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

Energy Aware Channel Allocation with Spectrum Sensing in Pilot Contamination Analysis for Cognitive Radio Networks

Cognitive radio (CR) is an innovative and contemporary technology that has been making an effort to overcome the problems of bandwidth reduction by rising the usage of mobile cellular bandwidth connections. The reallocation and distribution of channels is a fundamental characteristic of cellular mobile networks (CMN) to exploit the consumption of CMS. Meanwhile, throughput maximization might lead to higher power utilization, the spectrum sensing system must tackle the energy throughput tradeoff. The spectrum sensing time should be defined by the residual battery energy of secondary user (SU). In that context, energy effective algorithm for spectrum sensing should be developed for meeting the energy constraint of CRN. This study designs a new quantum particle swarm optimization-based energy aware spectrum sensing scheme (QPSO-EASSS) for CRNs. Here, the presented QPSO-EASSS technique dynamically estimates the sensing time depending upon the battery energy level of SUs and the transmission power can be computed based on the battery energy level and PU signal of the SUs. In addition, in this work, the QPSO-EASSS technique applies the QPSO algorithm for throughput maximization with energy constraints in the CRN. The detailed set of experimentations take place and reported the improvements of the QPSO-EASSS technique compared to existing models

A Study on Techniques/Algorithms used for Detection and Prevention of Security Attacks in Cognitive Radio Networks

In this paper a detailed survey is carried out on the taxonomy of Security Issues, Advances on Security Threats and Countermeasures ,A Cross-Layer Attack, Security Status and Challenges for Cognitive Radio Networks, also a detailed survey on several Algorithms/Techniques used to detect and prevent SSDF(Spectrum Sensing Data Falsification) attack a type of DOS (Denial of Service) attack and several other  Network layer attacks in Cognitive Radio Network or Cognitive Radio Wireless Sensor Node Networks(WSNN’s) to analyze the advantages and disadvantages of those existing algorithms/techniques

Distributed Localization of Active Transmitters in a Wireless Sensor Network

In today\u27s military environment, emphasis has been placed on bandwidth efficiency and total use of the available spectrum. Current communication standards divide the spectrum into several different frequency bands, all of which are assigned to one or multiple primary users. Cognitive Radio utilizes potential white spaces that exist between currently defined channels or in time. One under-explored dimension of white space exploration is spatial. If a frequency band is being used in one region, it may be underutilized, or not occupied in another. Using an active localization method can allow for the discovery of spatial white; trying to spatially map all of the frequencies in a large area would become very computationally intensive, and may even be impractical using modern centralized methods. Applying a distributed method and the concepts discussed in Wireless Distributed Computing to the problem can be scaled onto many small wireless sensors and could improve the measuring system\u27s effectiveness. For a bandwidth contested environment that must be spectrally mapped, three metrics stand out: Accuracy, Power Consumption, and Latency. All of these metrics must be explored and measured to determine which method could be most effectively applied to the spectral mapping of a spatial environment

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