Age of Information-Limited Capacity of Uncoordinated Massive Access Using Massive MIMO

• Main Authors: Tadele, Bamelak, Shyianov, Volodymyr, Bellili, Faouzi, Mezghani, Amine, Hossain, Ekram
• Format: Conference Proceeding
• Language: English
• Subjects: Age of Information; Diversity reception; Internet of Things (IoT); Limiting; Massive MIMO; Massive Random Access; Performance evaluation; Receivers; Spectral efficiency; Transmitting antennas
• ISSN: 1558-2612
• DOI: 10.1109/WCNC51071.2022.9771933

We derive an achievability bound in an uplink setting where N single-antenna devices, of which a random subset of K a users are active in each transmission period, attempt to update a base-station (BS), equipped with M antennas, with their status packets. Motivated by emerging applications of massive connectivity we consider the asymptotic scenario where both the total number of users and the number of antennas at the BS grow large at a fixed ratio \zeta = \frac{M}{N}. Under maximal-ratio combining and perfect channel state information at the receiver, we find that the achievable rate approaches {\log _2}\left( {1 + \frac{M}{{{K_a}}} \right) in the large system limit. We explore the trade-offs between this achievable rate and the freshness of the status packets using the age of information (AoI) metric. In the limiting regime, we find that the penalty one pays for increasing the data rate is a rise in the minimum AoI obtainable. Finally, we compare recent massive unsourced random access (URA) schemes against the newly established bound.