Computing best coverage path in the presence of obstacles in a sensor field

Authors:
Senjuti Basu Roy;Gautam Das;Sajal Das
Affiliations:
Department of Computer Sc and Engineering, University of Texas At Arlington, Arlington, TX;Department of Computer Sc and Engineering, University of Texas At Arlington, Arlington, TX;Department of Computer Sc and Engineering, University of Texas At Arlington, Arlington, TX
Venue:
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Year:
2007

Citing 11
Cited 2

Art gallery theorems and algorithms

Art gallery theorems and algorithms
Constrained Delaunay triangulations

SCG '87 Proceedings of the third annual symposium on Computational geometry
Voronoi diagrams with barriers and the shortest diagonal problem

Information Processing Letters
Introduction to algorithms

Introduction to algorithms
An output-sensitive algorithm for computing visibility

SIAM Journal on Computing
On the Peeper's Voronoi diagram

ACM SIGACT News
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Finding constrained and weighted Voronoi diagrams in the plane

Computational Geometry: Theory and Applications
Exposure in wireless Ad-Hoc sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Worst and Best-Case Coverage in Sensor Networks

IEEE Transactions on Mobile Computing
Coverage in wireless ad hoc sensor networks

IEEE Transactions on Computers

Review: Coverage and connectivity issues in wireless sensor networks: A survey

Pervasive and Mobile Computing
Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line segment obstacles and n point sensors on the plane. For any path between s to t, p is the least protected point along the path such that the Euclidean distance between p and its closest sensor is maximum. This distance (the path's cover value) is minimum for a BCP(s, t). We present two algorithmic results. For opaque obstacles, i.e., which obstruct paths and block sensing capabilities of sensors, computation of BCP(s, t) takes O((m2n2 + n4) log(mn + n2)) time and O(m2n2 +n4) space. For transparent obstacles, i.e., which only obstruct paths, but allows sensing, computation of BCP(s, t) takes O(nm2 + n3) time and O(m2 + n2) space. We believe, this is one of the first efforts to study the presence of obstacles in coverage problems in sensor networks.