On the Performance of the Free-Access Tree Algorithm with MPR, SIC, and Single-Slot Memory

Abstract

In this paper, we investigate performance of a random access scheme that exploits binary-tree algorithm with the free access in a scenario where the receiver is capable to perform both multi-packet reception (MPR) and successive interference cancellation (SIC) techniques. We analytically derive the maximum stable throughput of the scheme as well as the mean number of transmission attempts and the mean packet delay in a scenario with Poisson arrivals. The evaluation shows that the scheme is able of achieving a favorable performance in comparison to the scenarios when only either MPR or SIC with single-slot memory is used, making it a suitable candidate for an access solution in applications that are characterized with a massive number of users and sporadic traffic arrivals.