Skip to main content

Advertisement

SpringerLink
Log in

Coverage hole detection and restoration algorithm for wireless sensor networks

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

In wireless sensor networks (WSNs), preserving coverage of the target area by the sensor nodes is crucial to deliver certain services. However, a few sensor nodes die during the network operation due to energy constraints which may break the coverage of the target area. We refer this as a coverage hole problem. In this paper, we propose a new algorithm called CHD-CR which attempts to restore the coverage after detecting a coverage hole in the target area. The proposed algorithm mainly consists of coverage hole detection (CHD) and coverage restoration (CR) phases. We design an efficient local mechanism for coverage hole detection and energy efficient technique for its restoration. We test the performance of the proposed algorithm through simulation and the results are compared with the existing algorithms. Simulation results show that the proposed CHD-CR algorithm outperforms the existing algorithms in terms of coverage preservation for longer time.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  1. Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) Wireless Sensor Networks: survey. Comput Netw 38:393–422

    Article  Google Scholar 

  2. Tian D, Georganas ND (2002) A coverage-preserving node scheduling scheme for large wireless sensor networks. In Proceedings of the ACM international workshop on wireless sensor networks and applications, pp. 32–41

  3. Wu, Yang S (2004) Coverage issue in sensor networks with adjustable ranges. In proceedings of the IEEE ICPPW

  4. Cardei M, Wu J, Liu M, Pervaiz MO (2005) Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In Proceddings of WiMob 2005

  5. Dhawan A, Vu CT, Zelikovsky A, Li Y, Prasad SK (2006) Maximum lifetime of sensor networks with adjustable sensing range. In Proceedings of the IEEE SNPD

  6. Zhou Z, Das S, Gupta H (2004) Variable radii connected sensor cover in sensor networks. In Proceedings of the IEEE SECON

  7. Alam KM, Kamruzzaman J, Karmakar G, Murshed M (2014) Dynamic adjustment of sensing range for event coverage in wireless sensor networks. J Netw Comput Appl 46:139–153

    Article  Google Scholar 

  8. Shi K, Chen H, Lin Y (2015) Probabilistic coverage based sensor scheduling for target tracking sensor networks. Inf Sci 292:95–110

    Article  Google Scholar 

  9. Tian J, Zhang W, Wang G, Gao X (2014) 2D k-barrier duty-cycle scheduling for intruder detection in Wireless Sensor Networks. Comput Commun 43:31–42

    Article  Google Scholar 

  10. Tsai YR (2007) Coverage-preserving routing protocols for randomly distributed wireless sensor networks. IEEE Trans Wirel Commun 6:1240–1245

    Article  Google Scholar 

  11. Chamam A, Pierre S (2009) On the planning of wireless sensor networks: energy-efficient clustering under the joint routing and coverage constraint. IEEE Trans Mob Comput 8:1077–1086

    Article  Google Scholar 

  12. Heinzelman WB, Soro S (2009) Cluster head election techniques for coverage preservation in wireless sensor networks. Ad Hoc Netw 7:955–972

    Article  Google Scholar 

  13. Tao Y, Zhang Y, Ji Y (2013) Flow-balanced routing for multi-hop clustered wireless sensor networks. Ad Hoc Netw 11:541–554

    Article  Google Scholar 

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

    Article  Google Scholar 

  15. Gu X, Yu J, Yu D, Wang G, Lv Y (2014) ECDC: an energy and coverage-aware distributed clustering protocol for wireless sensor networks. Comput Electr Eng 40:384–398

    Article  Google Scholar 

  16. Heinzelman WB, Chandrakasan A, Balakrishnan H (2000) Energy-efficient communication protocols for wireless microsensor networks. In Proceedings of Hawaii international conference on system sciences

  17. Jin Y, Jo J-Y, Wang L, Kim Y, Yang X (2008) ECCRA: an energy-efficient coverage and connectivity preserving routing algorithm under border effects in wireless sensor networks. Comput Commun 31:2398–2407

    Article  Google Scholar 

  18. Torkestani JA (2013) An adaptive energy-efficient coverage algorithm for wireless sensor networks. Ad Hoc Netw 11:1655–1666

    Article  Google Scholar 

  19. Huang C-F, Tseng Y-C (2003) The coverage problem in a wireless sensor networks. In Proceedings WSNA

  20. Jia J, Chang JCG, Tan Z (2009) Energy efficient coverage control on wireless networks based on multi-objective genetic algorithm. Comput Math Appl 57:1756–1766

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  22. Di X (2012) A novel coverage-preserving clustering algorithm for wireless sensor networks. Phys Procedia 33:1064–1069

    Article  Google Scholar 

  23. Deng X, Yu D, Wang G, Gu X (2013) CWSC: Connected k-coverage working sets construction algorithm in wireless sensor networks. Int J Electr Commun 67:937–946

    Article  Google Scholar 

  24. Nghiem TP, Kim JH, Lee SHo, Cho TH (2009) A coverage and energy aware cluster-head selection algorithm in wireless sensor networks. In Proceedings of ICIC 2009, LNCS, vol. 5754, pp. 696–705

  25. (2009) A distributed coverage-aware sleep scheduling algorithm for wireless sensor networks. In Proceedings of ITNG 2009, pp. 524–527

  26. Photoelectric Sensors, http://www.schneider-electric.ca

  27. Wu J, Yang S (2004) Coverage and Connectivity in Sensor Networks with Adjustable Ranges. International workshop on mobile and wireless networking

  28. Nguyen DT, Nguyen NP, Thai MT, Helal A (2011) An optimal algorithm for coverage hole healing in hybrid sensor networks. In Proceedings of IWCMC, pp. 494–499

  29. Li F, Xiong S, Wang L (2011) Recovering coverage holes by using mobile sensors in wireless sensor networks, In Proceedings of the ICCIS, pp. 746–749

  30. Abo-Zahhad M, Ahmed SM, Sabor N, Sasaki S (2015) Rearrangement of mobile wireless sensor nodes for coverage maximization based on immune node deployment algorithm. Comput Electr Eng http://dx.doi.org/10.1016/j. compeleceng.2015.04.003

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian School of Mines, Dhanbad, India, 826004

    Tarachand Amgoth & Prasanta K. Jana

Authors
  1. Tarachand Amgoth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prasanta K. Jana
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tarachand Amgoth.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Amgoth, T., Jana, P.K. Coverage hole detection and restoration algorithm for wireless sensor networks. Peer-to-Peer Netw. Appl. 10, 66–78 (2017). https://doi.org/10.1007/s12083-015-0407-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-015-0407-2

Keywords

Search

Navigation