|| Massive Uncoordinated Access With Random User Activity
||Khac-Hoang Ngo, Alejandro Lancho, Giuseppe Durisi, Alexandre Graell i Amat, Chalmers University of Technology, Sweden|
||D7-S2-T1: Massive Access
||Tuesday, 20 July, 22:20 - 22:40
||Tuesday, 20 July, 22:40 - 23:00
We extend the seminal work by Polyanskiy (2017) on massive uncoordinated access to the case where the number of active users is random and unknown a priori. We define a random-access code accounting for both misdetection (MD) and false-alarm (FA), and derive a random-coding achievability bound for the Gaussian multiple access channel. Our bound captures the fundamental trade-off between MD and FA probabilities. It suggests that lack of knowledge of the number of active users entails a small penalty in power efficiency. For a typical scenario, to achieve both MD and FA probabilities below 0.1, the required energy per bit predicted by our bound is 0.5–0.7dB higher than that predicted by the bound in Polyanskiy (2017) for a known number of active users. Taking both MD and FA into account, we use our bound to benchmark the energy efficiency of some recently proposed massive random access schemes.