论文标题
在密集的以用户为中心的密集的大型MIMO网络中的公平调度
Fairness Scheduling in Dense User-Centric Cell-Free Massive MIMO Networks
论文作者
论文摘要
我们考虑一个以用户为中心的可扩展单元格的大型MIMO网络,该网络总计$ LM $分布式远程无线电单元,服务$ K $用户设备(UES)。当前文献中的许多作品都假设$ lm \ gg k $,使UE数据速率高,但也导致系统在总和吞吐量方面没有以最大的性能运行。我们提供了有关无细胞大规模MIMO网络的新观点,研究了速率分配和UE密度制度,其中网络利用其全部功能。 UE密度$ k $大约等于$ \ frac {lm} {2} $是系统达到最大总吞吐量的范围。此外,当服务$ k> \ frac {lm} {2} $ ues同时提供$ k> \ frac {lm}时,有很大一部分的UE。我们建议减少每个时间插槽的活动性UE的数量,以使系统无法在``Full Load''下运行,并通过旨在通过旨在最大化适当定义的凹入compontionWise的非降低网络实用程序函数的调度程序来强加所有用户的吞吐量公平。我们的数值模拟表明,我们可以调整系统,以便可以根据实用程序功能获得UE吞吐量的所需分布。
We consider a user-centric scalable cell-free massive MIMO network with a total of $LM$ distributed remote radio unit antennas serving $K$ user equipments (UEs). Many works in the current literature assume $LM\gg K$, enabling high UE data rates but also leading to a system not operating at its maximum performance in terms of sum throughput. We provide a new perspective on cell-free massive MIMO networks, investigating rate allocation and the UE density regime in which the network makes use of its full capability. The UE density $K$ approximately equal to $\frac{LM}{2}$ is the range in which the system reaches the largest sum throughput. In addition, there is a significant fraction of UEs with relatively low throughput, when serving $K>\frac{LM}{2}$ UEs simultaneously. We propose to reduce the number of active UEs per time slot, such that the system does not operate at ``full load'', and impose throughput fairness among all users via a scheduler designed to maximize a suitably defined concave componentwise non-decreasing network utility function. Our numerical simulations show that we can tune the system such that a desired distribution of the UE throughput, depending on the utility function, is achieved.