AMR:一个基于网络最大流的Ad-Hoc多路径路由算法

移动Ad-Hoc网路研究中,路由是一个关键问题.现有的Ad-Hoc路由算法大多为单路径算法.但是多路径方法可以更好地支持QoS,最近也受到较大关注.在没有精确的网络拓扑结构情况下,找出多条不相交路径是比较困难的.本文提出了一个基于网络最大流的Ad-Hoc多路径路由算法AMR(Aggregated multipath routing).该算法可以有效地找出多条节点不相交的路径,较大幅度地提高网络传输性能、减少网络拥塞.经过性能测试,表明AMR算法比DSR算法在数据传输率方面提高20%—60%,端对端平均延迟降低40%—60%.

AMR:A Multipath Routing Algorithm Based on Maximum Flow in Ad-Hoc Networks

Routing is a challenge task in the mobile Ad Hoc network because its topology changes dynamically for its nodes' movement.At present,most Ad Hoc routing algorithms are of single path.However,more attention has been paid to multipath recently for it can support QoS better.The problem in multipath routing is that it is much more difficult to find multiple node-disjoint paths because of the lack of an accurate network topology.This paper proposes an aggregated multipath routing algorithm(AMR) for mobile Ad Hoc networks based on the maximum-flow method,as an extension to the single path routing algorithm(DSR).This algorithm can find the node-disjoint paths effectively,improve the packet delivery performance greatly and edecrease the network congestion.THe results show that compared with DSR,AMR is able to improve packet delivery ratio by about 20%-60% and reduce average delay by about 40%-60%.