{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:09:05Z","timestamp":1742994545384,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642217128"},{"type":"electronic","value":"9783642217135"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21713-5_22","type":"book-chapter","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T05:22:45Z","timestamp":1307769765000},"page":"301-315","source":"Crossref","is-referenced-by-count":1,"title":["A Practical Tree Algorithm with Successive Interference Cancellation for Delay Reduction in IEEE 802.16 Networks"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Andreev","sequence":"first","affiliation":[]},{"given":"Eugeny","family":"Pustovalov","sequence":"additional","affiliation":[]},{"given":"Andrey","family":"Turlikov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"22_CR1","first-page":"32","volume":"14","author":"B.S. Tsybakov","year":"1978","unstructured":"Tsybakov, B.S., Mikhailov, V.A.: Free synchronous packet access in a broadcast channel with feedback. Problems of Information Transmission\u00a014(4), 32\u201359 (1978)","journal-title":"Problems of Information Transmission"},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","volume":"25","author":"J.I. Capetanakis","year":"1979","unstructured":"Capetanakis, J.I.: Tree algorithms for packet broadcast channels. IEEE Transactions on Information Theory\u00a025(4), 505\u2013515 (1979)","journal-title":"IEEE Transactions on Information Theory"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Pedersen, K., Kolding, T., Seskar, I., Holtzman, J.: Practical implementation of successive interference cancellation in DS\/CDMA systems. In: Proceedings of IEEE ICUPC, vol.\u00a01, pp. 321\u2013325 (1996)","DOI":"10.1109\/ICUPC.1996.557908"},{"issue":"8","key":"22_CR4","doi-asserted-by":"publisher","first-page":"2799","DOI":"10.1109\/TIT.2007.901153","volume":"53","author":"S. Weber","year":"2007","unstructured":"Weber, S., Andrews, J., Yang, X., Veciana, G.: Transmission capacity of wireless ad hoc networks with successive interference cancellation. IEEE Transactions on Information Theory\u00a053(8), 2799\u20132814 (2007)","journal-title":"IEEE Transactions on Information Theory"},{"key":"22_CR5","unstructured":"IEEE Std. 802.16m (D9), Amendment to IEEE Standard for Local and metropolitan area networks. Advanced Air Interface"},{"key":"22_CR6","first-page":"1908","volume":"3","author":"Y. Yu","year":"2005","unstructured":"Yu, Y., Giannakis, G.B.: SICTA: A 0.693 contention tree algorithm using successive interference cancellation. In: Proceedings of IEEE INFOCOM, vol.\u00a03, pp. 1908\u20131916 (2005)","journal-title":"Proceedings of IEEE INFOCOM"},{"issue":"12","key":"22_CR7","doi-asserted-by":"publisher","first-page":"4628","DOI":"10.1109\/TIT.2007.909080","volume":"53","author":"Y. Yu","year":"2007","unstructured":"Yu, Y., Giannakis, G.B.: High-throughput random access using successive interference cancellation in a tree algorithm. IEEE Transactions on Information Theory\u00a053(12), 4628\u20134639 (2007)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"22_CR8","doi-asserted-by":"publisher","first-page":"2253","DOI":"10.1109\/TCOMM.2007.910635","volume":"55","author":"X. Wang","year":"2007","unstructured":"Wang, X., Yu, Y., Giannakis, G.B.: A robust high-throughput tree algorithm using successive interference cancellation. IEEE Transactions on Communications\u00a055(12), 2253\u20132256 (2007)","journal-title":"IEEE Transactions on Communications"},{"issue":"11","key":"22_CR9","doi-asserted-by":"publisher","first-page":"3056","DOI":"10.1109\/TCOMM.2010.093010.090222","volume":"58","author":"G.T. Peeters","year":"2010","unstructured":"Peeters, G.T., Houdt, B.V.: Interference cancellation tree algorithms with k-signal memory locations. IEEE Transactions on Communications\u00a058(11), 3056\u20133061 (2010)","journal-title":"IEEE Transactions on Communications"},{"key":"22_CR10","first-page":"972","volume":"2","author":"X. Wang","year":"2006","unstructured":"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\u00a02, 972\u2013977 (2006)","journal-title":"16. IEEE Wireless Communications and Networking Conference"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-85500-2_2","volume-title":"Next Generation Teletraffic and Wired\/Wireless Advanced Networking","author":"S. Andreev","year":"2008","unstructured":"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.\u00a05174, pp. 13\u201324. Springer, Heidelberg (2008)"},{"issue":"3","key":"22_CR12","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1109\/TWC.2005.846996","volume":"4","author":"A. Agrawal","year":"2005","unstructured":"Agrawal, A., Andrews, J., Cioffi, J., Meng, T.: Iterative power pontrol for imperfect successive interference cancellation. IEEE Transactions on Wireless Communications\u00a04(3), 878\u2013884 (2005)","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"22_CR13","unstructured":"Andrews, J., Hasan, A.: Analysis of cancellation error for successive interference cancellation with imperfect channel estimation. Tech. Rep. EE\u2013381K: Multiuser Wireless Communications (2002)"},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1134\/S0032946007040072","volume":"43","author":"G.S. Evseev","year":"2007","unstructured":"Evseev, G.S., Turlikov, A.M.: A connection between characteristics of blocked stack algorithms for random multiple access system. Problems of Information Transmission\u00a043(4), 345\u2013379 (2007)","journal-title":"Problems of Information Transmission"},{"key":"22_CR15","first-page":"214","volume":"10","author":"L. Gyorfi","year":"2007","unstructured":"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\u00a010, 214\u2013250 (2007)","journal-title":"NATO Security through Science Series: Information and Communication Security"},{"key":"22_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032770","volume-title":"Average Case Analysis of Algorithms on Sequences","author":"Szpankowski","year":"2001","unstructured":"Szpankowski: Average Case Analysis of Algorithms on Sequences. Wiley, Chichester (2001)"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Gyorfi, L., Gyori, S.: Analysis of tree algorithm for collision resolution. In: Proceedings of AofA, pp. 357\u2013364 (2005)","DOI":"10.46298\/dmtcs.3376"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-540-68982-9_21","volume-title":"Analytical and Stochastic Modeling Techniques and Applications","author":"S.D. Andreev","year":"2008","unstructured":"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.\u00a05055, pp. 295\u2013309. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Analytical and Stochastic Modeling Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21713-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T03:24:15Z","timestamp":1741231455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21713-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642217128","9783642217135"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21713-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}