Enhancing the Performance of Tree Algorithm Using Re-split Mechanism

In shared wireless communication channel, the collision occurs when multiple users transmit the packet simultaneously. Tree algorithm has been proposed to resolve the collision. However, tree algorithm may suffer from high delay when the number of users gets large due to the collisions cause by too many users attempting to access the limited slots. To enhance the system delay of the tree algorithm, in this paper we introduce a Re-split mechanism that can be utilized in conjunction with the tree algorithm. As can be seen from the results that under heavy loads, the proposed mechanism offers better performance compared to the existing tree algorithm in terms of average delay, which signifies that the Re-split mechanism can be used to enhance the efficiency of the tree algorithm.