Multi-hop wireless sensor networks with mobile sink
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Using predictable observer mobility for power efficient design of sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Sensor networks with mobile agents
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Optimal multi-sink positioning and energy-efficient routing in wireless sensor networks
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
| Hi-index | 0.00 |
Deploying multiples sink nodes reduces communication distance, and thus energy consumption in wireless sensor networks. Determining exactly where to deploy those sinks so as to minimize the communication paths isn't however a trivial question. Solutions that use integer linear programming or iterative clustering techniques are usually not scalable, choose the sink positions only from a limited set of possibilities, and are based on global topology information. In this paper we present and analyze the 1_hop algorithm, an approach that uses only local, last-hop routing information to iteratively find an efficient solution to the deployment problem. We show that the algorithm performs well in any kind of heterogeneous environment (heterogeneous sensor density, areas of irregular shape, or with obstacles), cases in which solutions that build on global topology information are often not appropriate.