Abstract
In this paper we consider a cross-layer MAC-PHY technique that combines the collision resolution tree algorithm (TA) with the possibility of successive interference cancellation (SIC). The overview of the previous work shows that no simple protocol has been proposed to use a single memory location for the captured signal. We, consequently, propose two such protocols that demonstrate the throughput - implementation complexity trade-off. Further, we address the system operation during which interference cancellation errors are possible. We propose the third protocol that is resistant to cancellation errors. A simple yet effective technique is applied to address the throughput performance of all three protocols to demonstrate their superiority over known conventional TA protocols.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1992)
Rom, R., Sidi, M.: Multiple Access Protocols: Performance and Analysis. Springer, Heidelberg (1990)
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)
Andrews, J., Hasan, A.: Analysis of cancellation error for successive interference cancellation with imperfect channel estimation. Technical report, EE-381K: Multiuser Wireless Communications (2002)
Yu, Y., Giannakis, G.B.: Giannakis. Sicta: A 0.693 contention tree algorithm using successive interference cancellation. Proceedings IEEE INFOCOM 3, 1908–1916 (2005)
Peeters, G.T., Van Houdt, B., Blondia, C.: A multiaccess tree algorithm with free access, interference cancellation and single signal memory requirements. Performance Evaluation 64(9-12), 1041–1052 (2007)
Van Houdt, B., Peeters, G.T.: Fcfs tree algorithms with interference cancellation and single signal memory requirements. In: International Workshop on Multiple Access Communications, vol. 1 (to be published, 2008)
Wang, X., Yu, Y., Giannakis, G.B.: A robust high-throughput tree algorithm using successive interference cancellation. In: IEEE Global Telecommunications Conference, vol. 6(28), pp. 5–10 (2005)
Wang, X., Yu, Y., Giannakis, G.B.: A deadlock-free high-throughput tree algorithm for random access over fading channels. In: 40th Annual Conference on Information Sciences and Systems, vol. 22, pp. 420–425 (2006)
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), 279–345 (2007)
Massey, J.L.: Collision resolution algorithm and random access communications. Multiuser Communication Systems, G. Longo, CISM Course and Lecture Notes 265, 73–131 (1981)
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)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andreev, S., Pustovalov, E., Turlikov, A. (2008). SICTA Modifications with Single Memory Location and Resistant to Cancellation Errors. In: Balandin, S., Moltchanov, D., Koucheryavy, Y. (eds) Next Generation Teletraffic and Wired/Wireless Advanced Networking. NEW2AN 2008. Lecture Notes in Computer Science, vol 5174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85500-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-85500-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85499-9
Online ISBN: 978-3-540-85500-2
eBook Packages: Computer ScienceComputer Science (R0)