论文标题
在带有连续干扰取消的D-Ary树算法上
On d-ary tree algorithms with successive interference cancellation
论文作者
论文摘要
在本文中，我们概述了D- ARY树算法（TA）的碰撞分辨率间隔（TA）的衍生方法的方法，并以封闭式访问和连续的干扰取消（SIC）（根据竞争用户的数量）进行条件。这是带有门控访问的TA的基本性能参数。我们确定了Yu和Giannakis的SIC的开创性论文中进行的分析的缺陷，表明它们的分析仅适用于二元分裂，即d = 2。我们还为稳定的吞吐量提供了一些有见地的结果，可以为d的不同值实现。
In this paper, we outline the approach for the derivation of the length of the collision resolution interval for d-ary tree algorithms (TA) with gated access and successive interference cancellation (SIC), conditioned on the number of the contending users. This is the basic performance parameter for TA with gated access. We identify the deficiencies of the analysis performed in the seminal paper on TA with SIC by Yu and Giannakis, showing that their analysis is correct only for binary splitting, i.e. for d=2. We also provide some insightful results on the stable throughput that can be achieved for different values of d.
