Location of Repository

An algorithmic approach to geographic routing in ad hoc and sensor networks

By Fabian Kuhn, Roger Wattenhofer and Aaron Zollinger

Abstract

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 paper 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. Index Terms—Algorithmic analysis, routing, stretch, wireless networks

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.191.222
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://dcg.ethz.ch/publication... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.