English
Related papers

Related papers: Massive Unsourced Random Access: Exploiting Angula…

200 papers

A framework for the analysis of synchronous grant-free massive multiple access schemes based on the irregular repetition slotted ALOHA (IRSA) protocol and operating over the Gaussian multiple access channel is presented. IRSA-based schemes…

Information Theory · Computer Science 2024-02-22 Velio Tralli , Enrico Paolini

This article presents a novel transmission scheme for the unsourced, uncoordinated Gaussian multiple access problem. The proposed scheme leverages notions from single-user coding, random spreading, minimum-mean squared error (MMSE)…

Information Theory · Computer Science 2019-11-05 Asit Kumar Pradhan , Vamsi K. Amalladinne , Krishna R. Narayanan , Jean-Francois Chamberland

This paper investigates the unsourced random access (URA) problem for integrated sensing and commutations (ISAC). Recent results reveal that conventional multiple access strategies for ISAC such as treating interference as noise (TIN) and…

Information Theory · Computer Science 2025-09-22 Zhentian Zhang , Kai-Kit Wong , Jian Dang , Zaichen Zhang , Chan-Byoung Chae

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

Massive random access of devices in the emerging Open Radio Access Network (O-RAN) brings great challenge to the access control and management. Exploiting the bursting nature of the access requests, sparse active user detection (SAUD) is an…

Machine Learning · Computer Science 2023-03-07 Xiao Tang , Sicong Liu , Xiaojiang Du , Mohsen Guizani

A high success rate of grant-free random access scheme is proposed to support massive access for machine-to-machine communications in massive multipleinput multiple-output systems. This scheme allows active user equipments (UEs) to transmit…

Information Theory · Computer Science 2020-12-29 Huimei Han , Lushun Fang , Weidang Lu , Wenchao Zhai , Ying Li , Jun Zhao

In this paper, we investigate a joint device activity detection (DAD), channel estimation (CE), and data decoding (DD) algorithm for multiple-input multiple-output (MIMO) massive unsourced random access (URA). Different from the…

Information Theory · Computer Science 2021-12-20 Tianya Li , Yongpeng Wu , Mengfan Zheng , Wenjun Zhang , Chengwen Xing , Jianping An , Xiang-Gen Xia , Chengshan Xiao

We introduce a modulation for unsourced massive random access whereby the transmitted symbols are rank-1 tensors constructed from Grassmannian sub-constellations. The use of a low-rank tensor structure, together with tensor decomposition in…

Information Theory · Computer Science 2020-08-13 Alexis Decurninge , Ingmar Land , Maxime Guillaud

In this paper, we investigate unsourced random access for massive machine-type communications (mMTC) in the sixth-generation (6G) wireless networks. Firstly, we establish a high-efficiency uncoupled framework for massive unsourced random…

Information Theory · Computer Science 2024-05-07 Feiyan Tian , Xiaoming Chen , Yong Liang Guan , Chau Yuen

In this paper, we study a concatenate coding scheme based on sparse regression code (SPARC) and tree code for unsourced random access in massive multiple-input and multiple-output systems. Our focus is concentrated on efficient decoding for…

Information Theory · Computer Science 2022-08-15 Juntao You , Wenjie Wang , Shansuo Liang , Wei Han , Bo Bai

This paper is a tutorial introduction to the field of unsourced multiple access (UMAC) protocols. We first provide a historical survey of the evolution of random access protocols, focusing specifically on the case in which uncoordinated…

Information Theory · Computer Science 2024-08-20 Gianluigi Liva , Yury Polyanskiy

The performance of grant-free random access (GF-RA) is limited by the number of accessible random access resources (RRs) due to the absence of collision resolution. Compressive sensing (CS)-based RA schemes scale up the RRs at the expense…

Information Theory · Computer Science 2021-03-23 Ameha Tsegaye Abebe , Chung G. Kang

We examine unsourced random access in a fully asynchronous setup, where active users transmit their data without restriction on the start time over a fading channel. In the proposed scheme, the transmitted signal consists of a pilot…

Information Theory · Computer Science 2025-12-23 Mert Ozates , Mohammad Kazemi , Gianluigi Liva , Deniz Gündüz

This paper considers the massive MIMO unsourced random access problem in a quasi-static Rayleigh fading setting. The proposed coding scheme is based on a concatenation of a "conventional" channel code (such as, e.g., LDPC) serving as an…

Signal Processing · Electrical Eng. & Systems 2023-05-01 Patrick Agostini , Zoran Utkovski , Slawomir Stanczak

Type-based unsourced multiple access (TUMA) is a recently proposed framework for type-based estimation in massive uncoordinated access networks. We extend the existing design of TUMA, developed for an additive white Gaussian channel, to a…

Information Theory · Computer Science 2025-04-29 Kaan Okumus , Khac-Hoang Ngo , Giuseppe Durisi , Erik G. Ström

This paper proposes a unified semi-blind detection framework for sourced and unsourced random access (RA), which enables next-generation ultra-reliable low-latency communications (URLLC) with massive devices. Specifically, the active…

Information Theory · Computer Science 2023-03-21 Malong Ke , Zhen Gao , Mingyu Zhou , Dezhi Zheng , Derrick Wing Kwan Ng , H. Vincent Poor

Resource allocation and multiple access schemes are instrumental for the success of communication networks, which facilitate seamless wireless connectivity among a growing population of uncoordinated and non-synchronized users. In this…

Signal Processing · Electrical Eng. & Systems 2023-06-22 Sajad Daei , Saeed Razavikia , Marios Kountouris , Mikael Skoglund , Gabor Fodor , Carlo Fischione

This paper proposes a channel access control scheme fit to dense acoustic sensor nodes in a sensor network. In the considered scenario, multiple acoustic sensor nodes within communication range of a cluster head are grouped into clusters.…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-11-06 Hyun-Gyu Ryu , Sang-Keum Lee , Dongsoo Har

The random access scheme is a fundamental scenario in which users transmit through a shared channel and cannot coordinate each other. In recent years, successive interference cancellation (SIC) was introduced into the random access scheme.…

Information Theory · Computer Science 2018-04-16 Tomokazu Emoto , Takayuki Nozaki

The unsourced MAC model was originally introduced to study the communication scenario in which a number of devices with low-complexity and low-energy wish to upload their respective messages to a base station. In the original problem…

Information Theory · Computer Science 2020-11-24 Allen Hao , Stefano Rini , Vamsi Amalladinne , Asit Kumar Pradhan , Jean-Francois Chamberland