Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks

Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Such floods take up a substantial portion of network bandwidth. We focus on a particular on-demand protocol, called Dynamic Source Routing, and show how intelligent use of multipath techniques can reduce the frequency of query floods. We develop an analytic modeling framework to determine the relative frequency of query floods for various techniques. Our modeling effort shows that while multipath routing is significantly better than single path routing, the performance advantage is small beyond a few paths and for long path lengths. It also shows that providing all intermediate nodes in the primary (shortest) route with alternative paths has a significantly better performance than providing only the source with alternate paths. We perform some simulation experiments which validate these findings.

[1]  Samir Ranjan Das,et al.  Query Localization Techniques for On-Demand Routing Protocols in Ad Hoc Networks , 1999, Wirel. Networks.

[2]  Samir R. Das,et al.  Comparative Performance Evaluation of Routing Protocols for Mobile, Ad hoc. , 1998 .

[3]  A. Udaya Shankar,et al.  Transient and steady-state performance of routing protocols: distance-vector versus link-state , 1992 .

[4]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[5]  A. Udaya Shankar,et al.  Design and implementation of MaRS: a routing testbed , 1992 .

[6]  Jim Lansford,et al.  HomeRF#8482; and SWAP: wireless networking for the connected home , 1998, MOCO.

[7]  J. Jubin,et al.  The DARPA packet radio network protocols , 1987, Proceedings of the IEEE.

[8]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[9]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[10]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[11]  N. Shacham,et al.  Future directions in packet radio architectures and protocols , 1987, Proceedings of the IEEE.

[12]  Sheldon M. Ross,et al.  Introduction to Probability Models, Eighth Edition , 1972 .

[13]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[14]  Cengiz Alaettinoglu,et al.  Performance comparison of routing protocols using MaRS: distance-vector versus link-state , 1992, SIGMETRICS '92/PERFORMANCE '92.

[15]  J. J. Garcia-Luna-Aceves,et al.  Loop-free multipath routing using generalized diffusing computations , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[16]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[17]  Samir Ranjan Das,et al.  Comparative performance evaluation of routing protocols for mobile, ad hoc networks , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[18]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[19]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.