Skip to main content
SpringerLink
Log in

Geographic Routing

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

Years and Authors of Summarized Original Work

  • 2003; Kuhn, Wattenhofer, Zollinger

Problem Definition

Geographic routing is a type of routing particularly well suited for dynamic ad hoc networks. Sometimes also called directional, geometric, location-based, or position-based routing, it is based on two principal assumptions. First, it is assumed that every node knows its own and its network neighbors' positions. Second, the source of a message is assumed to be informed about the position of the destination. Geographic routing is defined on a Euclidean graph, that is a graph whose nodes are embedded in the Euclidean plane. Formally, geographic ad hoc routing algorithms can be defined as follows:

Definition 1 (Geographic Ad Hoc Routing Algorithm)

Let \( { G=(V,E) } \) be a Euclidean graph. The task of a geographic ad hoc routing algorithm \( { \mathcal{A} } \) is to transmit a message from a source \( { s\in V } \) to a destination \( { t\in V } \) by sending packets over the edges of G...

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.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

Recommended Reading

  1. Barrière L, Fraigniaud P, Narayanan L (2001) Robust position-based routing in wireless ad hoc networks with unstable transmission ranges. In: Proceedings of the 5th international workshop on discrete algorithms and methods for mobile computing and communications (DIAL-M). ACM Press, New York,pp 19–27

    Google Scholar 

  2. Bose P, Brodnik A, Carlsson S, Demaine E, Fleischer R, López-Ortiz A, Morin P, Munro J (2000) Online routing in convex subdivisions. In: International symposium on algorithms and computation (ISAAC). LNCS, vol 1969. Springer, Berlin/New York, pp 47–59

    Google Scholar 

  3. Bose P, Morin P (1999) Online routing in triangulations. In: Proceedings of 10th internatrional symposium on algorithms and computation (ISAAC). LNCS, vol 1741. Springer, Berlin, pp 113–122

    Google Scholar 

  4. Bose P, Morin P, Stojmenovic I, Urrutia J (1999) Routing with guaranteed delivery in ad hoc wireless networks. In: Proceedings of the 3rd international workshop on discrete algorithms and methods for mobile computing and communications (DIAL-M), pp 48–55

    Google Scholar 

  5. Datta S, Stojmenovic I, Wu J (2002) Internal node and shortcut based routing with guaranteed delivery in wireless networks. In: Cluster computing, vol 5. Kluwer Academic, Dordrecht, pp 169–178

    Google Scholar 

  6. Finn G (1987) Routing and addressing problems in large metropolitan-scale internetworks. Technical report ISI/RR-87–180, USC/ISI

    Google Scholar 

  7. Flury R, Wattenhofer R (2006) MLS: an efficient location service for mobile ad hoc networks. In: Proceedings of the 7th ACM international symposium on mobile ad-hoc networking and computing (MobiHoc), Florence

    Google Scholar 

  8. Fonseca R, Ratnasamy S, Zhao J, Ee CT, Culler D, Shenker S, Stoica I (2005) Beacon vector routing: scalable point-to-point routing in wireless sensornets. In: 2nd symposium on networked systems design & implementation (NSDI), Boston

    Google Scholar 

  9. Gao J, Guibas L, Hershberger J, Zhang L, Zhu A (2001) Geometric spanner for routing in mobile networks. In: Proceedings of 2nd ACM international symposium on mobile ad-hoc networking and computing (MobiHoc), Long Beach

    Google Scholar 

  10. Hou T, Li V (1986) Transmission range control in multihop packet radio networks. IEEE Trans Commun 34:38–44

    Article  Google Scholar 

  11. Karp B, Kung H (2000) GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of 6th annual international conference on mobile computing and networking (MobiCom),pp 243–254

    Google Scholar 

  12. Kim YJ, Govindan R, Karp B, Shenker S (2005) Geographic routing made practical. In: Proceedings of the second USENIX/ACM symposium on networked system design and implementation (NSDI 2005), Boston

    Google Scholar 

  13. Kim YJ, Govindan R, Karp B, Shenker S (2005) On the pitfalls of geographic face routing. In: Proceedings of the ACM joint workshop on foundations of mobile computing (DIALM-POMC), Cologne

    Google Scholar 

  14. Kranakis E, Singh H, Urrutia J (1999) Compass routing on geometric networks. In: Proceedings of 11th Canadian conference on computational geometry, Vancouver, pp 51–54

    Google Scholar 

  15. Kuhn F, Wattenhofer R, Zhang Y, Zollinger A (2003) Geometric routing: of theory and practice. In: Proceedings of the 22nd ACM symposium on the principles of distributed computing (PODC)

    Google Scholar 

  16. Kuhn F, Wattenhofer R, Zollinger A (2002) Asymptotically optimal geometric mobile ad-hoc routing. In: Proceedings of 6th international workshop on discrete algorithms and methods for mobile computing and communications (Dial-M). ACM, New York, pp 24–33

    Google Scholar 

  17. Kuhn F, Wattenhofer R, Zollinger A (2003) Ad-hoc networks beyond unit disk graphs. In: 1st ACM joint workshop on foundations of mobile computing (DIALM-POMC), San Diego

    Google Scholar 

  18. Kuhn F, Wattenhofer R, Zollinger A (2003) Worst-case optimal and average-case efficient geometric ad-hoc routing. In: Proceedings of 4th ACM international symposium on mobile ad-hoc networking and computing (MobiHoc)

    Google Scholar 

  19. Leong B, Liskov B, Morris R (2006) Geographic routing without planarization. In: 3rd symposium on networked systems design & implementation (NSDI), San Jose

    Google Scholar 

  20. Leong B, Mitra S, Liskov B (2005) Path vector face routing: geographic routing with local face information. In: 13th IEEE international conference on network protocols (ICNP), Boston

    Google Scholar 

  21. Takagi H, Kleinrock L (1984) Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans Commun 32:246–257

    Article  Google Scholar 

  22. Urrutia J (2002) Routing with guaranteed delivery in geometric and wireless networks. In: Stojmenovic I (ed) Handbook of wireless networks and mobile computing, ch. 18. Wiley, Hoboken, pp. 393–406

    Google Scholar 

  23. Wattenhofer M, Wattenhofer R, Widmayer P (2005) Geometric routing without geometry. In: 12th colloquium on structural information and communication complexity (SIROCCO), Le Mont Saint-Michel

    Google Scholar 

  24. Zollinger A (2005) Networking unleashed: geographic routing and topology control in ad hoc and sensor networks. PhD thesis, ETH Zurich, Switzerland Dissertation, ETH 16025

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA, USA

    Aaron Zollinger

Authors
  1. Aaron Zollinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aaron Zollinger .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Zollinger, A. (2016). Geographic Routing. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_164

Download citation

Publish with us

Policies and ethics

Search

Navigation