基于邻居缓存的AODV路由协议  

Research of AODV routing protocol based on neighbor cache

作　　者：李世宝[1] 洪利[1] 

机构地区：[1]中国石油大学(华东)计算机与通信工程学院,山东东营257061

出　　处：《计算机应用》2011年第7期1931-1933,1943,共4页journal of Computer Applications

摘　　要：在移动自组网(MANET)中,传统的洪泛和扩展环路由发现方法路由开销较大。针对这一问题,提出一种基于邻居缓存的路由发现算法。该算法从网络中的各种数据分组中提取单跳邻居信息,建立邻居信息缓存表。在此基础上,将路由搜索分解为两个步骤:1)寻找刚刚和目标节点接触过的节点;2)找到后以它为中心展开新的扩展环搜索。使搜索限定在目标节点最可能出现的区域,减少了路由发现的盲目性,从而降低路由开销。仿真结果表明,与洪泛和传统扩展环算法相比,该方法节省了路由开销,提高了网络性能。In Mobile Ad Hoc Networks（MANET）,the routing overhead was heavy and routing latency was long by using conventional algorithms of route discovery such as flooding and Expanding Ring Search（ERS）.In order to improve the performance of routing protocol,a scheme of route discovery was provided based on the neighbor cache.Neighbor information was extracted from data packets,and neighbor cache table was established to store historical neighbor records.And then the approach of route discovery included two stages： 1） Found the node meeting the destination node before a short time;2） Started new ERS.The simulation results show that the new scheme significantly improves performance of the protocol under many kinds of simulation scenarios.The routing overhead is saved and the end-to-end delay of the packet is reduced.At the same time,the new scheme is also easy to implement.

关 键 词：移动自组织网络 AODV路由协议 扩展环搜索 路由开销 邻居缓存 

分 类 号：TP393.07[自动化与计算机技术—计算机应用技术]