Distributed hole recovery process using connectivity information

摘要

A distributed coverage hole recovery process using connectivity information is proposed for wireless sensor networks and other wireless networks. A link is said to exist between two nodes which are sufficiently close. After a un-triangulated hole is detected enclosing by links between N (N>3) active boundary nodes, the distributed hole recovery process activates one or two redundant nodes to recover the hole at each iteration. This process is performed iteratively by each of the active boundary nodes adjacent to the hole independently without any central controller. It requires 2 hops connectivity or neighbor information from each boundary node adjacent to the hole. After each hole recovery iteration, the hole is reduced in size or split into two smaller holes. Then the hole recovery process repeats until the hole is recovered or detected as unrecoverable.