Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.