Unsourced Random Access: A Comprehensive Survey

September 23, 2024 Β· The Cartographer Β· πŸ› IEEE Communications Surveys and Tutorials

πŸ“š THE CARTOGRAPHER: The Cartographer
Survey/review paper β€” maps the landscape rather than implementing a method.

"No code URL or promise found in abstract"
"Title-pattern auto-detect: Unsourced Random Access: A Comprehensive Survey"

Evidence collected by the PWNC Scanner

Authors Mert Ozates, Mohammad Javad Ahmadi, Mohammad Kazemi, Deniz GΓΌndΓΌz, Tolga M. Duman arXiv ID 2409.14911 Category cs.IT: Information Theory Citations 10 Venue IEEE Communications Surveys and Tutorials Last Checked 3 days ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory