Skip to main content
SpringerLink
Log in

Connectivity Based k-Coverage Hole Detection in Wireless Sensor Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

A connectivity based k-coverage hole detection algorithm is proposed in this paper. We adopt Rips complex in homology theory to model a wireless sensor network (WSN). We firstly present a simplicial complex reduction algorithm to simplify the network topology by vertex and edge deletion, while keeping the homology intact. Then a connectivity-based algorithm is proposed for discovering boundary cycles of non-triangular k-coverage holes. The algorithm consists of two parts, one part is 1-coverage hole detection and the other part is coverage degree reduction. In the 1-coverage hole detection part, boundary cycles of 1-coverage holes are found. In the coverage degree reduction part, an independent covering subset of nodes for the covered region is found and these nodes are set to dormant state to decrease the coverage degree of the target region by one. The k-coverage hole detection algorithm is an iterative process of the two parts. Computation complexity of the algorithm is analyzed and simulation results show that more than 95% of non-triangular k-coverage holes can be accurately detected by our algorithm.

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

Similar content being viewed by others

References

  1. Meguerdichian S, Koushanfar F, Potkonjak M, Srivastava MB (2001) Coverage problems in wireless ad-hoc sensor networks. In: Proc. IEEE INFOCOM 2001, pp 1380–1387

  2. 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(5):1743–1756

    Article  Google Scholar 

  3. Qiu C, Shen H, Chen K (2018) An energy-efficient and distributed cooperation mechanism for k-coverage hole detection and healing in WSNs. IEEE Trans Mob Comput 17(6):1247–1259

    Article  Google Scholar 

  4. Dai G, Chen L, Zhou B, Xu P (2015) Coverage hole detection agorithm based on Voronoi diagram in wireless sensor network. J Comput Appl 35(3):620–623

    Google Scholar 

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

    Article  Google Scholar 

  6. Niculescu D (2004) Positioning in ad hoc sensor networks. IEEE Netw 18(4):24–29

    Article  Google Scholar 

  7. Bejerano Y (2008) Simple and efficient k-coverage verification without location information. In: Proc. IEEE INFOCOM 2008, pp 897–905

  8. Qiu C, Shen H (2014) A Delaunay-based coordinate-free mechanism for full coverage in wireless sensor networks. IEEE Trans Parallel Distrib Syst 25(4):828–839

    Article  Google Scholar 

  9. Zhang C, Zhang Y, Fang Y (2009) Localized algorithms for coverage boundary detection in wireless sensor networks. Wirel Netw 15(1):3–20

    Article  Google Scholar 

  10. Kasbekar GS, Bejerano Y, Sarkar S (2012) Generic coverage verification without location information using dimension reduction. IEEE/ACM Trans Network 20(6):1991–2004

    Article  Google Scholar 

  11. Ghrist R, Muhammad A (2005) Coverage and hole-detection in sensor networks via homology. In: Proc. Fourth International symposium on information processing in sensor networks, 2005, pp 254–260

  12. Huang C, Tseng Y (2003) The coverage problem in a wireless sensor network. In: Proc. 2nd ACM international conference on wireless sensor networks and applications, 2003, pp 115–121

  13. Tong B, Tavanapong W (2006) On discovering sensing coverage holes in large-scale sensor networks. Iowa State University, Technical Report, TR 06–03

  14. Yan F, Vergne A, Martins P, Decreusefond L (2015) Homology-based distributed coverage hole detection in wireless sensor networks. IEEE/ACM Trans Network 23(6):1705–1718

    Article  Google Scholar 

  15. Tahbaz-Salehi A, Jadbabaie A (2010) Distributed coverage verification in sensor networks without location information. IEEE Trans Autom Control 55(8):1837–1849

    Article  MathSciNet  Google Scholar 

  16. Campos-Nanez E, Garcia A, Li C (2008) A game-theoretic approach to efficient power management in sensor networks. Oper Res 56(3):552–561

    Article  MathSciNet  Google Scholar 

  17. Dlotko P, Ghrist R, Juda M, Mrozek M (2012) Distributed computation of coverage in sensor networks by homological methods. Applic Algebra Eng Commun Comput 23(1–2):29–58

    Article  MathSciNet  Google Scholar 

  18. Vergne A, Decreusefond L, Martins P (2013) Reduction algorithm for simplicial complexes. In: Proc. IEEE INFOCOM 2013, pp 475–479

  19. Cao Z, Yan F, Deng S, Xia W, Shen L, Li Z (2017) A topology control algorithm based on homology theory in software-defined sensor networks. In: Proc. IEEE/CIC ICCC 2017, pp 1–6

  20. Dong D, Liu Y, Liu K, Liao X (2010) Distributed coverage in wireless ad hoc and sensor networks by topological graph approaches. In: Proc. IEEE ICDCS 2010, pp 106–15

  21. Barmak JA (2011) Algebraic topology of finite topological spaces and applications. Lect Notes Math-Springer-Verlag 2032:57–68

    MathSciNet  MATH  Google Scholar 

  22. Barmak JA, Minian EG (2012) Strong homotopy types, nerves and collapses. Discret Comput Geom 47 (2):301–328

    Article  MathSciNet  Google Scholar 

  23. Wilkerson AC, Moore TJ, Swami A, Krim H (2013) Simplifying the homology of networks via strong collapses. In: Proc. IEEE ICASSP 2013, pp 5258–5262

  24. Wilkerson AC, Chintakunta H, Krim H, Moore TJ, Swami A (2013) A distributed collapse of a network’s dimensionality. In: Proc. IEEE GlobalSIP 2013, pp 595–598

  25. Ma W, Yan F, Zuo X, Hu J, Xia W, Shen L (2018) Simplicial complex reduction algorithm for simplifying WSN’s topology. In: Proc. ADHOCNETS 2018, pp 25–35

Download references

Acknowledgments

This work is supported in part by the National Natural Science Foundation of China (No. 61601122 and No. 61871370), the Natural Science Foundation of Shanghai, China under grant No. 18ZR1437500, the Hundred Talent Program of Chinese Academy of Sciences under grant No. Y86BRA1001, the Fundamental Research Funds for the Central Universities, and the Key Research & Development Plan of Jiangsu Province (Grant No. BE2018108). The corresponding author is Feng Yan.

Author information

Authors and Affiliations

  1. National Mobile Communications Research Laboratory, Southeast University, Nanjing, 210096, China

    Feng Yan, Wenyu Ma, Weiwei Xia & Lianfeng Shen

  2. Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai, China

    Fei Shen

Authors
  1. Feng Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenyu Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fei Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Weiwei Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Lianfeng Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Feng Yan.

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

Yan, F., Ma, W., Shen, F. et al. Connectivity Based k-Coverage Hole Detection in Wireless Sensor Networks. Mobile Netw Appl 25, 783–793 (2020). https://doi.org/10.1007/s11036-019-01301-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-019-01301-y

Keywords

Search

Navigation