Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
A Hybrid Multipath Routing in Mobile ad hoc Networks
PRDC '06 Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing
Guaranteed on-demand discovery of node-disjoint paths in ad hoc networks
Computer Communications
Mitigating path diminution in disjoint multipath routing for mobile ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
On the probability of finding non-interfering paths in wireless multihop networks
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Modeling path duration distributions in MANETs and their impact on reactive routing protocols
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.01 |
In this paper, we analyse a routing protocol that identifies a maximal set of node-disjoint paths between a given source and a destination in multiple attempts using an approach that is a combination of a single-go routing protocol and an incremental protocol. We prove that doing so preserves the guarantee inherited from the incremental protocol to discover a maximal set of node-disjoint paths. In our analysis, we focus on the computational and communication overheads incurred in identifying node-disjoint paths and the time after which all routes identified are expected to fail.