RFID Tags Recognition Algorithm Based on Grouping Query Tree
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.
国家科技期刊平台
NSTL
万方数据
