Abstract
The one type of routing in ad hoc and sensor networks that currently appears to be most amenable to algorithmic analysis is geographic routing. This chapter contains an introduction to the problem field of geographic routing, presents a specific routing algorithm based on a synthesis of the greedy forwarding and face routing approaches, and provides an algorithmic analysis of the presented algorithm from both a worst-case and an average-case perspective.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Zollinger, A. (2007). Geographic Routing. In: Wagner, D., Wattenhofer, R. (eds) Algorithms for Sensor and Ad Hoc Networks. Lecture Notes in Computer Science, vol 4621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74991-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-74991-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74990-5
Online ISBN: 978-3-540-74991-2
eBook Packages: Computer ScienceComputer Science (R0)