Identification efficiency is a key performance metrics to evaluate the ultra high frequency (UHF) based radio frequency identification (RFID) systems. In order to solve the tag collision problem and improve the identification 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 efficient tag cardinality estimation method, an optimal grouping strategy and a modified 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 modified binary splitting strategy will be applied while the rest tags are waiting in the queue and will be identified in the following slots. To evaluate its performance, we first 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.

中文翻译：

---

UHF RFID防碰撞系统的一种基于组的二进制分裂算法

识别效率是评估基于超高频 (UHF) 的射频识别 (RFID) 系统的关键性能指标。为了解决大规模网络中的标签冲突问题并提高识别率，我们提出了一种称为基于组的二进制分裂算法（GBSA）的冲突仲裁策略，它是一种有效的标签基数估计方法的集成，一种最优分组策略和修改后的二进制拆分。在GBSA中，根据标签基数估计和最优分组策略将标签适当地划分为多个子集。如果多个标签落入同一个时隙并形成一个子集，则将应用修改后的二进制拆分策略，而其余标签在队列中等待并在以下时隙中进行标识。为了评估其性能，我们首先推导出 GBSA 系统吞吐量的闭式表达式。通过理论分析，进一步确定了最优分组因子。大量仿真结果辅以原型测试表明，我们提出的算法的系统吞吐量可以达到 0.4835，优于现有的 UHF RFID 系统防碰撞算法。