避免路由断裂的优化AODV路由协议

发布时间：2018-05-31 05:29

本文选题：移动自组网 + 按需距离矢量路由协议　；参考：《计算机应用》2014年09期

【摘要】：移动自组网(MANET)中,节点的移动容易引起链路失效,传统的按需距离矢量(AODV)路由算法的本地修复机制局限于在链路断裂后进行,如果修复失败或者过慢,可能导致缓存的数据包丢失。针对这一问题,提出一种避免路由断裂的优化AODV路由算法ARB-AODV,该算法首先对即将断裂的链路进行预测,然后计算有关节点的相对稳定度,将稳定性较高的节点插入即将断裂的链路中,以消除节点的边缘效应来避免路由断裂。在NS-2平台下采用随机路点移动模型(RWM)和恒定比特率(CBR)数据源进行实验,在节点的移动速度大于10 m/s时,ARB-AODV算法的分组投递率保持在80%以上,其平均端到端时延比AODV算法降低了40%,归一化路由开销比AODV算法降低了15%。仿真结果表明,ARB-AODV优于AODV,能有效提高网络性能。
[Abstract]:In Manet (Mobile Ad Hoc Network), the node movement is easy to cause link failure. The local repair mechanism of the traditional on-demand distance vector AODV routing algorithm is limited to the local repair mechanism after the link break, if the repair fails or is too slow. May cause cached packets to be lost. To solve this problem, an optimized AODV routing algorithm, ARB-AODV, is proposed to avoid route breakage. The algorithm first predicts the link that is about to break, and then calculates the relative stability of the nodes concerned. The stable nodes are inserted into the link which is about to break in order to eliminate the edge effect of the node and avoid the route breakage. The data sources of random path moving model (RWM) and constant bit rate (CBR) are used on NS-2 platform. The packet delivery rate of ARB-AODV algorithm remains above 80% when the moving speed of nodes is more than 10 m / s. The average end-to-end delay is 40% lower than that of the AODV algorithm, and the normalized routing overhead is 15% lower than that of the AODV algorithm. Simulation results show that ARB-AODV is superior to AODV and can effectively improve network performance.
【作者单位】：郑州大学信息工程学院;
【基金】：河南省教育厅科技研究重点项目(14A520021)
【分类号】：TN929.5

【相似文献】