Delay analysis of tree algorithms with different additional of feedback information

This paper proposes three algorithms based on the contention tree algorithm to improve the system performance by utilizing the different additional of feedback information. These three algorithms are derived from adding of skipped slots and/or adaptive frame size strategies. Average access delay is analyzed to evaluate the system performance which is measured in term of the number of used slots in the collision resolution process. Numerical results show that the tree algorithm in conjunction with skipped slots and adaptive frame size schemes is superior to the other proposed algorithms and the optimum tree algorithm.