127 research outputs found
Collaborative spectrum sensing optimisation algorithms for cognitive radio networks
The main challenge for a cognitive radio is to detect the existence of primary users reliably in order to minimise the interference to licensed communications. Hence, spectrum sensing is a most important requirement of a cognitive radio. However, due to the channel uncertainties, local observations are not reliable and collaboration among users is required. Selection of fusion rule at a common receiver has a direct impact on the overall spectrum sensing performance. In this paper, optimisation of collaborative spectrum sensing in terms of optimum decision fusion is studied for hard and soft decision combining. It is concluded that for optimum fusion, the fusion centre must incorporate signal-to-noise ratio values of cognitive users and the channel conditions. A genetic algorithm-based weighted optimisation strategy is presented for the case of soft decision combining. Numerical results show that the proposed optimised collaborative spectrum sensing schemes give better spectrum sensing performance
A Weighted Linear Combining Scheme for Cooperative Spectrum Sensing
AbstractCooperative spectrum sensing exploits spatial diversity of secondary-users (SUs), to reliably detect the availability of a spectrum. Soft energy combining schemes have optimal detection performance at the cost of high cooperation overhead, since actual sensed data is required at the fusion center. To reduce cooperation overhead, in hard combining only local decisions are shared; however the detection performance is suboptimal due to the loss of information. In this paper, a weighted linear combining scheme is proposed in which a SU performs a local sensing test based on two threshold levels. If local test result lies between the two thresholds then the SU report neither its local decision nor sequentially estimated unknown SNR parameter values, to the fusion center. Thereby, uncertain decisions about the presence/absence of the primary-user signal are suppressed. Simulation results suggest that the detection performance of the proposed scheme is close to optimal soft combining schemes yet its overhead is similar to hard combining techniques
Byzantine Attack and Defense in Cognitive Radio Networks: A Survey
The Byzantine attack in cooperative spectrum sensing (CSS), also known as the
spectrum sensing data falsification (SSDF) attack in the literature, is one of
the key adversaries to the success of cognitive radio networks (CRNs). In the
past couple of years, the research on the Byzantine attack and defense
strategies has gained worldwide increasing attention. In this paper, we provide
a comprehensive survey and tutorial on the recent advances in the Byzantine
attack and defense for CSS in CRNs. Specifically, we first briefly present the
preliminaries of CSS for general readers, including signal detection
techniques, hypothesis testing, and data fusion. Second, we analyze the spear
and shield relation between Byzantine attack and defense from three aspects:
the vulnerability of CSS to attack, the obstacles in CSS to defense, and the
games between attack and defense. Then, we propose a taxonomy of the existing
Byzantine attack behaviors and elaborate on the corresponding attack
parameters, which determine where, who, how, and when to launch attacks. Next,
from the perspectives of homogeneous or heterogeneous scenarios, we classify
the existing defense algorithms, and provide an in-depth tutorial on the
state-of-the-art Byzantine defense schemes, commonly known as robust or secure
CSS in the literature. Furthermore, we highlight the unsolved research
challenges and depict the future research directions.Comment: Accepted by IEEE Communications Surveys and Tutoiral
Weighted soft decision for cooperative sensing in cognitive radio networks
Enhancing the current services or deploying new services operating in RF spectrum requires more licensed spectrum which may not be provided by the regulatory bodies because of spectrum scarcity. On the contrary, recent studies suggest that many portions of the licensed spectrum remains unused or underused for significant period of time raising the issue of spectrum access without license in an opportunistic manner. Among all the spectrum accessing techniques, sensing based methods are considered optimal for their simplicity and cost effectiveness. In this paper, we introduce a new cooperative spectrum sensing technique which considers the spatial variation of secondary (unlicensed) users and each user's contribution is weighted by a factor that depends on received power and path loss. Compared to existing techniques, the proposed one increases the sensing ability and spectrum utilization, and offers greater robustness to noise uncertainty. Moreover, this cooperative technique uses very simple energy detector as its building block thereby reduces the cost and operational complexity
Recommended from our members
Spectrum utilization using game theory
This thesis was submitted for the degree of Master of Philosophy and awarded by Brunel University.Spectrum utilization is the most recent communications issue which takes great deal of attention from communication researchers where most of the efforts have been dedicated for spectral efficient utilization. Spectrum sharing is one of the solutions considered in the problem of lack of available frequency for new communication services which are unlicensed. In this work we propose an optimal method for spectrum utilization to increase spectral efficiency. It considers the problem of spectrum holes found in Primary User's (PU) band and detected using one of the spectral sensing methods. The solution is formulated with the help of Game theory approach in such a way that the primary user who has unoccupied frequency can share it with a group of secondary users (SU) in a competitive way. One of the SUs will be a secondary primary user (SPU), share available frequency from PU then offer his sharing to serve other SUs in different rate of sharing. Each user in the group of secondary users has a chance to be secondary primary user depending on reputation of each SU. Enhancing reputation is the only way for any SU to assure a share in the spectrum where it considered the factor of increasing or decreasing rate of sharing as well as factor of being SPU or an ordinary SU. A theoretical non-cooperative game model is introduced in a comparison with a proposed non-dynamic technique which depends on number of subscribers who occupy frequency in each time period. Multi-users compete on sharing the frequency from one of the users who offers sharing at a time when he has low number of subscribers that occupy his band. It is found that non-dynamic sharing results in inefficient spectrum utilization which is one of the reasons of spectrum scarcity where this resource is allocated in fixed way. Spectrum sharing using game theory solves this problem by its ability to make users compete to gain highest rate of spectrum allocation according to the real requirement of each user at each time interval. The problem of urgent case is also discussed when the primary user comes back to using his band which is the specific band of sharing with the secondary users group. SPU makes it easy to unload the required band from multi-users because PU does not need to request his band from each SU in the group
- …