Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing (2003)
Cached
Download Links
- [www.dcg.ethz.ch]
- [sigmobile.org]
- [www.sigmobile.org]
- DBLP
Other Repositories/Bibliography
by
Fabian Kuhn
,
Roger Wattenhofer
,
Aaron Zollinger
| Citations: | 149 - 13 self |
BibTeX
@MISC{Kuhn03worst-caseoptimal,
author = {Fabian Kuhn and Roger Wattenhofer and Aaron Zollinger},
title = {Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing},
year = {2003}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first ad-hoc algorithm to be both asymptotically optimal and average-case e#cient. For our simulations we identify a network density range critical for any routing algorithm. We study a dozen of routing algorithms and show that GOAFR outperforms other prominent algorithms, such as GPSR or AFR.
