Anti‐collision algorithm based on slotted random regressive‐style binary search tree in RFID technology

Abstract

Abstract In recent years, the rapid development of the Internet of Things (IoT) technology has provided a strong technical support for the technological transformation of the logistics industry. The informatization development of logistics industry increasingly relies on the Internet of Things technology represented by Radio Frequency Identification (RFID) technology. These technologies lead the whole business process to optimize the business process in the direction of accurate, efficient and real‐time. In order to solve the problem that the reader cannot identify the label information correctly due to the phenomenon of data collision in the application of RFID technology, this paper proposes an anti‐collision algorithm based on Slotted Random Regressive‐style Binary Search Tree (SR‐RBST). Based on Slotted ALOHA (SA) the method proposed in this paper uses the Regressive‐style Binary Search Tree (RBST) to process the RFID labels in the collision time slot. With the same size of tags, the SR‐RBST algorithm needs less total time slot and has higher efficiency and shorter identification time, while with the increase of the number of tags, the SR‐RBST anti‐collision algorithm has more obvious advantages. The SR‐RBST algorithm effectively improves the time slot utilization efficiency of the system.

Keywords

• Combinatorial mathematics
• Protocols
• Computer communications
• Combinatorial mathematics
• Computer networks and techniques
• Protocols