English
Related papers

Related papers: Unsourced Random Access Using Multiple Stages of O…

200 papers

In this work, we introduce the pattern-domain pilot design paradigm based on a "superposition of orthogonal-building-blocks" with significantly larger contention space to enhance the massive machine-type communications (mMTC) random access…

Information Theory · Computer Science 2025-10-28 Xiaoming Dai , Tiantian Yan , Qianqian Li , Hua Li , Xiyuan Wang

The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model,…

Networking and Internet Architecture · Computer Science 2017-07-04 Enrico Paolini , Cedomir Stefanovic , Gianluigi Liva , Petar Popovski

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…

Signal Processing · Electrical Eng. & Systems 2024-12-09 Ao Chen , Wei Chen , Bo Ai , Petar Popovski

In this paper, we study an unmanned aerial vehicle (UAV)-aided non-orthogonal multiple access (NOMA) multi-way relaying networks (MWRNs). Multiple terrestrial users aim to exchange their mutual information via an amplify-and-forward (AF)…

Information Theory · Computer Science 2020-05-19 Xingwang Li , Qunshu Wang , Yuanwei Liu , Theodoros A. Tsiftsis , Zhiguo Ding , Arumugam Nallanathan

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…

Information Theory · Computer Science 2024-11-18 Yifei Yuan , Yuhong Huang , Chunlin Yan , Sen Wang , Shuai Ma , Xiaodong Shen

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

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)…

Information Theory · Computer Science 2015-03-19 Huyen-Chi Bui , Jérôme Lacan , Marie-Laure Boucheret

This paper investigates the problem of resource allocation for joint communication and radar sensing system on rate-splitting multiple access (RSMA) based unmanned aerial vehicle (UAV) system. UAV simultaneously communicates with multiple…

Information Theory · Computer Science 2021-07-13 Yuwei Li , Wanli Ni , Hui Tian , Meihui Hua , Shaoshuai Fan

We propose a pilot-data transmission overlay scheme for multipair massive multiple-input multiple-output (MIMO) relaying systems employing either half- or full-duplex (HD or FD) communications at the relay station (RS). In the proposed…

Information Theory · Computer Science 2016-06-06 Leyuan Pan , Yongyu Dai , Wei Xu , Xiaodai Dong

To improve the sum-rate (SR) of the dual-hop relay system, a novel two-stage power allocation scheme with non-orthogonal multiple access (NOMA) is proposed. In this scheme, after the reception of the superposition coded symbol with a power…

Information Theory · Computer Science 2016-04-14 Wei Duan , Miaowen Wen , Yier Yan , Zixiang Xiong , Moon Ho Lee

Large communication networks, e.g. Internet of Things (IoT), are known to be vulnerable to co-channel interference. One possibility to address this issue is the use of orthogonal multiple access (OMA) techniques. However, due to a…

Information Theory · Computer Science 2020-03-20 Steven Kisseleff , Symeon Chatzinotas , Björn Ottersten

In this paper, a simple variation of classical Slotted Aloha is introduced and analyzed. The enhancement relies on adding multiple receivers that gather different observations of the packets transmitted by a user population in one slot. For…

Networking and Internet Architecture · Computer Science 2014-01-16 Andrea Munari , Michael Heindlmaier , Gianluigi Liva , Matteo Berioli

A new universal coding/decoding scheme for random access with collision detection is given in the case of two senders. The result is used to give an achievable joint source-channel coding error exponent for multiple access channels in the…

Information Theory · Computer Science 2013-09-19 Lóránt Farkas , Tamás Kói

In this work, we propose three pilot assignment schemes to reduce the effect of pilot contamination in cell-free massive multiple-input-multiple-output (MIMO) systems. Our first algorithm, which is based on the idea of random sequential…

Information Theory · Computer Science 2021-05-21 Priyabrata Parida , Harpreet S. Dhillon

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 introduces a novel communication paradigm for the unsourced, uncoordinated Gaussian multiple access problem. The major components of the envisioned framework are as follows. The encoded bits of every message are partitioned…

Information Theory · Computer Science 2020-11-23 Asit Pradhan , Vamsi Amalladinne , Avinash Vem , Krishna R. Narayanan , Jean-Francois Chamberland

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,…

Information Theory · Computer Science 2023-02-23 Khac-Hoang Ngo , Alejandro Lancho , Giuseppe Durisi , Alexandre Graell i Amat

We address a decentralized wireless communication network with a fixed number $u$ of frequency sub-bands to be shared among $N$ transmitter-receiver pairs. It is assumed that the number of users $N$ is a random variable with a given…

Information Theory · Computer Science 2009-12-01 Kamyar Moshksar , Alireza Bayesteh , Amir K. Khandani

Slotted Aloha-based Random Access (RA) techniques have recently regained attention in light of the use of Interference Cancellation (IC) as a mean to exploit diversity created through the transmission of multiple burst copies per packet…

Information Theory · Computer Science 2015-01-29 Alessio Meloni , Maurizio Murroni

Modern random access protocols are emerging as an efficient yet simple solution for arising internet of things (IoT) applications in upcoming beyond-5G systems. In this context, both terrestrial and non-terrestrial scenarios can benefit…

Information Theory · Computer Science 2019-06-06 Andrea Munari , Federico Clazzer
‹ Prev 1 3 4 5 6 7 10 Next ›