Skip to main content
SpringerLink
Log in

Ad Hoc Routing

  • Chapter
Distributed Graph Algorithms for Computer Networks

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

Routing is the process of deciding on the optimal route between a source node and destination node in a network. A routing protocol is a collection of algorithms and procedures to perform routing. We have already investigated distributed routing algorithms in wired computer networks. Our focus in this chapter is on the routing protocols rather than algorithms for wireless ad hoc networks, and we will see that the routing in such networks have different requirements due to the mobility and energy limitations of the nodes.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Akkaya K, Younis M (2005) A survey on routing protocols for wireless sensor networks. Ad Hoc Netw 3:325–349

    Article  Google Scholar 

  2. Haas ZJ, Pearlman MR (1998) The Zone Routing Protocol (ZRP) for ad hoc networks. IETF Internet draft

    Google Scholar 

  3. Hedetniemi S, Liestman A (1988) A survey of gossiping and broadcasting in communication networks. Networks 18(4):319–349

    Article  MathSciNet  MATH  Google Scholar 

  4. Heinzelman W, Chandrakasan A, Balakrishnan H (2000) Energy-efficient communication protocol for wireless sensor networks. In: Proc Hawaii international conference system sciences

    Google Scholar 

  5. Intanagonwiwat C, Govindan R, Estrin D (2000) Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proc 6th annual ACM/IEEE international conference on mobile computing and networking (MobiCom’00)

    Google Scholar 

  6. Johnson DB, Maltz DA (1996) Dynamic source routing in ad hoc wireless networks. In: Imielinski T, Korth H (eds) Mobile computing. Kluwer Academic, Dordrecht, pp 153–181. Chapter 5

    Chapter  Google Scholar 

  7. Manjeshwar A, Agrawal DP (2001) TEEN: a protocol for enhanced efficiency in wireless sensor networks. In: Proc 1st international workshop on parallel and distributed computing, issues in wireless networks and mobile computing

    Google Scholar 

  8. Manjeshwar A, Agrawal DP (2002) APTEEN: a hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks. In: Proc 2nd international workshop on parallel and distributed computing, issues in wireless networks and mobile computing

    Google Scholar 

  9. Murthy S, Garcia-Luna-Aceves JJ (1996) An efficient routing protocol for wireless networks. Mob Netw Appl 1(2):183–197. Special issue on routing in mobile communication networks

    Article  Google Scholar 

  10. Park VD, Corson MS (1997) A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proc INFOCOM ’97, sixteenth annual joint conference of the IEEE computer and communications societies. Driving the information revolution. Proceedings IEEE, vol 3, pp 1405–1413

    Google Scholar 

  11. Park VD, Corson S (1997) Temporally-ordered routing algorithm (TORA), version 1, functional specification. IETF Internet draft

    Google Scholar 

  12. Perkins CE, Bhagwat P (1994) Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. Comput Commun Rev 24(4):234–244

    Article  Google Scholar 

  13. Perkins CE, Royer EM (1999) Ad hoc on demand distance vector routing, mobile computing systems and applications. In: Proc WMCSA ’99. Second IEEE workshop, pp 90–100

    Google Scholar 

  14. Roychowdhury S, Patra C (2010) Geographic adaptive fidelity and geographic energy aware routing in ad hoc routing. Int J Comput Commun Technol 1(2, 3, 4):309–313. Special issue

    Google Scholar 

  15. Xu Y, Heidemann J, Estrin D (2001) Geography-informed energy conservation for ad hoc routing. In: Proc 7th annual ACM/IEEE international conference on mobile computing and networking (MobiCom’01)

    Google Scholar 

  16. Yu Y, Estrin D, Govindan R (2001) Geographical and energy-aware routing: a recursive data dissemination protocol for wireless sensor networks. Technical report, UCLA-CSD TR-01-0023, UCLA Computer Science Department

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Department, Izmir University, Uckuyular, Izmir, Turkey

    K. Erciyes

Authors
  1. K. Erciyes
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag London

About this chapter

Cite this chapter

Erciyes, K. (2013). Ad Hoc Routing. In: Distributed Graph Algorithms for Computer Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-4471-5173-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-5173-9_16

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-5172-2

  • Online ISBN: 978-1-4471-5173-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation