Advertisement

Peer-to-Peer Networking and Applications

, Volume 10, Issue 1, pp 66–78 | Cite as

Coverage hole detection and restoration algorithm for wireless sensor networks

  • Tarachand AmgothEmail author
  • Prasanta K. Jana
Article

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.

Keywords

Wireless sensor networks Coverage preservation Coverage hole Coverage restoration Energy efficient 

References

  1. 1.
    Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) Wireless Sensor Networks: survey. Comput Netw 38:393–422CrossRefGoogle Scholar
  2. 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–41Google Scholar
  3. 3.
    Wu, Yang S (2004) Coverage issue in sensor networks with adjustable ranges. In proceedings of the IEEE ICPPWGoogle Scholar
  4. 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 2005Google Scholar
  5. 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 SNPDGoogle Scholar
  6. 6.
    Zhou Z, Das S, Gupta H (2004) Variable radii connected sensor cover in sensor networks. In Proceedings of the IEEE SECONGoogle Scholar
  7. 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–153CrossRefGoogle Scholar
  8. 8.
    Shi K, Chen H, Lin Y (2015) Probabilistic coverage based sensor scheduling for target tracking sensor networks. Inf Sci 292:95–110CrossRefGoogle Scholar
  9. 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–42CrossRefGoogle Scholar
  10. 10.
    Tsai YR (2007) Coverage-preserving routing protocols for randomly distributed wireless sensor networks. IEEE Trans Wirel Commun 6:1240–1245CrossRefGoogle Scholar
  11. 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–1086CrossRefGoogle Scholar
  12. 12.
    Heinzelman WB, Soro S (2009) Cluster head election techniques for coverage preservation in wireless sensor networks. Ad Hoc Netw 7:955–972CrossRefGoogle Scholar
  13. 13.
    Tao Y, Zhang Y, Ji Y (2013) Flow-balanced routing for multi-hop clustered wireless sensor networks. Ad Hoc Netw 11:541–554CrossRefGoogle Scholar
  14. 14.
    Wang B, Lim HB, Ma D (2012) A coverage-aware clustering protocol for wireless sensor networks. Comput Netw 56:1599–1611CrossRefGoogle Scholar
  15. 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–398CrossRefGoogle Scholar
  16. 16.
    Heinzelman WB, Chandrakasan A, Balakrishnan H (2000) Energy-efficient communication protocols for wireless microsensor networks. In Proceedings of Hawaii international conference on system sciencesGoogle Scholar
  17. 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–2407CrossRefGoogle Scholar
  18. 18.
    Torkestani JA (2013) An adaptive energy-efficient coverage algorithm for wireless sensor networks. Ad Hoc Netw 11:1655–1666CrossRefGoogle Scholar
  19. 19.
    Huang C-F, Tseng Y-C (2003) The coverage problem in a wireless sensor networks. In Proceedings WSNAGoogle Scholar
  20. 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–1766CrossRefzbMATHMathSciNetGoogle Scholar
  21. 21.
    Misra S, Kumar MP, Obaidat MS (2011) Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks. Comput Commun 34:1484–1496CrossRefGoogle Scholar
  22. 22.
    Di X (2012) A novel coverage-preserving clustering algorithm for wireless sensor networks. Phys Procedia 33:1064–1069CrossRefGoogle Scholar
  23. 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–946CrossRefGoogle Scholar
  24. 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–705Google Scholar
  25. 25.
    (2009) A distributed coverage-aware sleep scheduling algorithm for wireless sensor networks. In Proceedings of ITNG 2009, pp. 524–527Google Scholar
  26. 26.
    Photoelectric Sensors, http://www.schneider-electric.ca
  27. 27.
    Wu J, Yang S (2004) Coverage and Connectivity in Sensor Networks with Adjustable Ranges. International workshop on mobile and wireless networkingGoogle Scholar
  28. 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–499Google Scholar
  29. 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–749Google Scholar
  30. 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

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringIndian School of MinesDhanbadIndia

Personalised recommendations