Recently, a number of articles have proposed query tree algorithms based on bit tracking to solve the multitag collision problem in radio frequency identification systems. However, these algorithms still have problems such as idle slots and redundant prefixes. In this paper, a time slot detection-based -ary tree (Time Slot Detection based -ary tree, TSDM) tag anticollision algorithm has been proposed. When a collision occurs, the reader sends a predetection command to detect the distribution of the -bit ID in the 2^m subslots; then, the time slot after predetection is processed according to the format of the frame-like. The idle time slots have been eliminate through the detection. Using a frame-like mode, only the frame start command carries parameters, and the other time slot start commands do not carry any parameters, thereby reducing the communication of each interaction. Firstly, the research status of the anticollision algorithm is summarized, and then the TSDM algorithm is explained in detail. Finally, through theoretical analysis and simulation, it is proved that the time cost of the TSDM algorithm proposed in this paper is reduced by 12.57%, the energy cost is reduced by 12.65%, and the key performance outperforms the other anticollision algorithms.

中文翻译：

---

物联网RFID标签基于时隙检测的三叉树防冲突识别协议

最近，许多文章提出了基于位跟踪的查询树算法，以解决射频识别系统中的多标签冲突问题。但是，这些算法仍然存在诸如空闲时隙和冗余前缀之类的问题。在本文中，一个时隙检测为基础的-叉树（时隙检测基础-叉树，TSDM）标签防碰撞算法已被提出。发生冲突时，读取器会发送一个预检测命令以检测-位ID在2 ^{m中的分布}子插槽；然后，根据帧状的格式对预检测后的时隙进行处理。通过检测消除了空闲时隙。使用类似帧的模式时，仅帧启动命令带有参数，而其他时隙启动命令不带有任何参数，从而减少了每次交互的通信。首先总结了防冲突算法的研究现状，然后详细说明了TSDM算法。最后，通过理论分析和仿真，证明了本文提出的TSDM算法的时间成本降低了12.57％，能源成本降低了12.65％，关键性能优于其他防冲突算法。