Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Interrelation of characteristics of blocked RMA stack algorithms
Problems of Information Transmission
Contention-Based Polling Efficiency in Broadband Wireless Networks
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
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
Interference cancellation tree algorithms with κ-signal memory locations
IEEE Transactions on Communications
Iterative power control for imperfect successive interference cancellation
IEEE Transactions on Wireless Communications
Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation
IEEE Transactions on Information Theory
High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
IEEE Transactions on Information Theory
Hi-index | 0.00 |
This paper thoroughly studies a modification of tree algorithm with successive interference cancellation. In particular, we focus on the algorithm throughput and account for a single signal memory location, as well as cancellation errors of three types. The resulting scheme is robust to imperfect interference cancellation and is tailored to the uplink bandwidth request collision resolution in an IEEE 802.16 cellular network. The mean packet delay is shown to be considerably reduced when using the proposed approach.