Corrections to 'High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm'

Yash Deshpande, Cedomir Stefanovic, H. Murat Gursu, Wolfgang Kellerer

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

In the above article, the authors propose d -ary SICTA and derive the expected conditional length of the collision resolution interval, optimal splitting probability and the maximum stable throughput (MST) for d \geq 2 under stationary ergodic packet arrivals. In this correction, we show that the premise of the analysis for d > 2 and consequentially the results presented for d > 2 do not hold.

Original languageEnglish
Pages (from-to)1658-1659
Number of pages2
JournalIEEE Transactions on Information Theory
Volume69
Issue number3
DOIs
StatePublished - 1 Mar 2023

Keywords

  • Collision resolution
  • and tree protocol
  • maximum stable throughput
  • random access

Fingerprint

Dive into the research topics of 'Corrections to 'High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm''. Together they form a unique fingerprint.

Cite this