Improved high maximum stable throughput FCFS tree algorithms with interference cancellation

Authors:
G. T. Peeters;B. Van Houdt
Affiliations:
University of Antwerp - IBBT, Antwerp, Belgium;University of Antwerp - IBBT, Antwerp, Belgium
Venue:
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Year:
2008

Citing 6
Cited 1

Data networks

Data networks
Random Multiple Access Algorithms Using a Control Mini-Slot

IEEE Transactions on Computers
A multiaccess tree algorithm with free access, interference cancellation and single signal memory requirements

Performance Evaluation
A review of contention resolution algorithms for IEEE 802.14 networks

IEEE Communications Surveys & Tutorials
Information theory and communication networks: an unconsummated union

IEEE Transactions on Information Theory
High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm

IEEE Transactions on Information Theory

Interference cancellation tree algorithms with κ-signal memory locations

IEEE Transactions on Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tree algorithms form a well researched class of collision resolution algorithms for solving multiple access control problems. Signal interference cancellation, which allows one to recover additional information from otherwise lost collision signals, has recently been combined with tree algorithms, providing substantially higher maximum stable throughputs (MSTs), up to 0.693 (Yu and Giannakis, IEEE Transactions on Information Theory, Vol. 53(12), 2007). We propose two novel First-Come-First-Served tree algorithms, the operation of which is similar to the well-known tree splitting algorithms, that exploit interference cancellation and derive their MST. Furthermore, these algorithms are also designed such that, at all times, it suffices to store only one signal.