关键词: 射频识别（RFID）, 防碰撞算法, 查询树, 锁位, 预测指令

Abstract: Aiming at the problem of too many timeslots and high communication complexity caused by tag collisions in wireless radio frequency identification technology systems, on the basis of binary and quadruple number query tree anti-collision algorithms, the use of collision bit locks and prediction of sub-nodes methods, a novel lock-bit hybrid query tree (NLHQT) algorithm is proposed. The algorithm extracts the collision bit information through the lock bit instruction and predicts the extracted collision bit information. While reducing the collision time slot, the reader generates a new query prefix through the prediction, thus avoiding the idle child node being produced. The simulation results show that compared with the existing regressive lock-adaptive multi-tree search (RLAMS) and improved hybrid query tree (IHQT) anti-collision algorithms, the algorithm can effectively reduce the total number of slots and the communication complexity, and can improve the efficiency of tag identification.

Key words: radio frequency identification (RFID), anti-collision algorithm, query tree, lock position, prediction instruction