改进最小生成树算法在移动自组织网络路由选择中的应用

摘要

针对移动自组织网络的动态性和多跳网络特性，在路由选择中提出改进最小生成树算法。设计过程中既考虑节点间的直通中断概率，又考虑多跳次数对信道容量的影响，通过调整最小生成树得到源节点与目的节点间最佳路由。实验结果表明：改进最小生成树算法可以获得更高的信道容量。%The improved minimum spanning tree algorithm was proposed for routing,according to the dynamics of mobile ad hoc network and the characteristics of multi-hop network. The proposed scheme takes into consideration both the outage probability among nodes and the effect of hop counts on the chan-nel capacity. By adjusting the minimum spanning tree,the best routing is obtained between source node and destination node. Experimental results show that the improved minimum spanning tree algorithm is a-ble to achieve higher channel capacity.