AODV-Based Multipath Routing Protocol for Mobile Ad Hoc Networks

Shinji MOTEGI; Hiroki HORIUCHI

AODV-Based Multipath Routing Protocol for Mobile Ad Hoc Networks

Shinji MOTEGI, Hiroki HORIUCHI

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E87-B No.9 pp.2477-2483

Publication Date: 2004/09/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Networking Technologies for Mobile Internet Systems)

Category: Ad Hoc Network

Cite this

Copy

Shinji MOTEGI, Hiroki HORIUCHI, "AODV-Based Multipath Routing Protocol for Mobile Ad Hoc Networks" in IEICE TRANSACTIONS on Communications, vol. E87-B, no. 9, pp. 2477-2483, September 2004, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_9_2477/_p

Copy

@ARTICLE{e87-b_9_2477,
author={Shinji MOTEGI, Hiroki HORIUCHI, },
journal={IEICE TRANSACTIONS on Communications},
title={AODV-Based Multipath Routing Protocol for Mobile Ad Hoc Networks},
year={2004},
volume={E87-B},
number={9},
pages={2477-2483},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={September},}

Copy

TY - JOUR
TI - AODV-Based Multipath Routing Protocol for Mobile Ad Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2477
EP - 2483
AU - Shinji MOTEGI
AU - Hiroki HORIUCHI
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2004
AB - 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.
ER -