Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”
IEEE Transactions on Information Theory(2023)
摘要
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.
更多查看译文
关键词
Collision resolution,maximum stable throughput,random access,and tree protocol
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络