Abstract
In this paper we consider a multipath extension to the dynamic source routing (DSR) protocol proposed by Johnson and Maltz, an on-demand routing protocol for ad hoc wireless networks. This extension keeps two node-disjoint paths between the source and destination of a routing process without introducing extra overhead. Unlike other multipath extensions where node-disjoint paths are selected at the destination or at the reply phase, our approach generates two node-disjoint paths during the query phase of the route discovery process by restricting the way the query packet is flooded. Several optimization options are also considered. Simulation is conducted to determine the success rate of finding node-disjoint paths.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Chen, P. Druschel and D. Subramanian, An efficient multipath forwarding method, in: Proc. of IEEE INFORCOM'98, March 1998, pp. 1418–1425.
I. Cidon, R. Rom and Y. Shavitt, Analysis of multi-path routing, IEEE/ACM Transactions on Networking 7(6) (1999) 885–896.
D.J. Goodman, Wireless Personal Communications Systems (Addison-Wesley, Reading, MA, 1997).
C. Hedrick, Routing information protocol, Internet Request for Comments RFC 1058 (June 1988).
A. Jean-Marie and L. Gun, Parallel queues with resequencing, Journal of ACM 40(5) (1993) 1188–1208.
D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, in: Mobile Computing, eds. T. Imielinski and H. Korth (Kluwer Academic Publishers, 1996).
S.J. Lee and M. Gerla, AODV-BR: Backup routing in ad hoc networks, in: Proc. of IEEE WCNC 2000, September 2000, pp. 1311–1316.
S.J. Lee and M. Gerla, Split multipath routing with maximally disjoint paths in ad hoc networks, in: Proc. of ICC, 2001, pp. 3201–3205.
J.M. McQuillan, I. Richer and E.C. Rosen, The new routing algorithm for ARPANET, IEEE Transactions on Communications 28(5) (1980) 711–719.
J. Moy, OSPF version 2, Internet Request for Comments RFC 1247 (July 1991).
A. Nasipuri and S.R. Das, On-demand multipath routing for mobile ad hoc networks, in: Proc. of IEEE INFOCOM'99, 1999, pp. 64–70.
R. Ogier, V. Rutenburg and B. Shacham, Distributed algorithms for computing shortest pairs of disjoint paths, IEEE Transactions on Information Theory 39(2) (1993) 443–455.
V.D. Park and M.S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: Proc. of IEEE INFOCOM'97, 1997, pp. 1405–1413.
M.R. Pearlman et al., On the impact of alternate path routing for load balancing in mobile ad hoc networks, in: Proc. of MobiHoc'2000, 2000, pp. 3–10.
C.E. Perkins, Mobile IP: Design Principles and Practices (Addison Wesley, Reading, MA, 1997).
D. Sidhu, R. Nair and S. Abdallah, Finding disjoint paths in networks, in: Proc. of ACM SIGCOMM' 91, September 1991, pp. 41–51.
N. Taft-Plotkin, B. Bellur and R. Ogier, Quality-of-service routing using maximally disjoint paths, in: Proc. of IEEE IWQoS'99, June 1999, pp. 119–128.
A. Tisrigos and Z.J. Haas, Multipath routing in the presence of frequent topological changes, IEEE Communications Magazine (November 2001), 132–138.
L. Wang, L.F. Zheng, Y.T. Shu, M. Dong and O.W.W. Yang, Multipath source routing in ad hoc networks, in: Proc. of Canadian Conf. Elec. Comp. Eng., May 2000, pp. 479–483.
K. Wu and J. Harms, Multipath routing for mobile ad hoc networks, Journal of Communications and Networks 4(1) (2002) 48–58.
W.T. Zaumen and J.J. Garcia-Luna-Aceves, Shortest multipath routing using generalized diffusing computations, in: Proc. of IEEE INFOCOM'98, 1998.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wu, J. An Extended Dynamic Source Routing Scheme in Ad Hoc Wireless Networks. Telecommunication Systems 22, 61–75 (2003). https://doi.org/10.1023/A:1023478518008
Issue Date:
DOI: https://doi.org/10.1023/A:1023478518008