Fast Detection Method in Cooperative Cognitive Radio Networks

Cognitive Radio (CR) technology improves the utilization of spectrum highly via opportunistic spectrum sharing, which requests fast detection as the spectrum utilization is dynamic. Taking into consideration the characteristic of wireless channels, we propose a fast detection scheme for a cooperative cognitive radio network, which consists of multiple CRs and a central control office. Specifically, each CR makes individual detection decision using the sequential probability ratio test combined with Neyman Pearson detection with respect to a specific observation window length. The proposed method upper bounds the detection delay. In addition, a weighted K out of N fusion rule is also proposed for the central control office to reach fast global decision based on the information collected from CRs, with more weights assigned for CRs with good channel conditions. Simulation results show that the proposed scheme can achieve fast detection while maintaining the detection accuracy

Implementation of spectrum sensing techniques for cognitive radio systems

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This work presents a method for real-time detection of secondary users at the cognitive wireless technologies base stations. Cognitive radios may hide themselves in between the primary users to avoid being charged for spectrum usage. To deal with such scenarios, a cyclostationary Fast Fourier Transform accumulation method (FAM) has been used to develop a new strategy for recognising channel users under perfect and different noise environment conditions. Channel users are tracked according to the changes in their signal parameters, such as modulation techniques. MATLAB® Simulation tool was used to run various modulation signals on channels, and the obtained spectral correlation density function shows successful recognition between secondary and primary signals. We are unaware of previous efforts to use the FAM characteristics or other detection methods to make a distinction between channel users as presented in this thesis. A novel combination of both cognitive radio technology and ultra wideband technology is interdicted in this thesis, looking for an efficient and reliable spectrum sensing method to detect the presence of primary transmitters, and a number of spectrum-sensing techniques implemented in ultra wideband and cognitive radio component (UWB-CR) under different AWGN and fading settings environments. The sensing performance of different detectors is compared in conditions of probability of detection and miss detection curves. Simulation results show that the selection of detectors rely on the different fading scenarios, detector requirements and on a priori knowledge. Furthermore, result showed that the matched filter detection method is suitable for detecting signals through UWB-CR system under various fading channels. A general observation is that the matched filter detector outperforms the other detectors in all scenarios by an average of SNR=-20 dB in the level of probability of detection (Pd) , and the energy detector slightly outperforms the cyclostationary detector, in the level Pd at SNR=-20 dB. Furthermore, the thesis adapts novel detection models of cooperative and cluster cooperative wideband spectrum sensing in cognitive radio networks. In the proposed schemes, wavelet-based multi-resolution spectrum sensing and a proposed approach scheme are utilized for improving sensing performance of both models. On the other hand, cluster based cooperative spectrum sensing with soft combination Equal Gain Combination (EGC) scheme is proposed. The proposed detection models could achieve improvement of transmitter signal detection in terms of higher probability of detection and lower probability of false alarm. In the cooperative wideband spectrum sensing model, using traditional fusion rule, existing worst performance of false alarms by measurement is 78% of the sensing bands at an average SNR=5 dB; this compares with the proposed model, which is by measurement 19% false alarms of scanning spectrum at the same SNR for cluster cooperative wideband spectrum sensing. The proposed combining methods shows improvements of results with a high probability of detection (Pd) and low probability of false alarm (Pf) at an average SNR=-16 dB compared with other traditional fusion methods; this is illustrated through numerical results

Dynamic Geospatial Spectrum Modelling: Taxonomy, Options and Consequences

Much of the research in Dynamic Spectrum Access (DSA) has focused on opportunistic access in the temporal domain. While this has been quite useful in establishing the technical feasibility of DSA systems, it has missed large sections of the overall DSA problem space. In this paper, we argue that the spatio-temporal operating context of specific environments matters to the selection of the appropriate technology for learning context information. We identify twelve potential operating environments and compare four context awareness approaches (on-board sensing, databases, sensor networks, and cooperative sharing) for these environments. Since our point of view is overall system cost and efficiency, this analysis has utility for those regulators whose objectives are reducing system costs and enhancing system efficiency. We conclude that regulators should pay attention to the operating environment of DSA systems when determining which approaches to context learning to encourage

A Secure Cooperative Sensing Protocol for Cognitive Radio Networks

Cognitive radio networks sense spectrum occupancy and manage themselves to operate in unused bands without disturbing licensed users. Spectrum sensing is more accurate if jointly performed by several reliable nodes. Even though cooperative sensing is an active area of research, the secure authentication of local sensing reports remains unsolved, thus empowering false results. This paper presents a distributed protocol based on digital signatures and hash functions, and an analysis of its security features. The system allows determining a final sensing decision from multiple sources in a quick and secure way.Las redes de radio cognitiva detectora de espectro se las arreglan para operar en las nuevas bandas sin molestar a los usuarios con licencia. La detección de espectro es más precisa si el conjunto está realizado por varios nodos fiables. Aunque la detección cooperativa es un área activa de investigación, la autenticación segura de informes locales de detección no ha sido resuelta, por lo tanto se pueden dar resultados falsos. Este trabajo presenta un protocolo distribuido basado en firmas digitales y en funciones hash, y un análisis de sus características de seguridad. El sistema permite determinar una decisión final de detección de múltiples fuentes de una manera rápida y segura.Les xarxes de ràdio cognitiva detectora d'espectre se les arreglen per operar en les noves bandes sense destorbar els usuaris amb llicència. La detecció d'espectre és més precisa si el conjunt està realitzat per diversos nodes fiables. Encara que la detecció cooperativa és una àrea activa d'investigació, l'autenticació segura d'informes locals de detecció no ha estat resolta, per tant es poden donar resultats falsos. Aquest treball presenta un protocol distribuït basat en signatures digitals i en funcions hash, i una anàlisi de les seves característiques de seguretat. El sistema permet determinar una decisió final de detecció de múltiples fonts d'una manera ràpida i segura

Collaborative Spectrum Sensing from Sparse Observations in Cognitive Radio Networks

Spectrum sensing, which aims at detecting spectrum holes, is the precondition for the implementation of cognitive radio (CR). Collaborative spectrum sensing among the cognitive radio nodes is expected to improve the ability of checking complete spectrum usage. Due to hardware limitations, each cognitive radio node can only sense a relatively narrow band of radio spectrum. Consequently, the available channel sensing information is far from being sufficient for precisely recognizing the wide range of unoccupied channels. Aiming at breaking this bottleneck, we propose to apply matrix completion and joint sparsity recovery to reduce sensing and transmitting requirements and improve sensing results. Specifically, equipped with a frequency selective filter, each cognitive radio node senses linear combinations of multiple channel information and reports them to the fusion center, where occupied channels are then decoded from the reports by using novel matrix completion and joint sparsity recovery algorithms. As a result, the number of reports sent from the CRs to the fusion center is significantly reduced. We propose two decoding approaches, one based on matrix completion and the other based on joint sparsity recovery, both of which allow exact recovery from incomplete reports. The numerical results validate the effectiveness and robustness of our approaches. In particular, in small-scale networks, the matrix completion approach achieves exact channel detection with a number of samples no more than 50% of the number of channels in the network, while joint sparsity recovery achieves similar performance in large-scale networks.Comment: 12 pages, 11 figure

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