A Robust High-Throughput Tree Algorithm Using Successive Interference Cancellation
Xin Wang, Yingqun Yu, Georgios B. Giannakis · IEEE Transactions on Communications · 2007
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 a SICTA with first success (SICTA/FS) protocol, which is capable of high throughput while requiring limited-sensing and gaining robustness to errors relative to SICTA.