基于分割网络的避障连通恢复算法

In the practical application of wireless sensor network (WSN), due to energy exhaustion or other reasons, a large area node cannot work effectively and the network is partitioned into multiple disjoint segments, which has a great influence on the whole network data collection. Based on the above situation, this paper presents a novel way that utilizes the relay nodes to realize network recovery. Firstly, in order to save energy more efficiently, we utilize the boundary sensors to construct the minimum spanning tree (MST). Then, we utilize the specific methods to analyze different obstacles and obtain the obstacles avoidance spanning tree. Finally, by considering the distribution and mobile capabilities of the relay nodes, the recovery path is optimized to realize the network connectivity. The simulation results show that the proposed algorithm has higher connectivity success rate and lower energy consumption than the existing algorithms, which reflects the effectiveness of the proposed algorithm.