Interference cancellation tree algorithms with κ-signal memory locations

Authors:
G. T. Peeters;B. Van Houdt
Affiliations:
University of Antwerp, Antwerp, Belgium;University of Antwerp, Antwerp, Belgium
Venue:
IEEE Transactions on Communications
Year:
2010

Citing 10
Cited 1

Data networks

Data networks
Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

IEEE Transactions on Information Theory
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
SICTA Modifications with Single Memory Location and Resistant to Cancellation Errors

NEW2AN '08 / ruSMART '08 Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Improved high maximum stable throughput FCFS tree algorithms with interference cancellation

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
A review of contention resolution algorithms for IEEE 802.14 networks

IEEE Communications Surveys & Tutorials
Contention Resolution Diversity Slotted ALOHA (CRDSA): An Enhanced Random Access Schemefor Satellite Access Packet Networks

IEEE Transactions on Wireless Communications
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

A practical tree algorithm with successive interference cancellation for delay reduction in IEEE 802.16 networks

ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, tree algorithms have been combined with successive interference cancellation to achieve a substantially higher maximum stable throughput (MST). All previous work assumed either a single or an unbounded number of signal memory locations, with MSTs of 0.662 and 0.693, respectively. In this paper, we address the gap between these two algorithms by designing and analyzing two novel general k-signal memory location algorithms.