Remote Holes Detection Algorithms for Wireless Sensor Networks
Kai-Biao Lin, Kuo-Hua Robert Lai, C. Liu · DOAJ (DOAJ: Directory of Open Access Journals) · 2014
This paper develop a practical and energy-efficient distributed algorithm for the detection of coverage holes in a wireless sensor network. It assumes that the location of sensor nodes is available. We do this in two phases. First we want to identify a set of nodes of which encircle a coverage hole. This is done by introducing a concept of mono-covered arc, which represents the circumference of a non-overlapping region of the sensing disc of a sensor node. That is, a coverage hole or insufficient coverage region will be along the right-hand side of these directed mono-covered arcs. Based on this notion, a graph-theoretic distributed algorithm can then be developed to identify every simple boundary and interior hole locally. Furthermore, this graph-theoretic information can also be forwarded to the sink or base station to recognize the geometric characteristics among these coverage holes existing in the network fabric remotely.