Full-view barrier coverage in mobile camera sensor networks

Abstract

Barrier coverage is an important problem in wireless camera sensor networks for many security applications such as border monitoring and target detection, where camera sensors are used for detecting targets that penetrate the protected area. The full-view coverage is an effective approach of camera barrier coverage which can capture multiple viewpoints of the target crossing the protected area. Existing works on full-view barrier coverage mainly consider static and rotatable camera sensors, which leads to a waste of camera sensors under the limitation of sensing angles and coverage areas. In this paper, we study full-view barrier coverage in mobile camera sensor networks, where camera sensors can randomly move within the deployed area. Specially, we first propose full-view covered model of mobile camera sensors. With this model, we then divide the deployed area into some connected grids and present grid-based deployment strategy to deploy camera sensors for each grid. Finally, we construct a weighted directed graph to model these connected grids and their relationship. Based on the graph, we employ Dijkstras algorithm to obtain a shortest coverage barrier, which is a connected full-view coverage zone across the entire target area. Extensive simulation and theoretical results are provided to illustrate the efficient of our covered models as well as our proposed algorithm in reducing the number of camera sensors and improving coverage probability.