TY - GEN
T1 - Connectivity-based distributed coverage hole detection in wireless sensor networks
AU - Yan, Feng
AU - Martins, Philippe
AU - Decreusefond, Laurent
PY - 2011/12/1
Y1 - 2011/12/1
N2 - Coverage is considered as an important measure of quality of service provided by a wireless sensor network (WSN). Yet, coverage holes may appear in the target field due to random deployment, depletion of sensor power or sensor destruction. Discovering the boundaries of coverage holes is important for patching the sensor network. In this paper, we adopt two types of simplicial complexes called Čech complex and Rips complex to capture coverage holes and classify coverage holes to be triangular and non-triangular. A distributed algorithm with only connectivity information is proposed for non-triangular holes detection. Some hole boundary nodes are found first and some of them initiate the process to detect coverage holes. Simulation results show that the area percentage of triangular holes is always below 0.03% when the ratio between communication radius and sensing radius of a sensor is two. It is also shown that our algorithm can discover most non-triangular coverage holes.
AB - Coverage is considered as an important measure of quality of service provided by a wireless sensor network (WSN). Yet, coverage holes may appear in the target field due to random deployment, depletion of sensor power or sensor destruction. Discovering the boundaries of coverage holes is important for patching the sensor network. In this paper, we adopt two types of simplicial complexes called Čech complex and Rips complex to capture coverage holes and classify coverage holes to be triangular and non-triangular. A distributed algorithm with only connectivity information is proposed for non-triangular holes detection. Some hole boundary nodes are found first and some of them initiate the process to detect coverage holes. Simulation results show that the area percentage of triangular holes is always below 0.03% when the ratio between communication radius and sensing radius of a sensor is two. It is also shown that our algorithm can discover most non-triangular coverage holes.
UR - https://www.scopus.com/pages/publications/84857202626
U2 - 10.1109/GLOCOM.2011.6134128
DO - 10.1109/GLOCOM.2011.6134128
M3 - Conference contribution
AN - SCOPUS:84857202626
SN - 9781424492688
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
T2 - 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Y2 - 5 December 2011 through 9 December 2011
ER -