Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Massive Uncoordinated Access With Random User Activity

Abstract : 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. The derived bound suggests that, for the scenario considered in Polyanskiy (2017), lack of knowledge of the number of active users entails a small penalty in terms of power efficiency. For example, our bound shows that 0.5-0.7 dB extra power is required to achieve both MD and FA probabilities below 0.1 compared to the case in which the number of active users is known a priori. Taking both MD and FA into account, we show that some of the recently proposed massive random access schemes are highly suboptimal with respect to our bound.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Contributor : Khac-Hoang Ngo Connect in order to contact the contributor
Submitted on : Monday, November 8, 2021 - 11:26:22 PM
Last modification on : Sunday, November 28, 2021 - 3:41:36 AM

Links full text


  • HAL Id : hal-03420076, version 1
  • ARXIV : 2103.09721



Khac-Hoang Ngo, Alejandro Lancho, Giuseppe Durisi, Alexandre Graell I Amat. Massive Uncoordinated Access With Random User Activity. 2021. ⟨hal-03420076⟩



Record views