Unsourced Random Access: A Comprehensive Survey

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Ozates, Mert, Ahmadi, Mohammad Javad, Kazemi, Mohammad, Gündüz, Deniz, Duman, Tolga M.
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866917079728259072
author Ozates, Mert
Ahmadi, Mohammad Javad
Kazemi, Mohammad
Gündüz, Deniz
Duman, Tolga M.
author_facet Ozates, Mert
Ahmadi, Mohammad Javad
Kazemi, Mohammad
Gündüz, Deniz
Duman, Tolga M.
contents Multiple access communication systems enable numerous users to share common communication resources, playing a crucial role in wireless networks. With the emergence of the sixth generation (6G) and beyond communication networks, supporting massive machine-type communications with sporadic activity patterns is expected to become a critical challenge. Unsourced random access (URA) has emerged as a promising paradigm to address this challenge by decoupling user identification from data transmission through the use of a common codebook. This survey offers a comprehensive overview of URA solutions, encompassing both theoretical foundations and practical applications. We present a systematic classification of URA solutions across three primary channel models: Gaussian multiple access channels (GMACs), single-antenna fading channels, and multiple-input multiple-output (MIMO) fading channels. For each category, we analyze and compare state-of-the-art solutions in terms of performance, complexity, and practical feasibility. Additionally, we discuss critical challenges such as interference management, computational complexity, and synchronization. The survey concludes with promising future research directions and potential methods to address existing limitations, providing a roadmap for researchers and practitioners in this rapidly evolving field.
format Preprint
id arxiv_https___arxiv_org_abs_2409_14911
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Unsourced Random Access: A Comprehensive Survey
Ozates, Mert
Ahmadi, Mohammad Javad
Kazemi, Mohammad
Gündüz, Deniz
Duman, Tolga M.
Information Theory
Multiple access communication systems enable numerous users to share common communication resources, playing a crucial role in wireless networks. With the emergence of the sixth generation (6G) and beyond communication networks, supporting massive machine-type communications with sporadic activity patterns is expected to become a critical challenge. Unsourced random access (URA) has emerged as a promising paradigm to address this challenge by decoupling user identification from data transmission through the use of a common codebook. This survey offers a comprehensive overview of URA solutions, encompassing both theoretical foundations and practical applications. We present a systematic classification of URA solutions across three primary channel models: Gaussian multiple access channels (GMACs), single-antenna fading channels, and multiple-input multiple-output (MIMO) fading channels. For each category, we analyze and compare state-of-the-art solutions in terms of performance, complexity, and practical feasibility. Additionally, we discuss critical challenges such as interference management, computational complexity, and synchronization. The survey concludes with promising future research directions and potential methods to address existing limitations, providing a roadmap for researchers and practitioners in this rapidly evolving field.
title Unsourced Random Access: A Comprehensive Survey
topic Information Theory
url https://arxiv.org/abs/2409.14911