Fast Splitting-Based Tag Identification Algorithm For Anti-Collision in UHF RFID System

Efficient and effective objects identification using radio frequency identification (RFID) is always a challenge in large-scale industrial and commercial applications. Among existing solutions, the tree-based splitting scheme has attracted increasing attention because of its high extendibility and feasibility. However, the conventional tree splitting algorithms can only solve tag collision with counter value equals to zero and usually result in performance degradation when the number of tags is large. To overcome such drawbacks, we propose a novel tree-based method called fast splitting algorithm based on consecutive slot status detection (FSA-CSS), which includes a fast splitting (FS) mechanism and a shrink mechanism. Specifically, the FS mechanism is used to reduce collisions by increasing commands when the number of consecutive collision is above a threshold, whereas the shrink mechanism is used to reduce extra idle slots introduced by the FS. Simulation results supplemented by prototyping tests show that the proposed FSA-CSS achieves a system throughput of 0.41, outperforming the existing ultra high frequency RFID solutions.