Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Computational Geometry in C
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Minimum-cost coverage of point sets by disks
Proceedings of the twenty-second annual symposium on Computational geometry
Coverage by randomly deployed wireless sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
The coverage problem in a wireless sensor network
Mobile Networks and Applications
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
On k-coverage in a mostly sleeping sensor network
Wireless Networks
Optimal k-support coverage paths in wireless sensor networks
PERCOM '09 Proceedings of the 2009 IEEE International Conference on Pervasive Computing and Communications
Covering points by unit disks of fixed location
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
| Hi-index | 0.00 |
In this paper, we study k-road-coverage problems in wireless sensor networks (WSNs). Assume there is a 2-dimensional area Ω with a given road map **image** = (V,E) where E contains all road segments and V consists of all intersection points on Ω. The first question we study is about ‘sensor deployment’, i.e., how to deploy a minimum number of sensor nodes on Ω such that each path (each road segment) on **image** is k-covered when all sensor nodes have the same sensing range. When sensors can only be deployed in a set of discrete locations, we propose an efficient method with the approximation ratio 6 + ϵ for the special case where k = 1 and O(k) generally. If sensors can be deployed in arbitrary locations, we propose an efficient method with the approximation ratio 24 + ϵ when k = 1 and O(k) generally. The second question we study is about ‘path query’, i.e., how to find the k-covered path or k-support path connecting any given source/destination pair of points on the road map **image**. Basically, given any source/destination pair of points S and D, we present two algorithms which can efficiently find a k-covered path connecting S and D and a k-supported path connecting S and D, respectively. Copyright © 2010 John Wiley & Sons, Ltd.