Distributed User Scheduling in Multi-Cell MIMO O-RAN with QoS Constraints
Tenghao Cai, Lei Li, Tsung-Hui Chang

TL;DR
This paper proposes a distributed user scheduling algorithm for multi-cell MIMO O-RAN that maximizes throughput while satisfying QoS constraints, using a novel rate approximation and lightweight coordination.
Contribution
It introduces a distributed scheduling solution that closely matches centralized performance with minimal coordination, addressing the complexity of multi-user MIMO O-RAN systems.
Findings
Distributed scheduler achieves near-centralized performance.
The scheme ensures high scalability and fast convergence.
It effectively satisfies user QoS requirements in large networks.
Abstract
Distributed scheduling is essential for open radio access network (O-RAN) employing advanced physical-layer techniques such as multi-user MIMO (MU-MIMO), carrier aggregation (CA), and joint transmission (JT). This work investigates the multi-component-carrier (multi-CC) resource block group (RBG) scheduling in MU-MIMO O-RAN with both JT and non-JT users. We formulate a scheduling optimization problem to maximize throughput subject to user-specific quality of service (QoS) requirements while ensuring consistent allocations across cooperating O-RAN radio units (O-RUs) required by JT transmission. The strong variable coupling, non-convexity, and combinatorial complexity make the problem highly challenging. To tackle this, we extend the eigen-based zero-forcing transceiver design to JT users and leverage massive MIMO asymptotic properties to derive a tractable, separable rate approximation.…
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.
