Data Stream Based Algorithms For Wireless Sensor Network Applications

TL;DR: This work proposes and evaluates two algorithms based on data stream, which use sampling and sketch techniques, to reduce data traffic in a WSN and, consequently, decrease the delay and energy consumption.

Abstract: A wireless sensor network (WSN) is energy constrained, and the extension of its lifetime is one of the most important issues in its design. Usually, a WSN collects a large amount of data from the environment. In contrast to the conventional remote sensing - based on satellites that collect large images, sound files, or specific scientific data - sensor networks tend to generate a large amount of sequential small and tuple- oriented data from several nodes, which constitutes data streams. In this work, we propose and evaluate two algorithms based on data stream, which use sampling and sketch techniques, to reduce data traffic in a WSN and, consequently, decrease the delay and energy consumption. Specifically, the sampling solution, provides a sample of only log n items to represent the original data of n elements. Despite of the reduction, the sampling solution keeps a good data quality. Simulation results reveal the efficiency of the proposed methods by extending the network lifetime and reducing the delay without loosing data representativeness. Such a technique can be very useful to design energy-efficient and time-constrained sensor networks if the application is not so dependent on the data precision or the network operates in an exception situation (e.g., there are few resources remaining or there is an urgent situation).