Distributed coverage preserving algorithm with connectivity information

In this paper we propose a new distributed algorithms to detect and recover coverage holes in wireless sensor networks, the algorithm does not require any coordinates or location information, it requires only local connectivity information. This algorithm is derived and justified through graph theory, which can detect most coverage holes and recover the hole by activating necessary redundant nodes (if exist). The complexity of the algorithms doesn´t depend on the overall size of the network.