English
Related papers

Related papers: Achievability Bounds for T-Fold Irregular Repetiti…

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

With the emergence of machine-driven communi- cation, there is a renewed interest in the design of random multiple access schemes for networks with large number of active devices. Many of the recently proposed access paradigms are…

Information Theory · Computer Science 2018-01-12 Arman Hasanzadeh , Jean-Francois Chamberland , Krishna Narayanan

ALOHA-type protocols became a popular solution for distributed and uncoordinated multiple random access in wireless networks. However, such distributed operation of the Medium Access Control (MAC) layer leads to sub-optimal utilization of…

Information Theory · Computer Science 2016-06-08 G. Interdonato , S. Pfletschinger , F. Vazquez-Gallego , J. Alonso-Zarate , G. Araniti

Irregular repetition slotted Aloha (IRSA) has shown significant advantages as a modern technique for uncoordinated random access with massive number of users due to its capability of achieving theoretically a throughput of $1$ packet per…

Information Theory · Computer Science 2023-12-12 Manuel Fernández-Veiga , M. E. Sousa-Vieira , Ana Fernández-Vilas , Rebeca P Díaz-Redondo

Multiple connected devices sharing common wireless resources might create interference if they access the channel simultaneously. Medium access control (MAC) protocols gener- ally regulate the access of the devices to the shared channel to…

Information Theory · Computer Science 2016-07-11 Konstantinos Dovelos , Laura Toni , Pascal Frossard

We propose an irregular repetition slotted ALOHA (IRSA) based random-access protocol for the binary adder channel (BAC). The BAC captures important physical-layer concepts, such as packet generation, per-slot decoding, and information rate,…

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

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…

Information Theory · Computer Science 2016-11-18 Enrico Paolini , Gianluigi Liva , Marco Chiani

Associated with multi-packet reception at the access point, irregular repetition slotted ALOHA (IRSA) holds a great potential in improving the access capacity of massive machine type communication systems. Considering the time-frequency…

Information Theory · Computer Science 2021-10-18 Zhengchuan Chen , Yifan Feng , Chundie Feng , Liang Liang , Yunjian Jia , Tony Q. S. Quek

Irregular repetition slotted aloha (IRSA) is a massive random access protocol in which users transmit several replicas of their packet over a frame to a base station. Existing studies have analyzed IRSA in the single-cell (SC) setup, which…

Signal Processing · Electrical Eng. & Systems 2023-02-22 Chirag Ramesh Srivatsa , Chandra R. Murthy

An information-theoretic approach to irregular repetition slotted ALOHA (IRSA) is proposed. In contrast with previous works, in which IRSA analysis is conducted only based on quantities that are typical of collision models such as the…

Information Theory · Computer Science 2022-07-15 Enrico Paolini , Lorenzo Valentini , Velio Tralli , Marco Chiani

Motivated by the analogy between successive interference cancellation and iterative belief-propagation on erasure channels, irregular repetition slotted ALOHA (IRSA) strategies have received a lot of attention in the design of medium access…

Information Theory · Computer Science 2015-01-06 Laura Toni , Pascal Frossard

Irregular repetition slotted aloha (IRSA) is a massive random access protocol which can be used to serve a large number of users while achieving a packet loss rate (PLR) close to zero. However, if the number of users is too high, then the…

Information Theory · Computer Science 2023-02-27 Chirag Ramesh Srivatsa , Chandra R. Murthy

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

Contention Resolution Diversity Slotted ALOHA (CRDSA) and its burst degree optimizations (CRDSA++, IRSA) make use of MAC burst repetitions and Interference Cancellation (IC) making possible to reach throughput values as high as $T \simeq…

Information Theory · Computer Science 2015-01-26 Alessio Meloni , Maurizio Murroni , Christian Kissling , Matteo Berioli

In this paper, we review the key figures of merit to assess the performance of advanced random access (RA) schemes exploiting physical layer coding, repetitions and collision resolution techniques. We then investigate RA modeling aspects…

Information Theory · Computer Science 2018-01-22 Alberto Mengali , Riccardo De Gaudenzi , Cedomir Stefanovic

The present paper focuses on an IoT setting in which a large number of devices generate time-stamped updates addressed to a common gateway. Medium access is regulated following a grant-free approach, and the system aims at maintaining an…

Information Theory · Computer Science 2022-10-28 Hooman Asgari , Andrea Munari , Gianluigi Liva

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…

Information Theory · Computer Science 2016-11-15 Enrico Paolini , Gianluigi Liva , Marco Chiani

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

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

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
‹ Prev 1 2 3 10 Next ›