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%.