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

Nguyen Thi My Binh; Huynh Thi Thanh Binh; Vu Le Loi; Vu Trung Nghia; Dang Lam San; Chu Minh Thang

doi:10.1117/12.2519272

10 May 2019 An efficient approximate algorithm for achieving (k −ω) barrier coverage in camera wireless sensor networks

Nguyen Thi My Binh, Huynh Thi Thanh Binh, Vu Le Loi, Vu Trung Nghia, Dang Lam San, Chu Minh Thang

Proceedings Volume 11006, Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications; 1100613 (2019) https://doi.org/10.1117/12.2519272
Event: SPIE Defense + Commercial Sensing, 2019, Baltimore, MD, United States

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.

Conference Presentation

Citation Download Citation

Nguyen Thi My Binh, Huynh Thi Thanh Binh, Vu Le Loi, Vu Trung Nghia, Dang Lam San, and Chu Minh Thang "An efficient approximate algorithm for achieving (k −ω) barrier coverage in camera wireless sensor networks", Proc. SPIE 11006, Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications, 1100613 (10 May 2019); https://doi.org/10.1117/12.2519272

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

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.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available