Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Wireless integrated network sensors
Communications of the ACM
Embedded computation meets the World Wide Web
Communications of the ACM
Routing with guaranteed delivery in geometric and wireless networks
Handbook of wireless networks and mobile computing
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Worst and Best-Case Coverage in Sensor Networks
IEEE Transactions on Mobile Computing
Maximal breach in wireless sensor networks: geometric characterization and algorithms
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Optimisation problems based on the maximal breach path measure for wireless sensor network coverage
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
Maximal breach in wireless sensor networks: geometric characterization and algorithms
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Coverage is a measure of the quality of surveillance offered by a given network of sensors over the field it protects. Geometric characterization of, and optimization problems pertaining to, a specific measure of coverage - maximal breach - form the subject matter of this paper. We prove lower bound results for maximal breach through its geometric characterization.We define a new measure called average maximal breach and design an optimal algorithm for it. We also show that a relaxed optimization problem for the proposed measure is NP-Hard.