摘要： 针对传统的AODV路由协议采用全网络广播进行路由发现带来的路由开销较大问题，提出一种自适应的L跳扩展环路由搜索算法，并推导出L值的计算公式，节点在路由请求过程中能够根据以前搜索中获得的“先验”知识动态地调整搜索参数，进而计算下一步路由过程的最优跳数L，使搜索总是向着路由开销最小的方向进行。仿真结果表明，改进后的AODV协议能够降低路由开销，缩短路由发现过程的延时。

关键词: Ad Hoc网络, AODV路由协议, 路由发现, 扩展环

Abstract: Aiming at the problem of heavy routing overhead that is brought by AODV routing protocols when using full-net query flooding during route discovery, an adaptive L-hops expanding ring search route discovery algorithm is proposed. A theoretical model is developed to get the formula of L. Based on probability characteristic, the cached “experience” is used to optimize search arguments and the optimal L is calculated, in order to minimize the routing overhead. Simulation results show that the algorithm can reduce the routing overhead, cut down the average routing delay.

Key words: Ad Hoc networks, AODV routing protocol, route discovery, expanding ring

中图分类号: 

• TP393