Modified Coverage Hole Detection Algorithm for Distributed WSNs

Abstract — Wireless sensor networks (WSNs) are spatially distributed sensors that find wide applications in various fields such as environmental control, Medicine and Health care, Military surveillance etc. The sensing and communication within the network should be effective for such applications. Holes are the voids created in the network when accidental death of nodes is caused due to technical or improper coverage. The detection of the holes becomes essential after the random deployment. The main objective of the work is to detect the coverage holes using computational geometry approach which uses co-ordinates of the sensors and to implement it in the hardware. The communication range of a node is considered to be equal to its sensing range. The protocol is designed for irregular domain which is a real time scenario and takes the help of two-hop neighbors ’ of a node to detect the hole around it. The proposed system also allows only few nodes to initiate the detection algorithm so that the energy and time is conserved. Index Terms — Coverage holes, computational geometry approach, communication range, sensing range, two-hop neighbors