Authors: Xiaoyun Li, David K. Hunter
Addresses: Complex and Adaptive Systems Laboratory, University College Dublin, Dublin 4, Ireland. ' School of Computer Science and Electronic Engineering, University of Essex, Colchester, CO4 3SQ, UK
Abstract: This paper shows how a distributed algorithm, derived and justified through computational geometry, can detect and recover holes in the coverage provided by wireless sensor networks. Computational geometry is used to define conditions for the existence of holes in sensor coverage and based on these conditions, it is used to generate new distributed algorithms to detect and recover coverage holes. The algorithm does not require coordinates or location information and requires only minimal connectivity information. Most holes can be detected with very low probability of error and simulation results suggest that redundant nodes are selected efficiently for activation when recovering the hole. Unlike existing proposals, the complexity of the algorithms described here does not depend on the overall size of the network and they do not require flooding, with its associated high level of traffic.
Keywords: wireless sensor networks; WSNs; computational geometry; coordinate-free; hole detection; self-healing; network protocols; signalling; received signal strength indication; simulation; wireless networks; sensor coverage.
International Journal of Sensor Networks, 2009 Vol.5 No.3, pp.153 - 163
Available online: 08 Jun 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article