An Improvement over Incremental Approach for Guaranteed Identification of Multiple Node-Disjoint Paths in Mobile Ad hoc Networks
Ash Mohammad Abbas, Tehzeeb Ahmed Abbasi · 2007
Identifying a maximal set of node-disjoint paths between a given source and a destination is a challenging task in mobile ad hoc networks. One cannot guarantee to identify the maximal set of node-disjoint paths in a single sequence of request-reply cycle. However, one can guarantee to identify the maximal set of node-disjoint paths in multiple attempts and in an incremental fashion. One may combine a protocol that tries to identify multiple node-disjoint paths in a single go with an incremental approach. In this paper, we present an improved version of an incremental protocol that is guaranteed to discover the maximal set of node-disjoint paths between a given source and a destination. We have analytically shown that our approach requires less number of route discoveries than that required by the existing incremental protocol. We have also discussed the scalability of the proposed approach.