Sensor placement for effective coverage and surveillance in distributed sensor networks
Authors:
- K. ChakrabartyKCK. Chakrabarty
- 23 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15253511) , 1609-1614
Abstract
We present two algorithms for the efficient placement of sensors in a sensor field. The proposed approach is aimed at optimizing the number of sensors and determining their placement to support distributed sensor networks. The optimization framework is inherently probabilistic due to the uncertainty associated with sensor detections. The proposed algorithms address coverage optimization under the constraints of imprecise detections and terrain properties. These algorithms are targeted at average coverage as well as at maximizing the coverage of the most vulnerable grid points. The issue of preferential coverage of grid points (based on relative measures of security and tactical importance) is also modeled. Experimental results for an example sensor field with obstacles demonstrate the application of our approach.Keywords
This publication has 8 references indexed in Scilit:
- Grid coverage for surveillance and target location in distributed sensor networksIEEE Transactions on Computers, 2002
- Adaptive beacon placement2002
- Coding theory framework for target location in distributed sensor networks2002
- Coverage problems in wireless ad-hoc sensor networks2002
- Mobile Sensor Network Deployment using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem2002
- Communication structure planning for multisensor detection systemsIEE Proceedings - Radar, Sonar and Navigation, 2001
- GPS-less low-cost outdoor localization for very small devicesIEEE Wireless Communications, 2000
- On terrain acquisition by a point robot amidst polyhedral obstaclesIEEE Journal on Robotics and Automation, 1988