Efficient Scheduling for the Massive Random Access Gaussian Channel
Efficient Scheduling for the Massive Random Access Gaussian Channel
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. This papers attempts to answer whether grant-based schemes can be …