MU-MIMO系统中基于用户满意度的多用户调度研究
Study of Multiuser Scheduling Based on User Satisfaction for MU-MIMO Systems
浏览论文内容
中文总结 AI 辅助
针对MU-MIMO系统，提出基于用户满意度的调度方法US-SA，其性能接近最优穷举搜索法且计算成本更低，优于其他竞争技术。
中文摘要 AI 辅助
多用户多输入多输出（MU-MIMO）系统中的调度对于高效资源分配和整体性能提升至关重要。本研究将多用户调度问题建模为最大化用户设备（UEs）总满意度乘积的优化问题，以维持用户公平性。使用穷举搜索（EX）求解该组合问题需要评估大量资源块（RBs）内所有可能的多用户组，计算成本过高，因此提出一种高效的基于用户满意度的调度方法（US-SA）。在US-SA中，每帧构建低维子分组矩阵，用于在每个时隙调度最优多用户组，已满足的用户将从调度过程中排除。实验表明，所提US-SA在满意度、传输数据量、频谱效率、延迟和公平性方面表现接近最优的EX方法，且计算成本更低，优于其他竞争技术。
英文摘要
Scheduling in multiuser multiple input multiple output (MU-MIMO) systems is essential for efficient resource allocation and overall performance enhancement. In this work, a multiuser scheduling problem is formulated to maximize the product of user equipments' (UEs) aggregate satisfactions, which maintains user fairness. Solving such a combinatorial problem using exhaustive search (EX), which requires evaluating all possible multiuser groups within a massive number of resource blocks (RBs), is prohibitive. Instead, we propose an efficient users' satisfaction based scheduling approach (US-SA). In our US-SA, a low dimension sub-grouping matrix is constructed {at each frame}, which is used to schedule the best multiuser group in each time slot; satisfied users are eliminated from the scheduling process. Our US-SA performs close to the optimal EX method in terms of satisfaction, transmitted data amount, spectral efficiency, latency, and fairness with lower computational cost. Moreover, our experiments demonstrate that the proposed scheme outperforms competing techniques.
