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