A group-based binary splitting algorithm For UHF RFID anti-collision systems

Identi?cation ef?ciency is a key performance metrics to evaluate the ultra high frequency(UHF) based radio frequency identi?cation (RFID) systems. In order to solve the tag collision problem and improve the identi?cation rate in large scale networks, we propose a collision arbitration strategy termed as group-based binary splitting algorithm (GBSA), which is an integration of an ef?cient tag cardinality estimation method, an optimal grouping strategy and a modi?ed binary splitting. In GBSA, tags are properly divided into multiple subsets according to the tag cardinality estimation and the optimal grouping strategy. In case that multiple tags fall into a same time slot and form a subset, the modi?ed binary splitting strategy will be applied while the rest tags are waiting in the queue and will be identi?ed in the following slots. To evaluate its performance, we ?rst derive the closed-form expression of system throughput for GBSA. Through the theoretical analysis, the optimal grouping factor is further determined. Extensive simulation results supplemented by prototyping tests indicate that the system throughput of our proposed algorithm can reach as much as 0.4835, outperforming the existing anti-collision algorithms for UHF RFID systems.