Path set selection in mobile ad hoc networks

Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS-driven services. A promising technique for addressing this problem is to use multiple redundant paths between the source and the destination. However while multipath routing algorithms can tolerate network failures well their failure resilience only holds if the paths are selected judiciously. In particular the correlation between the failures of the paths in a redundant path set should be as small as possible. However selecting an optimal path set is an NP-complete problem. Heuristic solutions proposed in the literature are either too complex to be performed in real-time or too ineffective or both. This paper proposes a multipath routing algorithm called Disjoint Pathset Selection Protocol (DPSP) based on a novel heuristic that in nearly linear time on average picks a set of highly reliable paths. The convergence to a highly reliable path set is very fast and the protocol provides flexibility in path selection and routing algorithm. Furthermore DPSP is suitable for real-time execution with nearly no message exchange overhead and with minimal additional storage requirements. This paper presents evidence that multipath routing can mask a substantial number of failures in the network compared to single path routing protocols and that the selection of paths according to DPSP can be beneficial for mobile ad hoc networks since it dramatically reduces the rate of route discoveries.

[1]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[2]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[3]  Richard E. Barlow,et al.  Statistical Theory of Reliability and Life Testing: Probability Models , 1976 .

[4]  A. Rosenthal.  Computing the Reliability of Complex Networks , 1977 .

[5]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[6]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[7]  J. Scott Provan,et al.  The Complexity of Reliability Computations in Planar and Acyclic Graphs , 1986, SIAM J. Comput..

[8]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[9]  Charles J. Colbourn,et al.  Lower bounds on two-terminal network reliability , 1988, Discret. Appl. Math..

[10]  D. Shier.  Network Reliability and Algebraic Structures , 1991 .

[11]  Dexter Kozen,et al.  The Design and Analysis of Algorithms , 1991, Texts and Monographs in Computer Science.

[12]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[13]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[14]  Chai-Keong Toh,et al.  Associativity-Based Routing for Ad Hoc Mobile Networks , 1997, Wirel. Pers. Commun..

[15]  Satish K. Tripathi,et al.  Signal stability-based adaptive routing (SSA) for ad hoc mobile networks , 1997, IEEE Wirel. Commun..

[16]  Samir R. Das,et al.  On-demand multipath routing for mobile ad hoc networks , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[17]  Zygmunt J. Haas,et al.  Predictive distance-based mobility management for PCS networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[18]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[19]  Pietro Manzoni,et al.  Determination of Critical Transmission Range in Ad-Hoc Networks , 1999 .

[20]  Nitin H. Vaidya,et al.  Analysis of TCP Performance over Mobile Ad Hoc Networks , 1999, Wirel. Networks.

[21]  Zygmunt J. Haas,et al.  Determining the optimal configuration for the zone routing protocol , 1999, IEEE J. Sel. Areas Commun..

[22]  Zygmunt J. Haas,et al.  Improving the performance of query-based routing protocols through "diversity injection" , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[23]  Yih-Chun Hu,et al.  Caching strategies in on-demand routing protocols for wireless ad hoc networks , 2000, MobiCom '00.

[24]  Zygmunt J. Haas,et al.  On the impact of alternate path routing for load balancing in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[25]  Sung-Ju Lee,et al.  AODV-BR: backup routing in ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[26]  Sung-Ju Lee,et al.  Split multipath routing with maximally disjoint paths in ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[27]  Zygmunt J. Haas,et al.  Multipath routing in the presence of frequent topological changes , 2001, IEEE Commun. Mag..