The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Fair multiuser channel allocation for OFDMA networks using Nash bargaining solutions and coalitions
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.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Microwave Mobile Communications
Jakes, W. C. (1994) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470545287 · Cited by 9,747
(2006) · Choice Reviews Online · doi:10.5860/choice.43-4686 · Cited by 8,128
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Charging and rate control for elastic traffic
Kelly, F. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080106 · Cited by 2,936
Multiuser OFDM with adaptive subcarrier, bit, and power allocation
Wong, C. Y., Cheng, R. S., Lataief, K. B., & Murch, R. D. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.793310 · Cited by 2,657
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
Optimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
Parlar, M. (2000) · Interactive Operations Research with Maple · doi:10.1007/978-1-4612-1356-7_5 · Cited by 1,741
Elements of Information Theory
Phoenix, S. J. D. (1992) · Journal of Modern Optics · doi:10.1080/09500349214551641 · Cited by 1,380
A time and frequency synchronization scheme for multiuser OFDM
van de Beek, J.-J., Borjesson, P. O., Boucheret, M.-L., Landstrom, D., Arenas, J. M., Odling, P., Ostberg, C., Wahlqvist, M., & Wilson, S. K. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.806820 · Cited by 405
FDMA capacity of Gaussian multiple-access channels with ISI
Yu, W., & Cioffi, J. M. (2002) · IEEE Transactions on Communications · doi:10.1109/26.975766 · Cited by 249
A real-time sub-carrier allocation scheme for multiple access downlink OFDM transmission
Wong, C. Y., Tsui, C. Y., Cheng, R. S., & Letaief, K. B. (2005) · Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324) · doi:10.1109/vetecf.1999.798611 · Cited by 211
Multiuser subcarrier allocation for QoS provision in the OFDMA systems
Pietrzyk, S., & Janssen, G. J. M. (2003) · IEEE Vehicular Technology Conference · doi:10.1109/vetecf.2002.1040769 · Cited by 103
Cited by
Single carrier FDMA for uplink wireless transmission
Myung, H., Lim, J., & Goodman, D. (2006) · IEEE Vehicular Technology Magazine · doi:10.1109/mvt.2006.307304 · Cited by 1,236
Game theory for cognitive radio networks: An overview
Wang, B., Wu, Y., & Liu, K. J. R. (2010) · Computer Networks · doi:10.1016/j.comnet.2010.04.004 · Cited by 497
Self-citationDeep Multi-User Reinforcement Learning for Distributed Dynamic Spectrum Access
Naparstek, O., & Cohen, K. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2879433 · Cited by 477
COGNITIVE RADIOS FOR DYNAMIC SPECTRUM ACCESS - Dynamic Spectrum Sharing: A Game Theoretical Overview
Ji, Z., & Liu, K. J. (2007) · IEEE Communications Magazine · doi:10.1109/mcom.2007.358854 · Cited by 348
Self-citationZhang, H., Jiang, C., Beaulieu, N. C., Chu, X., Wang, X., & Quek, T. Q. S. (2015) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2015.2407355 · Cited by 341
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
- 15
- 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
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.