IBTA: An IBT-Tree Based Algorithm for RFID Anti-collision

In this paper we propose an anti-collision algorithm named IBTA for Radio Frequency Identification (RFID) when tag collision problem occurred. RFID is a flagship technology that has been developed for years since 1990s. Because of the shared wireless channel between RFID reader and tags during communication, the tag collision problem is a matter of significance to the performance of a RFID system. In the proposed algorithm, Manchester code is used to detect collision, and stack, counters are taken to decrease redundant communications. Theoretical analysis and experiment show that the proposed algorithm can effectively reduce the reader-to-tag communication cost at least by 11.11% than the Dynamic Binary Search Algorithms of Backtracking, and is more efficient than other binary tree based algorithms.