基于二叉树的RFID防碰撞算法的研究

Research on RFID anti-collision algorithms based on binary tree

在二叉树算法的基础上提出了锁位后退防碰撞(BLBO)算法,增加了锁位寻呼指令,阅读器根据译码结果判断发生碰撞的比特,发送锁位寻呼指令锁定发生碰撞的比特,寻呼过程采用后退策略,每次识别一个标签之后返回到上一个发生碰撞的节点。算法充分考虑了阅读器寻呼次数、传输时延、标签能耗以及吞吐量4个重要性能指标,仿真结果表明,BLBO防碰撞算法较其他二叉树算法性能有明显提高,更适用于RFID防碰撞协议。

The bit-locking backoff（BLBO） anti-collision algorithm was proposed on the basis of binary algorithm,which puts forward the concept and orders of bit-locking.A reader recognizes the bits where there are collisions according to the results of decoding.Then the orders of bit-locking are transmitted to lock the bit collided,after which backoff strategy is adopted.When the reader recognizes one tag,it returns to the previous collided tag.The proposed algorithm fully takes the time of request into account,as well as transmission delay,power consumption and throughput of the system.The analysis on simulation result indicates that BLBO performs significantly better than the existing binary tree algorithms.It is suitable for the RFID anti-collision protocol in a greater deal.