Mitigating path diminution in disjoint multipath routing for mobile ad hoc networks

Design of a disjoint multipath routing protocol in an ad hoc environment is a challenging task. In this paper, we propose a protocol named Vertex Disjoint Multipath Routing (VDMR) to discover multiple node disjoint paths between a given pair of nodes. A major issue in node disjoint multipath routing is path diminution. We propose schemes to mitigate path diminution. We analyse the probability of path diminution in a scheme commonly employed to discover node disjoint paths. We discuss how the probability of path diminution is reduced, using proposed schemes. We observe that VDMR with proposed schemes performs much better than existing multipath routing protocols in the sense that it has a low probability of diminution and high packet delivery ratio.

[1]  B. Hambly.  Fractals, random shapes, and point fields , 1994 .

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

[3]  Peter P. Pham,et al.  Performance analysis of reactive shortest path and multipath routing mechanism with load balance , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[5]  Sheldon M. Ross,et al.  Introduction to Probability Models (4th ed.). , 1990 .

[6]  Sung-Ju Lee,et al.  Split multipath routing with maximally disjoint paths in ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[7]  Satish K. Tripathi,et al.  A framework for reliable routing in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  Rahul Jain,et al.  Geographical routing using partial information for wireless ad hoc networks , 2001, IEEE Wirel. Commun..

[9]  Ash Mohammad Abbas,et al.  A Disjoint Alternate Path Routing for Mobile Ad hoc Networks , 2005 .

[10]  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.

[11]  Ash Mohammad Abbas,et al.  Path diminution in disjoint multipath routing for mobile ad hoc networks , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[12]  Samir Ranjan Das,et al.  Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks , 2001, Mob. Networks Appl..

[13]  A.M. Abbas,et al.  Topology control in heterogeneous mobile ad hoc networks , 2005, 2005 IEEE International Conference on Personal Wireless Communications, 2005. ICPWC 2005..

[14]  David Simplot,et al.  Partition Detection in Mobile Ad-hoc Networks Using Multiple Disjoint Paths Set , 2003 .

[15]  Ash Mohammad Abbas,et al.  An analytical framework for path reliabilities in mobile ad hoc networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[16]  Jie Wu,et al.  An Extended Dynamic Source Routing Scheme in Ad Hoc Wireless Networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[17]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

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

[19]  D. Stoyan,et al.  Fractals, random shapes and point fields : methods of geometrical statistics , 1996 .

[20]  Arunabha Sen,et al.  Optimal routing for fast transfer of bulk data files in time-varying networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).