Path diminution in node-disjoint multipath routing for mobile ad hoc networks is unavoidable with single route discovery

Authors:
Ash Mohammad Abbas;Bijendra Nath Jain
Affiliations:
Department of Computer Engineering, Aligarh Muslim University, Aligarh 202002, 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:
2010

Citing 5
Cited 0

Data networks

Data networks
Finding disjoint paths in networks

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Performance of multipath routing for on-demand protocols in mobile ad hoc networks

Mobile Networks and Applications
Introduction to Algorithms

Introduction to Algorithms
Ad-hoc On-Demand Distance Vector Routing

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In an ad hoc network, identification of all node-disjoint paths between a given pair of nodes is a challenging task. The phenomena that a protocol is not able to identify all node-disjoint paths that exist between a given pair of nodes is called path diminution. In this paper, we discuss that path diminution is unavoidable when a protocol discovers multiple node-disjoint paths in a single route discovery. We discuss schemes to mitigate path diminution. However, no such scheme is guaranteed to discover all node-disjoint paths that exist between a given pair of nodes. We have proved that one cannot devise an efficient algorithm that is guaranteed to compute all node-disjoint paths between a given pair of nodes in a single route discovery.