An Efficient Grant-Based Scheme for the Massive Random Access Gaussian Channel

Gustavo Facenda, Danilo Silva

DOI: 10.14209/sbrt.2019.1570552678

Evento: XXXVII Simpósio Brasileiro de Telecomunicações e Processamento de Sinais (SBrT2019)

Keywords:

Abstract

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 use of inefficient scheduling request methods. In this paper, a novel grant-based scheme, which appears to outperform other methods, is proposed. 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. The simulation results show that, if a short feedback is allowed, our method requires lower energy per bit than existing practical grantless methods.

Download