Study of Enhanced Subset Greedy Multiuser Scheduling for Cell-Free Massive MIMO Systems

Abstract

In this work, we consider the problem of multiuser scheduling for the downlink of cell-free massive multi-input multi-output networks with clustering. In particular, we develop a multiuser scheduling algorithm based on an enhanced greedy method that is deployed with linear precoding and clustering. Closed-form expressions for the sum-rate performance are derived when imperfect channel state information is considered. The proposed scheduling algorithm is then analyzed along with its computational cost and network signaling load. Numerical results show that the proposed scheduling method outperforms the existing methods and in low signal-to-noise ratios, its performance becomes much closer to the optimal approach.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…