How to Identify and Authenticate Users in Massive Unsourced Random Access
- 8 October 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (12) , 3795-3799
Abstract
Identification and authentication are two essential features for traditional random access protocols. In ALOHA-based random access, the packets usually include a field with a unique user address. However, when the number of users is massive and relatively small packets are transmitted, the overhead of including such field becomes restrictive. In unsourced random access (U-RA), the packets do not include any address field for the user, which maximizes the number of useful bits that are transmitted. However, by definition an U-RA protocol does not provide user identification. This paper presents a scheme that builds upon an underlying U-RA protocol and solves the problem of user identification and authentication. In our scheme, the users generate a message authentication code (MAC) that provides these functionalities without violating the main principle of unsourced random access: the selection of codewords from a common codebook is i.i.d. among all users.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Fundamental Limits of Many-User MAC With Finite Payloads and FadingIEEE Transactions on Information Theory, 2021
- Tensor-Based Modulation for Unsourced Massive Random AccessIEEE Wireless Communications Letters, 2020
- Massive Random Access with Common Alarm Messages2019
- Towards Massive Connectivity Support for Scalable mMTC Communications in 5G NetworksIEEE Access, 2018
- A perspective on massive random-access2017
- Capacity of Gaussian Many-Access ChannelsIEEE Transactions on Information Theory, 2017
- Toward Massive, Ultrareliable, and Low-Latency Wireless Communication With Short PacketsProceedings of the IEEE, 2016
- THE ALOHA SYSTEM1970