摘要
针对无线网络随机接入的特性,提出了快速检测二叉树形冲突分解算法,并对其进行了分析研究,得到了N个激活终端的冲突信息分组平均分解的时隙数及吞吐量的数学解析式和计算机实验结果。
Aiming at the characteristics of wireless Internet access,Puts forward fast detection binary tree conflict decomposition algorithm,and analyzed and researched it,the mathematics expression of time slot number of conflict message of N activation packet decomposes in average and the handling capacity and the computer experiment result have been gotten.
出处
《电脑编程技巧与维护》
2011年第12期54-56,共3页
Computer Programming Skills & Maintenance
关键词
随机访问
冲突分解
二叉树算法
Random access
Collision resolution
Binary tree algorithm
