Barrier Coverage with Mobile Sensors
Authors:
- Changxiang ShenCSChangxiang Shen
- Weifang ChengWCWeifang Cheng
- Xiangke LiaoXLXiangke Liao
- Shaoliang PengSPShaoliang Peng
- 1 May 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)
- No. 10874089,p. 99-104
Abstract
Barrier coverage, which guarantees that every movement crossing a barrier of sensors will be detected, is known to be an appropriate model of coverage for moving detection and boundary guard. The related problems about barrier coverage with stationary sensors are extensively studied. When sensors are randomly deployed, we require much more sensors to achieve barrier coverage than deterministic deployment. In this paper we study barrier coverage with mobile sensors, in which the sensors can be relocated after deployment, and we are able to utilize much fewer mobile sensors than stationary sensors to achieve barrier coverage with random deployment. We study the energy-efficient relocation problem for barrier coverage, and propose a centralized barrier algorithm, which computes the relocated positions based on knowing the initial positions of all sensors. For practicability and scalability, we further design a distributed barrier algorithm based on our proposed virtual force model. We conduct extensive simulations to study the effectiveness of the proposed algorithms.Keywords
This publication has 6 references indexed in Scilit:
- Local Barrier Coverage in Wireless Sensor NetworksIEEE Transactions on Mobile Computing, 2009
- Designing localized algorithms for barrier coverage2007
- Reliable density estimates for coverage and connectivity in thin strips of finite length2007
- On k-coverage in a mostly sleeping sensor network2004
- The coverage problem in a wireless sensor network2003
- Coverage problems in wireless ad-hoc sensor networks2002