• Title/Summary/Keyword: Cognitive Radio Networks

Search Result 393, Processing Time 0.026 seconds

A Channel Allocation Scheme Based on Spectrum Hole Prediction in Cognitive Radio Wireless Networks (무선인지 통신망에서 스펙트럼 홀 예측에 의한 채널할당)

  • Lee, Jin-yi
    • Journal of Advanced Navigation Technology
    • /
    • v.19 no.4
    • /
    • pp.318-322
    • /
    • 2015
  • In wireless communication networks, most of the prediction techniques are used for predicting the amount of resource required by user's calls for improving their demanding quality of service. However, we propose a channel allocation scheme based on predicting the resources of white spectrum holes for improving the QoS of rental user's spectrum handoff calls for cognitive radio networks in this paper. This method is supported by Wiener predictor to predict the amount of white spectrum holes of license user's free spectrum resources. We classify rental user's calls into initial calls and spectrum handoff calls, and some portion of predicted spectrum-hole resources is reserved for spectrum handoff calls' priority allocation. Simulations show that the performance of the proposed scheme outperforms in spectrum handoff call's dropping rate than an existing method without spectrum hole prediction(11% average improvement in 50% reservation).

A Call Admission Control Using Markovian Queueing Model for Multi-services Cognitive Radio Networks (멀티 서비스 무선 인지 망을 위한 마르코프 큐잉모델을 이용한 호 수락 제어)

  • Lee, Jin-Yi
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.4
    • /
    • pp.347-352
    • /
    • 2014
  • In this paper, we propose a Markovian queueing model(M/M/1)-based call admission control to reduce forced terminating rate of non-real secondary user's call for Multi-services Cognitive Radio Networks. A existing control has a problem that the forced terminating rate increases because of adopting a policy of spectrum priority allocation to real calls. In our scheme the rate can be reduced as the call that has no useful spectrum waits in a queue until getting an available spectrum. Our scheme use a neural-net based prediction of primary user's reappearance. Through the simulation, we analysis the call forced terminating rate, access delay and spectrum utilization efficiency, and then show that our scheme can more reduce the forced terminating rate of the call, compared to that of the existing algorithm.

Energy Efficient Resource Allocation with Energy Harvesting in Cognitive Radio Networks (인지 라디오 네트워크에서 에너지 하베스팅을 고려한 에너지 효율적 자원 할당 방안)

  • Lee, Kisong;Lee, Woongsup
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.7
    • /
    • pp.1255-1261
    • /
    • 2016
  • Recently, the energy harvesting technology in which energy is collected from the wireless signal which is transmitted by mobile communication devices, has been considered as a novel way to improve the life time of wireless sensors by mitigating the lack of power supply problem. In this paper, we consider the optimal sensing time and power allocation problem for cognitive radio systems, where the energy efficiency of secondary user is maximized while the constraint are satisfied, using the optimization technique. Based on the derived optimal solutions, we also have proposed an iterative resource allocation algorithm in which the optimal power and sensing time allocation can be found without excessive computations. The simulation results confirm that the proposed scheme achieves the optimal performance and it outperforms the conventional resource allocation schemes in terms of energy efficiency while the constraints are guaranteed to be satisfied.

Efficient Spectrum Sensing Based on Evolutionary Game Theory in Cognitive Radio Networks (인지무선 네트워크에서 진화게임을 이용한 효율적인 협력 스펙트럼 센싱 연구)

  • Kang, Keon-Kyu;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.11
    • /
    • pp.790-802
    • /
    • 2014
  • In cognitive radio technology, secondary users can determine the absence of PU by periodic sensing operation and cooperative sensing between SUs yields a significant sensing performance improvement. However, there exists a trade off between the gains in terms of probability of detection of the primary users and the costs of false alarm probability. Therefore, the cooperation group must maintain the suitable size. And secondary users should sense not only the currently using channels and but also other candidates channel to switch in accordance with sudden appearance of the primary user. In this paper, we propose an effective group cooperative sensing algorithm in distributed network situations that is considering both of inband and outband sensing using evolutionary game theory. We derived that the strategy group of secondary users converges to an ESS(Evolutionary sable state). Using a learning algorithm, each secondary user can converge to the ESS without the exchange of information to each other.

Energy Efficient Channel Sensing Scheduling in Cognitive Radio Networks (인지 무선 네트워크에서의 에너지 효율적인 센싱 스케쥴링 방법)

  • Choi, Woo-Jeong;Yoo, Sang-Jo;Seo, Myunghwan;Cho, Hyung-Weon
    • Journal of Satellite, Information and Communications
    • /
    • v.10 no.2
    • /
    • pp.1-9
    • /
    • 2015
  • Recently, cognitive radio technology has been spotlighted for the efficient use of limited frequency technology. The most important part of CR is to protect the incumbent user's communications. Therefore, CR user should be sensing the currently using channel and another hopping channel for sudden appearance of the Incumbent User. In this paper, we propose the cooperative channel sensing to protect the IU considering each CR user's remained power and sensing-zone, sense the spectrum bands in a fairly distributed manner and share the results among the users within respective sensing zone. Sensing scheme including inband sensing and outband sensing is utilized. The inband sensing is in charge of current using channel scanning while the outband sensing mainly cares about other channels. The performance results by computer simulations show that our sensing scheduling scheme reduces the number of sensing nodes and saves energy need to channel sensing.

Performance Evaluation of a Cooperative Spectrum Sensing using the k-out-of-n Fusion Rule in CR Networks (CR 네트워크에서 k-out-of-n 융합 규칙을 사용한 협력 스펙트럼 감지 방식의 성능 분석)

  • Lee, Sang-Wook;Lim, Chang-Heon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5A
    • /
    • pp.429-435
    • /
    • 2009
  • Cooperative spectrum sensing allows secondary users of a cognitive radio(CR) network to collaborate to determine whether a primary user occupies the spectrum of interest or not. It usually performs spectrum sensing by combining the individual decisions of each second user into a final one and the k-out-of-n fusion rule is a general approach for decision fusion. This rule declares that the spectrum is occupied only when the decisions from more than k-1 secondary users indicate the presence of a primary user. In this paper, we analyze a cooperative spectrum sensing scheme with the fusion rule under the constraint that its detection probability is maintained to be no less than a given level and its numerical results for the case of a CR network with 10 secondary users.

Unlimited Cooperative Sensing with Energy Detection for Cognitive Radio

  • Bae, Sunghwan;Kim, Hongseok
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.172-182
    • /
    • 2014
  • In this paper, we investigate the fundamental performance limits of the cooperative sensing using energy detection by considering the unlimited number of sensing nodes. Although a lot of cognitive radio research so far proposed various uses of energy detection because of its simplicity, the performance limits of energy detection have not been studied when a large number of sensing nodes exist. First, we show that when the sensing nodes see the independent and identically distributed channel conditions, then as the number of sensing nodes N goes to infinity, the OR rule of hard decision achieves zero of false alarm Pf for any given target probability of detection $\bar{P_d}$ irrespective of the non-zero received primary user signal to noise ratio ${\gamma}$. Second, we show that under the same condition, when the AND rule of hard decision is used, there exists a lower bound of $P_f$. Interestingly, however, for given $\bar{P_d}$, $P_f$ goes to 1 as N goes to infinity. Third, we show that when the soft decision is used, there exists a way of achieving 100% utilization of secondary user, i.e., the sensing time overhead ratio goes to zero so does $P_f$.We verify our analyses by performing extensive simulations of the proposed unlimited cooperative sensing. Finally, we suggest a way of incorporating the unlimited cooperative sensing into a practical cellular system such as long term evolutionadvanced by exploiting the existing frame structure of absolute blank subframe to implement the in-band sensing.

Optimized Spectrum Pooling by Inventory Model (인벤토리모델을 이용한 스펙트럼풀링 최적화)

  • Byun, Sang-Seon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.11
    • /
    • pp.2664-2669
    • /
    • 2014
  • Recently, many research efforts have paid attention to spectrum pooling meshanism that provides efficient way to manage transient spectrum requests of secondary users in cognitive radio networks. Spectrum pooling is maintained by WSP (wireless service provider). WSP leases the spectrums stored in her spectrum pool to secondary users with being paid for it. It is natural that WSP tries to get profits as much as possible, which implies the WSP tries to minimize the cost required for maintaining her spectrum pool. In this paper, we model the spectrum pool into a probabilistic inventory model. Assuming secondary users' spectrum requests follow normal distribution, we give a strategic way that minimizes the maintenance cost of the spectrum pool. By a series of simulations, we show that WSP can reduce the total maintenance cost through our inventory model-based spectrum pooling than maintaining fixed inventory level.

Generalized Analysis on the Combined Effect of SPM and Fiber Chromatic Dispersion on Subcarrier Multiplexed Optical Transmission Systems for RoF Applications

  • Kim, Kyoung-Soo;Lee, Jae-Hoon;Jeong, Ji-Chai
    • Journal of the Optical Society of Korea
    • /
    • v.15 no.2
    • /
    • pp.132-139
    • /
    • 2011
  • We investigate theoretically the combined effect of fiber chromatic dispersion and self-phase modulation (SPM) on multi-channel subcarrier multiplexed (SCM) optical transmission systems in terms of the detected RF carrier power and SPM-induced power gain after transmission over single-mode fiber (SMF) links. According to the calculated power gain due to the SPM effect at the transmission distance of P3dB using the detected radio-frequency (RF) carrier power after photo-detection, the power gain is significantly degraded with large optical modulation index (OMI), small SCM channel spacing, and large fiber launching power because of the increased interaction between subcarrier channels. The nonlinear phase shift due to linear and nonlinear fiber characteristics is investigated to explain these results in detail. The numerical simulation results show that the OMI per SCM channel has to be smaller than 10 % for the fiber launching power of 10 dBm to guarantee prevention of SPM-induced power gain degradation below 0.5 dB for the SCM system with the channel spacing of 100 MHz. This result is expected to be utilized for the optical transmission systems using the SCM technology in future radio-over-fiber (RoF) networks.

PERFORMANCE OF MYOPIC POLICY FOR OPPORTUNISTIC SPECTRUM SHARING

  • Lee, Yu-Tae
    • East Asian mathematical journal
    • /
    • v.27 no.1
    • /
    • pp.23-33
    • /
    • 2011
  • Due to underutilization of spectrum under current inefficient and static spectrum management policy, various kinds of opportunistic spectrum access (OSA) strategies have appeared. Myopic policy is a simple and robust OSA strategy with reduced complexity that maximizes immediate throughput. In this paper, we propose mathematical models to evaluate the throughput and the MAC delay of a myopic policy under saturation tra c conditions. Using the MAC delay distribution, we evaluate the packet delay of secondary users under nonsaturation conditions. Numerical results are given to show the performance of the myopic policy in cognitive radio networks.