Research On Anti-collision Algorithm In RFID Tag

RFID technology has many advantages,for example,the non-contact initiative to quickly identify, permanent storage data, reusable and can be read at the same time, low cost, strong penetrability, etc, it has broad application prospects in today. In the RFID system, when multiple tags within the scope of reader response reader at the same time, its own information sent to the reader, the reader can't identify all the tags at the same time. This will lead to the RFID tag collision problems. The problem restricting the development of RFID technology, this paper studies tag collision algorithm based on RFID technology, do the following work:Firstly, we propose an Improved Return Binary Search tree algorithm(IRBS). the main idea of IRBS algorithm is that when the tag collision, using the principle of collision tracking to detect the highest bit, and sends a feedback information to the label,the label will stop sending ID information, by using this method to reduce the unnecessary information in the process of RBS algorithm.Secondly, we propose a Grouping Frame Slot ALOHA algorithm(GFSA).This method first to use DFSA on reader within the scope of the tag is used to identify the frame first, and get a estimate of the remaining labels, and then the optimal grouping coefficient is used to determine the tag number of sets of grouping, the remaining label random response packet. After for grouping label,reader for each set of tags by RBS algorithm for identification. Simulation results show that the algorithm can not only improve the efficiency of system identification, can also improve the ALOHA algorithm "label hunger" phenomenon.