检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:蔡小庆[1] 鲁小利[1] 宋晓华[1] 陈晓芳[1]
出 处:《电子技术应用》2013年第7期93-96,共4页Application of Electronic Technique
摘 要:在移动自组网中,节点的移动导致拓扑动态变化,已经建立的路由时刻存在中断的可能,而传统的AODV路由协议中的路由修复方法开销大、时延长。针对这一问题,提出了一种基于链路中断预测的改进路由算法。该算法在链路中断之前启用备用节点,尽量避免路由修复;在链路中断后,首先在本地进行链路修复,不成功再逐层由上游节点发起路由搜索。仿真实验结果表明,与传统AODV相比控制开销降低了40%,端到端时延减少了25%,提高了网络性能。In mobile ad hoc networks (MANET), due to the changing topology and limited bandwidth, link break frequently oc- curs in mobile ad hoc networks. In traditional AODV, the source node broadcasts RREQ message to find a new route to the desti- nation when the link break occurs. Control overhead and long packet delay are high. In this paper we propose an improved routing repair algorithm(RP-AODV). The intermediate node, which detects the link break, to repair the break route. Once the intermediate node cannot repair the route in time, the backward pre-hop node tends to find a new route instead. The simulation is done through network Simulator-2, Results show that RP-AODV performs better in terms of routing overhead, end to end delay than classic AODV. the control overhead ratio is decreased by 40% , and the end to end delay is decreased by 25%. RP-AODV is quite suitable for such a dynamic network.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.44