Path Diminution is Unavoidable in Node-Disjoint Multipath Routing with Single Route Discovery

Author

Abbas, Ash Mohammad ; Jain, Bijendra Nath

Author_Institution

Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., New Delhi

fYear

0

fDate

0-0 0

Firstpage

1

Lastpage

10

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

ad hoc networks; routing protocols; ad hoc network; node-disjoint multipath routing; path diminution; protocol; single route discovery; Ad hoc networks; Ash; Computer science; Frequency; Heuristic algorithms; Intelligent networks; Network topology; Protocols; Routing; Throughput; Routing; ad hoc networks; node-disjoint multipath routing; path diminution; single route discovery;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication System Software and Middleware, 2006. Comsware 2006. First International Conference on

Conference_Location

New Delhi

Print_ISBN

0-7803-9575-1

Type

conf

DOI

10.1109/COMSWA.2006.1665210

Filename

1665210