3rd International ICST Conference on Performance Evaluation Methodologies and Tools

Research Article

Improved High Maximum Stable Throughput FCFS Tree Algorithms with Interference Cancellation

Download837 downloads
  • @INPROCEEDINGS{10.4108/ICST.VALUETOOLS2008.4257,
        author={G.T Peeters and B. Van Houdt},
        title={Improved High Maximum Stable Throughput FCFS Tree Algorithms with Interference Cancellation},
        proceedings={3rd International ICST Conference on Performance Evaluation Methodologies and Tools},
        publisher={ICST},
        proceedings_a={VALUETOOLS},
        year={2010},
        month={5},
        keywords={Interference cancellation random-access maximum stable throughput.},
        doi={10.4108/ICST.VALUETOOLS2008.4257}
    }
    
  • G.T Peeters
    B. Van Houdt
    Year: 2010
    Improved High Maximum Stable Throughput FCFS Tree Algorithms with Interference Cancellation
    VALUETOOLS
    ICST
    DOI: 10.4108/ICST.VALUETOOLS2008.4257
G.T Peeters1,*, B. Van Houdt1,*
  • 1: University of Antwerp - IBBT, Middelheimlaan 1, B-2020 Antwerp, Belgium
*Contact email: gino.peeters@ua.ac.be, benny.vanhoudt@ua.ac.be

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.