SICTA: a 0.693 contention tree algorithm using successive interference cancellation

Abstract

Contention tree algorithms have provable stability properties, and are known to achieve stable throughput as high as 0.487 for the infinite population Poisson model. A common feature in all these random access protocols is that collided packets at the receive-node are always discarded. In this paper, we derive a novel tree algorithm (TA) that we naturally… (More)
DOI: 10.1109/INFCOM.2005.1498469

Topics

8 Figures and Tables

Statistics

0510'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

64 Citations

Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Yu2005SICTAA0, title={SICTA: a 0.693 contention tree algorithm using successive interference cancellation}, author={Yingqun Yu and Georgios B. Giannakis}, journal={Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.}, year={2005}, volume={3}, pages={1908-1916 vol. 3} }