Maximum barrier coverage deployment algorithms in wireless sensor networks

Barrier coverage is one of the most important issues in wireless sensor networks (WSNs). In particular, it has been a popular area of WSNs research in recent years. Maximizing the number of barrier paths is one of the key factors in the design of barrier coverage algorithms for WSNs. In this paper, we propose a novel concept to optimize the number of barrier paths by minimizing the total moving distance and the number of moving sensors, which consists of two algorithms. After an initial random placement of sensors, the first approach is to move all sensors close to the optimal location. The second approach is used to determine the barrier paths based on coverage graph and then applied the former to the other sensors which do not belong to any available barrier path. The simulation results show that our two proposed algorithms have improved barrier coverage. The first algorithm is more suitable for a high degree of fault-tolerant coverage while the second approach is to achieve the optimal number of moving sensors and total moving distance.