Unsourced Random Access: A Recent Paradigm for Massive Connectivity
<|reference_start|>Unsourced Random Access: A Recent Paradigm for Massive Connectivity: The sixth generation and beyond communication systems are expected to enable communications of a massive number of machine-type devices. The traffic generated by some of these devices will significantly deviate from those in conventional communication scenarios. For instance, for applications where a massive number of cheap sensors communicate with a base station (BS), the devices will only be sporadically active and there will be no coordination among them or with the BS. For such systems requiring massive random access solutions, a new paradigm called unsourced random access (URA) has been proposed. In URA, all the users employ the same codebook and there is no user identity during the data transmission phase. The destination is only interested in the list of messages being sent from the set of active users. In this survey, we provide a comprehensive overview of existing URA solutions with an emphasis on the state-of-the-art, covering both algorithmic and information-theoretic aspects. Moreover, we provide future research directions and challenges, and describe some potential methods of addressing them.<|reference_end|>
@article{ozates2024unsourced,
    title={Unsourced Random Access: A Recent Paradigm for Massive Connectivity},
    author={Mert Ozates, Mohammad Javad Ahmadi, Mohammad Kazemi, Tolga M. Duman},
    journal={arXiv preprint arXiv:2409.14911},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.14911},
    primaryClass={cs.IT math.IT}
}