How to Identify and Authenticate Users in Massive Unsourced Random Access

Radoslaw Kotaba, Anders Ellersgaard Kalør, Petar Popovski, Israel Leyva-Mayorga, Beatriz Soret, Maxime Guillaud, Garcia Ordonez Luis

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

11 Downloads (Pure)


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 letter 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.

TidsskriftI E E E Communications Letters
Udgave nummer12
Sider (fra-til)3795 - 3799
Antal sider5
StatusUdgivet - 12 dec. 2021


Dyk ned i forskningsemnerne om 'How to Identify and Authenticate Users in Massive Unsourced Random Access'. Sammen danner de et unikt fingeraftryk.