Log In Sign Up

Efficient Scheduling for the Massive Random Access Gaussian Channel

by   Gustavo Kasper Facenda, et al.

This paper investigates the massive random access Gaussian channel with a focus on small payloads. For this problem, grant-based schemes have been regarded as inefficient due to the necessity of large feedbacks and the use of inefficient scheduling request methods. In this paper, a novel grant-based scheme is proposed, which appears to outperform previous methods. The scheme uses Ordentlich and Polyanskiy's grantless method to transmit small coordination indices in order to perform the scheduling request, which allows both the request from the users to be efficient and the feedback to be small. We also present an improvement to the Ordentlich and Polyanskiy's scheme, allowing it to handle collisions of the same message, significantly improving the method for very small messages. Simulation results show that, if a short feedback is allowed, our method requires lower energy per bit than existing practical grantless methods.


page 1

page 2

page 3

page 4


Scheduling Versus Contention for Massive Random Access in Massive MIMO Systems

Massive machine-type communications protocols have typically been design...

Minimum Feedback for Collision-Free Scheduling in Massive Random Access

Consider a massive random access scenario in which a small set of k acti...

Common Message Acknowledgments: Massive ARQ Protocols for Wireless Access

Massive random access plays a central role in supporting the Internet of...

Energy-efficiency of Massive Random Access with Individual Codebook

The massive machine-type communication has been one of the most represen...

Self-Organized Scheduling Request for Uplink 5G Networks: A D2D Clustering Approach

In one of the several manifestations, the future cellular networks are r...