English
Related papers

Related papers: ALOHA Random Access that Operates as a Rateless Co…

200 papers

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

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

To efficiently utilize the scarce wireless resource, the random access scheme has been attaining renewed interest primarily in supporting the sporadic traffic of a large number of devices encountered in the Internet of Things (IoT). In this…

Information Theory · Computer Science 2024-10-24 Dick Maryopi , Daud Al Adumy , Osman Musa , Peter Jung , Agus Virgono

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

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

One of the novelties brought by 5G is that wireless system design has increasingly turned its focus on guaranteeing reliability and latency. This shifts the design objective of random access protocols from throughput optimization towards…

Information Theory · Computer Science 2017-09-08 Cedomir Stefanovic , Francisco Lazaro , Petar Popovski

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

The advent of Machine-to-Machine communication has sparked a new wave of interest to random access protocols, especially in application to LTE Random Access (RA). By analogy with classical slotted ALOHA, state-of-the-art models LTE RA as a…

Information Theory · Computer Science 2018-12-19 Mikhail Vilgelm , Sergio Rueda Linares , Wolfgang Kellerer

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

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

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

We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation…

Information Theory · Computer Science 2012-10-03 Čedomir Stefanović , Kasper F. Trilingsgaard , Nuno K. Pratas , Petar Popovski

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

In this paper, we design a novel high-throughput random access scheme for an indoor optical wireless communication (OWC) massive Internet of Things (IoT) scenario. Due to the large density of both IoT devices and OWC access points (APs), we…

Signal Processing · Electrical Eng. & Systems 2020-04-20 Dejan Vukobratovic , Francisco J. Escribano

Motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, and cyber-physical systems, supporting delay-constrained traffic becomes critical for such systems. In delay-constrained…

Information Theory · Computer Science 2022-06-23 Lei Deng , Danzhou Wu , Jing Deng , Po-Ning Chen , Yunghsiang S. Han

Grant-free random access (GFRA) is now a popular protocol for large-scale wireless multiple access systems in order to reduce control signaling. Resource allocation in GFRA can be viewed as a form of frame slotted ALOHA, where a ubiquitous…

Information Theory · Computer Science 2024-07-29 Alix Jeannerot , Malcolm Egan , Jean-Marie Gorce

In conventional backscatter communication (BackCom) systems, time division multiple access (TDMA) and frequency division multiple access (FDMA) are generally adopted for multiuser backscattering due to their simplicity in implementation.…

Information Theory · Computer Science 2025-03-10 Bowen Gu , Dong Li , Hao Xie , Kan Yu , Quansheng Guan , Yongjun Xu

Access reservation based on slotted ALOHA is commonly used in wireless cellular access. In this paper we investigate its enhancement based on the use of physical-layer network coding and signature coding, whose main feature is enabling…

Information Theory · Computer Science 2017-07-03 Jasper Goseling , Cedomir Stefanovic , Petar Popovski
‹ Prev 1 2 3 10 Next ›