WSN中基于流网络的K连通算法

K connectivity algorithm based on flow network in wireless sensor networks

无线传感器网络(WSN)的连通性是保证网络容错性的重要途径。常规的多路由算法往往存在共同路径,这些共同路径会因为节点损坏、通信链路中断等故障导致整个WSN的连通性过早失效。针对共同路径问题提出了一种解决方案,通过节点分裂的方式在共同路径上生成多条路径,以支持WSN的容错,保证每个传感器节点都有K条长度有界的、到汇聚节点的不相交最短路径。仿真结果验证了本算法能提供更好的容错性,保证网络的连通性。

Wireless sensor networks(WSN)connectivity is an important way to ensure network fault tolerance.Conventional multi-routing algorithms often have common paths,which will lead to premature connectivity failure of the whole WSN due to node damage,communication link interruption and other faults.Aiming at the common path problem,a solution was proposed to generate multiple paths on the common path through node splitting to support fault tolerance of WSN and ensure that each sensor node has K disjoint shortest paths of bounded length to the sinks.The simulation results show that the algorithm can provide better fault tolerance and ensure network connectivity.