Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

3HA: Hybrid Hole Healing Algorithm in a Wireless Sensor Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In wireless sensor networks (WSNs), the appearance of coverage holes over a large target field is mostly possible. Those holes reduce network performance and may affect the network efficiency. Several approaches were proposed to heal coverage holes in WSNs, but they still suffer from some weaknesses. In this paper we suggest a distributed algorithm, named hybrid hole healing algorithm (3HA), to find the minimum effective patching positions to deploy additional nodes to cover the holes. A hole manager node of each hole is responsible for operating the 3HA algorithm which requires two phases. The first phase finds all candidate patching positions using a Voronoi diagram. It takes all Voronoi vertices within the hole as the initial patching positions list. The second phase reduces as much as possible this list based on integer linear programming and on a probabilistic sensor model. The 3HA algorithm repeats the above phases in rounds, until all Voronoi vertices are covered. Simulation results show that our solution offers a high coverage ratio for various forms and sizes of holes and reduces the number of additional sensors when compared to some algorithms like the Perimeter-based, the Delaunay triangulation-based, the Voronoi-based, and the Trees-based coverage hole healing methods.

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
Fig. 11

Similar content being viewed by others

References

  1. Khan, I., Mokhtar, H., & Merabti, H. (2010). An overview of holes in wireless sensor network. In Proceedings of the 11th annual postgraduate symposium on the convergence of telecommunications, networking and broadcasting, Liverpool, UK.

  2. Li, F., Zhang, B., & Zheng, J. (2011). Geographic hole-bypassing forwarding protocol for wireless sensor networks. IET Communications,5(6), 737–744.

    Article  MathSciNet  Google Scholar 

  3. Vieira, M. A. M., Vieira, L. F. M., Ruiz, L. B. R., Lureiro, A. A. F., Fernandes, A. O., & Nogueira, J. M. S. (2003). Scheduling nodes in wireless sensor networks: A Voronoi approach. In 28th annual IEEE international conference on local computer networks. IEEE.

  4. Wu, C. H., Lee, K. C., & Chung, Y. C. (2007). A Delaunay triangulation based method for wireless sensor network deployment. Computer Communications,30, 2744–2752.

    Article  Google Scholar 

  5. Aliouane, L., & Benchaiba, M. (2014). HACH: Healing algorithm of coverage hole in a wireless sensor network. In Proceeding in 8th international conference on next generation mobile applications, services and technologies (pp. 215–220). IEEE.

  6. Kang, Z., Yu, H., & Xiong, Q. (2013). Detection and recovery of coverage holes in wireless sensor networks. Journal of Network and Computer Applications,8(4), 822–828.

    Google Scholar 

  7. Li, Wei. (2014). A novel graphic coverage hole description in wireless sensor networks. IEEE Communications Letters,18(12), 2205–2208.

    Article  Google Scholar 

  8. Li, W., & Wu, Y. (2016). Tree-based coverage hole detection and healing method in wireless sensor networks. Computer Networks Journal,103(3), 33–43.

    Article  Google Scholar 

  9. Yogi, M. K., & Chinthala, V. (2014). A review of coverage improvement approaches of mobile nodes in wireless sensor networks. International Journal of Innovative Research and Studies,3(2), 296–310.

    Google Scholar 

  10. Khelil, A., & Beghdad, R. (2016). ESA: An efficient self-deployment algorithm for coverage in wireless sensor networks. Procedia Computer Science,98, 40–47.

    Article  Google Scholar 

  11. Vikrant, S., Patel, R. B., Bhadauria, H. S., & Prasad, D. (2016). NADS: Neighbor assisted deployment scheme for optimal placement of sensor nodes to achieve blanket coverage in wireless sensor network. Wireless Personal Communications,90(4), 1903–1933.

    Article  Google Scholar 

  12. Wang, G., Guohong, C., & La Porta, T. (2006). Movement assisted sensor deployment. IEEE Transactions on Mobile Computing,5(6), 640–652.

    Article  Google Scholar 

  13. Gupta, M., Krishna, C. R., & Prasad, D. (2014). SEEDS: Scalable energy efficient deployment scheme for homogeneous wireless sensor network. In Proceeding in international conference on issues and challenges in intelligent computing techniques (pp. 416–423). IEEE.

  14. Ajay, K., Vikrant, S., & Prasad, D. (2013). Distributed deployment scheme for homogeneous distribution of randomly deployed mobile sensor nodes in wireless sensor networks. International Journal of Advanced Computer Science and Applications,4(4), 139–146.

    Google Scholar 

  15. Senouci, M. R., Mellouk, A., & Assnoune, K. (2014). Localized movement-assisted sensor deployment algorithm for hole detection and healing. IEEE Transactions on Parallel and Distributed Systems,25(5), 1267–1277.

    Article  Google Scholar 

  16. Neethu, A. J., & Manoj, R. (2015). Hole detection and energy efficient hole healing for wireless sensor networks. International Journal of Advanced Research in Computer Science and Software Engineering,5(5), 1027–1031.

    Google Scholar 

  17. Wang, G., Cao, G., Berman, P., & La Porta, T. F. (2007). Bidding protocols for deploying mobile sensors. IEEE Transactions on Mobile Computing,6(5), 563–576.

    Article  Google Scholar 

  18. Ghosh, A. (2004). Estimating coverage holes and enhancing coverage in mixed sensor networks. In Proceedings of the 29th annual IEEE international conference on local computer networks (ICLCN’04) (pp. 68–76).

  19. Erciyes, K. (2013). Distributed graph algorithm for computer networks, book in computer communications and networks (p. 135). New York: Springer.

    Google Scholar 

  20. Tai-Lin, C., Parameswaran, R., & Kewal, S. (2006). Optimal sensor distribution for maximum exposure in a region with obstacles. In IEEE global telecommunications conference GLOBECOM (pp. 1–5).

  21. Hata, M. (1980). Empirical formula for propagation loss in land mobile radio services. IEEE Transactions on Vehicular Technology,29(3), 317–325.

    Article  Google Scholar 

  22. Sahoo, P. K., Chiang, M. J., & Wu, L. (2016). An efficient distributed coverage hole detection protocol for wireless sensor networks. Sensors,16(3), 1–21.

    Article  Google Scholar 

  23. Land, A. H., & Doig, A. G. (1960). An automatic method of solving discrete programming problems. Econometrica,28, 497–520.

    Article  MathSciNet  Google Scholar 

  24. Khelil, A., & Beghdad, R. (2012). Coverage and connectivity protocol for wireless sensor networks. In Proceedings of IEEE 24th international conference on microelectronics (pp. 1–4) ICM, Algiers, Algeria.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rachid Beghdad.

Additional information

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

Khelil, A., Beghdad, R. & Khelloufi, A. 3HA: Hybrid Hole Healing Algorithm in a Wireless Sensor Networks. Wireless Pers Commun 112, 587–605 (2020). https://doi.org/10.1007/s11277-020-07062-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-020-07062-2

Keywords

Navigation