基于分支定界的动态树形搜索反碰撞算法

针对RFID系统中最常见的反碰撞问题，论文提出了一种基于分支定界的动态树形搜索反碰撞算法，算法采用分支定界的树形搜索机理，动态调整指令发送长度和发送值，并对一位碰撞进行智能识别。最后利用树的遍历思想予以实现，该算法能高效地识别所有标
签，时间复杂度低，在RFID领域有较好的应用前景。
关键词：分支定界；动态传输；反碰撞；无线射频识别
Abstract: For solving the common problem of anti-collision in RFID, this article brings
forward a binary-tree dynamic searching anti-collision algorithm based on branching and
bounding. The algorithm uses the principle of binary-tree searching on branching and bounding, adjusts the length and the value of sending code, and recognizes the collision of one bit intelligent .Finally, the algorithm is put into practice based on the traversing idea of tree, can identify all tags efficient, be proved by the analysis of time complexity, and has more extensive application prospects in radio frequency identification field.
Key words：Branch and bound; Dynamic send; anti-collision; RFID