Overheads and Mean Route Failure Time of a Hybrid Protocol for Node-Disjoint Multipath Routing in Mobile Ad Hoc Networks

Abstract

Identification of node-disjoint paths in an ad hoc network is a challenging task. A protocol that is hybrid of an incremental protocol and a protocol that tries to identify multiple node-disjoint paths in a single route discovery, can be used to identify a maximal set of node-disjoint paths between a given source and destination. In this paper, we analyze the communication and computational overheads and the time after which all node-disjoint paths between a given source and a destination are expected to fail.