skip to main content
10.1145/1023663.1023704acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
Article

A reliable node-disjoint multipath routing with low overhead in wireless ad hoc networks

Published:04 October 2004Publication History

ABSTRACT

Wireless ad hoc networks are characterized by the use of wireless links with limited bandwidth, dynamically varying network topology and multi-hop connectivity. AODV and DSR are the two most widely studied on-demand ad hoc routing protocols. Previous work has shown some limitations of the two protocols: whenever there is a link break on the active route, each of the two routing protocols has to invoke a route discovery process. This leads to increase in both delay and control overhead as well as decrease in packet delivery ratio. To alleviate these problems, we modify and extend AODV to include the path accumulation feature of DSR in route request/reply packets so that much lower route overhead is employed to discover multiple node-disjoint routing paths. The extended AODV is called Reliable Node-Disjoint Multipath Routing Protocol (NDMR), which has two novel aspects compared to the other on-demand multipath protocols: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. Simulation results show that performance of NDMR is much better than that of AODV and DSR.

References

  1. Charles E. Perkings, Elizabeth M. Belding-Royer, Samir R.Das, Ad Hoc On-Demand Distance Vector (AODV) Routing, http://www.ietf.org/internet-drafts/draft-ietf-manet -aodv-13.txt, IETF Internet draft, Feb 2003]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J.Broch, D.Johnson, and D. Maltz, "The Dynamic Source Protocol for Mobile Ad hoc Networks", http://www.ietf. org/internetdrafts/draft-ieft-manet-dsr-03.txt, IETF Internet draft (work in progress), Oct.1999.]]Google ScholarGoogle Scholar
  3. Charles E. Perkings, Elizabeth M.Royer and Samir R.Das, Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks, IEEE Personal Communications, Feb 2001.]]Google ScholarGoogle Scholar
  4. S.J.Lee and M.Gerla, Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks, In Proceedings of the IEEE ICC, pages 3201--3205, 2001.]]Google ScholarGoogle Scholar
  5. Nasipuri, R. Castaneda, and S.R. Das, Performance of Multipath Routing for On-demand protocols in Mobile Ad Hoc Networks, ACM Mobile Networks and Applications (MONET), 6(4):339--349, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Mahesh K. Marina, and Samir R. Das, On-demand Multipath Distance Vector Routing in Ad Hoc Networks. In Proceedings of the 9th IEEE International Conference on Network Protocols (ICNP), November 2001]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Ye, Z., Krishnamurthy, S. V., Tripathi, S.K., A Framework for Reliable Routing in Mobile Ad Hoc Networks. IEEE INFOCOM (2003)]]Google ScholarGoogle Scholar
  8. OPNET Technologies, Inc. <http://www.opnet.com/>]]Google ScholarGoogle Scholar

Index Terms

  1. A reliable node-disjoint multipath routing with low overhead in wireless ad hoc networks

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              MSWiM '04: Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
              October 2004
              334 pages
              ISBN:1581139535
              DOI:10.1145/1023663

              Copyright © 2004 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 4 October 2004

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              MSWiM '04 Paper Acceptance Rate45of121submissions,37%Overall Acceptance Rate398of1,577submissions,25%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader