Abstract: The anti-collision algorithm is the key technology of radio frequency identification system to achieve multi-target recognition.To solve the problem of too many identification times and transmitted bits in some binary tree based schemes,a new tree-based anti-collision algorithm is proposed.The algorithm divides tags into several groups.Four query prefixes which consist of two bits are directly used to split tag set,and the backtrack strategy is adopted to reduce identification times.The simulation results show that the algorithm significantly improves the query times and the data transmission.

Key words: radio frequency identification, anti-collision, binary Tree, grouping process, backtrack strategy