随机多址信道冲突分解算法及吞吐量分析

Analysis of Improved Contention Resolution Algorithms and Throughput over RAC

摘要: 讨论了一种改进的随机多址信道二叉树形、三叉树形冲突分解算法,导出了分解冲突所需平均时隙数的解析表达式。获得了较高的分解效率,并将其结果应用于阻塞接入信道的计算机仿真实验,数值分析表明,可获得较高的系统稳定最大吞吐量。

Abstract: This paper suggestes a new algorithm model of binary & ternary-tree contention resolution algorithm, and derives the mean slots formula used in resoluting collision. Comparing with basic contention resolution algorithm, this result gets a high efficiency. The throughput character of blocked access channel is also analyzed through computer simulation.