On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 584-593
- https://doi.org/10.1007/11600930_58
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Habitat monitoring with sensor networksCommunications of the ACM, 2004
- The coverage problem in a wireless sensor networkPublished by Association for Computing Machinery (ACM) ,2003
- Data-Centric Storage in Sensornets with GHT, a Geographic Hash TableMobile Networks and Applications, 2003
- Coverage problems in wireless ad-hoc sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The overlay of lower envelopes in three dimensions and its applicationsPublished by Association for Computing Machinery (ACM) ,1995
- A linear-time algorithm for computing the voronoi diagram of a convex polygonDiscrete & Computational Geometry, 1989
- An Improved Algorithm for Constructing kth-Order Voronoi DiagramsIEEE Transactions on Computers, 1987
- Power Diagrams: Properties, Algorithms and ApplicationsSIAM Journal on Computing, 1987
- On k-Nearest Neighbor Voronoi Diagrams in the PlaneIEEE Transactions on Computers, 1982
- Two-Dimensional Voronoi Diagrams in theLp-MetricJournal of the ACM, 1980