基于k边连通最小生成子图的网络拓扑管理算法

可移动社区依托于移动自组网,其特征决定了社区网络的临时性通信范围的有限性以及网络拓扑结构的高度动态性.利用图论的理论和方法,提出了一种基于k边连通最小生成子图的网络拓扑管理算法,算法以能量消耗等因素衡量链路的代价值,通过减少高代价的冗余链路来优化拓扑结构,能够较好地适应可移动社区拓扑管理的需求.实验结果表明:该拓扑管理算法有效地减少了网络整体能量损耗,延长了网络的生命周期.

The Algorithm of Network Topology Management Using k-Edge Connected Minimal Spanning Sub-Graph

The mobile community is based on the mobile ad hoc network,which determines the temporary,the limited communication range and the high dynamic of the network topology.Using the theory and method of graph theory,a new algorithm is proposed,which uses the k-edge connected minimum spanning sub-graph.The algorithm uses energy consumption and other factors to measure the value of the link,and can adapt to the requirements of the mobile community topology management by reducing the high cost of redundant links.Experimental results show that the topology management algorithm can effectively reduce the energy loss of the network,and prolong the life cycle of the network.