Compass Routing on Geometric Networks (1999)
by
Evangelos Kranakis
,
Harvinder Singh
,
Jorge Urrutia
| Venue: | IN PROC. 11 TH CANADIAN CONFERENCE ON COMPUTATIONAL GEOMETRY |
| Citations: | 209 - 14 self |
BibTeX
@INPROCEEDINGS{Kranakis99compassrouting,
author = {Evangelos Kranakis and Harvinder Singh and Jorge Urrutia},
title = {Compass Routing on Geometric Networks},
booktitle = {IN PROC. 11 TH CANADIAN CONFERENCE ON COMPUTATIONAL GEOMETRY},
year = {1999},
pages = {51--54},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we study local routing algorithms on geometric networks. Formally speaking, suppose that we want to travel from a vertex s to a vertex t of a geometric network. A routing algorithm is called a local routing algorithm if it satisfies the following conditions:
Citations
| 338 | A Distance Routing Effect Algorithm for Mobility (DREAM - Basagni, Chlamtac, et al. - 1998 |
| 129 | Labelling and implicit routing in networks - Santoro, Khatib - 1985 |
| 66 | Designing networks with compact routing tables - Frederickson, Janardan - 1988 |
| 51 | Location-Aided Routing in mobile adhoc networks - Young, Vaidya - 2000 |
| 41 | Efficient message routing in planar networks - Frederickson, Janardan - 1989 |
| 30 | Interval routing schemes - Fraigniaud, Gavoille - 1998 |
| 18 | Geographic distance routing in ad hoc wireless networks - Lin, Stojmenovic - 1998 |
| 8 | Lower Bounds for Shortest Path Interval Routing - Gavoille, Perennes - 1997 |
| 6 | Routing on Cayley Networks - Kranakis, Krizanc, et al. - 1997 |
