Effect of the number of participating nodes on recovery of WSN coverage holes
Coverage holes (CHs) due to the correlated node failures, if not appropriately addressed in a timely manner, not only disrupt network's operation but also can compromise its integrity. In the absence of centralised control, distributed node relocation can be an effective solution to recover CHs. Relocation algorithms that mainly applied to all nodes to address networks' coverage and unbalanced deployments problems, are not efficient as participating nodes beyond a certain distance and depth from the CHs do not significantly contribute to recovery of CHs. Here, the effects of the number of participating nodes and movement iterations on recovery of CHs are examined in two Voronoi-based and one force-based node relocation algorithms.