一种改进的动态二进制树防碰撞算法

在无线射频识别系统（RFID）中,标签的防碰撞问题是必须解决的关键问题之一。针对现有RFID系统中动态二进制树搜索算法识别效率较低、通信复杂度较高的问题,提出一种改进的动态二进制树防碰撞算法,在标签内设置一个计数器记录匹配位置信息,阅读器根据碰撞信息的高位与次高位产生下一级搜索前缀,并通过堆栈保存各搜索深度的前缀,从而减少搜索次数并降低数据通信量。经仿真分析表明,该算法在识别效率和通信复杂度两方面具有明显的优势。

An Improved Dynamic Anti-Collision Algorithm Based on Binary Tree

Anti-collision problem is one of the key problems must be solved in RFID system that how to identify multi-tags in target region quickly and efficiently.Considering that the radio frequency identification （RFID） binary tree search anti-collision algorithm is low-efficient and the communication complexity is high,an improved dynamic anti-collision algorithm based on binary tree is proposed in this paper.By setting a counter in the tag to record the matching position,and according to the highest position and second highest position of the collision information,the reader produces the next level search prefix and stores it in stack,which can reduce the search times and data communications volume.