Abstract—The problem of tag collision is the main problem affecting the performance of RFID systems. Probabilistic tag anti-collision algorithms have tag starvation and cannot recognize some tags. This paper proposes a deterministic query-tree algorithm, that is, a single-stack deep query-tree RFID tag anti-collision algorithm, which successfully implements tag anti-collision by generating new query code and tag recognition. The algorithm uses the highest two collision bits of the collision code to form four new query codes. The query tree formed by the query code is a depth-first traversal quad-tree. The algorithm introduces a single-stack storage mechanism, and the query code uses a depth-first traversal algorithm. In the entire tag recognition process, the structure of the query code spanning tree was improved, and the degree of the branch node was 4. This combination of depth-first traversal and single-stack mechanism effectively shortened the recognition time, saved memory space, and reduced the number of tag collisions. And the algorithm is simple and easy to implement. When the number of tags increases, the efficiency of the algorithm will be more clearly reflected.
Index Terms—RFID, anti-collision algorithm, query tree, single stack.
Yanling Zhou is with College of Artificial Intelligence and Big Data, HeFei University, HeFei, China (e-mail: zhouyanling1006@163.com). Linshan Ma is with HeFei University Library, Hefei University, Hefei, China (e-mail: lsmao@hfuu.edu.cn). Thomas Clemen is with Deputy Dean of School of Computer Engineering, Hamburg University of Applied Sciences, Germany (e-mail: thomas.clemen@haw-hamburg.de).
[PDF]
Cite:Yanling Zhou, Linshan Ma, and Thomas Clemen, "Single-Stack Deep-Query Quad-Tree RFID Tag Anti-collision Algorithm," International Journal of Computer Theory and Engineering vol. 12, no. 6, pp. 140-144, 2020.
Copyright © 2020 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
