Analysis of robust collision resolution algorithm with successive interference cancellation and bursty arrivals

A novel tree multiple access algorithm is discussed, which is robust to imperfect successive interference cancellation. The algorithm exploits a single memory location to store the captured packets and thus has feasible complexity. For this algorithm, the performance evaluation is conducted, which focuses on its transmission rate and mean packet delay. Both virtual and actual delays are established analytically. Additionally to Poisson arrivals, bursty arrival model is considered and the analysis is extended respectively. The results are new and important to conclude upon the efficiency of the proposed algorithm.