English

Fairness Scheduling in Dense User-Centric Cell-Free Massive MIMO Networks

Information Theory 2022-11-29 v1 math.IT

Abstract

We consider a user-centric scalable cell-free massive MIMO network with a total of LMLM distributed remote radio unit antennas serving KK user equipments (UEs). Many works in the current literature assume LMKLM\gg K, enabling high UE data rates but also leading to a system not operating at its maximum performance in terms of sum throughput. We provide a new perspective on cell-free massive MIMO networks, investigating rate allocation and the UE density regime in which the network makes use of its full capability. The UE density KK approximately equal to LM2\frac{LM}{2} is the range in which the system reaches the largest sum throughput. In addition, there is a significant fraction of UEs with relatively low throughput, when serving K>LM2K>\frac{LM}{2} UEs simultaneously. We propose to reduce the number of active UEs per time slot, such that the system does not operate at ``full load'', and impose throughput fairness among all users via a scheduler designed to maximize a suitably defined concave componentwise non-decreasing network utility function. Our numerical simulations show that we can tune the system such that a desired distribution of the UE throughput, depending on the utility function, is achieved.

Keywords

Cite

@article{arxiv.2211.15294,
  title  = {Fairness Scheduling in Dense User-Centric Cell-Free Massive MIMO Networks},
  author = {Fabian Göttsch and Noboru Osawa and Takeo Ohseki and Yoshiaki Amano and Issei Kanno and Kosuke Yamazaki and Giuseppe Caire},
  journal= {arXiv preprint arXiv:2211.15294},
  year   = {2022}
}
R2 v1 2026-06-28T07:14:50.570Z