The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2013 vol. 12)
ISSN: 1536-1233
pp: 1920-1930
J. Cole Smith , University of Florida, Gainesville
Behnam Behdani , University of Florida, Gainesville
Ye Xia , University of Florida, Gainesville
YoungSang Yun , University of Florida, Gainesville
ABSTRACT
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 amount of delay in delivering the data to the sink. 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 sensor nodes and the sink can run it directly as part of the network operation. 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.
INDEX TERMS
Mobile communication, Delay, Robot sensing systems, Mobile computing, Wireless sensor networks, Algorithm design and analysis, Distributed algorithms, delay-tolerant applications, Mobile communication, Delay, Robot sensing systems, Mobile computing, Wireless sensor networks, Algorithm design and analysis, Distributed algorithms, mobile sink, Wireless sensor network, lifetime maximization, distributed algorithm
CITATION
J. Cole Smith, Behnam Behdani, Ye Xia, YoungSang Yun, "Distributed Algorithm for Lifetime Maximization in a Delay-Tolerant Wireless Sensor Network with a Mobile Sink", IEEE Transactions on Mobile Computing, vol. 12, no. , pp. 1920-1930, Oct. 2013, doi:10.1109/TMC.2012.152
185 ms
(Ver )