Frameless ALOHA with Combined Latency-Reliability Guarantees

Abstract

In this talk, we present an exact finite-length characterization of frameless ALOHA, a slotted ALOHA based protocol that exploits successive interference cancellation. Specifically, we study the probability mass function of the packet loss rate (PLR) as a function of the latency, which corresponds to the length of the contention period. The obtained results allow for the explicit statement of the guarantees on the protocol performance, i.e., guaranteeing certain level of PLR with certain reliability at a given latency. We also investigate protocol optimization for which we obtain the minimal latency at which the target PLR is achieved.