An Optimum Tree-Based Collision Resolution Algorithm for RFID System using Ternary Feedback

Radio frequency identification (RFID) systems are widely used nowadays and it is believed that there will be many technologies which will be using RFID system in future as well. The collision resolution for RFID systems will help solving the problem which can occur when there are more than one identification tags entering the system at the same time. This paper proposes an algorithm which can be applied to a practical environment and deals with the situation when the feedback of the system cannot detect the number of tags accessing the system in case of a collision. The proposed algorithm for collision resolution is based on ternary feedback which has the information about success, idle, and collision. Furthermore, we investigated the performance and throughput of the proposed algorithm and compared it with well-established algorithms. Our results show that the throughput of proposed algorithm outperforms the existing algorithm.