arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1902.10235cs.ITmath.IT
收藏

具有多个资源块和快速重试的压缩随机接入

Compressive random access with multiple resource blocks and fast retrial

Jinho Choi

摘要:

在本文中,我们提出了一种压缩随机接入(CRA)方案,使用多个资源块(RB),以支持机器类型通信(MTC)的大规模连接。提出的CRA方案是可扩展的。因此,如果设备的数量增加,则可以添加更多的RB来支持它们。由于多个RB,我们可以采用RB之间的快速重试来重传冲突的分组,这可以导致短的接入延迟。对于具有快速重试的稳定CRA,我们推导了条件(具有速率控制方案),并分析了稳态性能,以找到吞吐量和延迟。通过分析和仿真结果,我们可以看到,所提出的方案可以比传统的多信道ALOHA性能更好,并享受性能和复杂度之间的平衡在RB的数量。

英文摘要:

In this paper, we propose a compressive random access (CRA) scheme using multiple resource blocks (RBs) to support massive connections for machine type communications (MTC). The proposed CRA scheme is scalable. As a result, if the number of devices increases, more RBs can be added to support them. Thanks to multiple RBs, we can employ fast retrial between RBs for re-transmissions of collided packets, which can result in short access delay. For stable CRA with fast retrial, we derive conditions (with a rate control scheme), and analyze the steady state performance to find the throughput and delay. Through analysis and simulation results, we can see that the proposed scheme can perform better than conventional multichannel ALOHA and enjoy a trade-off between the performance and complexity in terms of the number of RBs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑