论文标题
在物联网中的一个简短消息传递的抗压随机访问吞吐量
On Throughput of Compressive Random Access for One Short Message Delivery in IoT
论文作者
论文摘要
在本文中，我们研究了在蜂窝互联网（IoT）中使用两个机器类型通信（MTC）的抗压随机访问（CRA）。特别是，我们考虑以下情况：当被激活以在IoT应用程序中发送数据时，每个用户（IoT设备或传感器）只有一条短消息（相同长度）。讨论了两种不同的基于CRA的随机访问方案（一个是常规的，另一个是基于简化的握手过程的新事物）。基于吞吐量分析，我们表明，基于CRA的随机访问方案具有简化的握手过程可以胜过表现，因为其有效载荷的长度根据活动用户的数量而自适应地确定。仿真结果证实了派生的吞吐量表达式与它们一致，并且可以用每个有一个简短消息的活动设备或传感器来设计MTC的随机访问系统。
In this paper, we study compressive random access (CRA) with two stages for machine-type communication (MTC) in cellular Internet-of-Things (IoT). In particular, we consider the case that each user (IoT device or sensor) has only one short message (of the same length) when it is activated to send data in IoT applications. Two different CRA-based random access schemes are discussed (one is conventional and the other is new based on a simplified handshaking process). Based on the throughput analysis, we show that the CRA-based random access scheme with simplified handshaking process can outperform as its length of payload is adaptively decided depending on the number of active users. Simulation results confirm that the derived throughput expressions agree with them and can be used to design a random access system for MTC with each active device or sensor that has one short message.
