Performance analysis dynamic tree collision resolution algorithm on wireless channel

Qinyu Zhang · Journal of China Institute of Communications · 2004

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.

Read the paper · More papers on PaperTik