Affiliation:
1. City College New York, New York, NY
Abstract
In this article we analyze the capabilities of various models of sensor networks with the Boolean sensing model for mobile or stationary sensors and targets, under random or optimal placement, independent or globally coordinated search, and stealthy or visible sensors. For each model we give an upper bound for the capabilities under any strategy, and a search strategy which at least asymptotically matches that bound. To ensure comparability of these models, we present them using the same parameters: the sensing radius
r
, sensor placement density λ, as well as the travel distance
l
of each sensor and
d
of the target. By this we obtain a complete analysis of the geometric coverage and detection capabilities of the various models of sensor networks, where we abstract from issues like communication and power management.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications
Reference34 articles.
1. Coverage, Exploration and Deployment by a Mobile Robot and Communication Network
2. Brass P. Moser W. O. J. and Pach J. 2005. Research Problems in Discrete Geometry. Springer. Brass P. Moser W. O. J. and Pach J. 2005. Research Problems in Discrete Geometry. Springer.
3. Cardei M. and Wu J. 2004. Coverage in wireless sensor networks. In Handbook of Sensor Networks M. Ilyas and I. Mahgoub eds. CRC Press Boca Raton FL. Cardei M. and Wu J. 2004. Coverage in wireless sensor networks. In Handbook of Sensor Networks M. Ilyas and I. Mahgoub eds. CRC Press Boca Raton FL.
4. Sensor deployment strategy for target detection
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献