Improving Performance of Ternary Tree Algorithm Using Adaptive Group Splitting Technique

This paper presents technique for improving the performance of Ternary tree algorithm. In order to avoid the collision, Ternary tree algorithm divides the users involved in collisions into 3 groups. However, in the case of continuous collisions, keeping the number of divided groups equal to 3 all the time may cause an inefficient use of channel. This is because in later collisions there are fewer users involved in the collision. Dividing the number of groups to 2 in later collisions can provide better performance. Therefore, this paper proposes Adaptive Group Splitting technique to improve the channel access efficiency of Ternary tree algorithm. In Adaptive Group Splitting Technique, the threshold value is defined as the number of collisions in a continuous collision that start to change the number of divided groups from 3 to 2. From the results, we found that the threshold value is an important parameter and affects the system performance. When we use the appropriate threshold value Adaptive Group Splitting technique can help reduce the number of idle slots and improve the performance of Ternary tree algorithm. Especially in the case where there are a large number of users in the system.