A RFID Anti-Collision Algorithm Based on Two-Time-Slotted Binary Search

RFID (Radio Frequency Identification) is an auto-identification technology which has been widely applied to many fields for its great deal of advantages, and anti-collision algorithm is one of its core technologies. Based on the deep study on the traditional and some main currently anti-collision algorithms and its deficiencies analysis, a new anti-collision model: two-time-slotted binary search algorithm is presented in this paper, which the number of times of the search command is reduced because the responds of the radio-frequency tags in the operation scope of the RFID reader are assigned to different time slot, and the anti-collision process is optimized by the simplification of requests and responses between reader and tags. Furthermore, the complete process of the above algorithm is also expounded minutely. The simulation of the new algorithm is done by the software Quartus II, and the simulation result shows that the amount of communication data is reduced greatly, the search efficiency is improved obviously, and the tag´s identification becomes more accurate under the same conditions.