機械学習を用いたコグニティブ無線におけるOFDM信号認識に関する研究

電気通信大学201

Spectrum Sensing and Multiple Access Schemes for Cognitive Radio Networks

Increasing demands on the radio spectrum have driven wireless engineers to rethink approaches by which devices should access this natural, and arguably scarce, re- source. Cognitive Radio (CR) has arisen as a new wireless communication paradigm aimed at solving the spectrum underutilization problem. In this thesis, we explore a novel variety of techniques aimed at spectrum sensing which serves as a fundamental mechanism to find unused portions of the electromagnetic spectrum. We present several spectrum sensing methods based on multiple antennas and evaluate their receiving operating characteristics. We study a cyclostationary feature detection technique by means of multiple cyclic frequencies. We make use of a spec- trum sensing method called sequential analysis that allows us to significantly decrease the time needed for detecting the presence of a licensed user. We extend this scheme allowing each CR user to perform the sequential analysis algorithm and send their local decision to a fusion centre. This enables for an average faster and more accurate detection. We present an original technique for accounting for spatial and temporal cor- relation influence in spectrum sensing. This reflects on the impact of the scattering environment on detection methods using multiple antennas. The approach is based on the scattering geometry and resulting correlation properties of the received signal at each CR device. Finally, the problem of spectrum sharing for CR networks is addressed in or- der to take advantage of the detected unused frequency bands. We proposed a new multiple access scheme based on the Game Theory. We examine the scenario where a random number of CR users (considered as players) compete to access the radio spec- trum. We calculate the optimal probability of transmission which maximizes the CR throughput along with the minimum harm caused to the licensed users’ performance

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 AND COOPERATION IN COGNITIVE-OFDM BASED WIRELESS COMMUNICATIONS NETWORKS

The world has witnessed the development of many wireless systems and applications. In addition to the large number of existing devices, such development of new and advanced wireless systems increases rapidly the demand for more radio spectrum. The radio spectrum is a limited natural resource; however, it has been observed that it is not efficiently utilized. Consequently, different dynamic spectrum access techniques have been proposed as solutions for such an inefficient use of the spectrum. Cognitive Radio (CR) is a promising intelligent technology that can identify the unoccupied portions of spectrum and opportunistically uses those portions with satisfyingly high capacity and low interference to the primary users (i.e., licensed users). The CR can be distinguished from the classical radio systems mainly by its awareness about its surrounding radio frequency environment. The spectrum sensing task is the main key for such awareness. Due to many advantages, Orthogonal Frequency Division Multiplexing system (OFDM) has been proposed as a potential candidate for the CR‟s physical layer. Additionally, the Fast Fourier Transform (FFT) in an OFDM receiver supports the performance of a wide band spectrum analysis. Multitaper spectrum estimation method (MTM) is a non-coherent promising spectrum sensing technique. It tolerates problems related to bad biasing and large variance of power estimates. This thesis focuses, generally, on the local, multi antenna based, and global cooperative spectrum sensing techniques at physical layer in OFDM-based CR systems. It starts with an investigation on the performance of using MTM and MTM with singular value decomposition in CR networks using simulation. The Optimal MTM parameters are then found. The optimal MTM based detector theoretical formulae are derived. Different optimal and suboptimal multi antenna based spectrum sensing techniques are proposed to improve the local spectrum sensing performance. Finally, a new concept of cooperative spectrum sensing is introduced, and new strategies are proposed to optimize the hard cooperative spectrum sensing in CR networks. The MTM performance is controlled by the half time bandwidth product and number of tapers. In this thesis, such parameters have been optimized using Monte Carlo simulation. The binary hypothesis test, here, is developed to ensure that the effect of choosing optimum MTM parameters is based upon performance evaluation. The results show how these optimal parameters give the highest performance with minimum complexity when MTM is used locally at CR. The optimal MTM based detector has been derived using Neyman-Pearson criterion. That includes probabilities of detection, false alarm and misses detection approximate derivations in different wireless environments. The threshold and number of sensed samples controlling is based on this theoretical work. In order to improve the local spectrum sensing performance at each CR, in the CR network, multi antenna spectrum sensing techniques are proposed using MTM and MTM with singular value decomposition in this thesis. The statistical theoretical formulae of the proposed techniques are derived including the different probabilities. ii The proposed techniques include optimal, that requires prior information about the primary user signal, and two suboptimal multi antenna spectrum sensing techniques having similar performances with different computation complexity; these do not need prior information about the primary user signalling. The work here includes derivations for the periodogram multi antenna case. Finally, in hard cooperative spectrum sensing, the cooperation optimization is necessary to improve the overall performance, and/or minimize the number of data to be sent to the main CR-base station. In this thesis, a new optimization method based on optimizing the number of locally sensed samples at each CR is proposed with two different strategies. Furthermore, the different factors that affect the hard cooperative spectrum sensing optimization are investigated and analysed and a new cooperation scheme in spectrum sensing, the master node, is proposed.Ministry of Interior-Kingdom of Saudi Arabi

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

Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

Distributed Adaptation Techniques for Connected Vehicles

In this PhD dissertation, we propose distributed adaptation mechanisms for connected vehicles to deal with the connectivity challenges. To understand the system behavior of the solutions for connected vehicles, we first need to characterize the operational environment. Therefore, we devised a large scale fading model for various link types, including point-to-point vehicular communications and multi-hop connected vehicles. We explored two small scale fading models to define the characteristics of multi-hop connected vehicles. Taking our research into multi-hop connected vehicles one step further, we propose selective information relaying to avoid message congestion due to redundant messages received by the relay vehicle. Results show that the proposed mechanism reduces messaging load by up to 75% without sacrificing environmental awareness. Once we define the channel characteristics, we propose a distributed congestion control algorithm to solve the messaging overhead on the channels as the next research interest of this dissertation. We propose a combined transmit power and message rate adaptation for connected vehicles. The proposed algorithm increases the environmental awareness and achieves the application requirements by considering highly dynamic network characteristics. Both power and rate adaptation mechanisms are performed jointly to avoid one result affecting the other negatively. Results prove that the proposed algorithm can increase awareness by 20% while keeping the channel load and interference at almost the same level as well as improve the average message rate by 18%. As the last step of this dissertation, distributed cooperative dynamic spectrum access technique is proposed to solve the channel overhead and the limited resources issues. The adaptive energy detection threshold, which is used to decide whether the channel is busy, is optimized in this work by using a computationally efficient numerical approach. Each vehicle evaluates the available channels by voting on the information received from one-hop neighbors. An interdisciplinary approach referred to as entropy-based weighting is used for defining the neighbor credibility. Once the vehicle accesses the channel, we propose a decision mechanism for channel switching that is inspired by the optimal flower selection process employed by bumblebees foraging. Experimental results show that by using the proposed distributed cooperative spectrum sensing mechanism, spectrum detection error converges to zero