Deterministic Dual-stack Query Tree RFID tag anti-collision algorithm

Abstract

Tag collision problems are a major issue affecting the performance of RFID systems. The probabilistic tag anti-collision algorithm has tag starvation and cannot identify some tags. This paper proposes a deterministic dual-stack query tree algorithm (DDQT). It successfully implements the anti-collision algorithm of tags by generating new query codes and tag identification functions. At the same time, the DDQT algorithm greatly saves memory space by adding a prefix code stack and a suffix code stack. The DDQT algorithm is simple, and there is no limit on the length of the electronic tag to be queried. Compared with the previous query-tree algorithms, the DDQT algorithm has obvious improvements in query comparison times, empty query times, and occupied memory space. It can effectively remove idle nodes, shorten recognition time and save memory resources, thus improving the speed and accuracy of label recognition to some extent.