Research on Group-Based Polling Anti-collision Algorithm for RFID Tag Identification

摘要

A group-based polling algorithm is proposed. The results of our theoretical analysis show that the performance of the algorithm proposed is better than that of dynamic frame slot ALOHA algorithm, backtracking binary-tree searching algorithm and polling algorithm if the tags in the same group are numbered continuously. When a specific group of tags are identified, the performance of the algorithm proposed is much better than that of other algorithms. Comparative simulation experiments on the four kinds of anti-collision algorithms are conducted using Matlab7. Experimental results further verify the performance advantage of the group-based polling algorithm.