TY - GEN
T1 - Low cost data gathering using mobile hybrid sensor networks
AU - Tao, Dan
AU - Tang, Shaojie
AU - Ma, Huadong
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
KW - data gathering
KW - flow network
KW - group steiner tree
KW - mobile hybrid sensor networks
KW - mobile sink
UR - https://www.scopus.com/pages/publications/84864795733
U2 - 10.1007/978-3-642-31638-8_15
DO - 10.1007/978-3-642-31638-8_15
M3 - Conference contribution
AN - SCOPUS:84864795733
SN - 9783642316371
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 193
EP - 206
BT - Ad-hoc, Mobile, and Wireless Networks - 11th International Conference, ADHOC-NOW 2012
T2 - 11th International Conference on Ad-hoc, Mobile, and Wireless Networks, ADHOC-NOW2012
Y2 - 9 July 2012 through 12 July 2012
ER -