首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于Ad hoc网络AODV协议的不相交节点多路径路由算法
引用本文:刘广聪,张桦,韦东丽.一种基于Ad hoc网络AODV协议的不相交节点多路径路由算法[J].计算机应用研究,2011,28(2):692-695.
作者姓名:刘广聪  张桦  韦东丽
作者单位:广东工业大学计算机学院,广州,510006
摘    要:针对Ad hoc 网络低功耗无线通信的链路不确定性、链路质量不稳定性以及节点失效等问题,基于AODV路由协议提出了不相关节点路由算法。该算法使用简单的数字标志来搜寻不相关节点路径,并通过设置节点的阈值判断链路质量和失效节点来确定可靠的路由链路。仿真实验表明,该算法有很好的报文投递率,并能有效地减少网络链路中断的数量,降低端到端的延迟。

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

Node-disjoint multi-path routing algorithm based on AODV in Ad hoc networks
LIU Guang-cong,ZHANG Hu,WEI Dong-li.Node-disjoint multi-path routing algorithm based on AODV in Ad hoc networks[J].Application Research of Computers,2011,28(2):692-695.
Authors:LIU Guang-cong  ZHANG Hu  WEI Dong-li
Affiliation:(Faculty of Computer, Guangdong University of Technology, Guangzhou 510006, China)
Abstract: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.
Keywords:Ad hoc networks  AODV  node-disjoint  multi-path routing
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号