一种基于Ad hoc网络AODV协议的不相交节点多路径路由算法  

Node-disjoint multi-path routing algorithm based on AODV in Ad hoc networks

作　　者：刘广聪[1] 张桦[1] 韦东丽[1] 

机构地区：[1]广东工业大学计算机学院,广州510006

出　　处：《计算机应用研究》2011年第2期692-695,共4页Application Research of Computers

摘　　要：针对Ad hoc网络低功耗无线通信的链路不确定性、链路质量不稳定性以及节点失效等问题,基于AODV路由协议提出了不相关节点路由算法。该算法使用简单的数字标志来搜寻不相关节点路径,并通过设置节点的阈值判断链路质量和失效节点来确定可靠的路由链路。仿真实验表明,该算法有很好的报文投递率,并能有效地减少网络链路中断的数量,降低端到端的延迟。Because of the uncertainty of Ad hoc networks low-power wireless communications link,and the issues of link instability and node failure,this paper proposed a node-disjoint multi-path routing algorithm based on AODV routing protocol.The algorithm used a simple digital ID to search node-disjoint multi-path,and set the threshold to judge the quality of the link and the failure nodes,and determined the reliability of routing link.The simulation results show that the algorithm has a good packet delivery ratio,and can effectively reduce the number of the interrupted network links break and end to end delay.

关 键 词：Ad HOC网络 AODV协议 不相关节点 多路径路由 

分 类 号：TP393.04[自动化与计算机技术—计算机应用技术]