Power diagrams: properties, algorithms and applications
SIAM Journal on Computing
An improved algorithm for constructing kth-order voronoi diagrams
IEEE Transactions on Computers
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
The overlay of lower envelopes in three dimensions and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Two-Dimensional Voronoi Diagrams in the Lp-Metric
Journal of the ACM (JACM)
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
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Data-centric storage in sensornets with GHT, a geographic hash table
Mobile Networks and Applications
Habitat monitoring with sensor networks
Communications of the ACM - Wireless sensor networks
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
Interference-constrained wireless coverage in a protocol model
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Proceedings of the 15th annual international conference on Mobile computing and networking
Genetic coverage verification without location information using dimension reduction
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Analysis of higher order Voronoi diagram for fuzzy information coverage
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Solving the constrained coverage problem
Applied Soft Computing
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
IEEE/ACM Transactions on Networking (TON)
A GIS based wireless sensor network coverage estimation and optimization: a voronoi approach
Transactions on Computational Science XIV
Voronoi tessellation based rapid coverage decision algorithm for wireless sensor networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Generic coverage verification without location information using dimension reduction
IEEE/ACM Transactions on Networking (TON)
A Grid-Based Hole Detection Scheme in WSNs
International Journal of Distributed Systems and Technologies
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such networks, namely the coverage problem, in which we would like to determine whether a region of interest is sufficiently covered by a given set of sensors. This problem is motivated by monitoring applications in sensor networks, as well as robustness concerns and protocol requirements. We show that the coverage problem and some of its variants can be treated in a unified manner using suitable generalizations of the Voronoi diagram. As a result, we are able to give algorithms that have better runtimes than those proposed in previous works (see, e.g., [5, 6]). Our approach also yields efficient algorithms for coverage problems where the sensing region of a sensor is an ellipse or an Lp–ball, where p≥1.