Geographic routing without location information

  • Authors:

  • Ananth Rao;Sylvia Ratnasamy;Christos Papadimitriou;Scott Shenker;Ion Stoica

  • Affiliations:

  • University of California - Berkeley, CA;University of California - Berkeley, CA;University of California - Berkeley, CA;University of California - Berkeley, CA;University of California - Berkeley, CA

  • Venue:
  • Proceedings of the 9th annual international conference on Mobile computing and networking
  • Year:
  • 2003

Quantified Score

Hi-index 0.07

Visualization

Abstract

For many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e.g. GPSR) have been proposed to achieve this goal. These algorithms refer to nodes by their location, not address, and use those coordinates to route greedily, when possible, towards the destination. However, there are many situations where location information is not available at the nodes, and so geographic methods cannot be used. In this paper we define a scalable coordinate-based routing algorithm that does not rely on location information, and thus can be used in a wide variety of ad hoc and sensornet environments.