English
Related papers

Related papers: On the stability of asynchronous Random Access Sch…

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

In-band full-duplex is emerging as a promising solution to enhance throughput in wireless networks. Allowing nodes to simultaneously send and receive data over the same bandwidth can potentially double the system capacity, and a good degree…

Networking and Internet Architecture · Computer Science 2017-09-25 Andrea Munari , Petri Mähönen , Marina Petrova

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

Modern random access protocols are emerging as an efficient yet simple solution for arising internet of things (IoT) applications in upcoming beyond-5G systems. In this context, both terrestrial and non-terrestrial scenarios can benefit…

Information Theory · Computer Science 2019-06-06 Andrea Munari , Federico Clazzer

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

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

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

Flanking traditional metrics such as throughput and reliability, age of information (AoI) is emerging as a fundamental tool to capture the performance of IoT systems. In this context, we focus on a setup in which a large number of nodes…

Networking and Internet Architecture · Computer Science 2020-05-19 Andrea Munari , Alexey Frolov

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

LoRaWAN is one of the most promising standards for IoT applications. Nevertheless, the high density of end-devices expected for each gateway, the absence of an effective synchronization scheme between gateway and end-devices, challenge the…

Networking and Internet Architecture · Computer Science 2018-09-17 Tommaso Polonelli , Davide Brunelli , Luca Benini

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

In this paper, we consider the standard discrete-time slotted ALOHA with a finite number of terminals with infinite size buffers. In our study, we jointly consider the stability of this system together with the physical layer security. We…

Information Theory · Computer Science 2009-10-29 Yunus Sarikaya , Ozgur Ercetin

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 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 sum rate performance of random-access networks crucially depends on the access protocol and receiver structure. Despite extensive studies, how to characterize the maximum sum rate of the simplest version of random access, Aloha, remains…

Information Theory · Computer Science 2015-12-18 Yitong Li , Lin Dai

We analyze the stability of standard, buffered, slotted-Aloha systems. Specifically, we consider a set of $N$ users, each equipped with an infinite buffer. Packets arrive into user $i$'s buffer according to some stationary ergodic Markovian…

Information Theory · Computer Science 2009-09-29 Charles Bordenave , David McDonald , Alexandre Proutiere

Random access (RA) schemes are a topic of high interest in machine-type communication (MTC). In RA protocols, backoff techniques such as exponential backoff (EB) are used to stabilize the system to avoid low throughput and excessive delays.…

Information Theory · Computer Science 2022-01-25 Muhammad Awais Jadoon , Adriano Pastore , Monica Navarro , Fernando Perez-Cruz

We consider a relay-aided Slotted ALOHA solution for uplink random access for an Optical Wireless Communications (OWC)-based Internet of Things (IoT). The first phase of uplink, the one between IoT devices and the relays, is realized using…

Networking and Internet Architecture · Computer Science 2022-09-23 Milica Petkovic , Dejan Vukobratović , Andrea Munari , Federico Clazzer

In this paper, a novel uncoordinated random access (URA) protocol is presented to address the pressing demand for massive connectivity with low access latency in future massive machine type communication (mMTC) scenarios. The proposed URA…

Signal Processing · Electrical Eng. & Systems 2025-10-28 Pengyu Gao , Qu Luo , Jing Zhu , Gaojie Chen , Pei Xiao , Chuan Heng Foh

In nonorthogonal multiple access (NOMA), the power difference of multiple signals is exploited for multiple access and successive interference cancellation (SIC) is employed at a receiver to mitigate co-channel interference. Thus, NOMA is…

Information Theory · Computer Science 2017-06-28 Jinho Choi