Related papers: Reliability-Latency Performance of Frameless ALOHA…
In this paper we present an exact finite-length analysis of frameless ALOHA that is obtained through a dynamical programming approach. Monte Carlo simulations are performed in order to verify the analysis. Two examples are provided that…
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…
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…
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…
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…
We consider a frame asynchronous coded slotted ALOHA (FA-CSA) system for uncoordinated multiple access, where users join the system on a slot-by-slot basis according to a Poisson random process and, in contrast to standard frame synchronous…
We consider a frame-asynchronous coded slotted ALOHA (FA-CSA) system where users become active according to a Poisson random process. In contrast to standard frame-synchronous CSA (FS-CSA), users transmit a first replica of their message in…
We analyze the performance of coded slotted ALOHA systems for a scenario where users have different error protection requirements and correspondingly can be divided into user classes. The main goal is to design the system so that the…
We study the dynamic behavior of frameless ALOHA, both in terms of throughput and age of information (AoI). In particular, differently from previous studies, our analysis accounts for the fact that the number of terminals contending the…
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…
Herein, we consider the problem of cooperative multi-access in the presence of overlapped coverage areas. Assuming a frameless ALOHA transmission scheme, we derive exact analytical throughput expressions for throughput in the aforementioned…
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…
We focus on a slotted ALOHA system without feedback, in which nodes transmit time-stamped updates to a common gateway. Departing from the classical generate-at-will model, we assume that each transmitter may not always have fresh…
Enabling autonomous driving and industrial automation with wireless networks poses many challenges, which are typically abstracted through reliability and latency requirements. One of the main contributors to latency in cellular networks is…
In this paper, a simple variation of classical Slotted Aloha is introduced and analyzed. The enhancement relies on adding multiple receivers that gather different observations of the packets transmitted by a user population in one slot. For…
In Dynamic-Frame Aloha subsequent frame lengths must be optimally chosen to maximize throughput. When the initial population size ${\cal N}$ is known, numerical evaluations show that the maximum efficiency is achieved by setting the frame…
In this paper we investigate backlog estimation procedures for Dynamic Frame Aloha (DFA) in Radio Frequency Identification (RFID) environment. In particular, we address the tag identification efficiency with any tag number $N$, including…
ALOHA is one of the most basic Medium Access Control (MAC) protocols and represents a foundation for other more sophisticated distributed and asynchronous MAC protocols, e.g., CSMA. In this paper, unlike in the traditional work that focused…
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…
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,…