Throughput analysis of blocked access tree algorithms with mini-slots

Abstract

The tree-based collision resolution algorithms have been extensively studied because of their stable behavior. Some of these studies have employed control mini-slots in order to improve the performance of tree-based algorithms. This paper analyzes the maximum stable throughput of two Q-ary blocked access tree algorithms with mini-slots: one (TA/M-BF) assumes that something/nothing binary feedback information is available in a mini-slot, and the other (TA/M-TF) assumes ternary feedback information in a mini-slot. Both algorithms allow all users having new packets to transmit them in the slot immediately after the previously collided packets are resolved (i.e., blocked access algorithms). The stability of these algorithms is affected by two critical values of the throughpuut; the lower critical value is called the maximum stable throughput. We offer a way to derived those values exactly. The effect of mini-slot length on the maximum stable throughput is also evaluated. Furthermore, the performance of the above two algorithms is compared on the basis of numerical results drawn from our analysis.