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

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Andreev, S., Pustovalov, E., & Turlikov, A. (2011). A practical tree algorithm with successive interference cancellation for delay reduction in IEEE 802.16 networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6751 LNCS, pp. 301–315). https://doi.org/10.1007/978-3-642-21713-5_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free