Multipath Routing to Provide Quality of Service in Mobile Ad Hoc Networks

  • L. M. Patnaik
  • Anand Suvernkar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2571)

Abstract

Because of frequent topology changes and node failures, providing quality of service routing in mobile ad hoc networks becomes a very critical issue. The quality of service can be provided by routing the data along multiple paths. Such selection of multiple paths helps to improve reliability and load balancing, reduce delay introduced due to route rediscovery in presence of path failures. There are basically two issues in such a multipath routing .Firstly, the sender node needs to obtain the exact topology information. Since the nodes are continuously roaming, obtaining the exact topology information is a tough task. Here, we propose an algorithm which constructs highly accurate network topology with minimum overhead. The second issue is that the paths in the path set should offer best reliability and network throughput. This is achieved in two ways 1) by choice of a proper metric which is a function of residual power, traffic load on the node and in the surrounding medium 2) by allowing the reliable links to be shared between different paths. Subject Descriptors General Terms. Algorithms, Performance, Simulation

Keywords

Mobile ad hoc network IEEE 802.11 MAC standard dynamic source routing protocol network throughput energy consumption link sharing control overhead reduction 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P. Papaadmitratos, Z. J. Hass and E. Gon. “Path set selection in mobile ad hoc networks”. Proceedings of the Third International Symposium on Mobile Ad Hoc Networking and Computing, June 9–11 MOBIHOC, ACM 2002.Google Scholar
  2. [2]
    K. Wu and J. Harms. “On demand multipath routing for mobile ad hoc networks”. 21–22 Feb2001 OVE.Google Scholar
  3. [3]
    D. Eppstain and J.C. Siam. “Finding k-shortest paths”. 1998 Society For Industrial and Applied Mathematics vol. 28, No. 2, pp. 652–673.Google Scholar
  4. [4]
    Bob O'Hara and Al Petric. “IEEE 802.11 handbook, A designer’s companion”. IEEE Press,1999.Google Scholar
  5. [5]
    Bryan P. Crow, Indra Widjaja, Jeong Geun Kim and Prescott T Sakai. “IEEE 802.11 Wireless local area networks”, IEEE Communication magazine, September,1997.Google Scholar
  6. [6]
    J. Broch, D. Johnson and D. Maltz. “Dynamic source routing protocol for mobile ad hoc networks”. http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-01.txt,Dec 1998, IETF Internet Draft.
  7. [7]
    A. Nasipuri and S. R. Das. “On demand multipath routing for mobile ad hoc networks”. Proceedings of the 8th Int Conf on Computer Communications and Networks, Boston, October, 1999.Google Scholar
  8. [8]
    S. J. Lee and M. Gerla. “Split multipath routing with maximally disjoint paths in ad hoc networks”. Proceedings of ICC 2001, Helsinki, Finland,June 2001.Google Scholar
  9. [9]
    M.R. Pearlman, Z.J. Haas, P. Sholander, and S.S. Tabrizi.“On the impact of alternate routing in mobile ad hoc networks”. Proceedings of first workshop on mobile ad hoc networking and computing (Mobihoc 2000), Boston, M.A. Aug. 2000.Google Scholar
  10. [10]
    D.B. Johnson and D.A. Maltz. “Dynamic source routing in ad hoc wireless networks”. Mobile Computing, pages 153–181,1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • L. M. Patnaik
    • 1
  • Anand Suvernkar
    • 1
  1. 1.Microprocessor Applications Laboratory Department of Computer Science and AutomationIndian Institute Of ScienceBangalore

Personalised recommendations