Random Multiple Access Protocol combined Binary Tree Conflict-resolving Algorithm and the 1-persistent CSMA Protocol
Zhao Yifan, Ding Hongwei, Yangshui Gao, Guo Yingying, Nan Jing, Yu Pingping · Advances in intelligent systems research/Advances in Intelligent Systems Research · 2013
Th is paper presents a new random mu ltiple access control protocol -1-persistent CSMA control protocol based on improved binary tree conflict resolution algorithm.First, the paper gives an outline of 1-persistent CSMA and the binary tree conflict-resolving algorith m by build ing a mathematical model and using the average cycle method, and then respectively obtains the throughput and the number of time -slots of the protocol and the algorith m.The simulation results are g iven, and agree well with theoretical values.But, in a shared channel, each user independently sends information packets randomly, and it is prone to conflict and resulting in the failure.Especially to the 1-persistent CSMA control protocol, when the load is larger, it has a lower throughput and greatly increasing the probability of channel conflict.Therefore, bringing in the binary tree conflict-resolving algorith m is a good method to imp rove the throughput, especially the improved binary tree conflict resolution algorith m.So at last, the paper introduces the random mu ltip le access protocol comb ined improved binary tree conflict resolution algorith m and 1-persistent CSMA protocol, obtains the throughput and gives the simulations of the joint protocol.Theoretical calculations and experimental results show that 1-persistent CSMA protocol with conflict-resolving has a better performance.