Distributed Algorithm for Full-View Barrier Coverage with Rotatable Camera Sensors

Abstract—In wireless sensor networks, barrier coverage is a fundamental category of coverage problems and its surveillance capability can be reinforced when utilizing camera sensors. In this paper, we propose a distributed algorithm to solve the problem of Full-View Barrier Coverage with rotatable camera sensors (FBR). Our goal is to minimize the active sensor number when guaranteeing the surveillance capabilities. Correspondingly, we propose a Distributed Proliferation Algorithm (DPA) which is the first distributed algorithm to deal with such problem. In DPA, each sensor has five possible phases: Initial Phase, Update Phase, Expand Phase, Wait Phase, and Terminate Phase. The main idea of DPA is spreading the sensor direction along the barrier with the help of auxiliary conflicting graph. We design a greedy strategy based on DFS. Moreover, local Dijkstra algorithm is utilized to select the shortest path to reduce active sensor number from global view. The mass number of numerical experiments validate the efficiency of DPA which can construct a full-view barrier line with fewer sensors compared with previous work. Index Terms—full-view barrier coverage, rotatable camera sensors, distributed algorithm I