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

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

doi:10.1109/TIT.2022.3208441

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

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

^*Corresponding author for this work

Research output: Contribution to journal › Journal article › Research › peer-review

2 Citations (Scopus)

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 language	English
Journal	IEEE Transactions on Information Theory
Volume	69
Issue number	3
Pages (from-to)	1658-1659
Number of pages	2
ISSN	0018-9448
DOIs	https://doi.org/10.1109/TIT.2022.3208441
Publication status	Published - 1 Mar 2023

Bibliographical note

Publisher Copyright:
© 1963-2012 IEEE.

Keywords

and tree protocol
Collision resolution
maximum stable throughput
random access

Access to Document

10.1109/TIT.2022.3208441

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@article{9481051a9891412aa9068a9c56079205,

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

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.",

keywords = "and tree protocol, Collision resolution, maximum stable throughput, random access",

author = "Yash Deshpande and Cedomir Stefanovic and Gursu, {H. Murat} and Wolfgang Kellerer",

note = "Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2023",

month = mar,

day = "1",

doi = "10.1109/TIT.2022.3208441",

language = "English",

volume = "69",

pages = "1658--1659",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE (Institute of Electrical and Electronics Engineers)",

number = "3",

}

TY - JOUR

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

AU - Deshpande, Yash

AU - Stefanovic, Cedomir

AU - Gursu, H. Murat

AU - Kellerer, Wolfgang

PY - 2023/3/1

Y1 - 2023/3/1

N2 - 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.

AB - 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.

KW - and tree protocol

KW - Collision resolution

KW - maximum stable throughput

KW - random access

UR - http://www.scopus.com/inward/record.url?scp=85139424851&partnerID=8YFLogxK

U2 - 10.1109/TIT.2022.3208441

DO - 10.1109/TIT.2022.3208441

M3 - Journal article

AN - SCOPUS:85139424851

SN - 0018-9448

VL - 69

SP - 1658

EP - 1659

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 3

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

AUB Link

Other files and links

Fingerprint

Cite this