Ad hoc网络中不相关多路由源端寻路算法

Disjoint multipath source routing in Ad hoc network

路由方案是Ad hoc网络中一个热点研究领域。其中,按需路由算法由于其有效性在带宽受限的Ad hoc网络中得到比较大的发展。然而大部分的按需路由算法,建立并只使用单条路由,当前使用的路径的链路断开时,路由算法必须执行一个路由修复过程。提出了不相关多路由源端路由算法(DMSR),建立并利用多条最大不相关路由。算法中,中间节点等待一段时间以得到多个路由请求包(RREQ),然后在这个RREQ中,选择相关性最小的多路径,并将这些信息写入一个RREQ中,并将它广播出去。从仿真结果可以看出本文的算法提高了数据包的正确传输率和业务均衡性。

Routing schemes are the mostly focused area in Ad hoc networks.On-demand routing in particular,is widely developed in bandwidth constrained mobile wireless Ad hoc networks because of its effectiveness and efficiency.Most proposed on-demand routing protocols,however,build and rely on single path for each data session.Whenever there is a link disconnection on the active path,the routing protocol must perform a route recovery process.This paper propose the disjoint multipath source routing（DMSR） algorithm that establishes and utilizes maximally disjoint multiple paths.In the algorithm,each intermediate node waits for a while to receive several RREQs.Among these RREQs,it selects the maximally disjoint paths and records them in one RREQ,and then broadcasts it.The extensive simulation results show the increment in packet delivery ratio and load balancing.