Cooperative spectrum sensing based on Majority decision under CFAR and CDR constraints

n/

Cooperative sensing of spectrum opportunities

Reliability and availability of sensing information gathered from local spectrum sensing (LSS) by a single Cognitive Radio is strongly affected by the propagation conditions, period of sensing, and geographical position of the device. For this reason, cooperative spectrum sensing (CSS) was largely proposed in order to improve LSS performance by using cooperation between Secondary Users (SUs). The goal of this chapter is to provide a general analysis on CSS for cognitive radio networks (CRNs). Firstly, the theoretical system model for centralized CSS is introduced, together with a preliminary discussion on several fusion rules and operative modes. Moreover, three main aspects of CSS that substantially differentiate the theoretical model from realistic application scenarios are analyzed: (i) the presence of spatiotemporal correlation between decisions by different SUs; (ii) the possible mobility of SUs; and (iii) the nonideality of the control channel between the SUs and the Fusion Center (FC). For each aspect, a possible practical solution for network organization is presented, showing that, in particular for the first two aspects, cluster-based CSS, in which sensing SUs are properly chosen, could mitigate the impact of such realistic assumptions

Hard Decision Cooperative Spectrum Sensing Based on Estimating the Noise Uncertainty Factor

Spectrum Sensing (SS) is one of the most challenging issues in Cognitive Radio (CR) systems. Cooperative Spectrum Sensing (CSS) is proposed to enhance the detection reliability of a Primary User (PU) in fading environments. In this paper, we propose a hard decision based CSS algorithm using energy detection with taking into account the noise uncertainty effect. In the proposed algorithm, two dynamic thresholds are toggled based on predicting the current PU activity, which can be successfully expected using a simple successive averaging process with time. Also, their values are evaluated using an estimated value of the noise uncertainty factor. These dynamic thresholds are used to compensate the noise uncertainty effect and increase (decrease) the probability of detection (false alarm), respectively. Theoretical analysis is performed on the proposed algorithm to deduce its enhanced false alarm and detection probabilities compared to the conventional hard decision CSS. Moreover, simulation analysis is used to confirm the theoretical claims and prove the high performance of the proposed scheme compared to the conventional CSS using different fusion rules.Comment: 5 pages, 4 figures, IEEE International Conference on Computer Engineering and Systems (ICCES 2015). arXiv admin note: text overlap with arXiv:1505.0558

Spectrum Sensing in Cognitive Radio: Multi-detection Techniques based Model

Cognitive radio (CR) paradigm is a new radio technology proposed to solve spectrum scarcity and underutilization. Central to CR is spectrum sensing (SS), which is responsible for detecting unoccupied frequencies. Since Detection techniques differ in their performance, selecting the optimal detection method to locally perform SS has received significant attention. This research work aims to enhance the reliability of local detection decisions, under low SNR, by developing a spectrum sensing that can take advantage of multiple detection techniques. This model can either select the optimal technique or make these techniques cooperate with one another to achieve better sensing performance. The model performance is measured with respect to detection and false alarm probability as well as sensing time. To develop this model, the performance of three detection techniques is evaluated and compared. Furthermore, the voting and the maximum a posteriori probability (MAP) fusion models were developed and employed to combine spectrum sensing results obtained from the three techniques. It is concluded that the cyclostationary feature detection technique is a superior detector in low SNR situations. MAP fusion model is found to be more reliable than the voting model

Low Complexity Energy-Efficient Collaborative Spectrum Sensing for Cognitive Radio Networks

Clustering approach is considered a management technology that arranged the distributed cognitive radio users into logical groups to improve the sensing performance of the network. A lot of works in this area showed that cluster-based spectrum sensing (CBSS) technique efficiently tackled the trade-off between performance and overhead issue. By employing the tree structure of the cluster, a multilevel hierarchical cluster-based spectrum sensing (MH-CBSS) algorithm was proposed to compromise between the gained performance and incurred overhead. However, the MH-CBSS iterative algorithm incurs high computational requirements. In this thesis, an energy-efficient low computational hierarchical cluster-based algorithm is proposed which reduces the incurred computational burden. This is achieved by predetermining the number of cognitive radios (CRs) in the cluster, which provides an advantage of reducing the number of iterations of the MH-CBSS algorithm. Furthermore, for a comprehensive study, the modified algorithm is investigated over both Rayleigh and Nakagami fading channels. Simulation results show that the detection performance of the modified algorithm outperforms the MH-CBSS algorithm over Rayleigh and Nakagami fading channels. In addition, a conventional energy detection algorithm is a fixed threshold based algorithm. Therefore, the threshold should be selected properly since it significantly affects the sensing performance of energy detector. For this reason, an energy-efficient hierarchical cluster-based cooperative spectrum sensing algorithm with an adaptive threshold is proposed which enables the CR dynamically adapts its threshold to achieve the minimum total cluster error. Besides, the optimal threshold level for minimizing the overall cluster detection error rate is numerically determined. The detection performance of the proposed algorithm is presented and evaluated through simulation results

Spectrum Sensing Algorithms for Cognitive Radio Applications

Future wireless communications systems are expected to be extremely dynamic, smart and capable to interact with the surrounding radio environment. To implement such advanced devices, cognitive radio (CR) is a promising paradigm, focusing on strategies for acquiring information and learning. The first task of a cognitive systems is spectrum sensing, that has been mainly studied in the context of opportunistic spectrum access, in which cognitive nodes must implement signal detection techniques to identify unused bands for transmission. In the present work, we study different spectrum sensing algorithms, focusing on their statistical description and evaluation of the detection performance. Moving from traditional sensing approaches we consider the presence of practical impairments, and analyze algorithm design. Far from the ambition of cover the broad spectrum of spectrum sensing, we aim at providing contributions to the main classes of sensing techniques. In particular, in the context of energy detection we studied the practical design of the test, considering the case in which the noise power is estimated at the receiver. This analysis allows to deepen the phenomenon of the SNR wall, providing the conditions for its existence and showing that presence of the SNR wall is determined by the accuracy of the noise power estimation process. In the context of the eigenvalue based detectors, that can be adopted by multiple sensors systems, we studied the practical situation in presence of unbalances in the noise power at the receivers. Then, we shift the focus from single band detectors to wideband sensing, proposing a new approach based on information theoretic criteria. This technique is blind and, requiring no threshold setting, can be adopted even if the statistical distribution of the observed data in not known exactly. In the last part of the thesis we analyze some simple cooperative localization techniques based on weighted centroid strategies

Mobility-Aware, Correlation-Based Node Grouping and Selection for Cooperative Spectrum Sensing, Journal of Telecommunications and Information Technology, 2014, nr 2

Cooperative spectrum sensing has been proposed as a solution to increase the sensing function accuracy in cognitive radio networks, but the research has, so far, mainly focused on static scenarios, all but neglecting the impact of mobility on spectrum sensing. In this work a novel cooperative spectrum sensing scheme for mobile cognitive networks, based on a correlation-based, mobility-aware node selection algorithm is proposed. Correlation among sensing decisions is used to divide nodes into groups, and mobility is taken into account in the group leaders selection by means of a node selection metric that considers both sensing performance and mobility. Performance of the proposed algorithm is evaluated by computer simulations taking into account mobility and a detailed modeling of temporal and spatial correlation of fading and shadowing components in the channel path loss, going way beyond the performance evaluation carried out in previous works on correlation-based cooperative sensing schemes. Simulation results highlight that the proposed metric leads to a signi cant increase of the update period required to maintain acceptable sensing performance, and correspondingly to a strong reduction in the overhead caused by the grouping and node selection procedure

Context Augmented Spectrum Sensing in Cognitive Radio Networks

Spectrum management has become a crucial issue in wireless networks. However, optimal utilization of the spectrum among the different users is not a trivial task. Over the last two decades, wireless communication has witnessed a significant increase in applications. However, fixed strategies for allocating the spectrum bands cannot handle multiple requirements simultaneously, which is a core requirement of the emerging wireless applications. More importantly, licensed users or primary users (PUs) in wireless networks are intermittently connected, leading to spectrum underutilization. All of these limitations make it imperative that efficient strategies be developed to manage the spectrum among multiple users or networks. Cognition as a component of intelligence has been employed in communication technologies such as CR Networks for reasoning and learning goals. From this perspective, a Cognitive Radio Network is an adaptive data network that applies cognition as an optimization tool aiming to optimize spectrum sharing among multiple secondary users (SUs) in addition to the PUs in an autonomous and dynamic way. Spectrum Sensing is an important element of Cognitive Radio technology since its outcome is the basis for all the subsequent stages of the cognition cycle. However, with stand-alone Cognitive Radio devices, local spectrum sensing techniques such as Energy Detection technique might draw a false conclusion about the presence of a primary transmitter due to several reasons (e.g. fading, shadowing, hidden node problem, noise uncertainty, etc). Cooperative sensing minimizes the uncertainty due to those factors by exploiting the spatial variation of SUs, then concludes one global decision about the PU's presence/absence. In this research work, I propose an intelligent cooperative spectrum sensing system whereby the contextual information of each secondary user is augmented in the fusion process wherein a set of information acquired by several contributing SUs are fused to optimize a global decision. Incorporating the contextual information of the SUs improves the spectrum sensing decision's reliability in the sense that false rejections and false acceptances are minimized, and therefore utilization is optimized. Artificial Neural Networks, as a Machine Learning and Artificial Intelligence tool, has been employed as a fusion algorithm utilizing the context of every SU to optimize final decisions. Experimental work is reported and discussed to demonstrate the effectiveness of the proposed technique

Combined Soft Hard Cooperative Spectrum Sensing in Cognitive Radio Networks

Providing some techniques to enhance the performance of spectrum sensing in cognitive radio systems while accounting for the cost and bandwidth limitations in practical scenarios is the main objective of this thesis. We focus on an essential element of cooperative spectrum sensing (CSS) which is the data fusion that combines the sensing results to make the final decision. Exploiting the advantage of the superior performance of the soft schemes and the low bandwidth of the hard schemes by incorporating them in cluster based CSS networks is achieved in two different ways. First, a soft-hard combination is employed to propose a hierarchical cluster based spectrum sensing algorithm. The proposed algorithm maximizes the detection performances while satisfying the probability of false alarm constraint. Simulation results of the proposed algorithm are presented and compared with existing algorithms over the Nakagami fading channel. Moreover, the results show that the proposed algorithm outperforms the existing algorithms. In the second part, a low complexity soft-hard combination scheme is suggested by utilizing both one-bit and two-bit schemes to balance between the required bandwidth and the detection performance by taking into account that different clusters undergo different conditions. The scheme allocates a reliability factor proportional to the detection rate to each cluster to combine the results at the Fusion center (FC) by extracting the results of the reliable clusters. Numerical results obtained have shown that a superior detection performance and a minimum overhead can be achieved simultaneously by combining one bit and two schemes at the intra-cluster level while assigning a reliability factor at the inter-cluster level