Geometric Routing
Geometric Routing is a computational method in geometric graph theory that determines paths between nodes based on their embedded geometric coordinates, distinguished by its reliance on spatial positions rather than abstract adjacency to guide route selection.
64
Publications
5.4K
Citations
153
Authors
82
Institutions
Publications per year
2017–2026
2
64
Compass routing on geometric networks.
Evangelos Kranakis, Harvinder Singh, Jorge Urrutia · 1999 · 850 citations
Fabian Kühn, Rogert Wattenhofer, Yan Zhang et al. · 2003 · 662 citations
The impact of DHT routing geometry on resilience and proximity
Krishna P. Gummadi, R. Gummadi, Steven D. Gribble et al. · 2003 · 574 citations
Asymptotically optimal geometric mobile ad-hoc routing
Fabian Kühn, Rogert Wattenhofer, Aaron Zollinger · 2002 · 265 citations
1–5 of 64
153
6
h-index
6
h-index
5
h-index
5
h-index
3
h-index
1–5 of 153
82
ETH Zurich
Zurich, Switzerland
7 h-index
23 publications
6.4K citations

Carleton University
Ottawa, Canada
4 h-index
10 publications
318 citations
University of California, Berkeley
Berkeley, United States
3 h-index
4 publications
996 citations
Binghamton University
Binghamton, United States
3 h-index
6 publications
154 citations
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
4 publications
123 citations
Florida Atlantic University
Boca Raton, United States
3 h-index
6 publications
212 citations

Concordia University
Montreal, Canada
2 h-index
6 publications
165 citations
University at Buffalo, State University of New York
Buffalo, United States
2 h-index
3 publications
49 citations
1–8 of 82
3 publications · 272 citations
3
h-index
2 publications · 25 citations
2
h-index
2 publications · 50 citations
2
h-index
TON · 2 publications · 172 citations
2
h-index
1 publications · 61 citations
1
h-index
1–5