QoS-Constrained Scheduling in Multi-Cell Multi-User MIMO Networks
Tenghao Cai, Lei Li, and Tsung-Hui Chang

TL;DR
This paper proposes a novel scheduling algorithm for multi-cell MU-MIMO networks that maximizes throughput while satisfying QoS constraints, using eigen-based zero-forcing beamforming and a penalty-based optimization approach.
Contribution
It introduces a tractable surrogate optimization method for QoS-constrained scheduling in multi-cell MU-MIMO, leveraging massive MIMO asymptotics and eigen-based beamforming.
Findings
Scheduler meets QoS requirements effectively.
Achieves significant throughput improvements over existing schemes.
Efficient solution via penalty-based block coordinate descent.
Abstract
In 5G and beyond networks, efficient scheduling is essential to exploit the gains of multi-user MIMO (MU-MIMO) equipped with carrier aggregation and joint transmission (JT). However, cross-cell and cross-carrier scheduling under QoS constraints is challenging due to the strong coupling across users, base stations, and carriers. In this work, we address this problem in multi-cell MU-MIMO networks to maximize system throughput for both JT and non-JT users under rate constraints. The optimization is highly complex as scheduling variables and beamforming (BF) vectors are intertwined. To tackle it, we propose an approximate but tractable surrogate by leveraging the eigen-based zero-forcing BF and massive MIMO asymptotics. The reformulated problem has a separable structure and is amenable to efficient solutions by a penalty-based block coordinate descent method. Simulations demonstrate that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
