[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

A Low Overhead Ad Hoc Routing Protocol with Route Recovery

  • Conference paper
Mobile Ad-hoc and Sensor Networks (MSN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3794))

Included in the following conference series:

Abstract

Many routing protocols have been designed for Ad Hoc networks. However, most of these kinds of protocols are not able to react fast enough to maintain routing. In the paper, we propose a new protocol that repairs the broken route by using information provided by nodes overhearing the main route communication. When links go down, our protocol intelligently replaces these failed links or nodes with backup ones that are adjacent to the main route. Experimental results show that our protocol finds a backup route around 50% of cases and achieve better (or as good) in term of the packet delivery rate than the major Ad Hoc routing protocols, but with much less overhead.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.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
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 103.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 129.99
Price includes VAT (United Kingdom)
  • 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. Broch, J., Johnson, D.B., Malt, D.: The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks. IETF, Internet Draft, draft-ietf-manet-dsr-00.txt (March 1998)

    Google Scholar 

  2. Broch, J., Malt, D.A., Johnson, D.B., Hu, Y.C., Jetcheva, J.: A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In: MOBICOM 1998, pp. 85–97 (1998)

    Google Scholar 

  3. Chiang, C.C.: Routing in Clustered Multi-Hop, Mobile Wireless Networks with Fading Channel. In: Proc. IEEE SICON, pp. 197–211 (1997)

    Google Scholar 

  4. Chung, C.M., Wang, Y.H., Chuang, C.C.: Ad hoc on-demand backup node setup routing protocol. In: Proceedings of 15th IEEE International Conference on Information Networking, pp. 933–937 (2001)

    Google Scholar 

  5. Corson, M.S., Park, V.D.: Temporally Ordered Routing Algorithm (TORA) version 1: Functional specification. Internet-Draft, draft-ietf-manet-tora-spec-00.txt (November 1997)

    Google Scholar 

  6. Das, S.R., Perkins, C.E., Royer, E.M.: ‘Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks. In: Proceeding INFOCOM, pp. 3–12 (2000)

    Google Scholar 

  7. Fall, K., Varadhan, K. (eds.): Ns notes and documentation, The VINT Project, UC Berkeley, LBL, USC/ISI, and Xerox PARC (November 1999), Available from http://www-mash.cs.berkeley.edu/ns/

  8. Haas, Z.J.: The Zone Routing Protocol (ZRP) for Ad-Hoc Networks. IETF Internet Draft, draft-zone-routing-protocol-00.txt (November 1997)

    Google Scholar 

  9. Jiang, M.H., Jan, R.H.: An efficient multiple paths routing protocol for ad-hoc networks. In: Proceedings of 15th IEEE International Conference on Information Networking, pp. 544–549 (2001)

    Google Scholar 

  10. Johnson, D.B., Maltz, D.A.: Dynamic source routing in Ad-Hoc wireless networks. In: Imielinske, T., Korth, H. (eds.) Mobile Computing, pp. 153–181. Kluwer, Dordrecht (1996)

    Chapter  Google Scholar 

  11. Maltz, D., Broch, J., Jetcheva, J., Johnson, D.: The effects of on-demand behavior in routing protocols for multi-hop wireless ad hoc networks. IEEE Journal on Selected Areas in Communication (1999) (to appear)

    Google Scholar 

  12. Murthy, S., Garcia-Luna-Aceves, J.J.: A routing protocol for packet radio networks. In: ACM MOBICOM, pp. 86–94 (1995)

    Google Scholar 

  13. Park, V.D., Corson, M.S.: A Highly Adaptive Distributed Routing Protocol for Mobile Ad Hoc Networks. In: Proceeding INFOCOM 1997, pp. 1405–1413 (1997)

    Google Scholar 

  14. Perkins, C.E.: Ad Hoc On Demand Distance Vector (AODV) Routing, IETF, Internet-Draft, draft-ietf-manet-aodv-00.txt (November 1997)

    Google Scholar 

  15. Perkins, C.E., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. In: ACM SIGCOMM 1994, pp. 234–244 (1994)

    Google Scholar 

  16. Perkins, C.E., Royer, E.M.: Ad-hoc On-demand Distance Vector routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp. 99–100 (1999)

    Google Scholar 

  17. Royer, E.M., Toh, C.-K.: A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks. IEEE Personal Communication, 46–55 (1999)

    Google Scholar 

  18. Toh, C.K.: Associativity Based Routing for Ad-Hoc Mobile Networks. Wireless Personal Communication 4(2), 103–139 (1997)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, C.W., Wu, TK., Cheng, R.H., Chen, P.T. (2005). A Low Overhead Ad Hoc Routing Protocol with Route Recovery. In: Jia, X., Wu, J., He, Y. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2005. Lecture Notes in Computer Science, vol 3794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599463_65

Download citation

  • DOI: https://doi.org/10.1007/11599463_65

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30856-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics