Journal of the Operational Research Society

, Volume 61, Issue 6, pp 1000–1012 | Cite as

Optimal placement, scheduling, and routing to maximize lifetime in sensor networks

  • Y B Türkoğulları
  • N Aras
  • İ K Altınel
  • C Ersoy
Theoretical Paper

Abstract

A wireless sensor network is a network consisting of distributed autonomous electronic devices called sensors. Sensors have limited energy and capability for sensing, data processing, and communicating, but they can collectively behave to provide an effective network that monitors an area and transmit information to gateway nodes or sinks, either directly or through other sensor nodes. In most applications the network must operate for long periods of time, so the available energy resources of the sensors must be managed efficiently. In this paper, we first develop a mixed integer linear programming model to maximize network lifetime by optimally determining locations of sensors and sinks, activity schedules of deployed sensors, and data flow routes from sensors to sinks over a finite planning horizon subject to coverage, flow conservation, energy consumption, and budget constraints. Unfortunately, it is difficult to solve this model exactly even for small instances. Therefore, we propose two approximate solution methods: a Lagrangean heuristic and a two-stage heuristic in which sensors are deployed and an activity schedule is found in the first stage, whereas sinks are located and sensor-to-sink data flow routes are determined in the second stage. Computational experiments performed on various test instances indicate that the Lagrangean heuristic is both efficient and accurate and also outperforms the two-stage heuristic.

Keywords

sensor networks heuristics integer programming telecommunications 

References

  1. Akyıldız IF, Melodia T and Chowdhury KR ( 2007 ). A survey on wireless multimedia sensor networks . Comput Netw 51 : 921 – 960 .CrossRefGoogle Scholar
  2. Alfieri A, Bianco A, Brandimarte P and Chiasserini CF ( 2007 ). Maximizing system lifetime in wireless sensor networks . Eur J Opl Res 181 : 390 – 402 .CrossRefGoogle Scholar
  3. Altınel İK, Aras N, Güney E and Ersoy C ( 2006 ). Effective coverage in sensor networks: Binary integer programming formulations and heuristics . In : Proceedings of the International Conference on Communications . New York, 9 : 4014 – 4019 .Google Scholar
  4. Altınel İK, Aras N, Güney E and Ersoy C ( 2008 ). Binary integer programming formulations and heuristics for differentiated coverage in heterogeneous sensor networks . Comput Netw 52 : 2419 – 2431 .CrossRefGoogle Scholar
  5. Beasley J ( 1993 ). Lagrangean relaxation . In: Reeves C (ed) . Modern Heuristic Techniques for Combinatorial Problems . John Wiley and Sons: New York, pp . 243 – 303 .Google Scholar
  6. Bulusu N, Heidemann J and Estrin D ( 2000 ). GPS-less low-cost outdoor localization for very small devices . IEEE Pers Commun Mag 7 : 28 – 34 .CrossRefGoogle Scholar
  7. Cardei M and Wu J ( 2006 ). Coverage in wireless networks . Technical Report, Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL .Google Scholar
  8. Cardei M, Thai MT, Li Y and Wu W ( 2005 ). Energy-efficient target coverage in wireless sensor networks . In : Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies . IEEE: New York, 3 : 1976–1984 .Google Scholar
  9. Chakrabarty K, Iyengar SS, Qi H and Cho E ( 2002 ). Grid coverage for surveillance and target location in distributed sensor networks . IEEE Trans Comput 51 : 1448 – 1453 .CrossRefGoogle Scholar
  10. Crossbow Technology ( 2008 ). http://www.xbow.com/Support/wUserManuals.aspx, accessed 25 July 2008 .
  11. Dhillon SS and Chakrabarty K ( 2003 ). Sensor placement for effective coverage and surveillance in distributed sensor networks . In : Proceedings of the Conference on Wireless Communications and Networking . IEEE: New York, 3 : 1609–1614 .Google Scholar
  12. Ergen SC and Varaiya P ( 2007 ). Energy efficient routing with delay guarantee for sensor networks . Wirel Netw 13 : 679 – 690 .CrossRefGoogle Scholar
  13. Garey MR and Johnson DS ( 1979 ). Computers and Intractability: A Guide to the Theory of NP-Completeness . Freeman and Company: New York .Google Scholar
  14. Ha RW, Ho P, Shen XS and Zhang J ( 2006 ). Sleep scheduling for wireless sensor networks via network flow model . Comput Commun 29 : 2469 – 2481 .CrossRefGoogle Scholar
  15. Hou YT, Shi Y, Sherali HD and Midkiff SF ( 2005 ). On energy provisioning and relay node placement for wireless sensor networks . IEEE Trans Wirel Commun 4 : 2579 – 2590 .CrossRefGoogle Scholar
  16. Hua C and Yum TP ( 2006 ). Maximum lifetime routing and data aggregation for wireless sensor networks . Lect Notes Comput Sci 3976 : 840 – 855 .CrossRefGoogle Scholar
  17. ILOG ( 2008 ). http://www.ilog.com, accessed 25 July 2008 .
  18. Karmarkar N ( 1984 ). A new polynomial-time algorithm for linear programming . Combinatorica 4 : 373 – 395 .CrossRefGoogle Scholar
  19. Liu H, Wan P and Jia X ( 2006 ). Maximal lifetime scheduling for K to 1 sensor-target surveillance networks . Comput Netw 50 : 2839 – 2854 .CrossRefGoogle Scholar
  20. Meguerdichian S and Potkonjak M ( 2003 ). Low power 0/1 coverage and scheduling techniques in sensor networks . Technical Report, Computer Science Department, University of California, Los Angeles .Google Scholar
  21. Nakamura FG, Quintao FP, Menezes GC and Mateus GR ( 2005 ). An optimal node scheduling for fiat wireless sensor networks . Lect Notes Comput Sci 3420 : 475 – 482 .CrossRefGoogle Scholar
  22. Patel M, Chandrasekaran R and Venkatesan S ( 2005 ). Energy efficient sensor, relay and base station placements for coverage, connectivity and routing . In : Proceedings of the 24th International Conference on Performance, Computing and Communications . IEEE: New York, pp . 581 – 586 .Google Scholar
  23. Pham M, Kim D, Kim T and Yoo S ( 2006 ). Maximize the coverage lifetime of sensor networks . Lect Notes Comput Sci 4097 : 475 – 484 .CrossRefGoogle Scholar
  24. Torres MGC and Kabara J ( 2006 ). Measuring energy consumption in wireless sensor networks using GSP . In : Proceedings of the 17th International Symposium on Personal, Indoor and Mobile Radio Communications . IEEE: New York .Google Scholar
  25. Türkoğulları YB, Aras N, Altınel İK and Ersoy C ( 2007 ). Optimal placement and activity scheduling to maximize coverage lifetime in wireless sensor networks . In : Proceedings of the 22nd International Symposium on Computer and Information Sciences . IEEE: New York, pp . 1 – 6 .Google Scholar
  26. Xue Y, Cui Y and Nahrstedt K ( 2005 ). Maximizing lifetime for data aggregation in wireless sensor networks . Mobile Netw Appl 10 : 853 – 864 .CrossRefGoogle Scholar
  27. Zhang H and Hou J ( 2005 ). Maintaining sensing coverage and connectivity in large sensor networks . Int J Wirel Ad Hoc Sens Netw 1 : 89 – 124 .Google Scholar
  28. Zhao Q and Gurusamy M ( 2008 ). Connected K-target coverage problem in wireless sensor networks with different observation scenarios . Comput Netw 52 : 2205 – 2220 .CrossRefGoogle Scholar

Copyright information

© Operational Research Society 2009

Authors and Affiliations

  • Y B Türkoğulları
    • 1
  • N Aras
    • 1
  • İ K Altınel
    • 1
  • C Ersoy
    • 1
  1. 1.Boğaziçi UniversityİstanbulTurkey

Personalised recommendations