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

基于AODV的贪婪路由协议
引用本文:朱鸿,单洪,黄郡.基于AODV的贪婪路由协议[J].计算机工程,2008,34(24):96-97.
作者姓名:朱鸿  单洪  黄郡
作者单位:电子工程学院网络工程系,合肥,230037;电子工程学院网络工程系,合肥,230037;电子工程学院网络工程系,合肥,230037
摘    要:针对AODV路由协议在节点高速移动环境中存在的低性能问题,提出一种利用贪婪算法并充分考虑节点移动状态的路由协议GAODV。该协议涉及扩展Hello报文、限制控制分组数量、建立稳定路由以及禁用本地路由修复。仿真分析表明,GAODV比AODV具有更高的吞吐量,在节点移动速度达80 m/s时,端到端的平均时延减少了55%。

关 键 词:Ad  Hoc网络  贪婪路由协议  按需距离向量路由协议
修稿时间: 

Greedy Routing Protocol Based on AODV
ZHU Hong,SHAN Hong,HUANG Jun.Greedy Routing Protocol Based on AODV[J].Computer Engineering,2008,34(24):96-97.
Authors:ZHU Hong  SHAN Hong  HUANG Jun
Affiliation:(Department of Network Engineering, Electronic Engineering Institute, Hefei 230037)
Abstract:Aiming at the capability deficiency of AODV routing protocol in situation where nodes move at high speed, this paper proposes a routing protocol called GAODV which using the greedy algorithm and considering nodes’ moving state fully. This protocol includes extending Hello packet, restricting the number of control packet, establishing steady route and forbidding local routing repair. Simulation analysis shows that compared with AODV, GAODV has better throughput, and the average end-to-end delay is decreased by 55% when the node’s speed comes to 80 m/s.
Keywords:Ad Hoc network  greedy routing protocol  on-demand distance vector routing protocol
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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