English
Related papers

Related papers: ALOHA Receivers: a Network Calculus Approach for A…

200 papers

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

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

In this paper we present a simple, stochastic-geometric model of a wireless access network exploiting the LoRA (Long Range) protocol, which is a non-expensive technology allowing for long-range, single-hop connectivity for the Internet of…

Networking and Internet Architecture · Computer Science 2019-06-19 Bartłomiej Błaszczyszyn , Paul Mühlethaler

In this paper, we propose a Slotted ALOHA (SA)-inspired solution for an indoor optical wireless communication (OWC)-based Internet of Things (IoT) system. Assuming that the OWC receiver exploits the capture effect, we are interested in the…

Networking and Internet Architecture · Computer Science 2022-11-17 Tijana Devaja , Milica Petkovic , Francisco J. Escribano , Cedomir Stefanovic , Dejan Vukobratovic

In this letter, we develop a converse bound on the asymptotic load threshold of coded slotted ALOHA (CSA) schemes with K-multi packet reception capabilities at the receiver. Density evolution is used to track the average probability of…

Information Theory · Computer Science 2017-10-13 Cedomir Stefanovic , Enrico Paolini , Gianluigi Liva

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

We consider a multi-channel communication system under ALOHA and CSMA protocols, resepctively, in continuous time. We derive probabilistic formulas for the most important quantities: the numbers of sending attempts and the number of…

Probability · Mathematics 2022-12-19 Wolfgang König , Helia Shafigh

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

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

This paper proposes a new medium access control (MAC) protocol for Internet of Things (IoT) applications incorporating pure ALOHA with power domain non-orthogonal multiple access (NOMA) in which the number of transmitters are not known as a…

Signal Processing · Electrical Eng. & Systems 2018-03-28 Eren Balevi , Faeik T. Al Rabee , Richard D. Gitlin

An interference management problem among multiple overlapped random access networks (RANs) is investigated, each of which operates with slotted ALOHA protocol. Assuming that access points and users have multiple antennas, a novel…

Information Theory · Computer Science 2016-11-17 Hu Jin , Sang-Woon Jeon , Bang Chul Jung

In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson clustered…

Information Theory · Computer Science 2010-10-11 RadhaKrishna Ganti , Martin Haenggi

In "On Coding for Reliable Communication over Packet Networks" (Lun, Medard, and Effros, Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, 2004), a capacity-achieving coding scheme for unicast or multicast over lossy…

Information Theory · Computer Science 2007-07-16 Desmond S. Lun , Muriel Medard , Ralf Koetter , Michelle Effros

In this article, we consider a random access scheme for an indoor Internet of Things (IoT) framework that uses optical wireless communication (OWC). We focus on a Slotted ALOHA (SA)-based solution where a number of OWC IoT users contend to…

Information Theory · Computer Science 2021-07-16 Milica Petkovic , Tijana Devaja , Dejan Vukobratovic , Francisco J. Escribano , Cedomir Stefanovic

Random Access MAC protocols are simple and effective when the nature of the traffic is unpredictable and sporadic. In the following paper, investigations on the new Enhanced Contention Resolution ALOHA (ECRA) are presented, where some new…

Information Theory · Computer Science 2013-02-28 Federico Clazzer , Christian Kissling

Slotted ALOHA can benefit from physical-layer network coding (PNC) by decoding one or multiple linear combinations of the packets simultaneously transmitted in a timeslot, forming a system of linear equations. Different systems of linear…

Information Theory · Computer Science 2015-02-16 Shenghao Yang , Yi Chen , Soung Chang Liew , Lizhao You

Slotted ALOHA (SA) algorithms with Successive Interference Cancellation (SIC) decoding have received significant attention lately due to their ability to dramatically increase the throughput of traditional SA. Motivated by increased density…

Information Theory · Computer Science 2017-06-30 Aleksandar Mastilovic , Dejan Vukobratovic , Dusan Jakovetic , Dragana Bajovic

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

In this paper, we explore the use of machine learning methods as an efficient alternative to correlation in performing packet detection. Targeting satellite-based massive machine type communications and internet of things scenarios, our…

Networking and Internet Architecture · Computer Science 2020-08-26 Estefania Recayte , Andrea Munari , Federico Clazzer

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