Perl How to Program
Implementation of algorithms for maximum matching on nonbipartite graphs.
Implementation of algorithms for maximum matching on nonbipartite graphs.
Radio-Triggered Wake-Up for Wireless Sensor Networks
Real-Time Systems
The hybrid mobile wireless sensor networks for data gathering
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Introduction to Operations Research and Revised CD-ROM 8
Introduction to Operations Research and Revised CD-ROM 8
Fast and energy efficient sensor data collection by multiple mobile sinks
Proceedings of the 5th ACM international workshop on Mobility management and wireless access
General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies
IEEE Transactions on Mobile Computing
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
How Long is the Lifetime of a Wireless Sensor Network?
AINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications
Proceedings of the 7th ACM Conference on Embedded Networked Sensor 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
Mini-sink mobility with diversity-based routing in wireless sensor networks
Proceedings of the 8th ACM Symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
On traveling path and related problems for a mobile station in a rechargeable sensor network
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
| Hi-index | 0.00 |
We define scalable models and distributed heuristics for the concurrent and coordinated movement of multiple sinks in a wireless sensor network, a case that presents significant challenges compared to the widely investigated case of a single mobile sink. Our objective is that of maximizing the network lifetime defined as the time from the start of network operations till the failure of the first node. We contribute to this problem providing three new results. We first define a linear program (LP) whose solution provides a provable upper bound on the maximum lifetime possible for any given number of sinks. We then develop a centralized heuristic that runs in polynomial time given the solution to the LP. We also define a deployable distributed heuristic for coordinating the motion of multiple sinks through the network. We demonstrate the performance of the proposed heuristics via ns2-based simulations. The observed results show that our distributed heuristic achieves network lifetimes that are remarkably close to the optimum ones, resulting also in significant improvements over the cases of deploying the sinks statically, of random sink mobility and of heuristics previously proposed for restricted sink movements.