Weaving a proper net to catch large objects in wireless sensor networks
- 15 April 2010
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 9 (4) , 1360-1369
Abstract
Wireless sensor networks consist of a large number of sensors and have been broadly used for intrusion detection in surveillance systems. To guarantee detection quality, such networks are usually over-engineered, i.e., more than required sensors are deployed and remain active in order to cover each point in the monitored field with a high probability at any time instance. Existing sensor scheduling schemes based on the point coverage model tightly weave a sensor "net" that is unnecessarily dense. Intuitively, when the size and the shape of intrusion objects are considered, any net with holes no smaller than the size of the intrusion object would work fine. With this design philosophy in mind, we build a new mathematical model to investigate the impact of size and shape of intrusion objects on network configuration. We derive analytical results that provide practitioners with insights on how to weave an effective sensor "net" for intrusion object detection with minimum number of active sensors.Keywords
This publication has 13 references indexed in Scilit:
- Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor NetworksIEEE Transactions on Computers, 2009
- Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networksComputer Networks, 2009
- Intrusion Objects with Shapes under Randomized Scheduling Algorithm in Sensor Networks2008
- Asymptotic Coverage and Detection in Randomized Scheduling Algorithm in Wireless Sensor Networks2007
- Modeling Detection Metrics in Randomized Scheduling Algorithm in Wireless Sensor Networks2007
- Design and Analysis of Sensing Scheduling Algorithms under Partial Coverage for Object Detection in Sensor NetworksIEEE Transactions on Parallel and Distributed Systems, 2007
- Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networksIEEE Transactions on Parallel and Distributed Systems, 2006
- Optimization: Insights and Applications2005
- Lightweight Deployment-Aware Scheduling for Wireless Sensor NetworksMobile Networks and Applications, 2005
- Coverage problems in wireless ad-hoc sensor networks2002