Abstract

Barrier coverage is one of the most important issues in intruder detection applications. Visual sensors can give more accurate information of intruder but also raise the problem of large data volume for information exchange and processing. Constructing a disjoint full-view barrier using minimal number of visual sensors has been the main goal for handling the barrier coverage problem. This paper presents a decentralized FBCA mechanism which consists of Region Partitioning Phase, Grid Excluding Phase, Grid Verification Phase and Full-View Barrier Construction Phase. In Region Partitioning Phase, the given $R $ is partitioned into a set of equal-sized grids, aiming to simplify the construction problem of the full-view barrier. In Grid Excluding Phase, a certain amount of grids is removed, aiming to reduce the computational complexity. In Grid Verification Phase, each visual sensor aims to check if its neighboring grids satisfy the full-view coverage criteria. Finally, the Full-View Barrier Construction Phase aims to construct as many as possible full-view barriers. Experimental study shows that the proposed FBCA outperforms existing work SP, and likely approaches to the optimal solution (MCSPS) in terms of the average success ratio for constructing a full-view barrier.

Highlights

  • Wireless visual sensor networks (WVSNs) consist of a number of visual sensors

  • This paper addresses the problem of full-view barrier coverage and develops a decentralized Full-View Barrier Construction Algorithm (FBCA) for WVSNs

  • In this paper, the FBCA mechanism is proposed aiming to construct as many as possible full-view barriers

Read more

Summary

INTRODUCTION

Wireless visual sensor networks (WVSNs) consist of a number of visual sensors. The visual sensors have been widely used for many applications, including image monitoring service [1], [2], objects location identification [3] as well as constructing a virtual fence [4], [5] on the border between Mexico and the United States. Since the visual sensors provide rich information which requires computation cost, most of the existing approaches [11]–[13] aim to reduce the number of active visual sensors. They did not guarantee that every perspective of an object at any position is under the view of some visual sensors. Each constructed barrier is composed of as few visual sensors as possible while the full-view coverage requirement can be guaranteed. By locally considering the contribution of each visual sensor, the proposed FBCA can construct the barrier which satisfies the full-view coverage requirement in a decentralized manner.

RELATED WORK
NETWORK ENVIRONMENT
PROBLEM FORMULATIONS
GRID VERIFICATION PHASE
FULL-VIEW BARRIER CONSTRUCTION PHASE
SIMULATION
SIMULATION MODEL
CONCLUSION

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.