Efficient integer programming formulations for optimum sink location and routing in wireless sensor networks

In this work we consider routing and sink location problems in sensor networks and propose two new mixed integer programming formulations to determine optimal sink locations and data flow routes. The models basically differ in the formulations of their objective functions. We assume that the sensor field consists of a finite set of points, and sensors, which are located on a subset, cover the points of the field completely. Experimental results indicate that these new formulations are very efficient and optimal solutions can be computed easily even for large networks. We also propose Lagrangean relaxation methods to solve the formulations approximately.

[1]  Pravin Varaiya,et al.  Energy efficient routing with delay guarantee for sensor networks , 2007, Wirel. Networks.

[2]  Said Salhi,et al.  Discrete Location Theory , 1991 .

[3]  Yanghee Choi,et al.  Optimal Multi-sink Positioning and Energy-Efficient Routing in Wireless Sensor Networks , 2005, ICOIN.

[4]  J. Beasley.  Lagrangean heuristics for location problems , 1993 .

[5]  Arthur M. Geoffrion,et al.  Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.

[6]  Daeyoung Kim,et al.  Maximize the Coverage Lifetime of Sensor Networks , 2006, EUC Workshops.

[7]  Zhen Liu,et al.  Maximum lifetime routing in wireless ad-hoc networks , 2004, IEEE INFOCOM 2004.

[8]  Luca Mottola,et al.  Efficient Routing from Multiple Sources to Multiple Sinks in Wireless Sensor Networks , 2007, EWSN.

[9]  Weili Wu,et al.  Wireless Sensor Networks and Applications (Signals and Communication Technology) , 2007 .

[10]  Y.T. Hou,et al.  On energy provisioning and relay node placement for wireless sensor networks , 2005, IEEE Transactions on Wireless Communications.

[11]  Weili Wu,et al.  Wireless Sensor Networks and Applications , 2008 .

[12]  Cunqing Hua,et al.  Optimal Routing and Data Aggregation for Maximizing Lifetime of Wireless Sensor Networks , 2008, IEEE/ACM Transactions on Networking.

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[15]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[16]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[17]  R. Srikant,et al.  Energy-aware routing in sensor networks: A large system approach , 2007, Ad Hoc Networks.

[18]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[19]  Mohamed F. Younis,et al.  Energy-aware routing in cluster-based sensor networks , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

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

[21]  Edgar H. Callaway,et al.  Wireless Sensor Networks: Architectures and Protocols , 2003 .

[22]  Cunqing Hua,et al.  Maximum Lifetime Routing and Data Aggregation for Wireless Sensor Networks , 2006, Networking.

[23]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..