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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tsybakov, B.S., Mikhailov, V.A.: Free synchronous packet access in a broadcast channel with feedback. Problems of Information Transmission 14(4), 32–59 (1978)
Capetanakis, J.I.: Tree algorithms for packet broadcast channels. IEEE Transactions on Information Theory 25(4), 505–515 (1979)
Pedersen, K., Kolding, T., Seskar, I., Holtzman, J.: Practical implementation of successive interference cancellation in DS/CDMA systems. In: Proceedings of IEEE ICUPC, vol. 1, pp. 321–325 (1996)
Weber, S., Andrews, J., Yang, X., Veciana, G.: Transmission capacity of wireless ad hoc networks with successive interference cancellation. IEEE Transactions on Information Theory 53(8), 2799–2814 (2007)
IEEE Std. 802.16m (D9), Amendment to IEEE Standard for Local and metropolitan area networks. Advanced Air Interface
Yu, Y., Giannakis, G.B.: SICTA: A 0.693 contention tree algorithm using successive interference cancellation. In: Proceedings of IEEE INFOCOM, vol. 3, pp. 1908–1916 (2005)
Yu, Y., Giannakis, G.B.: High-throughput random access using successive interference cancellation in a tree algorithm. IEEE Transactions on Information Theory 53(12), 4628–4639 (2007)
Wang, X., Yu, Y., Giannakis, G.B.: A robust high-throughput tree algorithm using successive interference cancellation. IEEE Transactions on Communications 55(12), 2253–2256 (2007)
Peeters, G.T., Houdt, B.V.: Interference cancellation tree algorithms with k-signal memory locations. IEEE Transactions on Communications 58(11), 3056–3061 (2010)
Wang, X., Yu, Y., Giannakis, G.B.: Combining random backoff with a cross-layer tree algorithm for random access in IEEE 802.16. IEEE Wireless Communications and Networking Conference 2, 972–977 (2006)
Andreev, S., Pustovalov, E., Turlikov, A.: SICTA modifications with single memory location and resistant to cancellation errors. In: Balandin, S., Moltchanov, D., Koucheryavy, Y. (eds.) NEW2AN 2008. LNCS, vol. 5174, pp. 13–24. Springer, Heidelberg (2008)
Agrawal, A., Andrews, J., Cioffi, J., Meng, T.: Iterative power pontrol for imperfect successive interference cancellation. IEEE Transactions on Wireless Communications 4(3), 878–884 (2005)
Andrews, J., Hasan, A.: Analysis of cancellation error for successive interference cancellation with imperfect channel estimation. Tech. Rep. EE–381K: Multiuser Wireless Communications (2002)
Evseev, G.S., Turlikov, A.M.: A connection between characteristics of blocked stack algorithms for random multiple access system. Problems of Information Transmission 43(4), 345–379 (2007)
Gyorfi, L., Gyori, S., Massey, J.L.: Principles of stability analysis for random accessing with feedback. NATO Security through Science Series: Information and Communication Security 10, 214–250 (2007)
Szpankowski: Average Case Analysis of Algorithms on Sequences. Wiley, Chichester (2001)
Gyorfi, L., Gyori, S.: Analysis of tree algorithm for collision resolution. In: Proceedings of AofA, pp. 357–364 (2005)
Andreev, S.D., Turlikov, A.M., Vinel, A.V.: Contention-based polling efficiency in broadband wireless networks. In: Al-Begain, K., Heindl, A., Telek, M. (eds.) ASMTA 2008. LNCS, vol. 5055, pp. 295–309. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andreev, S., Pustovalov, E., Turlikov, A. (2011). A Practical Tree Algorithm with Successive Interference Cancellation for Delay Reduction in IEEE 802.16 Networks. In: Al-Begain, K., Balsamo, S., Fiems, D., Marin, A. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2011. Lecture Notes in Computer Science, vol 6751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21713-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-21713-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21712-8
Online ISBN: 978-3-642-21713-5
eBook Packages: Computer ScienceComputer Science (R0)