English
Related papers

Related papers: Coded Random Access: Applying Codes on Graphs to D…

200 papers

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

Leveraging recent progress in physical-layer network coding we propose a new approach to random access: When packets collide, it is possible to recover a linear combination of the packets at the receiver. Over many rounds of transmission,…

Information Theory · Computer Science 2012-12-27 Jasper Goseling , Michael Gastpar , Jos H. Weber

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 we investigate the effect of spatial coupling applied to the recently-proposed coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the graphical model describing the iterative interference…

Information Theory · Computer Science 2016-11-17 Gianluigi Liva , Enrico Paolini , Michael Lentmaier , Marco Chiani

The recent research has established an analogy between successive interference cancellation in slotted ALOHA framework and iterative belief-propagation erasure-decoding, which has opened the possibility to enhance random access protocols by…

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

The random access scheme is a fundamental scenario in which users transmit through a shared channel and cannot coordinate each other. In recent years, successive interference cancellation (SIC) was introduced into the random access scheme.…

Information Theory · Computer Science 2018-04-16 Tomokazu Emoto , Takayuki Nozaki

We propose a novel distributed random access scheme for wireless networks based on slotted ALOHA, motivated by the analogies between successive interference cancellation and iterative belief-propagation decoding on erasure channels. The…

Information Theory · Computer Science 2016-11-15 Cedomir Stefanovic , Petar Popovski , Dejan Vukobratovic

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

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

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

Recently, random access protocols have acquired a new wave of interest, not only from the satellite communication community, but also from researchers active in fields like Internet of Things and machine-to-machine. Asynchronous (slot- and…

Information Theory · Computer Science 2017-10-09 Federico Clazzer , Christian Kissling , Mario Marchese

The random access methods used for support of machine-type communications (MTC) in current cellular standards are derivatives of traditional framed slotted ALOHA and therefore do not support high user loads efficiently. Motivated by the…

Information Theory · Computer Science 2012-07-03 Nuno K. Pratas , Henning Thomsen , Cedomir Stefanovic , Petar Popovski

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…

Information Theory · Computer Science 2016-05-20 Jesper H. Sørensen , Elisabeth de Carvalho , Čedomir Stefanović , Petar Popovski

The thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in machine-type communications (MTC). First, a joint user activity identification and channel estimation…

Information Theory · Computer Science 2019-06-11 Zhuo Sun

Massive machine-type communications protocols have typically been designed under the assumption that coordination between users requires significant communication overhead and is thus impractical. Recent progress in efficient activity…

Information Theory · Computer Science 2022-07-12 Justin Kang , Wei Yu

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

The analogies between successive interference cancellation (SIC) in slotted ALOHA framework and iterative belief-propagation erasure-decoding, established recently, enabled the application of the erasure-coding theory and tools to design…

Information Theory · Computer Science 2016-11-17 Cedomir Stefanovic , Miyu Momoda , Petar Popovski

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

We develop a framework for communication-control co-design in a wireless networked control system with multiple geographically separated controllers and controlled systems, modeled via a Poisson point process. Each controlled system…

Information Theory · Computer Science 2024-12-02 Gourab Ghatak , Geethu Joseph , Chen Quan
‹ Prev 1 2 3 10 Next ›