Abstract: In AODV routing protocol, an intermediate node can reply a RREQ when it has a rout with a sequence number that is greater than or equal to that contained in the RREQ, no matter how many packets are waiting to send in it. These routs’ performance may degrade because local congestions may incur on those nodes with the increase of offered load. In this paper, we propose an optimized-AODV routing protocol, which allow an intermediate node behaves in difference way according to whose sending queue’s length when it receives a RREQ to decrease local congestions on certain nodes or routs. The Simulation results show that optimized-AODV performs better than AODV.

Key words: ad hoc, AODV, routing protocol

摘要： 为了减少建立路由所产生的延时，AODV路由协议允许拥有积极路由的中间节点响应路由请求，而不考虑该节点当时的负荷，这样虽然快速地建立了路由，但并不一定能有效地传输数据。针对这一问题，本文提出一个改进，在改进的AODV路由协议中，以节点的等待发送的数据包队列长度来衡量一个节点的负荷大小，在路由发现的过程中，中间节点根据自己负荷的大小而以不同的方式响应路由请求，使数据流不在某些路段上过于集中。仿真结果表明改进的协议和原协议相比，降低了端到端的延时和丢包率，提高了传输效率。

关键词: ad hoc网络, AODV, 路由协议