隔离型随机N叉树形冲突分解算法研究

Study on a isolation type of random n-ary tree collision resolution algorithm

文章提出一种隔离型随机N叉树形冲突分解算法,并对随机多址接入系统冲突分解进行了研究。给出一组新的冲突信息分组分解所需平均时隙数和系统静态、动态吞吐量的解析式,数值计算与计算机实验值相一致。

A isolation type of random N-ary tree collision resolution algorithm is used to analyze packet collision resolution based on random multiple access system in this paper. A new set of analytic formulae of the mean slot numbers which are needed by colliding information packets and the average throughput for dynamic and static system are given. Moreover, the results are verified by the simulation experiment.