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

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

Fair multiuser channel allocation for OFDMA networks using Nash bargaining solutions and coalitions

Zhu Han, Zhu Ji, Liu, K.J. Ray·2005·IEEE Transactions on Communications

Abstract

In this paper, a fair scheme to allocate subcarrier, rate, and power for multiuser orthogonal frequency-division multiple-access systems is proposed. The problem is to maximize the overall system rate, under each user's maximal power and minimal rate constraints, while considering the fairness among users. The approach considers a new fairness criterion, which is a generalized proportional fairness based on Nash bargaining solutions and coalitions. First, a two-user algorithm is developed to bargain subcarrier usage between two users. Then a multiuser bargaining algorithm is developed based on optimal coalition pairs among users. The simulation results show that the proposed algorithms not only provide fair resource allocation among users, but also have a comparable overall system rate with the scheme maximizing the total rate without considering fairness. They also have much higher rates than that of the scheme with max-min fairness. Moreover, the proposed iterative fast implementation has the complexity for each iteration of only O(K/sup 2/Nlog/sub 2/N+K/sup 4/), where N is the number of subcarriers and K is the number of users.

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/tcomm.2005.852826

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

Show all 1 references

Cited by

See all 540

Metadata

Authors
Han, Z., Ji, Z., & Liu, K. J. R.
Venue
IEEE Transactions on Communications
Published
2005-08
Volume
53
Issue
8
Pages
1366-1376
ISSN
0090-6778 (ISSN-L)
OpenAlex
W2131431638
Cited by
540
References
1
FWCI
26.06
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: Fair multiuser channel allocation for OFDMA networks using Nash bargaining solutions and coalitions. https://app.cochat.ai/papers/10.1109/tcomm.2005.852826
The paper
Han, Z., Ji, Z., & Liu, K. J. R. (2005). Fair multiuser channel allocation for OFDMA networks using Nash bargaining solutions and coalitions. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2005.852826

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.