论文标题
用多包装接收的树木叠加分析
Analysis of Tree-Algorithms with Multi-Packet Reception
论文作者
论文摘要
在本文中，我们在设置中分析了二进制算法，在该设置中，接收器可以同时执行fust和包括k数据包的多包装接收（MPR）。该分析涵盖了与交通无关的性能以及泊松到达下的性能。对于前一种情况，我们表明，与实现K-MPR能力所需的假定线性增加有关的线性增加时，该吞吐量倾向于与单次受体设置相同的值。但是，当与窗户的访问方案中的泊松到达相结合时，归一化的吞吐量会随着k的形式增加，我们提供了证据表明它渐近地趋向于1。我们还为夹层访问方案中的k-mpr提供了修改的树算法的性能结果。据我们所知，这是第一篇提供分析待遇和许多基本见解的论文，这些论文在用MPR的树叠加表现方面提供了许多基本见解。
In this paper, we analyze binary-tree algorithms in a setup in which the receiver can perform multi-packet reception (MPR) of up to and including K packets simultaneously. The analysis addresses both traffic-independent performance as well as performance under Poisson arrivals. For the former case, we show that the throughput, when normalized with respect to the assumed linear increase in resources required to achieve K-MPR capability, tends to the same value that holds for the single-reception setup. However, when coupled with Poisson arrivals in the windowed access scheme, the normalized throughput increases with K, and we present evidence that it asymptotically tends to 1. We also provide performance results for the modified tree algorithm with K-MPR in the clipped access scheme. To the best of our knowledge, this is the first paper that provides an analytical treatment and a number of fundamental insights in the performance of tree-algorithms with MPR.
