Journal
IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 12, Issue 10, Pages 1920-1930Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TMC.2012.152
Keywords
Wireless sensor network; lifetime maximization; distributed algorithm; delay-tolerant applications; mobile sink
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available