An Efficient Time-Shifted Random Access Scheme for Cellular-Based IoT Networks
An Efficient Time-Shifted Random Access Scheme for Cellular-Based IoT Networks
复制标题
DOI：
10.1109/lcomm.2019.2892139
复制
发表时间：
2019-01
期刊：
影响因子：
--
通讯作者：
Eunhye Park;Taehoon Kim;Youngnam Han
中科院分区：
文献类型：
--
作者：
Eunhye Park;Taehoon Kim;Youngnam Han
随机接入（RA）方案是物联网（IoT）网络中成功、高效连接设备的关键问题之一。在基于蜂窝的物联网网络中，Zadoff-Chu (ZC) 序列用作前导码，其中它们的循环移位版本彼此正交。我们为蜂窝物联网网络提出了一种时移 RA 方案，以减少冲突并容纳更多设备，这也可以提高公平性。在所提出的方案中，每个物联网设备在前导码生成阶段有效地调整ZC序列的循环移位量。我们制定优化问题以最小化平均碰撞概率并提供算法解决方案。仿真表明，我们提出的方案可以实现近乎完美的公平性，同时有效降低碰撞概率。
Random access (RA) scheme is one of the critical issues for successfully and efficiently connecting devices in the Internet of Things (IoT) networks. In cellular-based IoT networks, Zadoff–Chu (ZC) sequences are used as preambles, where their cyclically shifted versions are orthogonal to each other. We propose a time-shifted RA scheme for cellular IoT networks to reduce collision and to accommodate more devices, which can also increase fairness. In the proposed scheme, each IoT device efficiently adjusts the amount of cyclic shift of ZC sequences during preamble generation phase. We formulate an optimization problem to minimize average collision probability and provide an algorithmic solution. Simulation reveals that our proposed scheme can achieve near-perfect fairness while effectively mitigating collision probability.