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

In this paper, we perform a thorough analysis of tree-algorithms with multi-packet reception (MPR) and successive interference cancellation (SIC). 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. We also analyze d-ary tree algorithms with MPR and SIC, showing deficiencies of the analysis performed in the seminal paper on tree-algorithms with SIC by Yu and Giannakis.