An efficient approximate algorithm for achieving (k − !) barrier coverage in camera wireless sensor networks

Abstract

Barrier coverage problems in wireless camera sensor networks (WCSNs) have drawn the attention by academic community because of their huge potential applications. Various versions of barrier coverage under WCSNs have been studied such as minimal exposure path, strong/weak barrier, 1/k barrier, full view barrier problems. In this paper, based on new (k−ω) coverage model, we study how to achieve (k −ω) barrier coverage problem under uniform random deployment scheme (hereinafter A(k − ω)BC problem). This problem aims to juggle whether any given camera sensor networks is (k − ω) barrier coverage. A camera sensor network is called (k − ω) barrier coverage if any crossing path is (k − ω) coverage. The A(k − ω)BC problem is useful because it can make balance of the number of camera sensors used and the information retrieved by the camera sensors. Furthermore, this problem is vital for design and applications for camera sensor networks when camera sensor nodes were deployed randomly. Thus, we formulate the A(k − ω)BC problem and then proposed an efficient method named Dynamic Partition for solving this problem . An extensive experiments were conducted on random instances, and the results indicated that the proposed algorithm can achieve high quality and stable solutions in real-time execution.