A robust high-throughput tree algorithm using successive interference cancellation

Xin Wang, Yingqun Yu, Georgios B Giannakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

Abstract

A novel random access protocol combining a tree algorithm (TA) with successive interference cancellation (SIC) has been introduced recently. By migrating physical layer benefits to the medium access control (MAC) through a cross-layer approach, SICTA can afford stable throughput as high as 0.693. However, SICTA may lead to deadlocks caused by channel fading and error propagation in error-prone wireless networks. To mitigate such effects, we put forth a truncated version of SICTA that we term SICTA/FS (SICTA with first success). We establish using analysis and simulations that while providing high throughput, SICTA/FS is robust to errors, it is easy to implement, and can be readily incorporated to existing standards.

Original languageEnglish (US)
Title of host publicationGLOBECOM'05
Subtitle of host publicationIEEE Global Telecommunications Conference, 2005
Pages3597-3601
Number of pages5
Volume6
DOIs
StatePublished - Dec 1 2005
EventGLOBECOM'05: IEEE Global Telecommunications Conference, 2005 - St. Louis, MO, United States
Duration: Nov 28 2005Dec 2 2005

Other

OtherGLOBECOM'05: IEEE Global Telecommunications Conference, 2005
CountryUnited States
CitySt. Louis, MO
Period11/28/0512/2/05

Fingerprint Dive into the research topics of 'A robust high-throughput tree algorithm using successive interference cancellation'. Together they form a unique fingerprint.

  • Cite this

    Wang, X., Yu, Y., & Giannakis, G. B. (2005). A robust high-throughput tree algorithm using successive interference cancellation. In GLOBECOM'05: IEEE Global Telecommunications Conference, 2005 (Vol. 6, pp. 3597-3601). [1578442] https://doi.org/10.1109/GLOCOM.2005.1578442