Loading…

ALOHA Receivers: A Network Calculus Approach for Analyzing Coded Multiple Access With SIC

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 by Yu et al. (2021) as a probabilistic framework for providing differentiated services in uplink transmis...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2022-04, Vol.30 (2), p.840-854
Main Authors: Liu, Tzu-Hsuan, Yu, Che-Hao, Lin, Yi-Jheng, Chang, Chia-Ming, Chang, Cheng-Shang, Lee, Duan-Shin
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 by Yu et al. (2021) 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.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2021.3123685