Abstract: Aiming at high control overhead and long packet delay of the traditional Ad Hoc On Demand Distance Vector(AODV) routing repair algorithm, and improved algorithm is proposed. By delivering 2hop_RREQ and NOTICE packets during route repair phase, the repair near the broken links of the improved algorithm is limited at the range of 2 hops. Compared with the traditional algorithm, the results obtained by NS2 show that the routing cost is decreased by 50% and the packet delivery ratio is increased by 5%.

Key words: Ad Hoc network, Ad Hoc On Demand Distance Vector(AODV), local repair

摘要： 针对传统按需平面距离矢量(AODV)路由修复算法路由开销大和端到端时延长的问题，提出一种改进的AODV本地路由修复算法。通过路由修复阶段2hop_RREQ和NOTICE报文的传递，将修复限制在断链的2跳范围内。在NS2平台下的仿真结果表明，与传统算法相比，改进算法的路由开销减少约50%，包投递率增加约5%。

关键词: Ad Hoc网, 按需平面距离矢量, 本地修复

CLC Number: 

• TP393