Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
O(1)-Approximations for maximum movement problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
| Hi-index | 0.00 |
This paper investigates heuristics to control and coordinate the concurrent movement of multiple sinks for lifetime maximization in a wireless sensor network (WSN). We have developed a centralized heuristic that runs in polynomial time given the solution to the linear program from [1] which provides a provable upper bound to the problem of controlled mobility of multiple sinks. The centralized heuristic solves the sink movement and placement problem obtaining lifetimes that are within 2% of the upper bound. We also define a deployable distributed heuristic for coordinating the motion of multiple sinks through the network. The performance comparison of our heuristics with static sink placement and with random sink mobility shows that our distributed heuristic achieves network lifetimes that are remarkably close to the optimum ones, resulting in significant lifetime improvements over random sink mobility (+77.7%) and statically deployed sinks (+382.4%).