The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Designing localized algorithms for barrier coverage
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Reliable density estimates for coverage and connectivity in thin strips of finite length
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Barrier coverage with wireless sensors
Wireless Networks
Localized sensor self-deployment with coverage guarantee
ACM SIGMOBILE Mobile Computing and Communications Review
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Optimal movement of mobile sensors for barrier coverage of a planar region
Theoretical Computer Science
On minimizing the sum ofensor movements for barrier coverage of a line segment
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
| Hi-index | 0.00 |
We consider the problem of monitoring the Euclidean plane using rotating sensors with detection sectors and beam sensors. We assume that intruders can appear anywhere at any time and move arbitrarily fast, and may have full knowledge of the sensor network. We require that such intruders be detected within a finite amount of time. We give an optimal network for this problem consisting of a combination of rotating sensors and beam sensors that uses the minimum number of both types of sensors. We show a trade-off between the density of beam sensors needed and the angle of the detection sector of the rotating sensors. Secondly, we give a family of sensor networks using only rotating sensors for the same problem, that demonstrate a trade-off between the detection time and the density of rotating sensors used. We show that the density of rotating sensors required in this case can be significantly reduced by increasing the width of detection sectors. Finally, we show that our results on the infinite plane can be used to derive sensor networks that monitor some finite regions using the same asymptotic density of sensors as in the infinite plane case.