By Topic

Distributed algorithm for lifetime maximization in delay-tolerant wireless sensor network with mobile sink

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
$31 $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

4 Author(s)
YoungSang Yun ; Comput. & Inf. Sci. & Eng. Dept., Univ. of Florida, Gainesville, FL, USA ; Xia, Y. ; Behdani, B. ; Smith, J.C.

We propose an algorithm for maximizing the lifetime of a wireless sensor network when there is a mobile sink and the underlying application can tolerate some degree of delay in delivering the data to the sink. Our main contribution is that the algorithm is distributed, and in addition, mostly uses local information. Such an algorithm can be implemented by parallel and/or distributed execution and the overhead of message passing is low. It is also possible to embed the algorithm into a network protocol so that the senor nodes and the sink can run it directly as part of the network operation. Our second contribution is that we give a proof of the algorithm's optimality and the boundedness of the queue sizes, both in the long-run average sense. The proof is based on analyzing a Lyapunov drift.

Published in:

Decision and Control (CDC), 2010 49th IEEE Conference on

Date of Conference:

15-17 Dec. 2010