Path diminution in node-disjoint multipath routing for mobile ad hoc networks is unavoidable with single route discovery. (4th December 2009)

• Record Type: Journal Article
• Authors: Abbas, Ash Mohammad; Jain, Bijendra Nath
• Is Part Of: International journal of ad hoc and ubiquitous computing. Volume 5:Number 1(2010)
• Page Start: 7
• Page End: 21
• Publication Date: 2009-12-04
• Subjects: multipath routing -- mobile ad hoc networks -- MANETs -- path diminution -- node-disjoint routing -- single route discovery -- mobile networks; Ubiquitous computing -- Periodicals; Embedded computer systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Wireless communication systems -- Periodicals; Computer architecture -- Periodicals; 004.2
• Languages: English
• ISSNs: 1743-8225

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.