无线信道动态树碰撞解决算法的性能分析

一般的随机访问信道(RACH)，延时特性只有均值，很难有明确的上限保证，所以对部分实时业务性能难以保证。树型算法则可以对日前处理的业务提供明确的延时上限，然而一般的固定树型算法对于无线信道的业务波动情况没有适应能力，例如树型分支固定，只能适合一定强度的到达业务，其他情况下会导致信道利用率下降和延时增加。本文针对随机访问信道协议，在固定树型算法的基础上，结合随机接续协议，给出了一种混合动态树型算法，目的是提高一般树型算法的信道利用率，保证延时指标的上限。

Performance analysis dynamic tree collision resolution algorithm on wireless channel

The normal RACH only gives a statistic average delay without a up-bound, so the QoS of real time traffic can not be guaranteed. The tree type algorithm can provide a definite up-bound for delay and statistic mean value but fixed tree type algorithm does not have flexibility for the burst of traffic except fixed traffic strength. This paper presents a hybrid dynamic tree algorithm and its aim is to guarantee up-bound of delay and high channel throughput for variable traffic strength.