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

Efficient Compressive Sampling of Spatially Sparse Fields in Wireless Sensor Networks

Wireless sensor networks (WSN), i.e. networks of autonomous, wireless sensing nodes spatially deployed over a geographical area, are often faced with acquisition of spatially sparse fields. In this paper, we present a novel bandwidth/energy efficient CS scheme for acquisition of spatially sparse fields in a WSN. The paper contribution is twofold. Firstly, we introduce a sparse, structured CS matrix and we analytically show that it allows accurate reconstruction of bidimensional spatially sparse signals, such as those occurring in several surveillance application. Secondly, we analytically evaluate the energy and bandwidth consumption of our CS scheme when it is applied to data acquisition in a WSN. Numerical results demonstrate that our CS scheme achieves significant energy and bandwidth savings wrt state-of-the-art approaches when employed for sensing a spatially sparse field by means of a WSN.Comment: Submitted to EURASIP Journal on Advances in Signal Processin

Over-the-air computation for cooperative wideband spectrum sensing and performance analysis

For sensor network aided cognitive radio, cooperative wideband spectrum sensing can distribute the sampling and computing pressure of spectrum sensing to multiple sensor nodes (SNs) in an efficient way. However, this may incur high latency due to distributed data aggregation, especially when the number of SNs is large. In this paper, we propose a novel cooperative wideband spectrum sensing scheme using over-the-air computation. Its key idea is to utilize the superposition property of wireless channel to implement the summation of Fourier transform. This avoids distributed data aggregation by computing the target function directly. The performance of the proposed scheme is analyzed with imperfect synchronization between different SNs. Furthermore, a synchronization phase offset (SPO) estimation and equalization method is proposed. The corresponding performance after equalization is also derived. A working prototype based on universal software radio periphera (USRP) and Monte Carlo simulation is built to verify the performance of the proposed scheme

An objective based classification of aggregation techniques for wireless sensor networks

Wireless Sensor Networks have gained immense popularity in recent years due to their ever increasing capabilities and wide range of critical applications. A huge body of research efforts has been dedicated to find ways to utilize limited resources of these sensor nodes in an efficient manner. One of the common ways to minimize energy consumption has been aggregation of input data. We note that every aggregation technique has an improvement objective to achieve with respect to the output it produces. Each technique is designed to achieve some target e.g. reduce data size, minimize transmission energy, enhance accuracy etc. This paper presents a comprehensive survey of aggregation techniques that can be used in distributed manner to improve lifetime and energy conservation of wireless sensor networks. Main contribution of this work is proposal of a novel classification of such techniques based on the type of improvement they offer when applied to WSNs. Due to the existence of a myriad of definitions of aggregation, we first review the meaning of term aggregation that can be applied to WSN. The concept is then associated with the proposed classes. Each class of techniques is divided into a number of subclasses and a brief literature review of related work in WSN for each of these is also presented

Trust Score based Optimized Cluster Routing (TSOCR) approach for Enhancing the Lifetime of Wireless Sensor Networks

Energy efficiency is the most significant obstacle that Wireless Sensor Networks (WSN) must overcome, and the desire for solutions that maximize energy efficiency will never go away. There are a variety of methods that can be utilized to improve energy efficiency, with data transmission as the primary driver of maximum energy consumption. The transmission of data from the source to destination nodes uses more energy. When the transmission of data is handled better, the energy efficiency is improved and the lifetime of the network is increased. The purpose of this research is to propose an Trust Score based Optimized Cluster Routing (TSOCR)  scheme for WSNs, which is based on Whale Optimization Algorithm (WOA). A total trust score is derived by combining the results of computing three distinct trust scores, such as the direct, indirect, and the most recent trust score. The path that has the highest trust score is chosen as the route and employed for data transmission. The effectiveness of the work is evaluated by looking at factors such as the rate of packet delivery, the latency, the amount of energy consumed and the lifetime of the network

Toward a Robust Sparse Data Representation for Wireless Sensor Networks

Compressive sensing has been successfully used for optimized operations in wireless sensor networks. However, raw data collected by sensors may be neither originally sparse nor easily transformed into a sparse data representation. This paper addresses the problem of transforming source data collected by sensor nodes into a sparse representation with a few nonzero elements. Our contributions that address three major issues include: 1) an effective method that extracts population sparsity of the data, 2) a sparsity ratio guarantee scheme, and 3) a customized learning algorithm of the sparsifying dictionary. We introduce an unsupervised neural network to extract an intrinsic sparse coding of the data. The sparse codes are generated at the activation of the hidden layer using a sparsity nomination constraint and a shrinking mechanism. Our analysis using real data samples shows that the proposed method outperforms conventional sparsity-inducing methods.Comment: 8 page

Gossip Algorithms for Distributed Signal Processing

Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This article presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression.Comment: Submitted to Proceedings of the IEEE, 29 page