English
Related papers

Related papers: Unsourced Random Access

200 papers

This report summarizes some considerations on possible evolutions of grant-free random access in the next generation of the 3GPP wireless cellular standard. The analysis is carried out by mapping the problem to the recently-introduced…

We study the problem of unsourced random access (URA) over Rayleigh block-fading channels with a receiver equipped with multiple antennas. We propose a slotted structure with multiple stages of orthogonal pilots, each of which is randomly…

Information Theory · Computer Science 2023-07-17 Mohammad Javad Ahmadi , Mohammad Kazemi , Tolga M. Duman

Unsourced random access (URA) has emerged as a candidate paradigm for massive machine-type communication (MTC) in next-generation wireless networks. While many excellent uplink schemes have been developed for URA, these schemes do not…

Information Theory · Computer Science 2022-06-06 Jamison R. Ebert , Krishna R. Narayanan , Jean-Francois Chamberland

In this paper, a novel uncoordinated random access (URA) protocol is presented to address the pressing demand for massive connectivity with low access latency in future massive machine type communication (mMTC) scenarios. The proposed URA…

Signal Processing · Electrical Eng. & Systems 2025-10-28 Pengyu Gao , Qu Luo , Jing Zhu , Gaojie Chen , Pei Xiao , Chuan Heng Foh

Unsourced random access (URA) has emerged as a pragmatic framework for next-generation distributed sensor networks. Within URA, concatenated coding structures are often employed to ensure that the central base station can accurately recover…

Information Theory · Computer Science 2021-12-02 Vamsi K. Amalladinne , Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

This work introduces security for unsourced random access (URA) by employing physical layer security techniques. To achieve confidentiality, the proposed system opportunistically exploits intrinsic features of feedback-aided URA without…

Information Theory · Computer Science 2026-03-26 Mohammad Javad Ahmadi , Rafael F. Schaefer , H. Vincent Poor

We consider an unsourced random access (URA) system enhanced with a feedback mechanism that serves both communication and sensing tasks. While traditional URA systems do not incorporate feedback, we propose a novel feedback signal design…

Information Theory · Computer Science 2025-06-26 Mohammad Javad Ahmadi , Mohammad Kazemi , Rafael F. Schaefer

Cell-Free Massive MIMO systems aim to expand the coverage area of wireless networks by replacing a single high-performance Access Point (AP) with multiple small, distributed APs connected to a Central Processing Unit (CPU) through a…

Information Theory · Computer Science 2023-11-13 Michail Gkagkos , Jean-Francois Chamberland , Costas N. Georghiades , Krishna R. Narayanan

We consider the unsourced random access problem with multiple receivers and propose a cell-free type solution for that. In our proposed scheme, the active users transmit their signals to the access points (APs) distributed in a geographical…

Emerging Technologies · Computer Science 2025-01-20 Mert Ozates , Mohammad Kazemi , Eduard Jorswieck , Deniz Gunduz

Unsourced random-access (U-RA) is a type of grant-free random access with a virtually unlimited number of users, of which only a certain number $K_a$ are active on the same time slot. Users employ exactly the same codebook, and the task of…

Information Theory · Computer Science 2021-12-10 Alexander Fengler , Peter Jung , Giuseppe Caire

In this paper, we explore an efficient uncoupled unsourced random access (UURA) scheme for 6G massive communication. UURA is a typical framework of unsourced random access that addresses the problems of codeword detection and message…

Information Theory · Computer Science 2024-05-07 Feiyan Tian , Xiaoming Chen , Chongwen Huang , Zhaoyang Zhang

Unsourced random access (URA) is a recently proposed multiple access paradigm tailored to the uplink channel of machine-type communication networks. By exploiting a strong connection between URA and compressed sensing, the massive multiple…

Information Theory · Computer Science 2022-06-28 Jamison R. Ebert , Vamsi K. Amalladinne , Stefano Rini , Jean-Francois Chamberland , Krishna R. Narayanan

This paper explores the fundamental limits of unsourced random access (URA) with a random and unknown number ${\rm{K}}_a$ of active users in MIMO quasi-static Rayleigh fading channels. First, we derive an upper bound on the probability of…

Information Theory · Computer Science 2024-04-16 Junyuan Gao , Yongpeng Wu , Giuseppe Caire , Wei Yang , Wenjun Zhang

Emerging communication networks are envisioned to support massive wireless connectivity of heterogeneous devices with sporadic traffic and diverse requirements in terms of latency, reliability, and bandwidth. Providing multiple access to an…

Information Theory · Computer Science 2023-04-19 Sajad Daei , Marios Kountouris

We consider unsourced random access (uRA) in a cell-free (CF) user-centric wireless network, where a large number of potential users compete for a random access slot, while only a finite subset is active. The random access users transmit…

Information Theory · Computer Science 2025-05-01 Burak Çakmak , Eleni Gkiouzepi , Manfred Opper , Giuseppe Caire

In the Internet-of-Things (IoT), random access is employed for devices to share a common access channel in packet transmission with low signaling overhead. Although a retransmission strategy is necessary for packet collision resolution, it…

Information Theory · Computer Science 2019-07-23 Jinho Choi

The newly introduced ultra-reliable low latency communication service class in 5G New Radio depends on innovative low latency radio resource management solutions that can guarantee high reliability. Grant-free random access, where channel…

Networking and Internet Architecture · Computer Science 2019-04-12 Nurul Huda Mahmood , Renato Abreu , Ronald Böhnke , Martin Schubert , Gilberto Berardinelli , Thomas H. Jacobsen

This paper investigates the energy efficiency of massive unsourced random access~(URA) in multiple-input multiple-output quasi-static Rayleigh fading channels. Specifically, we derive achievability and converse bounds on the minimum…

Information Theory · Computer Science 2023-02-07 Junyuan Gao , Yongpeng Wu , Tianya Li , Wenjun Zhang

We investigate the unsourced random access scheme assuming that the base station is equipped with multiple antennas, and propose a high-performing solution utilizing on-off-division multiple access. We assume that each user spreads its…

Information Theory · Computer Science 2024-06-11 Mert Ozates , Mohammad Kazemi , Tolga M. Duman

We investigate the coexistence of massive and critical Internet of Things (IoT) services in the context of the unsourced multiple access (UMA) framework introduced by Polyanskiy (2017), where all users employ a common codebook and the…

Information Theory · Computer Science 2023-10-16 Khac-Hoang Ngo , Giuseppe Durisi , Alexandre Graell i Amat , Petar Popovski , Anders E. Kalor , Beatriz Soret