Towards Distributed Optimal Movement Strategy for Data Gathering in Wireless Sensor Networks

Abstract

In this paper, we address how to design a distributed movement strategy for mobile collectors, which can be either physical mobile agents or query/collector packets periodically launched by the sink, to achieve successful data gathering in wireless sensor networks. Formulating the problem as general random walks on a graph composed of sensor nodes, we analyze how much data can be successfully gathered in time under any Markovian random-walk movement strategies for mobile collectors moving over a graph (or network), while each sensor node is equipped with limited buffer space and data arrival rates are heterogeneous over different sensor nodes. In particular, from the analysis, we obtain the optimal movement strategy among a class of Markovian strategies so as to minimize the data loss rate over all sensor nodes, and explain how such an optimal movement strategy can be made to work in a distributed fashion. We demonstrate that our distributed optimal movement strategy can lead to about 2 times smaller loss rate than a standard random walk strategy under diverse scenarios. In particular, our strategy results in up to 70% cost savings for the deployment of multiple collectors to achieve the target data loss rate than the standard random walk strategy.

Spatial-Temporal Data Collection with Compressive Sensing in Mobile Sensor Networks

“…A similar model for mobile data gathering in WSNs was adopted in [ 37 ]. We assume that there is an edge between two sensor nodes if the Euclidean distance between them is smaller than the distance .…”

“…Mobile data gathering has also attracted much attention in the past few years, where one or more mobile collectors are designated to take responsibility for collecting data from sensor nodes [ 33 , 34 , 35 , 36 , 37 , 38 ]. The reason to use mobile collector(s) for data gathering is to reduce energy expenditure at each node.…”

Investigation on Energy Based Data Gathering Approach for WSN

“…Chul Ho Lee et.al [13] addressed the design and development of mobile node collectors to achieve successful data gathering in wireless sensor networks. The problem of network graph with random walk model was analysed to address the issue in data gathering at the destination node under Markovian random-walk movement strategies.…”

Energy efficient chaotic whale optimization technique for data gathering in wireless sensor network

“…The approach failed to attain higher data packet delivery at the sink node. A Distributed Optimal Movement technique was developed [7] for collecting the data with minimal loss rate. But the energy efficient data gathering was not performed to increase the lifetime of network.…”