Robust multipath routing to exploit maximally disjoint paths for wireless ad hoc networks

Authors:
Jungtae Kim;Sangman Moh;Ilyong Chung;Chansu Yu
Affiliations:
Dept. of Computer Sci., Chosun University, Gwangju, Korea;Dept. of Internet Eng., Chosun University, Gwangju, Korea;Dept. of Computer Sci., Chosun University, Gwangju, Korea;Dept. of Electrical and Computer Eng., Cleveland State U., OH
Venue:
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Year:
2006

Citing 4
Cited 1

A performance comparison of multi-hop wireless ad hoc network routing protocols

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Ad Hoc Wireless Networks: Protocols and Systems

Ad Hoc Wireless Networks: Protocols and Systems
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Ad Hoc Networking

Ad Hoc Networking

An efficient construction of node disjoint paths in OTIS networks

APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new multipath routing protocol called maximally disjoint multipath AODV (MDAODV), which exploits maximally node- and link-disjoint paths. The key idea is to extend the route request (RREQ) message by adding source routing information and to make the destination node select two paths from multiple RREQs received. Our simulation study shows that MDAODV outperforms the conventional multipath routing protocol based on AODV as well as the basic AODV protocol in terms of packet delivery ratio, and results in about 15 ~ 50 % less routing overhead.