变p值二叉树形冲突分解算法分析  

Study on isolated algorithm of conflictresolution with alterable values of p for binary trees

作　　者：张峰[1] 赵东风[1] 王菽兰[2] 程俊林[1] 

机构地区：[1]云南大学通信工程系,云南昆明650091 [2]昆明冶金高等专科学校,云南昆明650204

出　　处：《云南大学学报（自然科学版）》2007年第6期566-569,共4页Journal of Yunnan University(Natural Sciences Edition)

基　　金：云南省自然科学基金资助项目(2004F0011R);云南省教育厅基金资助项目(5Y05420)

摘　　要：提出了一种二叉树形冲突分解的改进算法,通过对随机争用多址访问系统中的信息分组冲突分解的研究,给出了冲突信息分组平均分解次数的解析式和系统吞吐量的解析式,仿真实验表明,仿真实现结果与理论值相吻合.It is presented an improved isolated algorithm of conflict resolution for binary tree, and analyzed the packet conflict resolution in random multiple access system. Furthermore, the average times of packet conflict resolution and the analytic formulae of the throughput of improved isolated algorithm are explicitly obtained. The simulation results shows that the theory results of packet conflict resolution are accorded with its simulation results.

关 键 词：二叉树形 冲突分解 树形算法 吞吐量 变P值 

分 类 号：TN913.21[电子电信—通信与信息系统]