自组网容错拓扑控制的研究

Fault-Tolerant Topology Control in Ad Hoc Networks

为省能而提出的拓扑控制若未考虑容错易造成自组网无法面对节点和无线信道失效.本文针对一般的原始平面图G0提出了保持两点之间最大限度K点、K边和K路径容错连通能力的概念.设计了一种基于K条内部节点互不相交路径的分布式拓扑控制算法LKINDP,能够保持G0内任意两点之间最大限度K连通容错能力,并给出了证明.仿真结果表明,LKINDP能够显著减小平均电台半径,简化网络拓扑结构,并且能够通过改变K值来调整网络的容错能力.

Topology control without fault tolerance will degrade the reliability of Ad Hoc networks. How to define the fault-tolerant topology control for a general planar graph Go and how to preserve Go＇ s fault-tolerant properties have been explored in this paper. The concepts of preserving to the maximum extent K-node, K-edge, and K-path connectivity between two nodes have been proposed. A localized algorithm to preserve to the maximum extent K fault-tolerant connectivity for any two nodes in Go has also been presented. The algorithm＇ s correctness has been formally proved. Simulation results show the network topology can be simplified and its reliability can be controlled by adjusting K.