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.
|Original language||English (US)|
|Number of pages||4|
|Journal||IEEE Transactions on Communications|
|State||Published - 2007|
Bibliographical noteFunding Information:
Paper approved by T.-S.P. Yum, the Editor for Packet Access and Switching of the IEEE Communications Society. Manuscript received March 31, 2005; revised September 26, 2005. This work was supported in part by the U.S. Department of Defense (USDoD) Army Research Office (ARO) under Grant W911NF-05-1-0283 and was prepared through collaborative participation in the Communications and Networks Consortium sponsored by the U.S. Army Research Laboratory under the Collaborative Technology Alliance Program, Cooperative Agreement DAAD19-01-2-0011. This paper was presented in part at the IEEE Globecom Conference, St. Louis, MO, Nov. 28–Dec. 2, 2005.
- Random access
- Successive interference cancellation (SIC)
- Tree algorithm