A Low Complexity Anti-Collision Algorithm for RFID Using Query Tree

摘要

In order to further decrease the probability of the collision and reduce communication complexity, a new low complexity anti-collision algorithm for RFID is proposed using Query Tree. The proposed algorithm can reduce the probability of collision and the traffic of data communication by tag grouping and setting rules, respectively. The simulation results show that the proposed scheme consumes fewer slots and has lower communication complexity.