AODV-Based Multipath Routing Protocol for Mobile Ad Hoc Networks
信二 茂木, Hiroki Horiuchi · IEICE Transactions on Communications · 2004
The single path routing protocol, known as the Ad Hoc On-demand Distance Vector, has been widely studied for use in mobile ad hoc networks. AODV requires a new route discovery whenever a path breaks. Such frequent route discoveries cause a delay due to route discovery latency. To avoid such inefficiency, a multipath routing protocol has been proposed that attempts to find link-disjoint paths in a route discovery. However, when there are two or more common intermediate nodes on the path, the protocol can not find a pair of link-disjoint paths even if the paths actually exist. To reduce this route discovery latency, it is necessary to increase the opportunities for finding a pair of link-disjoint paths. In this paper, we focus on AODV and propose an AODV-based new multipath routing protocol for mobile ad hoc networks. The proposed routing protocol uses a new method to find a pair of link-disjoint paths by selecting a route having a small number of common intermediate nodes on its path. Using simulation models, we evaluate the proposed routing protocol and compare it with AODV and the existing multipath routing protocol. Results show that the proposed routing protocol achieves better performance in terms of delay than other protocols because it increases the number of cases where a pair of link-disjoint paths can be established.