基于四元查询树算法的改进防碰撞算法

射频识别技术是一种非接触式的自动识别技术,当多个电子标签同时传输它们的唯一标签识别码(UID)给阅读器时,则会发生碰撞问题,因此解决电子标签信号碰撞的问题就显得尤为重要。提出了一种预先侦测查询树算法,以减少碰撞识别和空闲时间来降低识别延迟。使用四元查询树协议取代二元查询树协议来减少碰撞,实现时隙预先侦测信号技术来清除全部的空闲时间。结合四元查询树协议与时隙前侦测信号技术,来改善RFID在电子标签识别上所发生的碰撞问题,减少不必要的查询命令数量。经仿真模拟分析,并和已有电子标签防碰撞算法进行比较,实验结果显示预先侦测查询树算法可以有效改善碰撞问题,提升RFID系统的整体识别效能。

A New Anti-collision Algorithm Based on the Quaternary Query Tree Algorithm

Radio Frequency Identification is a kind of non-contact auto-identification technique when many electronic tags transmit their only tag identification code to the reader; there will be collision arising, thereby, the research on collision avoidance is necessary and urgent. With the purpose of decreasing the recognition delay, a Pre-Query Tree Algorithm is proposed through the way of decreasing the collision identification and idle time. In this algorithm, the Binary Query Tree Algorithm is replaced by the Quaternary Query Tree Algorithm to reduce the collision. Meanwhile the slotted Pre-Detection Signal Mechanism is used to eliminate the entire idle time. Combined with the Binary Query Tree Algorithm and the slotted Pre-Detection Signal Mechanism, the collision problem of Radio Frequency Identification (RFID) at the aspect of electronic tag identification is promoted and the number of unnecessary query command is reduced. The simulation results show that Pre-Query Tree Algorithm could reduce the collision, and the entire efficiency of FRID system is improved.