Machine learning algorithms for cognitive radio wireless networks

In this thesis new methods are presented for achieving spectrum sensing in cognitive radio wireless networks. In particular, supervised, semi-supervised and unsupervised machine learning based spectrum sensing algorithms are developed and various techniques to improve their performance are described. Spectrum sensing problem in multi-antenna cognitive radio networks is considered and a novel eigenvalue based feature is proposed which has the capability to enhance the performance of support vector machines algorithms for signal classification. Furthermore, spectrum sensing under multiple primary users condition is studied and a new re-formulation of the sensing task as a multiple class signal detection problem where each class embeds one or more states is presented. Moreover, the error correcting output codes based multi-class support vector machines algorithms is proposed and investigated for solving the multiple class signal detection problem using two different coding strategies. In addition, the performance of parametric classifiers for spectrum sensing under slow fading channel is studied. To address the attendant performance degradation problem, a Kalman filter based channel estimation technique is proposed for tracking the temporally correlated slow fading channel and updating the decision boundary of the classifiers in real time. Simulation studies are included to assess the performance of the proposed schemes. Finally, techniques for improving the quality of the learning features and improving the detection accuracy of sensing algorithms are studied and a novel beamforming based pre-processing technique is presented for feature realization in multi-antenna cognitive radio systems. Furthermore, using the beamformer derived features, new algorithms are developed for multiple hypothesis testing facilitating joint spatio-temporal spectrum sensing. The key performance metrics of the classifiers are evaluated to demonstrate the superiority of the proposed methods in comparison with previously proposed alternatives

Spectrum sensing algorithms and software-defined radio implementation for cognitive radio system

The scarcity of spectral resources in wireless communications, due to a fixed frequency allocation policy, is a strong limitation to the increasing demand for higher data rates. However, measurements showed that a large part of frequency channels are underutilized or almost unoccupied. The cognitive radio paradigm arises as a tempting solution to the spectral congestion problem. A cognitive radio must be able to identify transmission opportunities in unused channels and to avoid generating harmful interference with the licensed primary users. Its key enabling technology is the spectrum sensing unit, whose ultimate goal consists in providing an indication whether a primary transmission is taking place in the observed channel. Such indication is determined as the result of a binary hypothesis testing experiment wherein null hypothesis (alternate hypothesis) corresponds to the absence (presence) of the primary signal. The first parts of this thesis describes the spectrum sensing problem and presents some of the best performing detection techniques. Energy Detection and multi-antenna Eigenvalue-Based Detection algorithms are considered. Important aspects are taken into account, like the impact of noise estimation or the effect of primary user traffic. The performance of each detector is assessed in terms of false alarm probability and detection probability. In most experimental research, cognitive radio techniques are deployed in software-defined radio systems, radio transceivers that allow operating parameters (like modulation type, bandwidth, output power, etc.) to be set or altered by software.In the second part of the thesis, we introduce the software-defined radio concept. Then, we focus on the implementation of Energy Detection and Eigenvalue-Based Detection algorithms: first, the used software platform, GNU Radio, is described, secondly, the implementation of a parallel energy detector and a multi-antenna eigenbased detector is illustrated and details on the used methodologies are given. Finally, we present the deployed experimental cognitive testbeds and the used radio peripherals. The obtained algorithmic results along with the software-defined radio implementation may offer a set of tools able to create a realistic cognitive radio system with real-time spectrum sensing capabilities

Sensing of DVB-T signals for white space cognitive radio systems

In cognitive radio networks, systems operating in digital television white spaces are particularly interesting for practical applications. In this paper, we consider single- antenna and multi-antenna spectrum sensing of real DVB-T signals under different channel conditions. Some of the most important algorithms are considered and compared, including energy detection, eigenvalue based techniques and methods exploiting OFDM signal knowledge. The obtained results show the algorithm performance and hierarchy in terms of ROC and detection probability under fixed false alarm rate, for different channel profiles in case of true DVB-T signal

Sensing of DVB-T signals for white space cognitive radio systems

In cognitive radio networks, systems operating in digital television white spaces are particularly interesting for practical applications. In this paper, we consider single- antenna and multi-antenna spectrum sensing of real DVB-T signals under different channel conditions. Some of the most important algorithms are considered and compared, including energy detection, eigenvalue based techniques and methods exploiting OFDM signal knowledge. The obtained results show the algorithm performance and hierarchy in terms of ROC and detection probability under fixed false alarm rate, for different channel profiles in case of true DVB-T signals

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

On the Performance of Spectrum Sensing Algorithms using Multiple Antennas

In recent years, some spectrum sensing algorithms using multiple antennas, such as the eigenvalue based detection (EBD), have attracted a lot of attention. In this paper, we are interested in deriving the asymptotic distributions of the test statistics of the EBD algorithms. Two EBD algorithms using sample covariance matrices are considered: maximum eigenvalue detection (MED) and condition number detection (CND). The earlier studies usually assume that the number of antennas (K) and the number of samples (N) are both large, thus random matrix theory (RMT) can be used to derive the asymptotic distributions of the maximum and minimum eigenvalues of the sample covariance matrices. While assuming the number of antennas being large simplifies the derivations, in practice, the number of antennas equipped at a single secondary user is usually small, say 2 or 3, and once designed, this antenna number is fixed. Thus in this paper, our objective is to derive the asymptotic distributions of the eigenvalues and condition numbers of the sample covariance matrices for any fixed K but large N, from which the probability of detection and probability of false alarm can be obtained. The proposed methodology can also be used to analyze the performance of other EBD algorithms. Finally, computer simulations are presented to validate the accuracy of the derived results.Comment: IEEE GlobeCom 201