Analysis of Tree-Algorithms with Multi-Packet Reception

TL;DR

This paper analyzes binary-tree algorithms with multi-packet reception (MPR), revealing how throughput scales with MPR capability under different traffic conditions and providing the first analytical insights into their performance.

Contribution

It offers the first analytical treatment of tree algorithms with MPR, showing throughput behavior under both traffic-independent and Poisson arrival scenarios.

Findings

Normalized throughput tends to the same value as single-reception for traffic-independent case.

Normalized throughput increases with K under Poisson arrivals, approaching 1.

Performance results for modified tree algorithms with K-MPR in clipped access scheme.

Abstract

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.