Performance of binary tree collision resolution algorithm of random access channels

This paper employs the average cycle analysis method and binary tree collision resolution algorithm to analyze the performance of a random access system. It studies the packet collision resolution in a random multiple access system. The formula in which the colliding packets are resolved successfully is obtained. Also, the formulae of the throughput of two systems are given, one system employs the binary tree collision resolution basic algorithm, the other employs a binary tree collision resolution advanced algorithm. Furthermore, the computer simulation results of packet collision resolution are given in this paper. We can show that, compared to the binary tree collision resolution basic algorithm, the binary tree collision resolution advanced algorithm is a remarkable improvement