Abstract
Wireless sensor network coverage completeness is an important Quality of Service measure. It is frequently assumed that events occurring in the sensor field will always be detected. However, this is not necessary the case, particularly if there are holes in the sensor network coverage. This paper introduces a novel method for detection and relative localization of sensor network coverage holes in coordinate-free networks assuming availability of a network communication graph. We identify sensor nodes that bound coverage holes, called “hole boundary nodes”, by processing information embedded in a communication graph, which is non-planar in general. We create a hole-equivalent planar graph preserving a number and position of holes. Finally, we build a planar simplicial complex, called maximal simplicial complex, which contains the information regarding coverage holes. The proposed method is applicable for both coordinate-available and coordinate-free networks. Two implementation strategies for hole detection are provided, and they are each analyzed to compare runtime and accuracy. Simulation results show effectiveness of the hole detection algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
