Title :
Distributed Coordinate-Free Hole Recovery
Author :
Li, Xiaoyun ; Hunter, David K.
Author_Institution :
Dept. of Comput. & Electron. Syst., Univ. of Essex, Colchester
Abstract :
This paper proposes a distributed coordinate-free non-triangulated hole recovery algorithm for sensor networks called 3MeSH-DR (triangular mesh distributed hole recovery), which recovers coverage holes with the minimum number of redundant nodes using only connectivity information. If this hole cannot be triangulated by edges between pairs of nodes closer that 2 units from each other, the boundary of the hole is detected accurately with the minimum number of edges. It is shown to be error-free by thousands of simulations with different random topologies and node densities. Because of its high reliability and modest requirements for computing power and memory, 3MeSH-DR is an efficient solution for hole detection and recovery without location information in real sensor network applications.
Keywords :
graph theory; wireless sensor networks; 3MeSH-DR; distributed coordinate-free hole recovery; hole detection; memory computing; nontriangulated hole recovery algorithm; power computing; sensor networks; triangular mesh distributed hole recovery; Communications Society; Computer networks; Conferences; Detection algorithms; Distributed computing; Network topology; Nominations and elections; Partitioning algorithms; Peer to peer computing; Wireless sensor networks;
Conference_Titel :
Communications Workshops, 2008. ICC Workshops '08. IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-2052-0
Electronic_ISBN :
978-1-4244-2052-0
DOI :
10.1109/ICCW.2008.41