Journal
IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 10, Issue 4, Pages 592-608Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TMC.2010.193
Keywords
Sensor networks; mobile sinks; path constraint; data collection; energy utilization efficiency
Funding
- National Basic Research Program of China (973 program) [2007CB307100]
- National Key National Science Foundation of China [60833002]
- US National Science Foundation (NSF) [IIS-0326505, CNS-0721951]
- AFOSR [A9550-08-1-0260]
- NSF
Ask authors/readers for more resources
Recent work has shown that sink mobility along a constrained path can improve the energy efficiency in wireless sensor networks. However, due to the path constraint, a mobile sink with constant speed has limited communication time to collect data from the sensor nodes deployed randomly. This poses significant challenges in jointly improving the amount of data collected and reducing the energy consumption. To address this issue, we propose a novel data collection scheme, called the Maximum Amount Shortest Path (MASP), that increases network throughput as well as conserves energy by optimizing the assignment of sensor nodes. MASP is formulated as an integer linear programming problem and then solved with the help of a genetic algorithm. A two-phase communication protocol based on zone partition is designed to implement the MASP scheme. We also develop a practical distributed approximate algorithm to solve the MASP problem. In addition, the impact of different overlapping time partition methods is studied. The proposed algorithms and protocols are validated through simulation experiments using OMNET++.
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