一种基于复杂网络理论的移动自组网路由算法研究

摘要

The Ad hoc network was existed a phenomenon about sending packet routing overhead rate was not high, and average delay long bag etc, this paper proposed an Ad hoc network routing algorithm based on the complex network theory. In this algorithm, the routing found based on the routing messages in the neighborhood of the scope of mutual borrowing, if the average duration in network routing found time to dynamic range, random routing, jump series meets the conditions of complex network theory to choose to at least jump series or shortest path for the index of the optimal path to establish routing, otherwise, the position of routing direction of beneficial optimal path principles established routing. The experimental analysis shows that, even when the thinning algorithm of land by the node still has very good the sending packet routing overhead rate and average delay, its comprehensive performance superior the OLSR agreement and AODV agreement.%针对移动自组网中节点之间数据包发送成功率不高、路由开销大和包平均延时长等问题,提出了一种基于复杂网络理论的移动自组网路由算法.在该算法中,路由发现基于路由消息在邻域范围的相互借阅,若持续时间在网络平均路由发现时间范围内,则采取动态随机路由,考核跳级数是否满足复杂网络理论的条件来选择以最少跳级数或者最短路径为指标的最优路径建立路由,否则采取位置路由,采取方向最有益的最优路径建立路由.实验分析表明,即使节点稀疏时该路由算法仍具有很好的包发送成功率和包平均延时,其综合性能优于OLSR协议和AODV协议.