Maximize the Coverage Lifetime of Sensor Networks

When deploying sensors in the field in order to collect useful information, one of the most important issues is how to prolong the lifetime of the network because of energy constraint of the sensors while guaranteeing that every point in the network is covered. In this paper, we propose the formulation of integer linear programming (ILP) model to find the optimal network flow in the sensor fields in order to maximize the network lifetime while maintaining the coverage and connectivity. By dividing the network into grid structure, the problem can become manageable in size and complexity thus can be applied to large network with high number of nodes. The experimental results show that our proposed scheme outperforms previous protocols in terms of coverage lifetime.

[1]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[2]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[3]  M. Potkonjak,et al.  Low Power 0 / 1 Coverage and Scheduling Techniques in Sensor Networks , 2003 .

[4]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[5]  Konstantinos Kalpakis,et al.  MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS , 2002 .

[6]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[7]  Eric R. Zieyel Operations research : applications and algorithms , 1988 .

[8]  Krishna M. Sivalingam,et al.  Data Gathering Algorithms in Sensor Networks Using Energy Metrics , 2002, IEEE Trans. Parallel Distributed Syst..

[9]  Mihaela Cardei,et al.  Coverage in Wireless Sensor Networks , 2004, Handbook of Sensor Networks.

[10]  Jianping Pan,et al.  Optimal single-session flow routing for wireless sensor networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[11]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[12]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[13]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  David Simplot-Ryl,et al.  Energy-efficient area monitoring for sensor networks , 2004, Computer.

[15]  Jianping Pan,et al.  Single-beam flow routing for wireless sensor networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[16]  Miodrag Potkonjak,et al.  Wireless Sensor Networks , 2003 .

[17]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).