Analysis of a hybrid protocol for identification of a maximal set of node-disjoint paths in mobile Ad hoc networks

In this paper, we analyze 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. We prove that the hybrid protocol preserves the guarantee inherited from the incremental protocol about the identification of a maximal set of node-disjoint paths. In our analysis, we focus on the following parameters: (i) communication and computational overheads, and (ii) route failure time.