A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Introduction to algorithms
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Data Gathering in SEnsor Networks using the Energy Delay Metric
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Beyond Steiner's Problem: A VLSI Oriented Generalization
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
SenCar: An Energy-Efficient Data Gathering Mechanism for Large-Scale Multihop Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Mobility-Assisted Spatiotemporal Detection in Wireless Sensor Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Canopy closure estimates with GreenOrbs: sustainable sensing in the forest
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Increasing lifetime of wireless sensor networks using controllable mobile cluster heads
Wireless Communications & Mobile Computing
Delay tolerant event collection in sensor networks with mobile sink
INFOCOM'10 Proceedings of the 29th conference on Information communications
Multiple controlled mobile elements (data mules) for data collection in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
| Hi-index | 0.00 |
In this work we study energy efficient hybrid sensor network design using mobile sinks, motivated by the practical GreenObs system application. In our model, the movement of mobile sinks is constrained to be on some predefined road-segments. Two different network structures are investigated: the one-hop structure in which each static sensor can be reached by the mobile sink at some stage of the movement, and the multi-hop structure where some sensors need the relay by other sensors to reach the sink. The challenge is to find a movement schedule of mobile sink that will minimize the energy cost while meet other constraints. In this work, we first show that the problem is NP-hard and then design an efficient movement scheme and theoretically prove that the total cost is within a constant factor of the optimum. We further present a scheduling solution using integer program for multi-hop structure, which is near optimal and can be computed in polynomial time. Finally, we conduct extensive study of our method in a real wireless sensor network deployment composed of hundreds of static sensors. Our experiments validate the theoretical findings of our method.