The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Optimal User-Cell Association for Massive MIMO Wireless Networks
Abstract
Massive MIMO is one of the most promising approaches for coping with the predicted wireless data traffic explosion. Future deployment scenarios will involve dense heterogeneous networks, comprised of massive MIMO base stations with different powers, numbers of antennas and multiplexing gain capabilities, and possibly highly nonhomogeneous user density (hot-spots). In such dense irregularly deployed networks, it will be important to have mechanisms for associating users to base stations so that the available wireless infrastructure is efficiently used. In this paper, we consider the optimal user-cell association problem for massive MIMO heterogeneous networks and illustrate how massive MIMO can also provide nontrivial advantages at the system level. Unlike previous treatments that rely on integer program problem formulations and their convex relaxations, the user-cell association problem is formulated directly as a convex network utility maximization and solved efficiently by a centralized subgradient algorithm. As we show, the globally optimal solution is physically realizable, in that there exists a sequence of integer-valued associations approaching arbitrarily closely the optimal fractional association. We also consider simple decentralized user-centric association schemes, where each user individually and selfishly connects to the base station with the highest promised throughput. Such user-centric schemes where users make local association decisions in a probabilistic manner can be viewed as games and are known to converge to Nash equilibria. Surprisingly, as we show, under certain conditions, the globally optimal solution is close to these Nash equilibria. Such decentralized approaches are, therefore, attractive not only for their simplicity, but also because they operate near the system social optimum. Our theoretical results are confirmed by extensive simulations with realistic LTE-like network parameters.
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Cited by
Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency
Björnson, E., Hoydis, J., & Sanguinetti, L. (2017) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000093 · Cited by 2,137
User Association in 5G Networks: A Survey and an Outlook
Liu, D., Wang, L., Chen, Y., Elkashlan, M., Wong, K.-K., Schober, R., & Hanzo, L. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2516538 · Cited by 604
RadioUNet: Fast Radio Map Estimation With Convolutional Neural Networks
Levie, R., Yapar, Ç., Kutyniok, G., & Caire, G. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3054977 · Cited by 488
Self-citationFoundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
Wong, K.-K., & Tong, K.-F. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3133410 · Cited by 308
Metadata
- Authors
- Bethanabhotla, D., Bursalioglu, O. Y., Papadopoulos, H. C., & Caire, G.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2016-03
- Volume
- 15
- Issue
- 3
- Pages
- 1835-1850
- ISSN
- 1536-1276 (ISSN-L)
- OpenAlex
- W2228048552
- Cited by
- 186
- References
- 1
- FWCI
- 18.92
- 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: Optimal User-Cell Association for Massive MIMO Wireless Networks. https://app.cochat.ai/papers/10.1109/twc.2015.2496942
- The paper
- Bethanabhotla, D., Bursalioglu, O. Y., Papadopoulos, H. C., & Caire, G. (2016). Optimal User-Cell Association for Massive MIMO Wireless Networks. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2015.2496942
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.