ALOHA Receivers: a Network Calculus Approach for Analyzing Coded Multiple Access with SIC

TL;DR

This paper introduces a deterministic ALOHA receiver framework based on network calculus, enabling analysis of coded multiple access with SIC and integrating with probabilistic Poisson receivers for uplink performance modeling.

Contribution

It proposes a novel deterministic ALOHA receiver model, derives algebraic properties, and demonstrates closure properties, enhancing analysis of coded multiple access with SIC.

Findings

Theoretical results match simulation data closely.

Closure properties of ALOHA receivers are established.

Framework supports analysis of various receiver configurations.

Abstract

Motivated by the need to hide the complexity of the physical layer from performance analysis in a layer 2 protocol, a class of abstract receivers, called Poisson receivers, was recently proposed in [1] as a probabilistic framework for providing differentiated services in uplink transmissions in 5G networks. In this paper, we further propose a deterministic framework of ALOHA receivers that can be incorporated into the probabilistic framework of Poisson receivers for analyzing coded multiple access with successive interference cancellation. An ALOHA receiver is characterized by a success function of the number of packets that can be successfully received. Inspired by the theory of network calculus, we derive various algebraic properties for several operations on success functions and use them to prove various closure properties of ALOHA receivers, including (i) ALOHA receivers in tandem, (ii) cooperative ALOHA receivers, (iii) ALOHA receivers with traffic multiplexing, and (iv) ALOHA receivers with packet coding. By conducting extensive simulations, we show that our theoretical results match extremely well with the simulation results.