Research on RFID anti-collision algorithms based on binary tree

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.