论文标题
快速：使用物联网上下文ID的基于争议解决的随机访问
RAPID: Contention Resolution-based Random Access using Context ID for IoT
论文作者
论文摘要
随着物联网（IoT）设备的数量越来越多，机器类型通信（MTC）已成为第五代（5G）通信系统的重要用例。由于MTC设备大多与基站（BS）断开以进行节能，因此设备传输数据需要随机访问过程。如果许多设备同时尝试随机访问，则会发生preamble碰撞问题，从而导致潜伏期增加。在延迟敏感和容忍设备共存的环境中，基于争论的随机访问过程无法满足延迟敏感设备的延迟要求。因此，我们提出了一种新型的随机访问程序，该过程通过两个消息交换来完成延迟敏感设备。我们还开发了访问模式分析仪（APA），该分析仪估计了MTC设备的流量特征。当UES执行基于快速且基于争议的随机访问（共存）时，确定一个值的值是快速减少随机访问负载的值。因此，我们使用Markov链模型分析随机访问负载，以获得快速的最佳序列数量。仿真结果显示，与最新技术相比，上行链路延迟的可靠性迅速达到99.999％的可靠性，上行链路延迟80.8％，并且随机访问负载减少了30.5％。
With the increasing number of Internet of Things (IoT) devices, Machine Type Communication (MTC) has become an important use case of the Fifth Generation (5G) communication systems. Since MTC devices are mostly disconnected from Base Station (BS) for power saving, random access procedure is required for devices to transmit data. If many devices try random access simultaneously, preamble collision problem occurs, thus causing latency increase. In an environment where delay-sensitive and delay-tolerant devices coexist, the contention-based random access procedure cannot satisfy latency requirements of delay-sensitive devices. Therefore, we propose RAPID, a novel random access procedure, which is completed through two message exchanges for the delay-sensitive devices. We also develop Access Pattern Analyzer (APA), which estimates traffic characteristics of MTC devices. When UEs, performing RAPID and contention-based random access, coexist, it is important to determine a value which is the number of preambles for RAPID to reduce random access load. Thus, we analyze random access load using a Markov chain model to obtain the optimal number of preambles for RAPID. Simulation results show RAPID achieves 99.999% reliability with 80.8% shorter uplink latency, and also decreases random access load by 30.5% compared with state-of-the-art techniques.
