iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-3-540-24680-0_70
Cutting Down Routing Overhead in Mobile Ad Hoc Networks | SpringerLink
Skip to main content

Cutting Down Routing Overhead in Mobile Ad Hoc Networks

  • Conference paper
Grid and Cooperative Computing (GCC 2003)

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

Included in the following conference series:

  • 329 Accesses

Abstract

An ad hoc network is a P2P network, formed by a collection of wireless mobile hosts requiring no fixed infrastructure. Many on-demand routing algorithms proposed for such kind of networks incur much routing overhead during the route discovery process. This paper presents Band Zone Route Discovery, a new route discovery scheme to cut down the routing overhead. The basic idea of the proposed scheme is to use cached routes to limit the range of route discovery. Simulation comparisons show that the new scheme can reduce the number of routing packets needed in the route discovery process.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad Hoc Wireless Networks. In: Mobile Computing, pp. 53–181. Kluwer Academic Publishers, Boston (1996)

    Google Scholar 

  2. Perkins, C., Belding-Royer, E.M., Das, S.R.: Ad Hoc On-Demand Distance Vector (AODV) Routing. Internet Draft, draft-ietf-manet-aodv-11.txt (June 2002)

    Google Scholar 

  3. Hass, Z.J., Pearlman, M.R.: The performance of Query Control Schemes for the Zone Routing Protocol. IEEE/ACM Transactions on Networking 9(4), 427–438 (2001)

    Google Scholar 

  4. Hu, Y.-C., Johnson, D.B.: Caching Strategies in On-Demand Routing Protocols for Wireless Ad Hoc Networks. In: Proc. of ACM MobiCom 2000, Boston, MA (August 2000)

    Google Scholar 

  5. Lim, H., Kim, C.: Flooding in Wireless ad hoc networks. Computer Communications 24, 353–363 (2001)

    Article  Google Scholar 

  6. Fall, K., Varadhan, K. (eds.): ns Manual, http://www.isi.edu/nsnam/ns/ns-documentation

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

Zhong, J., Huang, S. (2004). Cutting Down Routing Overhead in Mobile Ad Hoc Networks. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24680-0_70

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-24680-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics