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

RFID Anti-collision Algorithm Based on Q-ary Search

确定性树形防碰撞算法用于确保读写器成功识别其工作域内的所有标签。然而当标签的标识符较长时,现有算法会产生大量的碰撞时隙,从而导致识别效率降低。针对现有树形算法的不足,通过引入标签ID比特编码机制,提出了一种多进制防碰撞算法,编码机制可以实现多比特碰撞仲裁,从而减少碰撞时隙。理论分析和仿真结果表明:该算法能减少识别过程中的碰撞时隙数,降低标签识别过程中的时间复杂度和通信负载,在标签数较多的情况下有效地提高射频识别系统的识别效率。

Deterministic tree-based algorithm is used to guarantee that all the tags in the reader field are successfully identified. However, the existing algorithms generates massive collision slots when the length of tags＇ ID is long, therefore reduce the identification efficiency. Aiming at the shortcomings of the existing tree-based algorithm, the Q-ary anti-collision algorithm is proposed by introducing the tag ID bit encoding mechanism. According to the encoding mechanism, the multiple bits collision arbitration can be achieved and the collision slots can be decreased. The theoretical analysis and simulation results show that the proposed algorithm can reduce the collision slots, time complexity and communication overhead during the identification process and efficiently improve the identification efficiency when the number of the tags is large.