Geometric spanners for routing in mobile networks

Jie Gao, Leonidas J. Guibas, John Hershberger, Li Zhang, An Zhu

Research output: Contribution to journalArticlepeer-review

87 Scopus citations


We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: 1) it is planar; 2) between any two graph nodes there exists a path whose length, whether measured in terms of topological or Euclidean distance, is only a constant times the minimum length possible; and 3) the graph can be maintained efficiently in a distributed manner when the nodes move around. Furthermore, each node only needs constant time to make routing decisions. We show by simulation that the RDG outperforms previously proposed routing graphs in the context of the Greedy perimeter stateless routing (GPSR) protocol. Finally, we investigate theoretical bounds on the quality of paths discovered using GPSR.

Original languageEnglish (US)
Pages (from-to)174-185
Number of pages12
JournalIEEE Journal on Selected Areas in Communications
Issue number1
StatePublished - Jan 2005
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering


  • Geographical routing
  • Spanners
  • Wireless ad hoc networks


Dive into the research topics of 'Geometric spanners for routing in mobile networks'. Together they form a unique fingerprint.

Cite this