Poisson接收机：一种分析编码随机接入的概率框架
Poisson Receivers: a Probabilistic Framework for Analyzing Coded Random Access
摘要：
在本文中，我们开发了一个概率框架，分析编码随机接入。我们的框架是基于一个新的抽象的接收器（解码器），称为泊松接收器，其特征在于由一个成功的概率函数的标记数据包受到泊松提供的负载。我们表明，各种编码时隙ALOHA（CSA）系统是泊松接收机。此外，泊松接收器具有两个优雅的封闭性质：（i）具有分组路由的泊松接收器仍然是泊松接收器，以及（ii）具有分组编码的泊松接收器仍然是泊松接收器。这两个封闭性使我们能够使用较小的泊松接收器作为分析较大泊松接收器的构建块。因此，我们可以分析复杂的系统，这是不可能的经典树评估方法。特别是，对于同时具有空间分集和时间分集的CSA系统，我们可以使用Poisson接收机的框架来计算精确的（渐进的）吞吐量。我们证明，我们的框架可以用来提供超可靠的低延迟通信（URLLC）流量和增强型移动宽带（eMBB）流量之间的差异化服务。通过进行大量的模拟，我们还验证了我们的理论结果与模拟结果非常吻合。
英文摘要：
In this paper, we develop a probabilistic framework for analyzing coded random access. Our framework is based on a new abstract receiver (decoder), called a Poisson receiver, that is characterized by a success probability function of a tagged packet subject to a Poisson offered load. We show that various coded slotted ALOHA (CSA) systems are Poisson receivers. Moreover, Poisson receivers have two elegant closure properties: (i) Poisson receivers with packet routing are still Poisson receivers, and (ii) Poisson receivers with packet coding are still Poisson receivers. These two closure properties enable us to use smaller Poisson receivers as building blocks for analyzing a larger Poisson receiver. As such, we can analyze complicated systems that are not possible by the classical tree evaluation method. In particular, for CSA systems with both spatial diversity and temporal diversity, we can use the framework of Poisson receivers to compute the exact (asymptotic) throughput. We demonstrate that our framework can be used to provide differentiated services between ultra-reliable low-latency communication (URLLC) traffic and enhanced mobile broadband (eMBB) traffic. By conducting extensive simulations, we also verify that our theoretical results match extremely well with the simulation results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
