Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Communications of the ACM
Wireless integrated network sensors
Communications of the ACM
Embedded computation meets the World Wide Web
Communications of the ACM
Embedding robots into the Internet
Communications of the ACM
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Distributed Algorithms
Delay of intrusion detection in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
On the robustness of grid-based deployment in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
A Delaunay Triangulation Based Method for Wireless Sensor Network Deployment
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
On computing conditional fault-tolerance measures for k-covered wireless sensor networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Distributed direction-based localization in wireless sensor networks
Computer Communications
IEEE Transactions on Parallel and Distributed Systems
Towards characterizing the effectiveness of random mobility against actuation attacks
Computer Communications
A Delaunay Triangulation based method for wireless sensor network deployment
Computer Communications
Wireless Personal Communications: An International Journal
Probabilistic model of triangulation
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Challenging benchmark for location discovery in ad hoc networks: foundations and applications
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
An approach to finding weak regions for wireless sensor networks with arbitrary sensing areas
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Optimizing coverage in a K-covered and connected sensor network using genetic algorithms
EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
An Algorithm of Coverage Control for Wireless Sensor Networks in 3D Underwater Surveillance Systems
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Fault tolerance measures for large-scale wireless sensor networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Path coverage by a sensor field: The nonhomogeneous case
ACM Transactions on Sensor Networks (TOSN)
Improving mobile target detection on randomly deployed sensor networks
International Journal of Sensor Networks
Event Detection Using Unmanned Aerial Vehicles: Ordered versus Self-organized Search
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
Shadowing effects and edge effect on sensing coverage for wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
An underwater sensor allocation scheme for a range dependent environment
Computer Networks: The International Journal of Computer and Telecommunications Networking
Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours
Computer Networks: The International Journal of Computer and Telecommunications Networking
Coverage, connectivity, and fault tolerance measures of wireless sensor networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Energy efficient intrusion detection in camera sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Clustering-based minimum energy wireless m-connected k-covered sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
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
Fundamenta Informaticae - Intelligent Data Analysis in Granular Computing
Coverage properties of clustered wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Survey on contemporary remote surveillance systems for public safety
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Arbitrary obstacles constrained full coverage in wireless sensor networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Pervasive and Mobile Computing
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
A sensor deployment approach using glowworm swarm optimization algorithm in wireless sensor networks
Expert Systems with Applications: An International Journal
On coverage issues in directional sensor networks: A survey
Ad Hoc Networks
Evaluating coverage quality through best covered pathes in wireless sensor networks
Proceedings of the Nineteenth International Workshop on Quality of Service
The euclidean bottleneck steiner path problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
Maximum lifetime coverage preserving scheduling algorithms in sensor networks
Journal of Global Optimization
A GIS based wireless sensor network coverage estimation and optimization: a voronoi approach
Transactions on Computational Science XIV
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
Finding the quality of line coverage of a sensor network
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Strong barrier coverage in directional sensor networks
Computer Communications
On the problem of k-coverage in mission-oriented mobile wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field
Journal of Discrete Algorithms
Design of wireless sensor networks for mobile target detection
IEEE/ACM Transactions on Networking (TON)
Computing best coverage path in the presence of obstacles in a sensor field
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A practical coverage algorithm for wireless sensor networks in real terrain surface
International Journal of Wireless and Mobile Computing
Power constrained sensor sample selection for improved form factor and lifetime in localized BANs
Proceedings of the conference on Wireless Health
In-Network Computations of Machine-to-Machine Communications for Wireless Robotics
Wireless Personal Communications: An International Journal
Adaptive k-coverage contour evaluation and deployment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
ACM Transactions on Sensor Networks (TOSN)
Collaborative path planning for event search and exploration in mixed sensor networks
International Journal of Robotics Research
Optimal partitioning for multi-vehicle systems using quadratic performance criteria
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
Wireless ad hoc sensor networks have recently emerged as a premier research topic. They have great long-term economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Here, we address one of the fundamental problems, namely, coverage. Sensor coverage, in general, answers the questions about the quality of service (surveillance) that can be provided by a particular sensor network. We briefly discuss the definition of the coverage problem from several points of view and formally define the worst and best-case coverage in a sensor network. By combining computational geometry and graph theoretic techniques, specifically the Voronoi diagram and graph search algorithms, we establish the main highlight of the paper驴an optimal polynomial time worst and average case algorithm for coverage calculation for homogeneous isotropic sensors. We also present several experimental results and analyze potential applications, such as using best and worst-case coverage information as heuristics to deploy sensors to improve coverage.