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

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Rate performance objectives of multihop wireless networks

Open access
Radunovic, B., Le Boudec, J.Y. · 2004 · IEEE Transactions on Mobile Computing

Abstract

We consider the question of what performance metric to maximize when designing ad hoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery-lifetime and power constraints. Commonly used metrics are total capacity (in the case of cellular networks) and transport capacity (in the case of ad hoc networks). However, it is known in traditional wired networking that maximizing total capacity conflicts with fairness, and this is why fairness-oriented rate allocations, such as max-min fairness, are often used. We review this issue for wireless ad hoc networks. Indeed, the mathematical model for wireless networks has a specificity that makes some of the findings different. It has been reported in the literature on ultra wide band that gross unfairness occurs when maximizing total capacity or transport capacity, and we confirm by a theoretical analysis that this is a fundamental shortcoming of these metrics in wireless ad hoc networks, as it is for wired networks. The story is different for max-min fairness. Although it is perfectly viable for a wired network, it is much less so in our setting. We show that, in the limit of long battery lifetimes, the max-min allocation of rates always leads to strictly equal rates, regardless of the MAC layer, network topology, channel variations, or choice of routes and power constraints. This is due to the "solidarity" property of the set of feasible rates. This results in all flows receiving the rate of the worst flow, and leads to severe inefficiency. We show numerically that the problem persists when battery-lifetime constraints are finite. This generalizes the observation reported in the literature that, in heterogeneous settings, 802.11 allocates the worst rate to all stations, and shows that this is inherent to any protocol that implements max-min fairness. Utility fairness is an alternative to max-min fairness, which approximates rate allocation performed by TCP in the Internet. We analyze by numerical simulations different utility functions and we show that the proportional fairness of rates or transport rates, a particular instance of utility-based metrics, is robust and achieves a good tradeoff between efficiency and fairness, unlike total rate or maximum fairness. We thus recommend that metrics for the rate performance of mobile ad hoc networking protocols be based on proportional fairness.

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.1109/tmc.2004.45

Cites

1 of 1 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

Cited by

See all 207

Metadata

Authors
Radunovic, B., & Le Boudec, J. Y.
Venue
IEEE Transactions on Mobile Computing
Published
2004-10
Volume
3
Issue
4
Pages
334-349
ISSN
1536-1233 (ISSN-L)
OpenAlex
W2113966777
Cited by
207
References
1
FWCI
21.58
Type
journal article
Language
en
Open access
green

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

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.