论文标题
在非平稳的多状态LOS/NLOS频道下,拥挤的XL-MIMO系统中的QoS感知用户调度
QoS-Aware User Scheduling in Crowded XL-MIMO Systems Under Non-Stationary Multi-State LoS/NLoS Channels
论文作者
论文摘要
由于网络结构有限的发电预算和资源块,在拥挤的无线通信系统中提供最低服务质量(QoS)具有挑战性。必须实施智能资源分配方法,例如用户调度,电源分配以及调制和编码方案选择,以应对挑战。旨在在拥挤的大型量表的下行链路(DL)渠道中以最小QoS的数量来增强大量多输入多输出(XL-MIMO)系统的最小QoS数量,在本文中,我们建议使用QoS-Aware的联合用户调度和功率分配技术。所提出的技术由两个顺序过程组成:用于用户计划的基于集团搜索的调度(CBS)算法,然后是最佳功率分配,并带有传输功率预算和每个用户约束的最低可实现率。为了准确评估XL-MIMO场景中提出的技术,我们根据球形波传播提出了一个广义的非平稳多状态通道模型,假设在同一通信单元中使用LOS和NLOS传输下的用户。这种模型认为,不同渠道状态下的用户在多路径褪色模型和路径损失规则中都经历了不同的传播方面。关于可实现的总和率,预定用户数量以及计划用户的分布的数值结果表明,当拟议的CBS算法提供了对整个单元区域的公平覆盖范围,当LOS和NLOS Channel在通信单元格中共存的NLOS Channel States共存时,可以实现大量的计划用户。
Providing minimum quality-of-service (QoS) in crowded wireless communications systems, with high user density, is challenging due to the network structure with limited transmit power budget and resource blocks. Smart resource allocation methods, such as user scheduling, power allocation, and modulation and coding scheme selection, must be implemented to cope with the challenge. Aiming to enhance the number of served users with minimum QoS in the downlink (DL) channel of crowded extra-large scale massive multiple-input multiple-output (XL-MIMO) systems, in this paper we propose a QoS-aware joint user scheduling and power allocation technique. The proposed technique is constituted by two sequential procedures: the clique search-based scheduling (CBS) algorithm for user scheduling followed by optimal power allocation with transmit power budget and minimum achievable rate per user constraints. To accurately evaluate the proposed technique in the XL-MIMO scenario, we propose a generalized non-stationary multi-state channel model based on spherical-wave propagation assuming that users under LoS and NLoS transmission coexist in the same communication cell. Such model considers that users under different channel states experience different propagation aspects both in the multipath fading model and the path loss rule. Numerical results on the achievable sum-rate, number of scheduled users, and distribution of the scheduled users reveal that the proposed CBS algorithm provides a fair coverage over the whole cell area, achieving remarkable numbers of scheduled users when users under the LoS and NLoS channel states coexist in the communication cell.