By Topic

Toward distributed optimal movement strategy for data harvesting in wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chul-Ho Lee ; Department of Electrical and Computer Engineering North Carolina State University, Raleigh, NC 27695 ; Do Young Eun

In this paper, we address how to design the 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 sensors, we analyze how many data can be successfully gathered in time under any Markovian movement strategies for mobile collectors moving over a graph (or network), while each sensor is equipped with limited buffer space and data arrival rate to each node is heterogeneous. 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 sensors, and explain how such optimal movement strategy can be made to work in a distributed fashion. We demonstrate that our distributed optimal movement strategy leads to about 2 times smaller loss rate than the simple random walk strategy under diverse scenarios. In particular, our strategy can result in about 50% cost savings for the deployment of multiple collectors to achieve the target data loss rate than the simple random walk.

Published in:

Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2012 9th Annual IEEE Communications Society Conference on

Date of Conference:

18-21 June 2012