检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]湖北第二师范学院物理与电子信息工程系,湖北武汉430205 [2]华中科技大学电子与信息工程系,湖北武汉430074
出 处:《通信技术》2008年第10期170-173,共4页Communications Technology
基 金:国家863"十一五"专项课题(2006AA01Z233);国家自然科学基金(60672059;60496315)。
摘 要:AODV路由协议是adhoc网络中一种典型的按需路由协议,但是当网络节点具有高移动性,网络拓扑变化频繁使得路由链路断开频繁时,按需路由协议包括AODV算法都缺乏鲁棒性,各个移动节点在发送数据包时需要不断发起路由请求。文章对AODV算法进行了详细分析,并利用路由缓存技术对AODV算法进行了改进。在缓存中建立了两条备用路由,当活动路由链路断开时,选取一条较好的备用路由作为活动路由。NS2仿真结果表明,这种带缓存功能的AODV算法能降低丢包率、时延,提高路由的稳健性,从而适应网络拓扑结构的频繁变化。Various routing protocols are proposed for ad hoc network, especially the On- Demand Routing Protocols, such as AODV. However, all On Demand Routing Protocols, including AODV algorithm, always lack robustness when the route link breaks frequently because of the frequent top changes due to the high mobility of the nodes, which have to send the routing request frequently while they need to send data packets but have no route to destination. This paper first analyzes the AODV protocol in detail, and then proposes an modified scheme by using route cache. Several backup routes are built up so as to select one of them as active route when the active link breaks. The simulation results in NS2 show that the modified AODV protocol by using route cache technology can decrease packet-loss ratio, reduce the routing delay and raise the routing robustness. This modified AODV protocol is more adaptable to the frequent top structure change than original one.
关 键 词:AD HOC网络 AODV路由协议 缓存 按需路由协议
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112