IRBST:An Improved RFID Anti-collision Algorithm Based on Regressive-Style Binary Search Tree

Tag collision is a common and inevitable problem in a RFID (radio frequency identification) system. How to solve this problem efficiently is very necessary. So it is important to research efficient anti-collision algorithm. In this paper, we proposed an Improved RFID anti-collision algorithm based on Regressive-style Binary Search Tree (IRBST). This algorithm decreases not only the data transmission size but also the times of computation by detecting the single collision bit. Furthermore, it makes the search range become smaller and smaller, so as to identify all tags which are in the range of reader rapidly. The performance analysis and experiment results of this algorithm show that this algorithm is superior to the algorithm based on regressive-style binary search tree in efficiency in the field where tags´ EPC are densely distributed.