An effective construction scheme of probabilistic k-barrier coverage in WSN

K-barrier coverage is one of the hot spot in the wireless sensor network. This paper mainly studies construction of probabilistic barrier of minimum node (MNPB) on large-scale network. First, the probabilistic barrier model is created. Second, the interested area is divided into several small areas, target location of node are determined by Hungary algorithm to construct MNPB. Node set with the least sum of moving distances constitute 1 MNPB in each small area. The residual mobile node in the vicinity repair the possible hole of barrier. Third, vertical barrier is built up to connect two horizontal adjacent MNPB. Finally, these MNPBs are merged into probabilistic K-barrier coverage. Simulation results show our method can effectively constitute probabilistic K-barrier coverage. This research enhances the performance of wireless sensor network, has important theoretical and practical significance.