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 sensor networks WCSNs is different from that in scalar sensor networks. In this paper, based on k, ω-angle coverage, we study the minimum k, ω-angle barrier coverage problem in WCSNs. We first present the technique to deploy minimum number of camera sensors to form a k, ω-angle barrier. Then propose a novel method to select the minimum number of camera sensors from an arbitrary deployment to form a k, ω-angle barrier. Though our simulation, we confirm that our algorithms reduce the number of sensors required comparing to the state-of-art algorithm.