articleSep 14, 2003Closed access

Geographic routing without location information

University of California, Berkeley

Indexed incrossref

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.

Citation impact

758
total citations
FWCI
42.91
Percentile
100%
References
30
Citations per year

Authors

5

Topics & keywords

Keywords
  • Computer science
  • Geographic routing
  • Computer network
  • Exploit
  • Scalability
  • Routing (electronic design automation)
  • Distributed computing
  • Wireless ad hoc network
No related works found for this paper.