Design of Hash-Tree Anti-collision Algorithm

In RFID system, the problem of the collision between tags is a focus topic. The Hash-tree anti-collision algorithm was proposed in the paper, which adopted hash operation to allocate slots for tags and used tree searching method to identify collision tags in the queue of collision slots. The proposed algorithm doesn´t require readers to test the precise location of collision bits, and its performance beyond 36.8% is better than ALOHA- based algorithms.