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

Cooperative Spectrum Sensing based on 1-bit Quantization in Cognitive Radio Networks

The wireless frequency spectrum is a very valuable resource in the field of communications. Over the years, different bands of the spectrum were licensed to various communications systems and standards. As a result, most of the easily accessible parts of it ended up being theoretically occupied. This made it somewhat difficult to accommodate new wireless technologies, especially with the rise of communications concepts such as the Machine to Machine (M2M) communications and the Internet of Things (IoT). It was necessary to find ways to make better use of wireless spectrum. Cognitive Radio is one concept that came into the light to tackle the problem of spectrum utilization. Various technical reports stated that the spectrum is in fact under-utilized. Many frequency bands are not heavily used over time, and some bands have low activity. Cognitive Radio (CR) Networks aim to exploit and opportunistically share the already licensed spectrum. The objective is to enable various kinds of communications while preserving the licensed parties' right to access the spectrum without interference. Cognitive radio networks have more than one approach to spectrum sharing. In interweave spectrum sharing scheme, cognitive radio devices look for opportunities in the spectrum, in frequency and over time. Therefore, and to find these opportunities, they employ what is known as spectrum sensing. In a spectrum sensing phase, the CR device scans certain parts of the spectrum to find the voids or white spaces in it. After that it exploits these voids to perform its data transmission, thus avoiding any interference with the licensed users. Spectrum sensing has various classifications and approaches. In this thesis, we will present a general review of the main spectrum sensing categories. Furthermore, we will discuss some of the techniques employed in each category including their respective advantages and disadvantages, in addition to some of the research work associated with them. Our focus will be on cooperative spectrum sensing, which is a popular research topic. In cooperative spectrum sensing, multiple CR devices collaborate in the spectrum sensing operation to enhance the performance in terms of detection accuracy. We will investigate the soft-information decision fusion approach in cooperative sensing. In this approach, the CR devices forward their spectrum sensing data to a central node, commonly known as a Fusion Center. At the fusion center, this data is combined to achieve a higher level of accuracy in determining the occupied parts and the empty parts of the spectrum while considering Rayleigh fading channels. Furthermore, we will address the issue of high power consumption due to the sampling process of a wide-band of frequencies at the Nyquist rate. We will apply the 1-bit Quantization technique in our work to tackle this issue. The simulation results show that the detection accuracy of a 1-bit quantized system is equivalent to a non-quantized system with only 2 dB less in Signal-to-Noise Ratio (SNR). Finally, we will shed some light on multiple antenna spectrum sensing, and compare its performance to the cooperative sensing

Spectrum sensing for cognitive radios: Algorithms, performance, and limitations

Inefficient use of radio spectrum is becoming a serious problem as more and more wireless systems are being developed to operate in crowded spectrum bands. Cognitive radio offers a novel solution to overcome the underutilization problem by allowing secondary usage of the spectrum resources along with high reliable communication. Spectrum sensing is a key enabler for cognitive radios. It identifies idle spectrum and provides awareness regarding the radio environment which are essential for the efficient secondary use of the spectrum and coexistence of different wireless systems. The focus of this thesis is on the local and cooperative spectrum sensing algorithms. Local sensing algorithms are proposed for detecting orthogonal frequency division multiplexing (OFDM) based primary user (PU) transmissions using their autocorrelation property. The proposed autocorrelation detectors are simple and computationally efficient. Later, the algorithms are extended to the case of cooperative sensing where multiple secondary users (SUs) collaborate to detect a PU transmission. For cooperation, each SU sends a local decision statistic such as log-likelihood ratio (LLR) to the fusion center (FC) which makes a final decision. Cooperative sensing algorithms are also proposed using sequential and censoring methods. Sequential detection minimizes the average detection time while censoring scheme improves the energy efficiency. The performances of the proposed algorithms are studied through rigorous theoretical analyses and extensive simulations. The distributions of the decision statistics at the SU and the test statistic at the FC are established conditioned on either hypothesis. Later, the effects of quantization and reporting channel errors are considered. Main aim in studying the effects of quantization and channel errors on the cooperative sensing is to provide a framework for the designers to choose the operating values of the number of quantization bits and the target bit error probability (BEP) for the reporting channel such that the performance loss caused by these non-idealities is negligible. Later a performance limitation in the form of BEP wall is established for the cooperative sensing schemes in the presence of reporting channel errors. The BEP wall phenomenon is important as it provides the feasible values for the reporting channel BEP used for designing communication schemes between the SUs and the FC

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

Over-the-air computation for cooperative wideband spectrum sensing and performance analysis

For sensor network aided cognitive radio, cooperative wideband spectrum sensing can distribute the sampling and computing pressure of spectrum sensing to multiple sensor nodes (SNs) in an efficient way. However, this may incur high latency due to distributed data aggregation, especially when the number of SNs is large. In this paper, we propose a novel cooperative wideband spectrum sensing scheme using over-the-air computation. Its key idea is to utilize the superposition property of wireless channel to implement the summation of Fourier transform. This avoids distributed data aggregation by computing the target function directly. The performance of the proposed scheme is analyzed with imperfect synchronization between different SNs. Furthermore, a synchronization phase offset (SPO) estimation and equalization method is proposed. The corresponding performance after equalization is also derived. A working prototype based on universal software radio periphera (USRP) and Monte Carlo simulation is built to verify the performance of the proposed scheme

Online detection and SNR estimation in cooperative spectrum sensing

ABSTRACT: Cooperative spectrum sensing has proved to be an effective method to improve the detection performance in cognitive radio systems. This work focuses on centralized cooperative schemes based on the soft fusion of the energy measurements at the cognitive radios (CRs). In these systems, the likelihood ratio test (LRT) is the optimal detection rule, but the sufficient statistic depends on the local signal-to-noise ratio (SNR) at the CRs, which are unknown in most practical cases. Therefore, the detection problem becomes a composite hypothesis test. The generalized LRT is the most popular approach in those cases. Unfortunately, in mobile environments, its performance is well below the LRT because the local energies are measured under varying SNRs. In this work, we present a new algorithm that jointly estimates the instantaneous SNRs and detects the presence of primary signals. Due to its adaptive nature, the algorithm is well suited for mobile scenarios where the local SNRs are time-varying. Simulation results show that its detection performance is close to the LRT in realistic conditions.This work was supported in part by the Ministerio de Ciencia, Innovación y Universidades, jointly with European Commission [European Regional Development Fund (ERDF)], under Grant TEC2017-86921-C2-1-R and Grant TEC2017-86921-C2-2-R (CAIMAN) and in part by The Comunidad de Madrid under Grant Y2018/TCS-4705 (PRACTICO-CM)