An Anti-Collision Algorithm Based on Subset-division and Dynamic Matching Mechanism for Intelligent Tags

Abstract

A collision will occur when more than one tag is read by the reader in the RFID system. The Slotted Aloha algorithm is presented to solve tag collision problem. But it has some deficiencies when the number of tags is great. An anti-collision algorithm based on subset-division and dynamic-matching mechanism was presented to advance it in this work. It divided the intelligent tags into different subsets according to time-slices and adjusted dynamically the matching area to reduce the collision probabilities. The simulation results show that compared with slotted aloha, the new anti-collision algorithm enhances obviously the identifying efficiency, success-identifying rate and throughput, and its success-identifying rate can reach 95% even though the number of tags is great. It takes on better application value.