论文标题
常见消息确认:无线访问的大规模ARQ协议
Common Message Acknowledgments: Massive ARQ Protocols for Wireless Access
论文作者
论文摘要
大量随机访问在支持物联网(IoT)中起着核心作用,其中大量用户的子集同时将小数据包传输到中央基础站。尽管关于在上行链路中进行大规模访问的协议的设计进行了很多研究,但向用户提供消息确认的问题已被忽略了。可靠的沟通需要依靠双向通信进行确认和重新传播。然而,由于有效用户的许多可能子集,提供确认需要大量位。在此激励的情况下,我们定义了大规模ARQ(自动重新启动请求)协议的问题,并引入了有效的方法,用于与下行链路中多个确认的联合编码。减少用于大规模承认的位数量的关键思想是允许一小部分假阳性确认。我们分析了这种方法的含义以及在大量随机访问的情况下确认错误的影响。最后,我们表明,当允许重传允许重新召集时,这些节省可以导致可靠性显着提高,因为它允许使用较低的速率更可靠地传输确认消息。
Massive random access plays a central role in supporting the Internet of Things (IoT), where a subset of a large population of users simultaneously transmit small packets to a central base station. While there has been much research on the design of protocols for massive access in the uplink, the problem of providing message acknowledgments back to the users has been somewhat neglected. Reliable communication needs to rely on two-way communication for acknowledgement and retransmission. Nevertheless, because of the many possible subsets of active users, providing acknowledgments requires a significant amount of bits. Motivated by this, we define the problem of massive ARQ (Automatic Retransmission reQuest) protocol and introduce efficient methods for joint encoding of multiple acknowledgements in the downlink. The key idea towards reducing the number of bits used for massive acknowledgements is to allow for a small fraction of false positive acknowledgments. We analyze the implications of this approach and the impact of acknowledgment errors in scenarios with massive random access. Finally, we show that these savings can lead to a significant increase in the reliability when retransmissions are allowed since it allows the acknowledgment message to be transmitted more reliably using a much lower rate.