Comparison of routing metrics for static multi-hop wireless networks (2004)
Cached
Download Links
- [cs.ucsb.edu]
- [research.microsoft.com]
- [www.research.microsoft.com]
- [www.research.microsoft.com]
- [www.research.microsoft.com]
- [www.cs.ucsb.edu]
- [www.sigcomm.org]
- [research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- [www.acm.org]
- [acm.org]
- [www-2.cs.cmu.edu]
- [research.microsoft.com]
- [www.cs.cuhk.hk]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In ACM SIGCOMM |
| Citations: | 157 - 2 self |
BibTeX
@INPROCEEDINGS{Draves04comparisonof,
author = {Richard Draves and Jitendra Padhye and Brian Zill},
title = {Comparison of routing metrics for static multi-hop wireless networks},
booktitle = {In ACM SIGCOMM},
year = {2004},
pages = {133--144}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to poor throughput. A routing algorithm can select better paths by explicitly taking the quality of the wireless links into account. In this paper, we conduct a detailed, empirical evaluation of the performance of three link-quality metrics— ETX, per-hop RTT, and per-hop packet pair—and compare them against minimum hop count. We study these metrics using a DSR-based routing protocol running in a wireless testbed. We find that the ETX metric has the best performance when all nodes are stationary. We also find that the per-hop RTT and per-hop packet-pair metrics perform poorly due to self-interference. Interestingly, the hop-count metric outperforms all of the link-quality metrics in a scenario where the sender is mobile.
