English
Related papers

Related papers: Asymptotic Performance of Coded Slotted ALOHA with…

200 papers

We propose a collision recovery scheme for symbol-synchronous slotted ALOHA (SA) based on physical layer network coding over extended Galois Fields. Information is extracted from colliding bursts allowing to achieve higher maximum…

Networking and Internet Architecture · Computer Science 2016-11-17 Giuseppe Cocco , Nader Alagha , Christian Ibars , Stefano Cioni

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 paper considers the slotted ALOHA protocol in a communication channel shared by N users. It is assumed that the channel has the multiple-packet reception (MPR) capability that allows the correct reception of up to M ($1 \leq M < N$)…

Information Theory · Computer Science 2017-07-26 Yijin Zhang , Yuan-Hsun Lo , Feng Shu , Jun Li

This paper introduces a random multiple access method for satellite communications, named Network Coding-based Slotted Aloha (NCSA). The goal is to improve diversity of data bursts on a slotted-ALOHA-like channel thanks to error correcting…

Information Theory · Computer Science 2010-09-27 Huyen Chi Bui , Jerome Lacan , Marie-Laure Boucheret

This paper proposes an improvement of the random multiple access scheme for satellite communication named Multislot coded ALOHA (MuSCA). MuSCA is a generalization of Contention Resolution Diversity Slotted ALOHA (CRDSA). In this scheme,…

Information Theory · Computer Science 2012-07-04 Huyen Chi Bui , Jérôme Lacan , Marie-Laure Boucheret

This is a sequel of our previous work [8] on characterization of maximum sum rate of slotted Aloha networks. By extending the analysis to incorporate the capacity-achieving receiver structure, Successive Interference Cancellation (SIC),…

Information Theory · Computer Science 2018-03-12 Yitong Li , Lin Dai

We analyze the performance of coded slotted ALOHA systems for a scenario where users have different error protection requirements and correspondingly can be divided into user classes. The main goal is to design the system so that the…

Information Theory · Computer Science 2016-09-20 Mikhail Ivanov , Fredrik Brannstrom , Alexandre Graell i Amat , Gianluigi Liva

We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted ALOHA (IRSA) scheme is investigated and achievability bounds…

Information Theory · Computer Science 2018-11-20 Anton Glebov , Nikolay Matveev , Kirill Andreev , Alexey Frolov , Andrey Turlikov

We consider framed slotted Aloha where $m$ base stations cooperate to decode messages from $n$ users. Users and base stations are placed uniformly at random over an area. At each frame, each user sends multiple replicas of its packet…

Information Theory · Computer Science 2014-01-28 Dusan Jakovetic , Dragana Bajovic , Dejan Vukobratovic , Vladimir Crnojevic

Recently a new Random Access technique based on Aloha and using Interference Cancellation (IC) named Sliding Window Contention Resolution Diversity Slotted Aloha (SW-CRDSA) has been introduced. Differently from classic CRDSA that operates…

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

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…

Information Theory · Computer Science 2019-03-11 Andrea Munari , Federico Clazzer , Gianluigi Liva , Michael Heindlmaier

Random access protocols relying on the transmission of packet replicas in multiple slots and exploiting interference cancellation at the receiver have been shown to achieve per- formance competitive with that of orthogonal schemes. So far…

Information Theory · Computer Science 2017-07-03 Federico Clazzer , Enrico Paolini , Iacopo Mambelli , Cedomir Stefanovic

Various applications of wireless Machine-to-Machine (M2M) communications have rekindled the research interest in random access protocols, suitable to support a large number of connected devices. Slotted ALOHA and its derivatives represent a…

Information Theory · Computer Science 2013-08-08 Cedomir Stefanovic , Petar Popovski

In this paper, the problem of using uncoordinated multiple access (UMA) to serve a massive amount of heterogeneous users is investigated. Leveraging the heterogeneity, we propose a novel UMA protocol, called iterative collision resolution…

Information Theory · Computer Science 2020-12-25 Yu-Chih Huang , Shin-Lin Shieh , Yu-Pin Hsu , Hao-Ping Cheng

We present a framework for the analysis of the error floor of coded slotted ALOHA (CSA) for finite frame lengths over the packet erasure channel. The error floor is caused by stopping sets in the corresponding bipartite graph, whose…

Information Theory · Computer Science 2015-01-27 Mikhail Ivanov , Fredrik Brannstrom , Alexandre Graell i Amat , Petar Popovski

Motivated by the need to hide the complexity of the physical layer from performance analysis in a layer 2 protocol, a class of abstract receivers, called Poisson receivers, was recently proposed in [1] as a probabilistic framework for…

Networking and Internet Architecture · Computer Science 2025-07-17 Tzu-Hsuan Liu , Che-Hao Yu , Yi-Jheng Lin , Cheng-Shang Chang , Duan-Shin Lee

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…

Information Theory · Computer Science 2017-12-11 Jinho Choi

We propose an uncoordinated medium access control (MAC) protocol, called all-to-all broadcast coded slotted ALOHA (B-CSA) for reliable all-to-all broadcast with strict latency constraints. In B-CSA, each user acts as both transmitter and…

Information Theory · Computer Science 2016-05-26 Mikhail Ivanov , Fredrik Brannstrom , Alexandre Graell i Amat , Petar Popovski

In this paper, we present a framework for convolutional coded Poisson receivers (CCPRs) that incorporates spatially coupled methods into the architecture of coded Poisson receivers (CPRs). We use density evolution equations to track the…

Information Theory · Computer Science 2024-04-25 Cheng-En Lee , Kuo-Yu Liao , Hsiao-Wen Yu , Ruhui Zhang , Cheng-Shang Chang , Duan-Shin Lee

This paper presents a finite length analysis of multi-slot type frameless ALOHA based on a dynamic programming approach. The analysis is exact, but its evaluation is only feasible for moderate number of users due to the computational…

Information Theory · Computer Science 2020-07-07 Francisco Lázaro , Čedomir Stefanović , Petar Popovski