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

  • Authors:
  • Fabian Kuhn;Roger Wattenhofer;Aaron Zollinger

  • Affiliations:
  • Microsoft Research, Mountain View, CA and Institute of Theoretical Computer Science, ETH Zurich, Zurich, Switzerland;Distributed Computing Group, Computer Engineering and Networks Laboratory, TIK, ETH Zurich, Zurich, Switzerland;Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.