NSDI '05 Abstract
Geographic Routing Made Practical
Young-Jin Kim and Ramesh Govindan, University of Southern California;
Brad Karp, Intel Research/Carnegie Mellon University; Scott Shenker,
University of California, Berkeley/ICSI
Geographic routing has been widely hailed as the most promising
approach to generally scalable wireless routing. However, the
correctness of all currently proposed geographic routing algorithms
relies on idealized assumptions
about radios and their resulting connectivity graphs.
We use testbed measurements to show that these
idealized assumptions are grossly violated by real radios, and that
these violations cause persistent failures in geographic routing,
even on static topologies.
Having identified this problem, we then fix it by proposing the
Cross-Link Detection Protocol (CLDP), which enables provably correct
geographic routing on arbitrary connectivity graphs. We
confirm in simulation and further testbed measurements that CLDP
is not only correct but practical: it incurs low overhead, exhibits
low path stretch, always succeeds in real, static wireless networks,
and converges quickly after topology changes.
- View the full text of this paper in HTML and PDF.
Until May 2005, you will need your USENIX membership identification in order to access the full papers. The Proceedings are published as a collective work, © 2005 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.