Tree-Algorithms with Multi-Packet Reception and Successive Interference Cancellation

TL;DR

This paper analyzes tree-algorithms with multi-packet reception and successive interference cancellation, revealing how these advanced physical layer techniques improve throughput and stability in contention-based networks.

Contribution

It provides new analytical results on performance metrics and asymptotic behavior of tree-algorithms with MPR and SIC, including throughput bounds under different access schemes.

Findings

Expected collision resolution interval derived

Normalized throughput conditioned on user number analyzed

Maximum stable throughput increases with MPR capabilities

Abstract

In this paper, we perform a thorough analysis of tree-algorithms with multi-packet reception (MPR) and successive interference cancellation (SIC), showing a number of novel results. We first derive the basic performance parameters, which are the expected length of the collision resolution interval and the normalized throughput, conditioned on the number of contending users. We then study their asymptotic behaviour, identifying an oscillatory component that amplifies with the increase in MPR. In the next step, we derive the throughput for the gated and windowed access, assuming Poisson arrivals. We show that for windowed access, the bound on maximum stable normalized throughput increases with the increase in MPR. his implies that investing in advanced physical capabilities, i.e., MPR and SIC pays off from the perspective of the medium access control algorithm.