计算机与数字工程2024，Vol.52Issue(2)：353-358,455,7.DOI:10.3969/j.issn.1672-9722.2024.02.010
基于分组查询树的RFID标签识别算法
RFID Tags Recognition Algorithm Based on Grouping Query Tree
摘要
Abstract
In order to solve the multi-tag collision problem,a new RFID anti-collision algorithm is designed.Based on the QT anti-collision algorithm,a Group-based query tree anti-collision(GQT)algorithm is proposed for a large number of mobile tag scenarios.The new algorithm re-encodes the tag ID code by double-grouping,combining as a group of three consecutive bits.The first two bits in the same group are XORed.If the result of the EOR operation is the third digit value,set this group number to 1.If the result of the XOR operation is the third digit value,set this group number to 1.And crossing the number,re-encode the generat-ed number to form a new binary bit,and finally use query tree algorithm for identification.Theoretical analysis shows that the GQT algorithm can eliminate idle time slots,and the simulation results show that,compared with the QT algorithm and the AHT algo-rithm,the GQT algorithm can reduce the number of collision slots,and in the case of a large number of tags,the algorithm identifi-cation efficiency can be maintained at about 0.76.The GQT algorithm has good application value in logistics transportation,storage,management and other scenarios.关键词
RFID/多标签碰撞/防碰撞算法/查询树/分组编码Key words
RFID/multi-tag collision/anti-collision algorithm/query tree/grouping encode分类
信息技术与安全科学引用本文复制引用
周伟辉,万心悦,蒋年德..基于分组查询树的RFID标签识别算法[J].计算机与数字工程,2024,52(2):353-358,455,7.基金项目
江西省教育厅科技项目(编号:191612)资助. （编号:191612）
