Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Exposure in wireless sensor networks: theory and practical solutions
Wireless Networks
Sensor deployment strategy for detection of targets traversing a region
Mobile Networks and Applications
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Determining approximate shortest paths on weighted polyhedral surfaces
Journal of the ACM (JACM)
Dynamic coverage in ad-hoc sensor networks
Mobile Networks and Applications
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
Approximation algorithms for computing minimum exposure paths in a sensor field
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all points x of p of the sensibility (the strength of the signal coming from x) times the element of path length. The minimum exposure path (MEP) problem is, given a pair of points x and y inside a sensor field, find a path between x and y of a minimum exposure. In this paper we introduce the first rigorous treatment of the problem, designing an approximation algorithm for the MEP problem with guaranteed performance characteristics. Given a convex polygon P of size n with O(n) sensors inside it and any real number Ɛ 0, our algorithm finds a path in P whose exposure is within an 1 + Ɛ factor of the exposure of the MEP, in time O(n/Ɛ2ψ), where ψ is a topological characteristic of the field. We also describe a framework for a faster implementation of our algorithm, which reduces the time by a factor of approximately Θ(1/Ɛ), by keeping the same approximation ratio.