Strong k-barrier coverage with mobile sensors

Authors:
Dongsong Ban;Jie Jiang;Wei Yang;Wenhua Dou;Huizhan Yi
Affiliations:
National University of Defense Technology, Changsha, Hunan, P.R. China;National University of Defense Technology, Changsha, Hunan, P.R. China;National University of Defense Technology, Changsha, Hunan, P.R. China;National University of Defense Technology, Changsha, Hunan, P.R. China;National University of Defense Technology, Changsha, Hunan, P.R. China
Venue:
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Year:
2010

Citing 5
Cited 0

Barrier coverage with wireless sensors

Proceedings of the 11th annual international conference on Mobile computing and networking
Designing localized algorithms for barrier coverage

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Defending Against Barrier Intrusions with Mobile Sensors

WASA '07 Proceedings of the International Conference on Wireless Algorithms,Systems and Applications
Strong barrier coverage of wireless sensor networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Barrier Coverage with Mobile Sensors

ISPAN '08 Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Barrier coverage is known to be an appropriate model of coverage for movement detection and boundary guard, which is achieved by barriers of sensors. This paper is focused on how to achieve strong k-barrier coverage with mobile sensors energy-efficiently. We first design an approximation algorithm CBGB to achieve strong 1-barrier coverage energy-efficiently, and the performance of CBGB is close to the optimal solution. Then, we propose a Divide-and-Conquer algorithm to achieve strong k-barrier coverage for large sensor networks. Simulations demonstrate the effectiveness of the proposed algorithm for achieving k-barrier coverage.