Achievable Rate of Multiuser Scheduling in RIS-based Massive MIMO Systems

In this paper, the achievable sum rate of multiuser scheduling in reconfigurable intelligent surface (RIS)-based mas-sive multiple-input multiple-output systems is investigated. Using asymptotic analysis under the generic condition of large numbers of base station antennas, RISs, and users, the RIS-based sum rate is proven to follow a Gaussian distribution. In addition, based on the characteristics of Gaussian distribution, the conditions for the occurrence of the channel hardening phenomenon and achievable scheduling gain are derived as a function of the number of RISs and users. Numerical results show that the derived RIS-based sum rate and the Monte Carlo simulation results are in close agreement as well as that the proposed achievable sum rate constitutes a meaningful bound to verify the performance of various multiuser scheduling algorithms.