Movement-assisted sensor redeployment scheme for network lifetime increase

Sensor deployment in mobile sensor networks has received significant attention in recent years. Goals during sensor deployment include improving coverage, achieving load balance, and prolonging the network lifetime. To improve the initial deployment, one possible method is to use mobile sensors, thus allowing sensors to relocate. In this paper, we present a sensor deployment strategy in mobile sensor networks. Our goal is to improve coverage and prolong network lifetime through sensor relocation after the initial deployment. The problem in this paper is defined as Movement-assisted Sensor Positioning (MSP) for network lifetime increase problem. With the observation that the sensors closer to the sink tend to consume more energy than those farther away from the sink, we first compute the desired non-uniform sensor density in the monitored area to reduce the energy holes near the sink and to prolong network lifetime. Assuming that sensors can move only once, we then propose a centralized algorithm to relocate mobile sensors to satisfy the density requirement with minimum cost. We construct the virtual multi-flow graph and solve the sensor relocation problem using a maximum-flow minimum-cost algorithm. The improvement in network lifetime is proved both mathematically and by simulations.

[1]  Ivan Stojmenovic,et al.  Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[2]  Mani Srivastava,et al.  Overview of sensor networks , 2004 .

[3]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[4]  Deborah Estrin,et al.  Guest Editors' Introduction: Overview of Sensor Networks , 2004, Computer.

[5]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[6]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[7]  Paolo Bellavista,et al.  Efficient data harvesting in mobile sensor platforms , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[8]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[9]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Gaurav S. Sukhatme,et al.  Robomote: enabling mobility in sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[11]  Bin Ma,et al.  Mobility Limited Flip-Based Sensor Networks Deployment , 2007, IEEE Transactions on Parallel and Distributed Systems.

[12]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[13]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[14]  Thomas F. La Porta,et al.  Sensor relocation in mobile sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Jie Wu,et al.  SMART: a scan-based movement-assisted sensor deployment method in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.