Study on a New Type of Discrete Random Contention System based on Binary Tree Conflict Resolution Algorithm

This paper proposed a new type of discrete random contention system based on the literature (1), researched it using the average cycle method, then get the formu la of the systemic throughput for the new random access protocol by building mathematical modeling; but the uncertainty of random mult iple access on frequency and time resulting in the conflict probability increases as the higher loading, therefore, introducing binary tree conflict resolution algorithm is very important to improve the channel utilizat ion. The paper analyzed the isolated binary tree conflict resolution algorithm and then got the average length of t imeslot of the algorithm; on the basis, the paper puts forward a new type of discrete random contention system based on binary tree conflict resolution algorith m. Analytic formulate for throughput of the new d iscrete random contention system and the system based on the conflict resolution algorith m are derived by build ing mathematical model and using the average cycle method. Finally, the computer simu lation experiments show that the correctness of the theoretical, at the same t ime, show that the new discrete random contention system protocol based on binary tree conflict resolution algorithm is effective to further improve the system performance.