基于多进制搜索的RFID防碰撞算法

摘要

多标签碰撞问题严重影响射频识别系统的识别效率.确定性树形算法作为一种主流的RFID防碰撞算法可以确保读写器正确识别其工作范围内的标签.为了克服现有树形算法的不足,提出了一种标签ID比特编码机制的多进制搜索(QAS)算法.在算法的设计中引入了标签ID比特编码机制,通过这种编码机制读写器可以实现多比特碰撞仲裁,从而减少碰撞时隙,提高识别效率.理论分析和仿真结果表明.QAS算法降低了标签识别过程中的时间复杂度和通信负载,同参考算法相比具有良好的性能.%Multiple tags collision seriously affects the identification efficiency of a RFID system.As a mainstream RFID anti-collision algorithm,deterministic tree-based algorithm can guarantee that the reader correctly identifies the tags within its coverage.In order to overcome the shortcomings of the existing tree-based algorithms,a Q-ary search (QAS) algorithm with tag ID bit encoding mechanism is proposed.The bit encoding mechanism of tags' ID is introduced in the design of QAS algorithm,by which the multi-bit collision arbitration can be implemented by the reader.Benefiting from the encoding mechanism,the collision time slot is reduced,and the identification efficiency is improved.The theoretical analysis and simulation results show that the QAS algorithm reduces the time complexity and communication overhead during the identification process and achieves the good performance compared with the reference algorithms.