Distributed Scheduling Algorithm for Barrier Coverage in Wireless Sensor Networks

Barrier coverage is a hot issue in wireless sensor networks for its various applications, such as border surveillance and intrusion detection. In wireless sensor networks, it is a very important problem that how to prolong the network life time. In this paper, we focus on the problem that how to prolong the network lifetime for barrier coverage application. Firstly, the surveillance region is divided into small vertical segment, which is called as slice. Based on this discretization, we formulate the problem that how to schedule sensors to achieve barrier coverage with the maximized network lifetime as BCSP (Barrier Coverage Scheduling Problem). Secondly, a distributed scheduling algorithm DBCS (Distributed Barrier Coverage Scheduling) is proposed. Finally, comprehensive simulations demonstrate that the proposed algorithm prolongs network lifetime effectively, DBCS is applicable for large scale sensor networks.