Research And Design Of A Distributed Algorithm For Barrier Coverage In Wireless Sensor Networks

Barrier coverage is a kind of strip-shaped coverage. It means the wireless sensor network nodes are randomly deployed in a strip area, and these nodes form a strip-shaped coverage by self-organization. When targeted events cross the area, the barrier coverage can perceive events in a timely manner. Barrier coverage is widely used in invasive monitoring, security monitoring and other fields. It has important theoretical research value and broad application prospects.To build such a great strip-shaped coverage area, there are two core problems need to be solved. One problem is the cost of the construction of barrier coverage, that is, how to ensure reliable sensing with minimal nodes and also meet the required sensitivity. It relates to the number of nodes in working condition and the amount of information transmitted between nodes. The other problem is to consider the lifetime of barrier coverage. The whole network cannot be paralyzed due to the death of a single or a few nodes. Through rational design allows the network to achieve a longer lifetime.This paper proposes a distributed barrier coverage algorithm(DBCA). It can effectively solve the two core problems mentioned above. The distributed algorithm consists of two sub-algorithms. The first one is the K-HOP Clustering Algorithm. This sub-algorithm uses clustering approach to divide the entire network into clusters structure. The other is path selection within cluster algorithm. It is a kind of improved weighted minimum cost maximum flow algorithm. After the first step of the clustering stage, for each cluster structure, executing the second sub-algorithm according to the neighbor node table information to find the optimal set of nodes to form the barrier coverage.The simulation results show that the distributed barrier coverage algorithm this paper proposed can effectively reduce the number of active nodes and transfer information. As the number of nodes deployed to reach 700, the amount of information transmitted of DBCA is reduced by 25% and 41.6% compared to ONSA and LBCP, the lifetime is more than 44% and 30%. This shows that the proposed algorithm is an effective solution to solve the two core problems.