A Robust High-Throughput Tree Algorithm Using Successive Interference Cancellation
作者： Xin Wang , Yingqun Yu , Georgios B. Giannakis
DOI: 10.1109/TCOMM.2007.910635
关键词:
摘要: A novel random access protocol combining a tree algorithm (TA) with successive interference cancellation (SIC) has been introduced recently. To mitigate the deadlock problem of SICTA arising in error-prone wireless networks, we put forth first success (SICTA/FS) protocol, which is capable high throughput while requiring limited-sensing and gaining robustness to errors relative SICTA.
sci-hub.se 参考文章(8)
George C. Polyzos, Mart L. Molle, Conflict Resolution Algorithms and their Performance Analysis ,(1993)
Yingqun Yu, G.B. Giannakis, SICTA: a 0.693 contention tree algorithm using successive interference cancellation international conference on computer communications. ,vol. 3, pp. 1908- 1916 ,(2005) , 10.1109/INFCOM.2005.1498469
M.K. Tsatsanis, Ruifeng Zhang, S. Banerjee, Network-assisted diversity for random access wireless networks IEEE Transactions on Signal Processing. ,vol. 48, pp. 702- 711 ,(2000) , 10.1109/78.824666
R. Garces, I.J. Garcia-Luna-Aceves, Collision avoidance and resolution multiple access: first-success protocols international conference on communications. ,vol. 2, pp. 699- 703 ,(1997) , 10.1109/ICC.1997.609940
Xin Wang, J.K. Tugnait, A bit-map-assisted dynamic queue protocol for multiaccess wireless networks with multiple packet reception IEEE Transactions on Signal Processing. ,vol. 51, pp. 2068- 2081 ,(2003) , 10.1109/TSP.2003.814463
J. Capetanakis, Tree algorithms for packet broadcast channels IEEE Transactions on Information Theory. ,vol. 25, pp. 505- 515 ,(1979) , 10.1109/TIT.1979.1056093
Yingqun Yu, Georgios B. Giannakis, High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm IEEE Transactions on Information Theory. ,vol. 53, pp. 4628- 4639 ,(2007) , 10.1109/TIT.2007.909080
John G. Proakis, Digital Communications ,(1983)