Skip to main content

A Correlated Load Aware Routing Protocol in Mobile Ad Hoc Networks

  • Conference paper
Universal Multiservice Networks (ECUMN 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3262))

Included in the following conference series:

Abstract

In this paper, we investigate the load distribution in ad hoc networks for reducing the possibility of power depletion and queuing delay at a node with heavy load environments. We examine the efficiency of dominant ad hoc routing protocols from a point of load balancing. Based on the results from various simulations, we design a new Correlated Load-Aware Routing (CLAR) protocol that considers the traffic load, through and around neighboring nodes, as the primary route selection metric. Simulation results show that CLAR outperforms other popular protocols and is better suited for the heady load networks with low mobility.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Perkins, C.E.: Ad hoc networking. Addison Wesley, Reading (2001)

    Google Scholar 

  2. Lee, S.J., Gerla, M.: Dynamic Load-Aware Routing in Ad hoc Networks. In: The Proceeding of ICC 2001, Helsinki, Finland (June 2001)

    Google Scholar 

  3. Hassanein, H., Zhou, A.: Routing with Load Balancing in Wireless Ad Hoc Networks. In: Proc. ACM MSWiM, Rome, Italy (July 2001)

    Google Scholar 

  4. Wu, K., Harms, J.: Load-Sensitive Routing for Mobile Ad Hoc Networks. In: Proc. IEEE ICCCN 2001, Scottsdale, AZ (October 2001)

    Google Scholar 

  5. Song, J.H., Wong, V.W.S., Leung, V.C.M.: Load-Aware On-demand Routing (LAOR) Protocol for Mobile Ad-hoc networks. In: Proc. IEEE VTC Spring 2003, Jeju, Korea (April 2003)

    Google Scholar 

  6. Floyd, S., Jacobson, V.: Random early detection gateways for congestion avoidance. Networking, IEEE/ACM Transactions on 1 (August 1993)

    Google Scholar 

  7. Allman, M., Paxson, V., Stevens, W.: TCP Congestion Control. RFC2581 in IETF (April 1999)

    Google Scholar 

  8. Perkins, C.E., Royer, E.M., Das, S.R.: Ad hoc On-Demand Distance Vector (AODV) Routing, IETF RFC3651 (July 2003)

    Google Scholar 

  9. The VINT Project, The network simulator – ns-2, Available at http://www.isi.edu/nsnam/ns/

  10. Lundgren, H.: AODV-UU. Uppsala University, Sweden, http://user.it.uu.se/~enrikl/aodv/index.shtml

  11. Johnson, D.B., Maltz, D.A., Hu, Y.-C.: Dynamic source routing in ad hoc wireless networks. draft-ietf-manet-dsr-09.txt, Internet Draft in IETF (April 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jung, JW., Choi, D., Kwon, K., Chong, I., Lim, K., Kahng, HK. (2004). A Correlated Load Aware Routing Protocol in Mobile Ad Hoc Networks. In: Freire, M.M., Chemouil, P., Lorenz, P., Gravey, A. (eds) Universal Multiservice Networks. ECUMN 2004. Lecture Notes in Computer Science, vol 3262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30197-4_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30197-4_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23551-4

  • Online ISBN: 978-3-540-30197-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics