【摘要】 采用２种二叉树形冲突分解改进算法，对随机争用多址访问系统中冲突分解进行了研究，给出了冲突分解平均时隙数的解析式和系统吞吐量的解析式．计算机模拟实验表明二叉树形冲突分解改进算法是有效的，进一步改进了系统性能．更多还原

【Abstract】 Based on binary tree collision resolution basic algorithm,this paper presents two binary tree collision resolution improved algorithms.It analyzes the packet collision resolution in random multiple access system.The formula which the colliding packets are resoluted successfully is obtained.Also,the average throughput of the system is analyzed and the formula of throughput are given.Furthermore,the computer simulation results of packets collision resolution are given in this paper.The theoretical results and computer simulation results for two binary tree collision resolution improved algorithms are anastomotic.The binary tree collision resolution improved algorithms make a remarkable improvement for random multiple access system.更多还原