A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
GS3: scalable self-configuration and self-healing in wireless networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Coverage Issue in Sensor Networks with Adjustable Ranges
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
The holes problem in wireless sensor networks: a survey
ACM SIGMOBILE Mobile Computing and Communications Review
Hole detection or: "how much geometry hides in connectivity?"
Proceedings of the twenty-second annual symposium on Computational geometry
Coverage and hole-detection in sensor networks via homology
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
Probabilistic model of triangulation
Proceedings of the 2008 ACM symposium on Solid and physical modeling
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
RETRACTED: Impacts of sensor node distributions on coverage in sensor networks
Journal of Parallel and Distributed Computing
A hybrid optimisation algorithm for coverage enhancement in 3D directional sensor networks
International Journal of Sensor Networks
Hi-index | 0.00 |
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.