改进型二叉树形冲突分解隔离算法研究  

Study on improved isolated algorithm of conflict resolution for binary trees

作　　者：张挺[1] 赵东风[1] 孙云山[1] 

机构地区：[1]云南大学通信工程系,云南昆明650091

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

基　　金：国家教育部骨干教师基金资助.

摘　　要：提出了一种改进型的二叉树形冲突分解隔离算法,对随机争用多址访问系统中的冲突分解进行了研究,且尝试将此算法应用于Adhoc网络,并给出了改进型隔离算法的冲突分解平均时隙数和系统吞吐量的解析式,其结果与计算机仿真实验相吻合.It is presented an improved isolated algorithm of conflict resolution for binary trees.It is analyzed the packet conflict resolution in random multiple access system,and tried to use this algorithm to the Ad hoc network.Furthermore,the average times of packet conflict resolution and the analytic formulae of the throughput of improved isolated algorithm are explicitly obtained.It is accorded with the computer simulation results of packet conflict resolution.

关 键 词：二叉树形冲突 冲突分解 隔离算法 吞吐量 AD HOC网络 随机多址访问 

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