Skip to main content
SpringerLink
Log in

An efficient coverage hole-healing algorithm for area-coverage improvements in mobile sensor networks

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

Abstract

Maximizing network coverage is among the key factors in designing efficient sensor-deployment algorithms for wireless sensor networks (WSNs). In this study, we consider a WSN in which mobile sensor nodes (SNs) are randomly deployed over a two-dimensional region with the existence of coverage holes due to the absence of any SNs. To improve the network coverage, we thus propose a novel distributed deployment algorithm – coverage hole-healing algorithm (CHHA) – to maximize the area coverage by healing the coverage holes such that the total SN moving distance is minimized. Once the network is formed after an initial random placement of the SNs, CHHA is applied to detect coverage holes, including hole-boundary SNs, based on computational geometry, i.e., Delaunay triangulation. The distributed deployment feature of CHHA applies a concept to virtual forces that is used to decide the movement of mobile SNs to heal the coverage holes. The simulation results show that our proposed algorithm is capable of exact detection of coverage holes in addition to area-coverage improvement by healing the holes. The results also demonstrate the effectiveness of CHHA compared with other competitive approaches, namely, VFA, VEDGE, and HEAL, in terms of total moving distance.

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
Fig. 15
Fig. 16

Similar content being viewed by others

References

  1. Akyildiz IF, Vuran MC (2010) Wireless sensor networks. John Wiley & Sons

  2. Cordeiro CM, Agrawal DP (2006) Ad hoc & sensor networks: theory and applications. World Scientific Publishing

  3. Dargie W, Poellabauer C (2010) Fundamentals of wireless sensor networks: theory and practice. John Wiley & Sons

  4. Nguyen TG, So-In C (2016) An energy-efficient point-coverage-aware clustering protocol in wireless sensor networks. Int J Ad Hoc Ubiq Co 28(3):148–167

  5. Huang CF, Tseng YC (2005) The coverage problem in a wireless sensor network. Mobile Netw Appl 10:519–528

    Article  Google Scholar 

  6. Wang B (2010) Coverage control in sensor networks. Computer Communications and Networks

  7. Wang Z, Cao Q, Qi H, Chen H, Wang Q (2017) Cost-effective barrier coverage formation in heterogeneous wireless sensor networks. Ad Hoc Netw 64:65–79

    Article  Google Scholar 

  8. Al-Karaki JN, Gawanmeh A (2017) The optimal deployment, coverage, and connectivity problems in wireless sensor networks: revisited. IEEE Access 5:18051–18065

    Article  Google Scholar 

  9. Wang Y, Wu S, Chen Z, Gao X, Chen G (2017) Coverage problem with uncertain properties in wireless sensor networks: a survey. Comput Netw 123:200–232

    Article  Google Scholar 

  10. Sangwan A, Singh RP (2015) Survey on coverage problems in wireless sensor networks. Wirel Pers Commun 80(4):1475–1500

    Article  Google Scholar 

  11. Wang Z, Chen H, Cao Q, Qi H, Wang Z, Wang Q (2017) Achieving location error tolerant barrier coverage for wireless sensor networks. Comput Netw 112:314–328

    Article  Google Scholar 

  12. Nguyen TG, So-In C, Nguyen NG, Phoemphon S (2017) A novel energy-efficient clustering protocol with area coverage awareness for wireless sensor networks. Peer Peer Netw Appl 10(3):519–536

    Article  Google Scholar 

  13. Sibley G, Rahimi M, Sukhatme G (2002) Robomote: a tiny mobile robot platform for large-scale ad-hoc sensor networks. Proc of the IEEE Int Conf Robot 2:1143–1148

  14. Laibowitz M, Paradiso J (2005) Parasitic mobility for pervasive sensor networks. Proc of 3rd Int Conf on Per Co (PERVASIVE’05) 255–278

  15. Senouci MR, Mellouk A (2016) Deploying wireless sensor networks: theory and practice. Elsevier Ltd

  16. Abdollahzadeh S, Navimipour N (2016) Deployment strategies in the wireless sensor network: a comprehensive review. Comput Commun 91–92:1–16

    Article  Google Scholar 

  17. Bartolini N, Calamoneri T, La Porta TF, Silvestri S (2011) Autonomous deployment of heterogeneous mobile sensors. IEEE T Mobile Comput 10(6):753–766

  18. Nguyen TG, So-In C, Nguyen NG (2017) Barrier coverage deployment algorithms for mobile sensor networks. J Internet Technol 8(7):1689–1699

  19. Wang G, Cao G, La Porta T (2006) Movement-assisted sensor deployment. IEEE T Mobile Comput 5(6):640–652

  20. Zou Y, Chakrabarty K (2003) Sensor deployment and target localization based on virtual forces. IEEE INFOCOM 23rd Annual Joint Conf of the IEEE Comp and Commun Societies 1293–1303

  21. Mahboubi H, Moezzi K, Aghdam AG, Sayrafian-Pour K, Marbukh V (2014) Distributed deployment algorithms for improved coverage in a network of wireless mobile sensors. IEEE T Ind Inform 10(1):163–174

  22. Senouci MR, Mellouk A, Assnoune K (2014) Localized movement-assisted sensor deployment algorithm for hole detection and healing. IEEE T Parall Distr 25(5):1267–1277

  23. Ghosh A (2004) Estimating coverage holes and enhancing coverage in mixed sensor networks. Proc of the IEEE Int Conf on Local Comp Netw 68–76

  24. Fang Q, Gao J, Guibas LJ (2006) Locating and bypassing holes in sensor networks. Mobile Netw Appl 11(2):187–200

  25. Wang G, Cao G, Berman P, Porta TFL (2007) Bidding protocols for deploying mobile sensors. IEEE T Mobile Comput 6(5):515–528

  26. Ma HC, Sahoo PK, Chen YW (2011) Computational geometry based distributed coverage hole detection protocol for the wireless sensor networks. J Netw Comput Appl 34(2011):1743–1756

    Article  Google Scholar 

  27. Li W, Zhang W (2015) Coverage hole and boundary nodes detection in wireless sensor networks. J Netw Comp Appl 48:35–43

    Article  Google Scholar 

  28. Li W, Wu Y (2016) Tree-based coverage hole detection and healing method in wireless sensor networks. Comput Netw 103:33–43

    Article  Google Scholar 

  29. Wang Y, Wu S, Gao X, Wu F, Chen G (2017) Minimizing mobile sensor movements to form a line Kcoverage. Peer Peer Netw Appl 10(4):1063–1078

  30. Nguyen TG, So-In C, Nguyen NG (2018) Distributed deployment algorithm for barrier coverage in mobile sensor networks. IEEE Access 6:21042–21052

  31. Yu X, Liu N, Huang W, et al. (2013) A node deployment algorithm based on Van Der Waals force in wireless sensor networks. Inter J of Distr Sensor Netw 1–8

  32. Yoon Y, Kim YH (2013) An efficient genetic algorithm for maximum coverage deployment in wireless sensor networks. IEEE T Cybernetics 43(5):1473–1483

  33. Mahboubi H, Moezzi K, Aghdam AG, Sayrafian-Pour K (2014) Distributed deployment algorithms for efficient coverage in a network of mobile sensors with nonidentical sensing capabilities. IEEE Trans Veh Technol 63(8):3998–4016

    Article  MATH  Google Scholar 

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

  35. MICAz.: http://www.memsic.com/userfiles/files/Datasheets/WSN/micaz_datasheet-t.pdf

  36. Silvestri S, Goss K (2017) MobiBar: an autonomous deployment algorithm for barrier coverage with mobile sensors. Ad Hoc Netw 54:111–129

    Article  Google Scholar 

  37. Locateli M, Raber U (2002) Packing equal circles in a square: a deterministic global optimization approach. Discret Appl Math 122:139–166

    Article  MathSciNet  MATH  Google Scholar 

  38. Chakrabarty K, Iyengar SS, Qi H, Cho E (2002) Grid coverage for surveillance and target location in distributed sensor networks. IEEE T Comput 51:1448–1453

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

  40. Li X, Calinescu G, Wan P, Wang Y (2003) Localized Delaunay triangulation with applications in wireless ad hoc networks. IEEE T Parall Distr 14(10):1035–1047

Download references

Acknowledgments

This work was supported by grants from Research and Academic Affairs Promotion Fund, Faculty of Science, Khon Kaen University (RAAPF), Fiscal year 2017 and Department of Computer Science, Faculty of Science, Khon Kaen University.

Author information

Authors and Affiliations

  1. Applied Network Technology (ANT) Laboratory, Department of Computer Science, Faculty of Science, Khon Kaen University, Khon Kaen, Thailand

    Chakchai So-In

  2. Faculty of Information Technology, Duy Tan University, Da Nang, Vietnam

    Tri Gia Nguyen

  3. Graduate School, Duy Tan University, Da Nang, Vietnam

    Nhu Gia Nguyen

Authors
  1. Chakchai So-In
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tri Gia Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nhu Gia Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tri Gia Nguyen.

Additional information

This article is part of the Topical Collection: Special Issue on Network Coverage

Guest Editors: Shibo He, Dong-Hoon Shin, and Yuanchao Shu

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

So-In, C., Nguyen, T.G. & Nguyen, N.G. An efficient coverage hole-healing algorithm for area-coverage improvements in mobile sensor networks. Peer-to-Peer Netw. Appl. 12, 541–552 (2019). https://doi.org/10.1007/s12083-018-0675-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-018-0675-8

Keywords

Search

Navigation