On d-ary tree algorithms with successive interference cancellation

TL;DR

This paper analyzes the performance of d-ary tree algorithms with successive interference cancellation, deriving collision resolution intervals and identifying limitations in previous analyses, with insights on stable throughput for various d values.

Contribution

It provides a generalized derivation for collision resolution intervals in d-ary tree algorithms with SIC and corrects prior analysis limitations for d>2.

Findings

Derived collision resolution interval lengths for d-ary trees with SIC.

Identified analysis inaccuracies in previous binary-focused work.

Provided insights into stable throughput across different d values.

Abstract

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.