Chih-Yung Chang
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.
- S. Kumar, T. H. Lai, and A. Arora, "Barrier Coverage with Wireless Sensors," in MobiCom 2005, pp. 284--298, 2005. Google Scholar
Digital Library
- A. Schrijver. "Combinatorial Optimization: Polyhedra and efficiency," Springer, ISBN 978-3-540-44389-6, 2003.Google Scholar
- Changxiang Shen, Weifang Cheng, Xiangke Liao, and Shaoliang Peng, "Barrier Coverage with Mobile Sensors", in ISPAN 2008, pp. 99--104, 2008. Google ScholarDigital Library
- Ai Chen, Ten H. Lai, and Dong Xuan, "Measuring and Guaranteeing Quality of Barrier-Coverage in Wireless Sensor Networks," in ACM MobiHoc, pp. 421--430, 2008. Google ScholarDigital Library
- Ai Chen, Santosh Kumor, and Ten H. Lai, "Designing Localized Algorithms for Barrier Coverage," in ACM MobiCom, pp. 63--74, 2007. Google ScholarDigital Library
Index Terms
- On-supporting energy balanced k-barrier coverage in wireless sensor networks
Recommendations
Minimum k, ω-angle barrier coverage in wireless camera sensor networks
Barrier coverage is an important issue in wireless sensor networks, which guarantees to detect any intruder attempting to cross a barrier or penetrating a protected region monitored by sensors. However, the barrier coverage problem in wireless camera ...
Weak k-Barrier Coverage Problem in Underwater Wireless Sensor Networks
AbstractMost existing works on barrier coverage assume that sensors are deployed in a two-dimensional (2D) long thin belt region, where a barrier is a chain of sensors from one end of the region to the other end with overlapping sensing zones of adjacent ...
An Energy Efficient Barrier Coverage Algorithm for Wireless Sensor Networks
Intrusion detection is one of the most important applications of wireless sensor networks. When mobile objects are entering into the boundary of a sensor field or are moving cross the sensor field, they should be detected by the scattered sensor nodes ...
Comments