论文部分内容阅读
提出了一种二叉树形冲突分解的改进算法,通过对随机争用多址访问系统中的信息分组冲突分解的研究,给出了冲突信息分组平均分解次数的解析式和系统吞吐量的解析式,仿真实验表明,仿真实现结果与理论值相吻合.
This paper proposes an improved algorithm of binary tree conflict resolution. By analyzing the conflict resolution of information packets in the system of random access contention, this paper gives the analytical formulas of the average resolution times and the throughput of the system. Simulation results show that the simulation results agree well with the theoretical ones.