摘要
针对Ad-hoc网络中由于节点移动导致的链路断裂和RREQ(Route Request)分组泛洪的问题,提出了基于路径收集的路由协议。采用路径收集机制和链路不相交的多路径算法,提高节点获取路由的能力,增加节点的平均有效路由数量,提高RREQ分组被应答的可能性,从而限制RREQ的广播范围和转发次数;依据路径维持时间的概率密度呈指数分布的特点,设计优先使用最新路径、兼顾路径长度的路由选择策略,以在概率上延长通信路径的维持时间。NS2的仿真结果表明,与AODV、AOMDV以及AODV_PA协议相比,提出的协议提高了分组投递率,并显著地减少了路由开销和通信时延。
Aiming at the problem of link breakage caused by node movement and RREQ(Route Request )packets' flooding, a routing protocol based on path accumulation was proposed. With the path-accumulation mechanism and link-disjoined multi-path algorithm, the proposed protocol enhances the node's s ability to obtain rout and increases the avera-ge number of valid route resided in a node. Consequently, a RREQ would be response more likely and the RREQs' broadcast range and the forwarding number are restricted. Based on the path maintain time probability density's charac-teristics of exponential distribution, the proposed protocol chooses a routing strategy, which preferentially uses the la-test path and take the length of the path into account, to extend the communication path maintenance time in statistic sense. NS2 simulation shows that, compared with AODV, AOMDV and AODV_PA, the proposed protocol has higher packet delivery ratio, lower routing overhead and end-to-end delay of packet.
出处
《计算机科学》
CSCD
北大核心
2013年第10期98-103,113,共7页
Computer Science
基金
国家自然科学基金项目(61063040)
广西可信软件重点实验室(桂林电子科技大学)开发课题资助