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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.