基于时隙补偿机制的RFID混合查询树算法(AHQT)

标签防碰撞算法的优劣决定了RFID系统性能的好坏，针对标签识别的RFID系统前人已经提出了许多算法，但都有明显的缺点，包括识别速度慢、不稳定等．已有的算法主要分为两大体系：基于ALOHA的算法、查询树算法．基于混合查询树算法，引入时隙补偿机制和采用特定编码方式（曼彻斯特编码），由标签中每三位中1的个数，决定标签响应时隙，大大降低了碰撞时隙，提高了识别效率．

Advanced hybrid query tree algorithm based on slotted backoff mechanism in RFID

The merits of performance quality for a RFID system are determined by the effectiveness of tag anti-collision algorithm. Many algorithms for RFID system of tag identification have been proposed, but they all have obvious weaknesses, such as slow speed of identification, unstable and so on. The existing algorithms can be divided into two groups, one is based on ALOHA and another is based on query tree. This article is based on the hybrid query tree algorithm, combined with a slotted backoff mechanism and a specific encoding （ Manchester encoding）. The number of value＂ 1＂ in every three consecutive bits of tags is used to determine the tag response time slots, which will greatly reduce the time slot of the collision and improve the recognition efficiency.