Abstract
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 M -ary tree (Time Slot Detection based M -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 m -bit ID in the 2m 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.
Highlights
Radiofrequency identification is a vital noncontact automatic identification technology in the sensing layer of the Internet of Things
Based on the M -ary tree algorithm, we proposed a TSDM (Time Slot Detection based M-ary Tree) anticollision algorithm
We propose time slot detection based on the M-ary tree anticollision algorithm (TSDM)
Summary
Based algorithm and the hybrid-based algorithm is briefed, and the current research status of the tree algorithm is detailed These articles focus on the improvement of ALOHA-based algorithm [1,2,3,4,5,6], and the basic idea behind this kind of algorithm is that the reader estimates the number of tags according to the collision, success, and idle time slots first and adjusts the frame length dynamically based on the estimation results. The simulation and theoretical analysis proved that the communication load, tag cost, time cost, and energy cost of the TSDM algorithm are better than the MCT, MQT, CwT, and STT algorithms compared with those articles [14, 15, 22, 27]. The performance of the proposed TSDM algorithm is evaluated and summarized
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
