Common Message Acknowledgments: Massive ARQ Protocols for Wireless Access

01/11/2022
by   Anders E. Kalør, et al.
0

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 acknowledgement 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/21/2021

How to Identify and Authenticate Users in Massive Unsourced Random Access

Identification and authentication are two basic functionalities of tradi...
research
06/03/2022

HashBeam: Enabling Feedback Through Downlink Beamforming in Unsourced Random Access

Unsourced random access (URA) has emerged as a candidate paradigm for ma...
research
01/18/2019

Massive Random Access with Common Alarm Messages

The established view on massive IoT access is that the IoT devices are a...
research
05/16/2019

Efficient Scheduling for the Massive Random Access Gaussian Channel

This paper investigates the massive random access Gaussian channel with ...
research
02/21/2023

Unsourced Multiple Access with Common Alarm Messages: Network Slicing for Massive and Critical IoT

We investigate the coexistence of massive and critical Internet of Thing...
research
03/25/2020

Massive Access in Multi-cell Wireless Networks Using Reed-Muller Codes

Providing connectivity to a massive number of devices is a key challenge...
research
04/05/2019

Optimal Communication Rates for Zero-Error Distributed Simulation under Blackboard Communication Protocols

We study the distributed simulation problem where n users aim to generat...

Please sign up or login with your details

Forgot password? Click here to reset