基于后退策略的位传输二进制搜索算法

An algorithm based on bit-by-bit binary-tree of backtracking

多个电子标签在识别时发生碰撞是射频识别(RFID)技术中的关键问题,通常使用的是二进制搜索算法,在其基础上提出的位传输二进制搜索算法是二进制算法的一种变异算法。文章在位传输二进制搜索算法的基础上进行改进,提出一种新的算法,并给出了该算法的软件实现;通过分析比较证明该算法的优异性能。

Tag collision is a key problem in radio frequency identification（RFID） when many tags are identified.The binary-tree searching（BS） algorithm is usually used to solve this problem.On the basis of the BS algorithm,a bit-by-bit binary-tree（BBT） searching algorithm has been proposed,which is actually derived from the BS.This paper offers a new algorithm,which is an improvement on the BBT,and proves that the new algorithm has some advantages by comparing with other algorithms.Finally,software realization is also presented.