The Research of RFID Anti-Collision Algorithm Based on the Frame Slots of Multi-branched Tree

摘要

This paper proposed a new RFID anti-collision algorithm on the basis of the frame slots of Multi-branched Tree. This new algorithm used for multi-grouped lies in the label prefix discrimination, which greatly prevents the situation that the frame length is not enough and reduces the transmission of bits effectively. Simultaneously, this algorithm reduces the Reader's search range and the probability of collisions. In the performance of decreasing the collisions slots, reducing the search depth and system delay and improving the system throughput, especially in the case of the presence of large number of tags, the new algorithm is superior to the traditional method. Numerical simulations demonstrate the efficiency of theoretical results.