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

Authors:
Ash Mohammad Abbas;Bijendra Nath Jain
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110016, India.;Department of Computer Science and Engineering, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110016, India
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2006

Citing 3
Cited 2

Data networks

Data networks
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications

Scalability and Route Failure Time of a Hybrid Protocol for Identification of Node-Disjoint Paths in Mobile Ad Hoc Networks

ICDCIT '08 Proceedings of the 5th International Conference on Distributed Computing and Internet Technology
Analysis of Multiple Attempt Multipath Routing for mobile ad hoc networks

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.