Related papers: Massive Unsourced Random Access: Exploiting Angula…
The problem of uplink transmissions in massive connectivity is commonly dealt with using schemes for grant-free random access. When a large number of devices transmit almost synchronously, the receiver may not be able to resolve the…
In this paper, we investigate an unsourced random access scheme for massive machine-type communications (mMTC) in the sixth-generation (6G) wireless networks with sporadic data traffic. Firstly, we establish a general framework for massive…
We present an unsourced multiple access (UMAC) scheme tailored to high-mobility wireless channels. The proposed construction is based on orthogonal time frequency space (OTFS) modulation and sparse interleaver division multiple access…
This paper investigates asynchronous multiple-input multiple-output (MIMO) massive unsourced random access (URA) in an orthogonal frequency division multiplexing (OFDM) system over frequency-selective fading channels, with the presence of…
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…
In this paper, we propose a novel fully Bayesian approach for the massive multiple-input multiple-output (MIMO) massive unsourced random access (URA). The payload of each user device is coded by the sparse regression codes (SPARCs) without…
This article introduces a novel communication scheme, termed coded compressed sensing, for unsourced multiple-access communication. The proposed divide-and-conquer approach leverages recent advances in compressed sensing and forward error…
In this paper, we introduce Multi-Slots Coded ALOHA (MuSCA) as a multiple random access method for satellite communications. This scheme can be considered as a generalization of the Contention Resolution Diversity Slotted Aloha (CRDSA)…
In this paper, coded slotted ALOHA (CSA) is introduced as a powerful random access scheme to the MAC frame. In CSA, the burst a generic user wishes to transmit in the MAC frame is first split into segments, and these segments are then…
We introduce a "one shot" random access procedure where users can send a message without a priori synchronizing with the network. In this procedure a common overloaded control channel is used to jointly detect sparse user activity and…
This paper investigates a reconfigurable intelligent surface (RIS)-aided unsourced random access (URA) scheme for the sixth-generation (6G) wireless networks with massive sporadic traffic devices. First of all, this paper proposes a novel…
In this paper, an improved ALOHA-based unsourced random access (URA) scheme is proposed in MIMO channels. The channel coherent interval is divided into multiple sub-slots and each active user selects several sub-slots to send its codeword,…
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…
This article seeks to advance coded compressed sensing (CCS) as a practical scheme for unsourced random access. The original CCS algorithm features a concatenated structure where an inner code is tasked with support recovery, and an outer…
This article introduces a novel paradigm for the unsourced multiple-access communication problem. This divide-and-conquer approach leverages recent advances in compressive sensing and forward error correction to produce a computationally…
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…
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…
In this paper, a random access scheme is introduced which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph representation…
In this paper, we discuss the potential for improvement of the simple random access scheme by utilizing local information such as the received signal-to-interference-plus-noise-ratio (SINR). We propose a spatially adaptive random access…
This work considers the problem of integrated sensing and communications (ISAC) with a massive number of unsourced and uncoordinated users. In the proposed model, known as the unsourced ISAC system (UNISAC), all active communication and…