The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Performance of multihop wireless networks: shortest path is not enough
Abstract
Existing wireless ad hoc routing protocols typically find routes with the minimum hop-count. This paper presents experimental evidence from two wireless test-beds which shows that there are usually multiple minimum hop-count paths, many of which have poor throughput. As a result, minimum-hop-count routing often chooses routes that have significantly less capacity than the best paths that exist in the network. Much of the reason for this is that many of the radio links between nodes have loss rates low enough that the routing protocol is willing to use them, but high enough that much of the capacity is consumed by retransmissions. These observations suggest that more attention be paid to link quality when choosing ad hoc routes; the paper presents measured link characteristics likely to be useful in devising a better path quality metric.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ad hoc On-Demand Distance Vector (AODV) Routing
Perkins, C., Belding-Royer, E., & Das, S. (2003) · doi:10.17487/rfc3561 · Cited by 10,686
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190336 · Cited by 6,678
A performance comparison of multi-hop wireless ad hoc network routing protocols
Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y.-C., & Jetcheva, J. (1998) · Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/288235.288256 · Cited by 4,673
Wireless LAN medium access control (MAC) and physical layer (PHY) specifications
Piscataway, N. (1996) · Medical Entomology and Zoology · Cited by 2,999
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Perkins, C. E., & Bhagwat, P. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190336 · Cited by 2,914
Capacity of Ad Hoc wireless networks
Li, J., Blake, C., Couto, D. S. J. D., et al. (2001) · Proceedings of the 28th Annual International Conference on Mobile Computing And Networking · doi:10.1145/381677.381684 · Cited by 1,637
A comparison of mechanisms for improving TCP performance over wireless links
Balakrishnan, H., Padmanabhan, V. N., Seshan, S., & Katz, R. H. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650137 · Cited by 1,395
Signal stability-based adaptive routing (SSA) for ad hoc mobile networks
Dube, R., Rais, C. D., Wang, K.-Y., & Tripathi, S. K. (1997) · IEEE Personal Communications · doi:10.1109/98.575990 · Cited by 893
Proceedings of the IEEE International Conference on Communications
McLaughlin, S., Mulgrew, B., & Cowan, C. F. N. (1989) · Cited by 787
TULIP: A link-level protocol for improving TCP over wireless links
Parsa, C., & Garcia-Luna-Aceves, J. J. (2003) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.1999.796938 · Cited by 61
Cited by
Understanding packet delivery performance in dense wireless sensor networks
Zhao, J., & Govindan, R. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958493 · Cited by 1,267
Opportunistic routing in multi-hop wireless networks
Biswas, S., & Morris, R. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/972374.972387 · Cited by 673
Self-citationAntHocNet: an adaptive nature‐inspired algorithm for routing in mobile ad hoc networks
Di Caro, G., Ducatelle, F., & Gambardella, L. M. (2005) · European Transactions on Telecommunications · doi:10.1002/ett.1062 · Cited by 579
Exploiting heterogeneity in sensor networks
Yarvis, M., Kushafnagar, N., Singh, H., Rangarajan, A., Lin, Y., & Singh, S. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498318 · Cited by 491
Fairness in wireless networks: Issues, measures and challenges
Shi, H., Prasad, R. V., Onur, E., & Niemegeers, I. G. M. M. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.050113.00015 · Cited by 446
Metadata
- Authors
- De Couto, D. S. J., Aguayo, D., Chambers, B. A., & Morris, R.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2003-01
- Volume
- 33
- Issue
- 1
- Pages
- 83-88
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2076267162
- Cited by
- 370
- References
- 10
- FWCI
- 53.25
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Performance of multihop wireless networks: shortest path is not enough. https://app.cochat.ai/papers/10.1145/774763.774776
- The paper
- De Couto, D. S. J., Aguayo, D., Chambers, B. A., & Morris, R. (2003). Performance of multihop wireless networks: shortest path is not enough. ACM SIGCOMM Computer Communication Review. https://doi.org/10.1145/774763.774776
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.