Related papers: An ODMA-Based Unsourced Random Access Scheme with …
We consider the problem of unsourced random access (U-RA), a grant-free uncoordinated form of random access, in a wireless channel with a massive MIMO base station equipped with a large number $M$ of antennas and a large number of wireless…
Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability and spectral efficiency of such schemes, the use of multiple…
In this paper, we propose a new polar coding scheme for the unsourced, uncoordinated Gaussian random access channel. Our scheme is based on sparse spreading, treat interference as noise and successive interference cancellation (SIC). On the…
In this paper, we study a layered random access scheme based on non-orthogonal multiple access (NOMA) to improve the throughput of multichannel ALOHA. At a receiver, successive interference cancellation (SIC) is carried out across layers to…
This paper investigates the massive random access for a huge amount of user devices served by a base station (BS) equipped with a massive number of antennas. We consider a grant-free unsourced random access (U-RA) scheme where all users…
We consider a classical multiple access system with a single transmission channel, finite number of users (users), and randomized transmission protocol (ALOHA). We assume that every user sends messages to the base station with various…
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…
In this work, we discuss the problem of unsourced random access (URA) over a Gaussian multiple access channel (GMAC). To address the challenges posed by emerging massive machine-type connectivity, URA reframes multiple access as a…
This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully…
We present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling…
This letter considers two groups of source nodes. Each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without…
Massive communication is one of key scenarios of 6G where two magnitude higher connection density would be required to serve diverse services. As a promising direction, unsourced multiple access has been proved to outperform significantly…
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…
In nonorthogonal multiple access (NOMA), the power difference of multiple signals is exploited for multiple access and successive interference cancellation (SIC) is employed at a receiver to mitigate co-channel interference. Thus, NOMA is…
This paper addresses the unsourced/uncoordinated random access problem in an integrated sensing and communications (ISAC) system, with a focus on uplink multiple access code design. Recent theoretical advancements highlight that an ISAC…
The core requirement of massive Machine-Type Communication (mMTC) is to support reliable and fast access for an enormous number of machine-type devices (MTDs). In many practical applications, the base station (BS) only concerns the list of…
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…
To account for the massive uncoordinated random access scenario, which is relevant for the Internet of Things, Polyanskiy (2017) proposed a novel formulation of the multiple-access problem, commonly referred to as unsourced multiple access,…
This article presents a novel enhancement to the random spreading based coding scheme developed by Pradhan et al.\ for the unsourced multiple access channel. The original coding scheme features a polar outer code in conjunction with a…
In this paper, pattern division multiple access with large-scale antenna array (LSA-PDMA) is proposed as a novel non-orthogonal multiple access (NOMA) scheme. In the proposed scheme, pattern is designed in both beam domain and power domain…