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 f...

Full description

Saved in:
Bibliographic Details
Main Authors: Andreev, S., Pustovalov, E., Turlikov, A.
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
collision resolution
Delay
Interference cancellation
Markov processes
multiple access
performance analysis
Receivers
Robustness
Silicon carbide
successive interference cancellation
tree algorithm
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ITST.2011.6060159