Performance evaluation of modified tree algorithm using adaptive permission probability control

摘要

In this paper, we propose an adaptive permission probability control mechanism that can be used in conjunction with the existing tree algorithm. This mechanism is designed to lower the risk of collision by reducing the number of accessing attempts in each subgroup. It can be observed from the results that under the heavy load condition, when the number of users is more than the number of subgroups, the proposed mechanism provides the better performance compared to the standard tree algorithm in terms of average delay, which indicates that the adaptive permission probability control mechanism can be used to improve the efficiency of the standard tree algorithm.