Title: 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
Addresses: 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
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.
Keywords: multipath routing; mobile ad hoc networks; MANETs; path diminution; node-disjoint routing; single route discovery; mobile networks.
International Journal of Ad Hoc and Ubiquitous Computing, 2010 Vol.5 No.1, pp.7 - 21
Published online: 03 Dec 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article