Skip to main content

Advertisement

Log in

Multiround Distributed Lifetime Coverage Optimization protocol in wireless sensor networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Coverage and lifetime are two paramount problems in wireless sensor networks (WSNs). In this paper, a method called Multiround Distributed Lifetime Coverage Optimization protocol (MuDiLCO) is proposed to maintain the coverage and to improve the lifetime in wireless sensor networks. The area of interest is first divided into subregions, and then the MuDiLCO protocol is distributed to the sensor nodes in each subregion. The proposed MuDiLCO protocol works in periods during which sets of sensor nodes are scheduled, with one set for each round of a period, to remain active during the sensing phase and thus ensure coverage so as to maximize the WSN lifetime. The decision process is carried out by a leader node, which solves an optimization problem to produce the best representative sets to be used during the rounds of the sensing phase. The optimization problem formulated as an integer program is solved to optimality through a Branch-and-Bound method for small instances. For larger instances, the best feasible solution found by the solver after a given time limit threshold is considered. Compared with some existing protocols, simulation results based on multiple criteria (energy consumption, coverage ratio, and so on) show that the proposed protocol can prolong efficiently the network lifetime and improve the coverage performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Rawat P, Singh KD, Chaouchi H, Bonnin JM (2014) Wireless sensor networks: a survey on recent developments and potential synergies. J Supercomput 68(1):1–48. https://doi.org/10.1007/s11227-013-1021-9

    Article  Google Scholar 

  2. Misra S, Zhang I, Misra SC (2009) Guide to wireless sensor networks. Springer, Berlin

    Book  MATH  Google Scholar 

  3. Akyildiz IF, Vuran MC (2010) Wireless sensor networks. Wiley, Hoboken

    Book  MATH  Google Scholar 

  4. Idrees AK, Deschinkel K, Salomon M, Couturier R (2015) Distributed lifetime coverage optimization protocol in wireless sensor networks. J Supercomput 71(12):4578–4593

    Article  Google Scholar 

  5. Varga A Omnet++ discrete event simulation system. http://www.omnetpp.org

  6. Cardei M, Wu J (2006) Energy-efficient coverage problems in wireless ad-hoc sensor networks. Comput Commun 29(4):413–420

    Article  Google Scholar 

  7. Abrams Z, Goel A, Plotkin S (2004) Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks. ACM, pp 424–432

  8. Cardei M, Du D-Z (2005) Improving wireless sensor network lifetime through power aware organization. Wirel Netw 11(3):333–340

    Article  Google Scholar 

  9. Slijepcevic S, Potkonjak M (2001) Power efficient organization of wireless sensor networks. In: IEEE International Conference on Communications, pp 472–476

  10. Manjun Pujari AK (2011) High-energy-first (HEF) heuristic for energy-efficient target coverage problem. Int J Ad Hoc Sens Ubiquitous Comput 2(1):45–58

    Article  Google Scholar 

  11. Kim Y-H, Han Y-H, Jeong Y-S, Park D-S (2013) Lifetime maximization considering target coverage and connectivity in directional image/video sensor networks. J Supercomput 65(1):365–382. https://doi.org/10.1007/s11227-011-0646-9

    Article  Google Scholar 

  12. Yang M, Liu J (2014) A maximum lifetime coverage algorithm based on linear programming. J Inf Hiding Multimed Signal Process 5(2):296–301

    Google Scholar 

  13. Cheng H, Su Z, Xiong N, Xiao Y (2016) Energy-efficient node scheduling algorithms for wireless sensor networks using markov random field model. Inf Sci 329(C):461–477. https://doi.org/10.1016/j.ins.2015.09.039

    Article  Google Scholar 

  14. Gentili M, Raiconi A (2013) \(\alpha \)-coverage to extend network lifetime on wireless sensor networks. Optim Lett 7(1):157–172

    Article  MathSciNet  MATH  Google Scholar 

  15. Castano F, Rossi A, Sevaux M, Velasco N (2014) A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints. Comput Oper Res 52(Part B):220–230. https://doi.org/10.1016/j.cor.2013.11.001

    Article  MathSciNet  MATH  Google Scholar 

  16. Rossi A, Singh A, Sevaux M (2012) An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges. Comput Oper Res 39(12):3166–3176

    Article  MathSciNet  MATH  Google Scholar 

  17. Deschinkel K (2012) A column generation based heuristic to extend lifetime in wireless sensor network. Sens Transducers J 14–2:242–253

    Google Scholar 

  18. Gallais A, Carle J, Simplot-Ryl D, Stojmenovic I (2006) Localized sensor area coverage with low communication overhead. In: Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications, pp 328–337

  19. Tian D, Georganas ND (2002) A coverage-preserving node scheduling scheme for large wireless sensor networks. In: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, WSNA ’02. ACM, pp 32–41

  20. Ye F, Zhong G, Cheng J, Lu S, Zhang L (2003) Peas: a robust energy conserving protocol for long-lived sensor networks. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, ICDCS’03, pp 28–37

  21. Zhang H, Hou JC (2005) Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc Sens Wirel Netw 1(1–2):89–124

    Google Scholar 

  22. Heinzelman WB, Chandrakasan AP, Balakrishnan H (2002) An application-specific protocol architecture for wireless microsensor networks. IEEE Trans Wirel Commun 1(4):660–670

    Article  Google Scholar 

  23. Yardibi T, Karasan E (2010) A distributed activity scheduling algorithm for wireless sensor networks with partial coverage. Wirel Netw 16(1):213–225

    Article  Google Scholar 

  24. Prasad SK, Dhawan A (2007) Distributed algorithms for lifetime of wireless sensor networks based on dependencies among cover sets. In: High performance computing–HiPC 2007. Springer, pp 381–392

  25. Misra S, Kumar MP, Obaidat MS (2011) Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks. Comput Commun 34(12):1484–1496

    Article  Google Scholar 

  26. Berman P, Calinescu G, Shah C, Zelikovsky A (2005) Efficient energy management in sensor networks. In: Ad hoc and sensor networks. Nova Science Publishers

  27. Lu J, Suda T (2003) Coverage-aware self-scheduling in sensor networks. In: 2003 IEEE 18th Annual Workshop on Computer Communications, 2003. CCW 2003. Proceedings. IEEE, pp 117–123

  28. Vu C, Gao S, Deshmukh W, Li Y (2006) Distributed energy-efficient scheduling approach for k-coverage in wireless sensor networks. MILCOM 0, pp 1–7. https://doi.org/10.1109/MILCOM.2006.302146

  29. Huang C-F, Tseng Y-C (2005) The coverage problem in a wireless sensor network. Mobile Netw Appl 10(4):519–528

    Article  Google Scholar 

  30. Wang B, Lim HB, Ma D (2012) A coverage-aware clustering protocol for wireless sensor networks. Comput Netw 56(5):1599–1611

    Article  Google Scholar 

  31. Liu Z, Zheng Q, Xue L, Guan X (2012) A distributed energy-efficient clustering algorithm with improved coverage in wireless sensor networks. Future Gener Comput Syst 28(5):780–790

    Article  Google Scholar 

  32. Zhang L, Zhu Q, Wang J (2013) Adaptive clustering for maximizing network lifetime and maintaining coverage. J Netw 8(3):616–622

    Google Scholar 

  33. He S, Chen J, Li X, Shen X, Sun Y (2012) Leveraging prediction to improve the coverage of wireless sensor networks. IEEE Trans Parallel Distrib Syst 23(4):701–712

    Article  Google Scholar 

  34. Xu Y, Heidemann J, Estrin D (2001) Geography-informed energy conservation for ad hoc routing. In: Proceedings of the 7th Annual International Conference on Mobile computing and networking. ACM, pp 70–84

  35. Cardei M, Wu J, Lu M, Pervaiz MO (2005) Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In: IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005, (WiMob’2005), vol 3. IEEE, pp 438–445

  36. Idrees AK, Deschinkel K, Salomon M, Couturier R (2014) Coverage and lifetime optimization in heterogeneous energy wireless sensor networks. In: ICN 2014, The Thirteenth International Conference on Networks, pp 49–54

  37. Misra S, Krishna PV, Bhiwal A, Chawla AS, Wolfinger BE, Lee C (2012) A learning automata-based fault-tolerant routing algorithm for mobile ad hoc networks. J Supercomput 62(1):4–23. https://doi.org/10.1007/s11227-011-0639-8

    Article  Google Scholar 

  38. Wang J, Cao J, Sherratt RS, Park JH (2017) An improved ant colony optimization-based approach with mobile sink for wireless sensor networks. J Supercomput. https://doi.org/10.1007/s11227-017-2115-6

    Google Scholar 

  39. Pedraza F, Medaglia AL, Garcia A (2006) Efficient coverage algorithms for wireless sensor networks. In: Proceedings of the 2006 Systems and Information Engineering Design Symposium, pp 78–83

  40. Raghunathan V, Schurgers C, Park S, Srivastava MB (2002) Energy-aware wireless microsensor networks. Sig Process Mag IEEE 19(2):40–50

    Article  Google Scholar 

  41. Fourer R, Gay DM, Kernighan BW (2002) AMPL: a modeling language for mathematical programming, 2nd edn. Cengage Learning, Boston

    MATH  Google Scholar 

  42. Makhorin A The glpk (gnu linear programming kit). http://www.gnu.org/software/glpk/

Download references

Acknowledgements

This work is partially funded by the Labex ACTION Program (Contract ANR-11-LABX-01-01). Ali Kadhum IDREES would like to gratefully acknowledge the University of Babylon—Iraq for the financial support and Campus France (the French national agency for the promotion of higher education, international student services, and international mobility) for the support received when he was Ph.D. student in France.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Raphaël Couturier.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Idrees, A.K., Deschinkel, K., Salomon, M. et al. Multiround Distributed Lifetime Coverage Optimization protocol in wireless sensor networks. J Supercomput 74, 1949–1972 (2018). https://doi.org/10.1007/s11227-017-2203-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-017-2203-7

Keywords

Profiles

  1. Ali Kadhum Idrees