摘要
针对移动Ad Hoc网络的AODV路由协议在通信过程中存在的局部拥塞问题,本文提出基于拥塞跳数的路由协议RAODV。该协议引进平均队列长度预测拥塞情况,在路由节点转发路由请求包时,考虑自身的拥塞情况动态调整跳数计数方式,得到的路径跳数称为拥塞跳数,基于拥塞跳数建立最短路由。仿真结果表明,RAODV路由协议在不影响收敛速度的情况下有效地提高了数据的传输投递率,降低了平均时延。
In order to solve the problem of local congestion that always exists in communication process in mobile Ad Hoc net- works, RAODV routing protocol based on congestion hop count is presented. Average queue length is improved to predict the con- gestion situation in RAODV routing protocol. When transmitting route request packet（ RREQ）, each touring node can adjust dy- namically hop count according to their congestion situation, get route hop count which is called congestion hop count, and estab- lishs the shortest path. Simulation results show that RAODV routing protocol can improve the transmission delivery rate of data packet under the same convergence speed and reduce the average end-to-end delay.
出处
《计算机与现代化》
2013年第8期133-136,共4页
Computer and Modernization
基金
国家973计划资助项目(2007CB311003)
国家自然科学基金资助项目(61073117
61175046)
安徽省自然科学基金资助项目(11040606M)
研究生学术创新研究项目(yqh100156)
