Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 370

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

De Couto, Douglas S. J., Aguayo, Daniel, Chambers, Benjamin A., Morris, Robert · 2003 · ACM SIGCOMM Computer Communication Review

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/774763.774776

Cites

10 of 10 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 10 references

Cited by

See all 370

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.