Data Compression in Multi-Hop Large-Scale Wireless Sensor Networks

Data collection from a multi-hop large-scale outdoor WSN deployment for environmental monitoring is full of challenges due to the severe resource constraints on small battery-operated motes (e.g., bandwidth, memory, power, and computing capacity) and the highly dynamic wireless link conditions in an outdoor communication environment. We present a compressed sensing approach which can recover the sensing data at the sink with good accuracy when very few packets are collected, thus leading to a significant reduction of the network traffic and an extension of the WSN lifetime. Interplaying with the dynamic WSN routing topology, the proposed approach is efficient and simple to implement on the resource-constrained motes without motes storing of a part of random measurement matrix, as opposed to other existing compressed sensing based schemes. We provide a systematic method via machine learning to find a suitable representation basis, for the given WSN deployment and data field, which is both sparse and incoherent with the measurement matrix in the compressed sensing. We validate our approach and evaluate its performance using our real-world multi-hop WSN testbed deployment in situ in collecting the humidity and soil moisture data. The results show that our approach significantly outperforms three other compressed sensing based algorithms regarding the data recovery accuracy for the entire WSN observation field under drastically reduced communication costs. For some WSN scenarios, compressed sensing may not be applicable. Therefore we also design a generalized predictive coding framework for unified lossless and lossy data compression. In addition, we devise a novel algorithm for lossless compression to significantly improve data compression performance for variouSs data collections and applications in WSNs. Rigorous simulations show our proposed framework and compression algorithm outperform several recent popular compression algorithms for wireless sensor networks such as LEC, S-LZW and LTC using various real-world sensor data sets, demonstrating the merit of the proposed framework for unified temporal lossless and lossy data compression in WSNs

Distortion-Tolerant Communications with Correlated Information

This dissertation is devoted to the development of distortion-tolerant communication techniques by exploiting the spatial and/or temporal correlation in a broad range of wireless communication systems under various system configurations. Signals observed in wireless communication systems are often correlated in the spatial and/or temporal domains, and the correlation can be used to facilitate system designs and to improve system performance. First, the optimum node density, i.e., the optimum number of nodes in a unit area, is identified by utilizing the spatial data correlation in the one- and two-dimensional wireless sensor networks (WSNs), under the constraint of fixed power per unit area. The WSNs distortion is quantized as the mean square error between the original and the reconstructed signals. Then we extend the analysis into WSNs with spatial-temporally correlated data. The optimum sampling in the space and time domains is derived. The analytical optimum results can provide insights and guidelines on the design of practical WSNs. Second, distributed source coding schemes are developed by exploiting the data correlation in a wireless network with spatially distributed sources. A new symmetric distributed joint source-channel coding scheme (DJSCC) is proposed by utilizing the spatial source correlation. Then the DJSCC code is applied to spatial-temporally correlated sources. The temporal correlated data is modeled as the Markov chain. Correspondingly, two decoding algorithms are proposed. The first multi-codeword message passing algorithm (MCMP) is designed for spatially correlated memoryless sources. In the second algorithm, a hidden Markov decoding process is added to the MCMP decoder to effectively exploit the data correlation in both the space and time domains. Third, we develop distortion-tolerant high mobility wireless communication systems by considering correlated channel state information (CSI) in the time domain, and study the optimum designs with imperfect CSI. The pilot-assisted channel estimation mean square error is expressed as a closed-form expression of various system parameters through asymptotic analysis. Based on the statistical properties of the channel estimation error, we quantify the impacts of imperfect CSI on system performance by developing the analytical symbol error rate and a spectral efficiency lower bound of the communication system

Impact of Random Deployment on Operation and Data Quality of Sensor Networks

Several applications have been proposed for wireless sensor networks, including habitat monitoring, structural health monitoring, pipeline monitoring, and precision agriculture. Among the desirable features of wireless sensor networks, one is the ease of deployment. Since the nodes are capable of self-organization, they can be placed easily in areas that are otherwise inaccessible to or impractical for other types of sensing systems. In fact, some have proposed the deployment of wireless sensor networks by dropping nodes from a plane, delivering them in an artillery shell, or launching them via a catapult from onboard a ship. There are also reports of actual aerial deployments, for example the one carried out using an unmanned aerial vehicle (UAV) at a Marine Corps combat centre in California -- the nodes were able to establish a time-synchronized, multi-hop communication network for tracking vehicles that passed along a dirt road. While this has a practical relevance for some civil applications (such as rescue operations), a more realistic deployment involves the careful planning and placement of sensors. Even then, nodes may not be placed optimally to ensure that the network is fully connected and high-quality data pertaining to the phenomena being monitored can be extracted from the network. This work aims to address the problem of random deployment through two complementary approaches: The first approach aims to address the problem of random deployment from a communication perspective. It begins by establishing a comprehensive mathematical model to quantify the energy cost of various concerns of a fully operational wireless sensor network. Based on the analytic model, an energy-efficient topology control protocol is developed. The protocol sets eligibility metric to establish and maintain a multi-hop communication path and to ensure that all nodes exhaust their energy in a uniform manner. The second approach focuses on addressing the problem of imperfect sensing from a signal processing perspective. It investigates the impact of deployment errors (calibration, placement, and orientation errors) on the quality of the sensed data and attempts to identify robust and error-agnostic features. If random placement is unavoidable and dense deployment cannot be supported, robust and error-agnostic features enable one to recognize interesting events from erroneous or imperfect data

Spatio-temporal sampling, rates and energy efficiency in wireless sensor networks

A multi-hop network of wireless sensors can be used to gather spatio-temporal samples of a physical phenomenon and transmit these samples to a processing center. This paper addresses an important issue in the design of such networks: determining the spatio-temporal sampling rate of the network under conditions of minimum energy usage. A new collision-free protocol for gathering sensor data is-used to obtain analytical results that characterize the tradeoffs among sensor density, energy usage, throughput, delay, temporal sampling rates and spatial sampling rates in wireless sensor networks. We also show that the lower bound on the delay incurred in gathering data is O(k(2)n) in a clustered network of n sensors with at most k hops between any sensor and its clusterhead (CH). Simulation results on the tradeoff between the achievable spatial sampling rates and the achievable temporal sampling rates when IEEE 802.11 distributed coordination function (DCF) is used as the media access scheme are provided and compared with the analytical results obtained in this paper

Compression vs Transmission Tradeoffs for Energy Harvesting Sensor Networks

The operation of Energy Harvesting Wireless Sensor Networks (EHWSNs) is a very lively area of research. This is due to the increasing inclination toward green systems, in order to reduce the energy consumption of human activities at large and to the desire of designing networks that can last unattended indefinitely (see, e.g., the nodes employed in Wireless Sensor Networks, WSNs). Notably, despite recent technological advances, batteries are expected to last for less than ten years for many applications and their replacement is often prohibitively expensive. This problem is particularly severe for urban sensing applications, think of, e.g., sensors placed below the street level to sense the presence of cars in parking lots, where the installation of new power cables is impractical. Other examples include body sensor networks or WSNs deployed in remote geographic areas. In contrast, EHWNs powered by energy scavenging devices (renewable power) provide potentially maintenance-free perpetual network operation, which is particularly appealing, especially for highly pervasive Internet of Things. Lossy temporal compression has been widely recognized as key for Energy Constrained Wireless Sensor Networks (WSN), where the imperfect reconstruction of the signal is often acceptable at the data collector, subject to some maximum error tolerance. The first part of this thesis deals with the evaluation of a number of lossy compression methods from the literature, and the analysis of their performance in terms of compression efficiency, computational complexity and energy consumption. Specifically, as a first step, a performance evaluation of existing and new compression schemes, considering linear, autoregressive, FFT-/DCT- and Wavelet-based models is carried out, by looking at their performance as a function of relevant signal statistics. After that, closed form expressions for their overall energy consumption and signal representation accuracy are obtained through numerical fittings. Lastly, the benefits that lossy compression methods bring about in interference-limited multi-hop networks are evaluated. In this scenario the channel access is a source of inefficiency due to collisions and transmission scheduling. The results reveal that the DCT-based schemes are the best option in terms of compression efficiency but are inefficient in terms of energy consumption. Instead, linear methods lead to substantial savings in terms of energy expenditure by, at the same time, leading to satisfactory compression ratios, reduced network delay and increased reliability performance. The subsequent part of the thesis copes with the problem of energy management for EHWSNs where sensor batteries are recharged via the energy harvested through a solar panel and sensors can choose to compress data before transmission. A scenario where a single node communicates with a single receiver is considered. The task of the node is to periodically sense some physical signal and report the measurements to the receiver (sink). We assume that this task is delay tolerant, i.e., the sensor can store a certain number of measurements in the memory buffer and send one or more packets of data after some time. Since most physical signals exhibit strong temporal correlation, the data in the buffer can often be compressed by means of a lossy compression method in order to reduce the amount of data to be sent. Lossy compression schemes allow us to select the compression ratio and trade some accuracy in the data reconstruction at the receiver for more energy savings at the transmitter. Specifically, our objective is to obtain the policy, i.e., the set of decision rules that describe the node behavior, that jointly maximizes throughput and reconstruction fidelity at the sink while meeting some predefined energy constraints, e.g., the battery charge level should never go below a guard threshold. To obtain this policy, the system is modeled as a Constrained Markov Decision Process (CMDP), and solved through Lagrangian Relaxation and Value Iteration Algorithm. The optimal policies are then compared with heuristic policies in different energy budget scenarios. Moreover the impact of the delay on the knowledge of the Channel State Information is investigated. Two more parts of this thesis deal with the development of models for the generation of space-time correlated signals and for the description of the energy harvested by outdoor photovoltaic panels. The former are very useful to prove the effectiveness of the proposed data gathering solutions as they can be used in the design of accurate simulation tools for WSNs. In addition, they can also be considered as reference models to prove theoretical results for data gathering or compression algorithms. The latter are especially useful in the investigation and in the optimization of EHWSNs. These models will be presented at the beginning and then intensively used for the analysis and the performance evaluation of the schemes that are treated in the remainder of the thesis