AODV路由协议在无线网状网中的改进
首发时间:2009-01-12
摘要:Ad hoc On-demand Distance Vector(AODV)路由协议的主要目标是找到最小跳数的路由。但是,在无线Mesh网络中,用跳数作为路由判据并不是一个好的选择。本文提出了一个新的路由判据Effective Available Bandwidth(EAB)和一个新的路由协议EAB-AODV。 在EAB-AODV中,在从每个RREQ组的第一个RREQ消息到达本节点开始的一段时间内,该中间节点接受该RREQ组的所有的RREQ消息。该时间段的长短由一种延迟算法计算决定。在这个时间段结束的时间点上,该中间节点将这段时间内接收到的具有最大EAB值的RREQ消息广播出去,并建立同该消息的接收链路相对应的反向链路。从这个时间点往后,该RREQ组的所有RREQ消息都会被拒绝接收。仿真结果显示EAB-AODV路由同AODV相比,能够使得端到端延迟降低37%,网络总吞吐量增加18%。
For information in English, please click here
Improvements on AODV in Wireless Mesh Networks
Abstract:Ad hoc On-demand Distance Vector routing focuses on finding minimum hop count. However, hop count is not a good choice as a routing metric for Wireless Mesh Networks. In this paper, we proposed a routing metric called Effective Available Bandwidth(EAB) and a routing protocol called EAB-AODV. In EAB-AODV, an intermediate node accepts all incoming RREQ messages in the same RREQ group for a period of time after the first arriving RREQ packet in the RREQ group. The length of the period is decided by a delay algorithm. As soon as the period ends, the intermediate node broadcasts the received RREQ message with the biggest EAB, store the corresponding reverse route and discards any incoming RREQ packet from then on. Simulation result shows that EAB-AODV routing can reduce the end-to-end delay by 37% and increase the aggregate throughput by 18%.
Keywords: AODV Routing Effective Available Bandwidth Wireless Mesh Networks
基金:
论文图表:
引用
No.2763337705712317****
同行评议
共计0人参与
勘误表
AODV路由协议在无线网状网中的改进
评论
全部评论0/1000