Improved Graph-Based User Scheduling For Sum-Rate Maximization in LEO-NTN Systems

Abstract

In this paper, we study the problem of user scheduling for Low Earth Orbit (LEO) Multi-User (MU) Multiple-Input-Multiple-Output (MIMO) Non-Terrestrial Network (NTN) systems with the objective of maximizing the sum-rate capacity while minimizing the total number of clusters. We propose an iterative graph-based maximum clique scheduling approach with constant graph density. Users are grouped together based on the channel coefficient of correlation (CoC) as dissimilarity metric and served by the satellite via Space Division Multiple Access (SDMA) by means of Minimum Mean Square Error (MMSE) digital beamforming on a cluster basis. Clusters are then served in different time slots via Time Division Multiple Access (TDMA). The results, presented in terms of per-cluster sum-rate capacity and per-user throughput, show that the presented approach can significantly improve the system performance.