基于二进制树分解的动态防碰撞算法

Dynamic Anti-collision Algorithm based on Binary-tree Disassembling

针对现有的无线射频识别系统(RFID)二进制树防碰撞算法所需的搜索时隙较多,系统识别速率较低,提出了一种基于二进制树分解的动态防碰撞算法。该算法利用标签EPC的唯一性,对发生碰撞的比特位进行深度分解,根据碰撞位调整搜索状态,从而进一步减少搜索时隙数并提高了系统的呑吐量。通过对算法的分析和仿真结果表明:基于二进制树分解的动态防碰撞算法相对于动态二进制搜索算法有明显的优势。

Considering that the radio frequency identification（RFID） binary tree search anti-collision algorithm requires more time solt and the system identification rate is fairly low,a dynamic anti-collision algorithm based on binary-tree disassembly is proposed in this paper.This algorithm,with the uniqueness of EPC,implements in-depth decomposition of the collision bits,and according to the location of collision bits,adjusts the search state.Consequently,the search time is further reduced and the system throughput is improved.Theory and computer simulations show that the dynamic anti-collision algorithm based on the binary-tree disassembling is of more obvious advantages than the dynamic binary search algorithm.