A study on the weak barrier coverage problem in wireless sensor networks

Authors:
Lei Li;Baoxian Zhang;Xiaojun Shen;Jun Zheng;Zheng Yao
Affiliations:
Key Lab of Wireless Sensor Networks and Communications, Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai 200050, China;Research Center of Ubiquitous Sensor Networks, Graduate University of Chinese Academy of Sciences, Beijing 100049, China;School of Computing and Engineering, University of Missouri, Kansas City, MO 64110, USA;National Mobile Communications Research Laboratory, Southeast University, Nanjing, Jiangsu 210096, China;Research Center of Ubiquitous Sensor Networks, Graduate University of Chinese Academy of Sciences, Beijing 100049, China
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2011

Citing 8
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On k-coverage in a mostly sleeping sensor network

Proceedings of the 10th annual international conference on Mobile computing and networking
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
Reliable density estimates for coverage and connectivity in thin strips of finite length

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
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

Anti-intrusion is a typical application of wireless sensor networks (WSNs). It usually requires sensor nodes to be deployed in a long belt region. The coverage problem in this kind of applications is often referred to as barrier coverage, which is classified into weak barrier coverage and strong barrier coverage. A belt region is called weakly k-barrier covered (k=1) if an intruder traveling along any orthogonal crossing path can be detected by at least k sensors. For sensor deployment in a belt service region, an interesting and important question is ''How many sensor nodes should be deployed to achieve weak k-barrier coverage with a given probability?'' In this paper, we study the weak k-barrier coverage problem and attempt to answer this question by analyzing the probability of weak k-barrier coverage. We derive a lower bound for the probability of weak k-barrier coverage with and without considering the border effect, respectively. Moreover, we propose a simple but effective algorithm for accurately determining whether a deployed belt region is weakly k-barrier covered, and if not, what percentage of the region is not weakly k-barrier covered. Simulation results show that the derived lower bound is very close to the actual probability of weak k-barrier coverage, especially when k is small, and the border effect has a big impact on the probability of weak k-barrier coverage.