• Title/Summary/Keyword: Primary Users

Search Result 651, Processing Time 0.027 seconds

Throughput of Cognitive Radio Network with Collaborative Spectrum Sensing Using Correlated Local Decisions (상관된 국부 결정을 사용하여 협력 스펙트럼 감지를 하는 인지 무선 네트워크의 전송 용량)

  • Lim, Chang-Heon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7C
    • /
    • pp.642-650
    • /
    • 2010
  • Collaborative spectrum sensing allows secondary users scattered in location to work together to detect the activity of primary users and has been shown to significantly reduce the performance degradation due to fading phenomenon. Most previous works on collaborative spectrum sensing are based on the assumption that local spectrum sensing decisions of secondary users are statistically independent. However, it may not hold in some practical situations with shadowing effect. In this paper, we consider the case that the secondary users are evenly spaced in the form of a linear array and only adjacent secondary users are statistically correlated, and analyze the effect of the statistical correlation on the performance of collaborative spectrum sensing and the throughput of a cognitive radio network. Here we assumed the AND and OR fusion rules for combining the local decisions of secondary users. The analysis showed that the AND fusion rule achieves higher throughput than the OR fusion rule.

Entropy-based Spectrum Sensing for Cognitive Radio Networks in the Presence of an Unauthorized Signal

  • So, Jaewoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.20-33
    • /
    • 2015
  • Spectrum sensing is a key component of cognitive radio. The prediction of the primary user status in a low signal-to-noise ratio is an important factor in spectrum sensing. However, because of noise uncertainty, secondary users have difficulty distinguishing between the primary signal and an unauthorized signal when an unauthorized user exists in a cognitive radio network. To resolve the sensitivity to the noise uncertainty problem, we propose an entropy-based spectrum sensing scheme to detect the primary signal accurately in the presence of an unauthorized signal. The proposed spectrum sensing uses the conditional entropy between the primary signal and the unauthorized signal. The ability to detect the primary signal is thus robust against noise uncertainty, which leads to superior sensing performance in a low signal-to-noise ratio. Simulation results show that the proposed spectrum sensing scheme outperforms the conventional entropy-based spectrum sensing schemes in terms of the primary user detection probability.

A Sliding Window-Based Energy Detection Method under Noise Uncertainty for Cognitive Radio Systems (Cognitive Radio 시스템에서 불확실한 잡음 전력을 고려한 슬라이딩 윈도우 기반 에너지 검출 기법)

  • Kim, Young-Min;Sohn, Sung-Hwan;Kim, Jae-Moung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11A
    • /
    • pp.1105-1116
    • /
    • 2008
  • Cognitive radio is one of the most effective techniques to improve the spectrum utilization efficiency. To implement the cognitive radio, spectrum sensing is considered as the key functionality because only counting on it, can the secondary users identify the spectrum holes and utilize them efficiently without causing interference to primary users. Generally, there are several spectrum sensing methods; the most common and simplest method is energy detection. However, the conventional energy detection has some disadvantages, which are caused by noise, especially, uncertain noise power leads to degradation of energy detector. In this paper, to solve this problem, we proposed sliding window-based energy detection method which can devide the frequency band of primary signal and noise using sliding window to estimate the power of primary user without the noise effect and achieve the better performance. It can calculate the energy of primary user only and can detect the primary signal. The simulation result shows that our proposed method outperforms conventional one.

Efficient Usage of Secondary Scramble Code via Optical Repeater in W-CDMA System (W-CDMA 시스템에서 광중계기를 이용한 secondary-스크램블 코드의 효율적 활용방안에 대한 연구)

  • Jeon, Eun-Sung;Park, Jun-Hyo;Yang, Jang-Hoon;Kim, Dong-Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8C
    • /
    • pp.731-741
    • /
    • 2009
  • Optical repeater is often installed at the isolated area. Spatial separation makes it possible to reduce the inter-code interference when secondary scrambling codes are used for traffic connected through repeater. In this paper, we propose five secondary scrambling code usage scenarios with the aids of optical repeater to maximize the user capacity. In order to evaluate the performance, dynamic system level simulation is performed. We also propose a base station-repeater switching where each active users can change access points by comparing the channel condition from base station and repeater thorough secondary common pilot channel (S-CPICH) signal to noise-interference ratio (SINR). Moreover, primary-secondary scramble code replacing scheme is proposed which replaces secondary scramble code with primary scramble code when a call using primary scramble code is ended and its corresponding OVSF code is available to users using the secondary scramble code

Uplink Relaying Scheme for Efficient Frequency Usage in Cognitive Radio Networks (인지 무선 네트워크 환경에서 효율적인 주파수 활용을 위한 상향링크 릴레이 기법)

  • Kim, Se-Woong;Choi, Jae-Kark;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4A
    • /
    • pp.356-368
    • /
    • 2011
  • While most of the public radio spectrum bands are allocated to licensed users, cognitive radio has been considered as a promising technology for the efficient spectrum utilization. In this new technology, secondary users opportunistically use the temporally underutilized licensed bands as long as they do not give the harmful interference to primary users. In this paper, we focus on the infra-structured network condition in which the cognitive radio network consists of a cognitive radio base station and multiple secondary users. Upon detecting a primary user, the entire cognitive radio network generally switches to another available channel, even if most of the on-going communications still does not interfere with the primary user. Moreover, the network re-entry process on a new channel causes the service disruption of the on-going communications. For this reason, in this paper, we propose a relaying scheme for efficient frequency usage, in which the secondary user out of the interference range of a primary user performs as a relaying node for the secondary user possibly interfering with a primary user. The entire spectrum switching is not required, and thus, we can avoid the service disruption of the on-going communications as much as possible.

A novel routing protocol for cognitive radio networks with cooperation process

  • Kim, Sunwoo;Pyeon, Dohoo;Jang, Ingook;Yoon, Hyunsoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3860-3875
    • /
    • 2014
  • Cognitive radio networks (CRNs) are composed of mobile users who can use multiple spectrum bands for communication. CRNs allow unlicensed users (called cognitive users) to efficiently utilize unused licensed spectrums without interfering with communications of licensed users (called primary users). The main goals of CRNs are to mitigate spectrum saturation and to improve spectrum utilization. This paper introduces state-of-the-art routing protocols for CRNs and addresses some limitations of these protocols. To resolve the limitations, we suggest a new research direction for routing protocols in CRNs. We implement our protocol to compare with the existing routing protocols for multi-hop CRNs. Our protocol shows good performance compared to the existing routing protocols in terms of network performance and PU protection.

Optimal Throughput of Secondary Users over Two Primary Channels in Cooperative Cognitive Radio Networks

  • Vu, Ha Nguyen;Kong, Hyung-Yun
    • Journal of electromagnetic engineering and science
    • /
    • v.12 no.1
    • /
    • pp.1-7
    • /
    • 2012
  • In this paper, we investigated the throughput of a cognitive radio network where two primary frequency channels (PCs) are sensed and opportunistically accessed by N secondary users. The sharing sensing member (SSM) protocol is introduced to sense both PCs simultaneously. According to the SSM protocol, N SUs (Secondary User) are divided into two groups, which allows for the simultaneous sensing of two PCs. With a frame structure, after determining whether the PCs are idle or active during a sensing slot, the SUs may use the remaining time to transmit their own data. The throughput of the network is formulated as a convex optimization problem. We then evaluated an iterative algorithm to allocate the optimal sensing time, fusion rule and the number of members in each group. The computer simulation and numerical results show that the proposed optimal allocation improves the throughput of the SU under a misdetection constraint to protect the PCs. If not, its initial date of receipt shall be nullified.

Distributed Channel Allocation Using Kernel Density Estimation in Cognitive Radio Networks

  • Ahmed, M. Ejaz;Kim, Joo Seuk;Mao, Runkun;Song, Ju Bin;Li, Husheng
    • ETRI Journal
    • /
    • v.34 no.5
    • /
    • pp.771-774
    • /
    • 2012
  • Typical channel allocation algorithms for secondary users do not include processes to reduce the frequency of switching from one channel to another caused by random interruptions by primary users, which results in high packet drops and delays. In this letter, with the purpose of decreasing the number of switches made between channels, we propose a nonparametric channel allocation algorithm that uses robust kernel density estimation to effectively schedule idle channel resources. Experiment and simulation results demonstrate that the proposed algorithm outperforms both random and parametric channel allocation algorithms in terms of throughput and packet drops.

The Analysis of an Opportunistic Spectrum Access with a Strict T-preemptive Priority Discipline (엄격한 T-축출 우선순위 대기행렬을 이용한 기회 주파수 접근 방식의 성능 분석)

  • Kim, Kilhwan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.4
    • /
    • pp.162-170
    • /
    • 2012
  • We propose a new priority discipline called the strict T-preemptive priority discipline, and derive the waiting time distributions of each class in the strict T-preemptive priority M/G/1 queue. Using this queueing analysis, we evaluate the performance of an opportunistic spectrum access in cognitive radio networks, where a communication channel is divided into time slots, a licensed primary user is assigned to one channel, and multiple unlicensed secondary users may opportunistically exploit time slots unused by the primary user. We also present a numerical example of the analysis of the opportunistic spectrum access where the arrival rates and service times distributions of each users are identical.

MSMA/CA: Multiple Access Control Protocol for Cognitive Radio-Based IoT Networks

  • Muhammad Shafiq;Jin-Ghoo Choi
    • Journal of Internet Technology
    • /
    • v.20 no.1
    • /
    • pp.301-313
    • /
    • 2019
  • In this paper, we propose a new MAC protocol for Cognitive Radio (CR)-based IoT networks, called MSMA/CA. We extend the standard CSMA/CA, adopted in IEEE 802.11 WLANs, to the CR networks with the minimal modification since it works well in the real world. We resolve the classical hidden/exposed terminal problems by a variant of RTS/CTS mechanism and further, the hidden primary terminal problem by the mutual spectrum sensing at the transmitter and the receiver. We also modify the backoff process of CSMA/CA to incorporate the blocking of secondary transmitters, with the aim of protecting ongoing primary transmissions from aggressive secondary users. We analyze the throughput and delay of our proposed scheme using the Markov chain model on the backoff procedure, and verify its accuracy by simulations. Simulation results demonstrate that our protocol is suitable for IoT networks since the performance is insensitive to the number of users or devices.