为了改善射频识别(radio frequency identification,RFID)系统中大量无源标签识别时,普通算法识别速度慢、性能不稳定等的问题,在混合查询树算法的基础上提出了一种改进型的混合查询树防碰撞算法.在原有查询队列的基础上,由每个符合前缀标签的除去前缀后高三位比特中“1”的个数来决定其延时多少个时隙再进行对阅读器的应答；应答过程中,采用曼彻斯特编码进行数据的发送,有效地识别了碰撞位.仿真结果表明,改进算法在大量标签识别的场合比混合查询树算法更具有效性和稳定性.%To resolve the problem of performing slowly and lacking of steadiness for traditional anti-collision algorithms in the case where there are hundreds of tags identifying simultaneously in the RFID system, a new algorithm is suggested based on hy-brid QT. In this algorithm, the tag which matches prefix sent by reader delays slots depending on their count of value 1 of upper 3 bit based on query queue. Manchester code is used in the process for tags' responding to detect collision effectively. The simula-tion performance shows the algorithm is more effective and steady than hybrid QT in the situation for a large number of tags for identifying.
展开▼
