Resource Allocation for User-Centric Cell-Free Massive MIMO Downlink

Given the strong macro-diversity gain, cell-free massive multiple-input-multiple-output (MIMO) with many access points (APs) can provide a more uniform service level for randomly distributed users or user sensors (USs). There has, however, been little implemented in practical applications, due to the challenges of substantial backhaul overhead and high signal processing demands in cell-free massive MIMO systems. In this article, we propose a resource allocation scheme that incorporates the effective algorithms for AP selection, pilot assignment, and power allocation, to improve the performance of user-centric cell-free massive MIMO systems. In particular, a grouping-based AP selection algorithm is investigated to select APs with significant gain contributions to USs. Based on this, we propose an improved K-means clustering (I-KMC)-based pilot assignment algorithm to reduce pilot contamination caused by pilot reuse. To improve the reliability of data transmission, we present two power allocation algorithms to maximize the achievable sum-rate, namely sequential convex approximation in combination with geometric programming (SCA-GP) approach, and nonmonotone accelerated proximal gradient (NAPG) approach with line search. Results demonstrate that the proposed scheme achieves similar sum-rate performance to the scenario where all USs are served by all APs, but with significantly lower power consumption.

Authors

Institutions

Publication Details

Journal
IEEE Sensors Journal
Published
2024-11-25
DOI
https://doi.org/10.1109/jsen.2024.3502399
Citations
3
Primary Topic
Advanced MIMO Systems Optimization
Type
article
Field-Weighted Citation Impact
0.63
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Resource Allocation for User-Centric Cell-Free Massive MIMO Downlink

Yi Liu, Cong Li, Xuan Wang
3 citations
IEEE Sensors Journal
Advanced MIMO Systems Optimization
0.63
article

Resource Allocation for User-Centric Cell-Free Massive MIMO Downlink

Yi Liu, Cong Li, Xuan Wang
article en
3 citations

Abstract

Given the strong macro-diversity gain, cell-free massive multiple-input-multiple-output (MIMO) with many access points (APs) can provide a more uniform service level for randomly distributed users or user sensors (USs). There has, however, been little implemented in practical applications, due to the challenges of substantial backhaul overhead and high signal processing demands in cell-free massive MIMO systems. In this article, we propose a resource allocation scheme that incorporates the effective algorithms for AP selection, pilot assignment, and power allocation, to improve the performance of user-centric cell-free massive MIMO systems. In particular, a grouping-based AP selection algorithm is investigated to select APs with significant gain contributions to USs. Based on this, we propose an improved K-means clustering (I-KMC)-based pilot assignment algorithm to reduce pilot contamination caused by pilot reuse. To improve the reliability of data transmission, we present two power allocation algorithms to maximize the achievable sum-rate, namely sequential convex approximation in combination with geometric programming (SCA-GP) approach, and nonmonotone accelerated proximal gradient (NAPG) approach with line search. Results demonstrate that the proposed scheme achieves similar sum-rate performance to the scenario where all USs are served by all APs, but with significantly lower power consumption.

IEEE Sensors JournalVol. 25(1)
Xidian University (CN), China Academy of Space Technology (CN)
Openalex Percentile: Top 30%
Advanced MIMO Systems Optimization
0.63
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.