Papers
Topics
Authors
Recent
Search
2000 character limit reached

Unsourced Random Access: A Comprehensive Survey

Published 23 Sep 2024 in cs.IT and math.IT | (2409.14911v2)

Abstract: Multiple access communication systems enable numerous users to share common communication resources simultaneously, playing a crucial role in wireless networks. With the emergence of the sixth generation (6G) and beyond communication systems, 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 provides a comprehensive overview of URA solutions, covering both theoretical foundations and practical implementations. We present a systematic classification of URA solutions across three main channel models: Gaussian multiple access channels (GMACs), single-antenna fading, 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 issues. 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.