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

Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

A survey of self organisation in future cellular networks

This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks

Optimized Clustering Protocol for Balancing Energy in Wireless Sensor Networks

While wireless sensor networks (WSNs) are increasingly equipped to handle more complex functions and in-network processing may require these battery powered sensors to judiciously use their constrained energy to prolong the effective network lifetime. Cluster-based Hierarchical Routing Protocol using compressive sensing (CS) theory (CBHRP-CS) divides the network into several clusters, each managed by a set of CHs called a header. Each member of the header compresses the collected data using CS. This paper proposes an optimized clustering protocol using CS (OCP-CS) to improve the performance of WSNs by exploiting compressibility. In OCP-CS, each cluster is managed by a cluster head (CH). CHs are selected based on node concentration and sensor residual energy, and performs data aggregation using CS to reduce the energy consumed in the process of data sampling and transmission. Simulations show that our proposed protocol is effective in prolonging the network lifetime and supporting scalable data aggregation than existing protocols

Biologically inspired, self organizing communication networks.

PhDThe problem of energy-efficient, reliable, accurate and self-organized target tracking in Wireless Sensor Networks (WSNs) is considered for sensor nodes with limited physical resources and abrupt manoeuvring mobile targets. A biologically inspired, adaptive multi-sensor scheme is proposed for collaborative Single Target Tracking (STT) and Multi-Target Tracking (MTT). Behavioural data obtained while tracking the targets including the targets’ previous locations is recorded as metadata to compute the target sampling interval, target importance and local monitoring interval so that tracking continuity and energy-efficiency are improved. The subsequent sensor groups that track the targets are selected proactively according to the information associated with the predicted target location probability such that the overall tracking performance is optimized or nearly-optimized. One sensor node from each of the selected groups is elected as a main node for management operations so that energy efficiency and load balancing are improved. A decision algorithm is proposed to allow the “conflict” nodes that are located in the sensing areas of more than one target at the same time to decide their preferred target according to the target importance and the distance to the target. A tracking recovery mechanism is developed to provide the tracking reliability in the event of target loss. The problem of task mapping and scheduling in WSNs is also considered. A Biological Independent Task Allocation (BITA) algorithm and a Biological Task Mapping and Scheduling (BTMS) algorithm are developed to execute an application using a group of sensor nodes. BITA, BTMS and the functional specialization of the sensor groups in target tracking are all inspired from biological behaviours of differentiation in zygote formation. Simulation results show that compared with other well-known schemes, the proposed tracking, task mapping and scheduling schemes can provide a significant improvement in energy-efficiency and computational time, whilst maintaining acceptable accuracy and seamless tracking, even with abrupt manoeuvring targets.Queen Mary university of London full Scholarshi