A robust high-throughput tree algorithm using successive interference cancellation

Xin Wang, Yingqun Yu, Georgios B. Giannakis

Research output: Contribution to journalArticle

10 Scopus citations

Abstract

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 languageEnglish (US)
Pages (from-to)2253-2256
Number of pages4
JournalIEEE Transactions on Communications
Volume55
Issue number12
DOIs
StatePublished - Dec 1 2007

Keywords

  • Random access
  • Successive interference cancellation (SIC)
  • Tree algorithm

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