A Near Optimal Scheduling Algorithm for Efficient Radio Resource Management in Multi-user MIMO Systems

Multiple input multiple output (MIMO) systems have high potential to achieve maximum channel capacity in wireless communication systems. Multi-user (MU) MIMO network with transmit antennas Tx at base station can schedule as many single antenna users in one time slot. This necessitates incorporation of a user scheduling strategy. Maximizing sumrate performance without under utilization of channel resources is a primary objective of such scheduling algorithms. Another key design factor for such techniques is to optimize fairness i.e. allowing equal opportunity to all communicating entities. In this paper, we present a simple approach to solve the scheduling problem in MU-MIMO systems while addressing the conflicting objectives of sumrate and fairness. Two variants of the proposed method are also discussed that provide options for maximizing the cumulative sumrate and improving the fairness. Simulations validate the proposed algorithm as a better choice over other conventional methods as it achieves optimal performance with relatively less computational complexity and without compromising fairness. Fairness results are verified by average sumrate method and Jain's Fariness Index.