论文标题
在大型MIMO拥挤的机器型网络中实现公平的随机访问性能
Achieving Fair Random Access Performance in Massive MIMO Crowded Machine-Type Networks
论文作者
论文摘要
通过飞行员的不足挑战了大量多输入多输出（MIMO）为一群用户设备（UES）服务的挑战。假设UES间歇性地活动性，则可以通过对飞行员的共享访问和合适的随机访问（RA）协议来解决此问题。最强的用户碰撞分辨率（SUCRE）是先前提出的RA协议，它通常使UES更靠近基站（BS）。相比之下，我们使用分散的飞行员功率分配方法提出了一种新型的RA协议，该方法旨在更公平的性能。提议的访问类禁止使用功率控制（ACBPC）协议允许每个UE估算，而无需其他开销，其中有多少UE碰撞了所选的飞行员并计算ACB因子，然后将其用于确定下一个协议步骤中的飞行员重新启动概率。结果表明，在为非常拥挤的网络提供公平的连接方面，提出的ACBPC协议优于SUCRE，尽管仍将分布和与原始的SUCRE协议保持不变。
The use of massive multiple-input multiple-output (MIMO) to serve a crowd of user equipments (UEs) is challenged by the deficit of pilots. Assuming that the UEs are intermittently active, this problem can be addressed by a shared access to the pilots and a suitable random access (RA) protocol. The strongest-user collision resolution (SUCRe) is a previously proposed RA protocol that often privileges the UEs closer to the base station (BS). In contrast, we propose a novel RA protocol using a decentralized pilot power allocation method that aims at a fairer performance. The proposed access class barring with power control (ACBPC) protocol allows each UE to estimate, without additional overhead, how many UEs collided for the chosen pilot and calculate an ACB factor, which is then used to determine the pilot retransmission probability in the next protocol step. The results show that the proposed ACBPC protocol is superior to SUCRe in terms of providing a fair connectivity for very crowded networks, although still being distributed and uncoordinated as the original SUCRe protocol.
