.png){kind=icon}
返回
RAPID: Contention Resolution Based Random Access Using Context ID for IoT
.png){kind=icon}
OA
AI
DOI：10.1109/TVT.2019.2919867.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
With the increasing number of Internet of Things (IoT) devices, machine-type communication (MTC) has become an important use case of the fifth-generation communication systems. Since MTC devices are mostly disconnected from base station 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, which estimates traffic characteristics of MTC devices. When user equipment, performing RAPID and contention-based random access, coexist, it is important to determine a value that 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 that 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.
Keyword:
2-step random access
5G
Internet of Things
Markov chain model
radio resource control state
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
.png){kind=icon}
分享收藏
Efficient Random-Access Scheme for Massive Connectivity in 3GPP Low-Cost Machine-Type Communications
PREAI
分享收藏
查看更多内容