A Greedy Approach for Coverage Hole Detection and Restoration in Wireless Sensor Networks

Wireless sensor network contains several small sensor nodes that are designed to work autonomously. Coverage preservation is an underlying requirement to efficiently deliver certain services in WSNs. During network operation, some sensor nodes die because of several reasons like energy exhaustion, link failure, node failure etc. We refer it as coverage hole problem of WSNs. In this paper, a new decentralized, node based, localized algorithm called Coverage Hole Detection and Restoration is proposed for detection as well as restoration of coverage holes. Our proposed algorithm is expected to outperform existing algorithms on the parameters of energy and time consumption for convex and non-convex holes.