ALOHA接收机：一种用于分析带SIC的编码多址接入的网络演算方法
ALOHA Receivers: a Network Calculus Approach for Analyzing Coded Multiple Access with SIC
AI总结：
本文提出ALOHA接收机的确定性框架，结合Poisson接收机分析带连续干扰消除的编码多址接入，利用网络演算推导成功函数的代数性质并证明多种闭合性质，理论结果与仿真高度吻合。
摘要：
为了在层2协议的性能分析中隐藏物理层的复杂性，文献[1]最近提出了一类称为Poisson接收机的抽象接收机，作为在5G网络上行链路传输中提供差异化服务的概率框架。在本文中，我们进一步提出了一种ALOHA接收机的确定性框架，该框架可纳入Poisson接收机的概率框架中，用于分析带有连续干扰消除的编码多址接入。ALOHA接收机由一个关于可成功接收数据包数量的成功函数来表征。受网络演算理论的启发，我们推导了成功函数上几种运算的各种代数性质，并利用它们证明了ALOHA接收机的各种闭合性质，包括(i)串联的ALOHA接收机，(ii)协作ALOHA接收机，(iii)带有流量复用的ALOHA接收机，以及(iv)带有数据包编码的ALOHA接收机。通过进行广泛的仿真，我们表明我们的理论结果与仿真结果极其吻合。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
