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

The DOI matches its Crossref record.

Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks

Open access
Chaporkar, Prasanna, Kar, Koushik, Luo, Xiang, Sarkar, Saswati·2008·IEEE Transactions on Information Theory

Abstract

The question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time, is addressed in this paper. It is shown that a simple distributed scheduling strategy, maximal scheduling, attains a guaranteed fraction of the maximum throughput region in arbitrary wireless networks. The guaranteed fraction depends on the ldquointerference degreerdquo of the network, which is the maximum number of transmitter-receiver pairs that interfere with any given transmitter-receiver pair in the network and do not interfere with each other. Depending on the nature of communication, the transmission powers and the propagation models, the guaranteed fraction can be lower-bounded by the maximum link degrees in the underlying topology, or even by constants that are independent of the topology. The guarantees are tight in that they cannot be improved any further with maximal scheduling. The results can be generalized to end-to-end multihop sessions. Finally, enhancements to maximal scheduling that can guarantee fairness of rate allocation among different sessions, are discussed.

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/tit.2007.913537

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.

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

Cited by

See all 253

Metadata

Authors
Chaporkar, P., Kar, K., Luo, X., & Sarkar, S.
Venue
IEEE Transactions on Information Theory
Published
2008-02
Volume
54
Issue
2
Pages
572-594
ISSN
0018-9448 (ISSN-L)
OpenAlex
W2116071440
Cited by
253
References
0
FWCI
31.38
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks. https://app.cochat.ai/papers/10.1109/tit.2007.913537
The paper
Chaporkar, P., Kar, K., Luo, X., & Sarkar, S. (2008). Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2007.913537

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.