An Parallel Anti-Collision Algorithm Based on Adaptive Multi-Tree Search

In order to improve the unstable system throughput and reduce the "misjudgment" issues, this paper proposes a kind of parallel multi-tree search anti-collision algorithm. The algorithm embeds pseudo collision time slot with OVSF spreading code in RFID systems for identifying tags. As there are more than one code channels in a pseudo collision time slot, the slot can identify tags concurrently, reducing the accumulated collision. Theoretic analysis proves that the system throughput is improved with the increasing of code length. Simulation results show that the new algorithm has more stable and higher system throughput.