On-supporting energy balanced k-barrier coverage in wireless sensor networks

Authors:
Chih-Yung Chang;Li-Ling Hung;Yu-Chieh Chen;Ming-Hsien Li
Affiliations:
Tamkang University, Taipei, Taiwan, R.O.C.;Aletheia University, Taipei, Taiwan, R.O.C.;Tamkang University, Taipei, Taiwan, R.O.C.;Tamkang University, Taipei, Taiwan, R.O.C.
Venue:
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Year:
2009

Citing 4
Cited 1

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
Measuring and guaranteeing quality of barrier-coverage in 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

Design of wireless sensor networks for mobile target detection

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The k-barrier coverage problem is known as the problem of detecting the intruders by at least k sensors when the intruders moving along the crossing paths from one boundary to another. This paper proposes decentralized algorithms to cope with the k-barrier coverage problem. For a given value k, the proposed algorithms find out the maximum disjoint sets of sensors such that each set of sensors meets the requirement of k-barrier coverage for users. Three mechanisms, called Basic, Backtracking, and Branch, are proposed for constructing as more as possible the disjoint sets of sensors that satisfy the requirement of k-barrier coverage. Performance study reveals that the proposed algorithms achieve near-optimal performance.