RFID系统中二叉树防碰撞算法性能的提升

针对RFID系统中的标签碰撞问题,提出了一种改进的二叉搜索树防碰撞算法.通过划分标签子集、动态调整冲突检测过程,以减少标签冲突和系统开销,提高识别效率.仿真结果表明,相比于目前的二叉树搜索算法,本文方法在待识别标签数量较大的情况下提高了识别效率,减少了搜索次数及阅读器与标签之间的通信量.

Improvement of the Binary searching based Anti collision Algorithm of RFID Systems

To address the tag collision problem in Radio Frequency Identification (RFID) system, an improved binary tree anti collision algorithm was proposed. By dividing the tags into different subsets and adjusting dynamically the process of collision detection, the collision probabilities and power consumption were reduced. The simulation results have shown that, compared with other binary tree anti collision algorithms, the proposed algorithm enhances the identifying efficiency, and both the number of searching times and the bits transferred between the reader and the tags are relatively low when the number of tags is large.