English
Related papers

Related papers: A Pseudo-Bayesian Approach to Sign-Compute-Resolve…

200 papers

We present a comprehensive steady-state analysis of threshold-ALOHA, a distributed age-aware modification of slotted ALOHA proposed in recent literature. In threshold-ALOHA, each terminal suspends its transmissions until the Age of…

Information Theory · Computer Science 2021-02-24 Orhan Tahir Yavascan , Elif Uysal

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

This paper presents a finite length analysis of multi-slot type frameless ALOHA based on a dynamic programming approach. The analysis is exact, but its evaluation is only feasible for moderate number of users due to the computational…

Information Theory · Computer Science 2020-07-07 Francisco Lázaro , Čedomir Stefanović , Petar Popovski

Non-orthogonal multiple access (NOMA) has been considered as a promising solution for improving the spectrum efficiency of next-generation wireless networks. In this paper, the performance of a p-persistent slotted ALOHA system in support…

Networking and Internet Architecture · Computer Science 2020-02-25 Ziru Chen , Yong Liu , Sami Khairy , Lin X. Cai , Yu Cheng , Ran Zhang

We propose an uncoordinated all-to-all broadcast protocol for periodic messages in vehicular networks based on coded slotted ALOHA (CSA). Unlike classical CSA, each user acts as both transmitter and receiver in a half-duplex mode. As in…

Information Theory · Computer Science 2015-01-27 Mikhail Ivanov , Fredrik Brannstrom , Alexandre Graell i Amat , Petar Popovski

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 investigate the random access problem for a delay-constrained heterogeneous wireless network. As a first attempt to study this new problem, we consider a network with two users who deliver delay-constrained traffic to an…

Networking and Internet Architecture · Computer Science 2021-07-16 Danzhou Wu , Lei Deng , Zilong Liu , Yijin Zhang , Yunghsiang S. Han

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

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

In this paper we present a finite-length analysis of frameless ALOHA for a k multi-user detection scenario, i.e., assuming the receiver can resolve collisions of size k or smaller. The analysis is obtained via a dynamical programming…

Information Theory · Computer Science 2017-01-01 Francisco Lazaro , Cedomir Stefanovic

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 many wireless communication networks a common channel is shared by multiple users who must compete to gain access to it. The operation of the network by self-interested and strategic users usually leads to the overuse of the channel…

Computer Science and Game Theory · Computer Science 2012-11-16 Luca Canzian , Yuanzhang Xiao , Michele Zorzi , Mihaela van der Schaar

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

In this paper, an improved ALOHA-based unsourced random access (URA) scheme is proposed in MIMO channels. The channel coherent interval is divided into multiple sub-slots and each active user selects several sub-slots to send its codeword,…

Information Theory · Computer Science 2025-05-06 Linjie Yang , Pingzhi Fan , Zhiguo Ding , Jingqiu Gao

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

Recently a new Random Access technique based on Aloha and using Interference Cancellation (IC) named Sliding Window Contention Resolution Diversity Slotted Aloha (SW-CRDSA) has been introduced. Differently from classic CRDSA that operates…

Information Theory · Computer Science 2015-01-27 Alessio Meloni , Maurizio Murroni

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

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

We study medium access in FMCW radar networks. We assume that all the radars use same parameters, e.g., chirp duration, chirp slope, cutoff frequency, number of chirps per packet, etc, and propose and analyze slotted ALOHA and CSMA…

Systems and Control · Electrical Eng. & Systems 2022-01-26 Haritha K , Vineeth Bala Sukumaran , Chandramani Singh

Despite the long history of research on slotted ALOHA, the exact analysis of the average delay is still in question as the performance of each node is coupled with the activity of other nodes. In this paper, we consider a network comprised…

Systems and Control · Electrical Eng. & Systems 2023-07-13 Seyed Ali Hashemian , Farid Ashtiani