基于返回式二进制树形搜索的反碰撞算法

An anti-collision algorithm based on binary-tree searching of backtracking

多个电子标签在识别时发生碰撞是射频识别(RFID)技术中关键的问题.解决此问题常用二进制树形搜索算法,但这种算法对N个标签识别进行一一识别时,所需的操作次数太多,效率较低.本文提出了一种新的算法,该算法是在二进制树形搜索算法的基础上进行改进.当阅读器检测不到有碰撞时,可用返回式从上一层REQUEST命令获得下一次的REQUEST命令.最后,通过比较对N个标签进行一一识别所需要总的操作次数,来进一步说明返回式二进制搜索算法的优越性.

Tag collision is a key problem in RFID when many electric tags are identified.Binary-tree searching algorithm was used to solve this problem.But,but it is too inefficient to do it.This paper gave a new algorithm which was an improvement on binary-tree searching algorithm.When there was no collision,the reader can acquire next request signal from superior layer.The new algorithm had an advantage by comparing testing times of identifying N electric tags with old algorithm.