An analytical framework for disjoint multipath routing in mobile ad hoc networks

Abstract

Design of disjoint multipath routing protocols in an ad hoc environment is a challenging task. In this paper, we discuss an analytical framework for disjoint multipath routing in mobile ad hoc networks. We analyze the probability that there exist k node disjoint paths between a pair of nodes. A major issue in the discovery of node disjoint paths is path diminution. We discuss the probability of path diminution in schemes commonly used to discover disjoint paths