The Bit Query for Labels in a Binary Tree-Based Anti-Collision Recognition Algorithm

Abstract

With its benefits including recognition distance, penetration ability, and multi-object recognition, radio frequency identification technology is a non-contact automatic identification method that is currently being used extensively in a variety of industries, including document anti-counterfeiting, automation, transportation, control management, and product services. An efficient anti-collision mechanism, such as anti-collision algorithms or anti-collision protocols, must be established in order to coordinate communication between the tag and the reader in the event that an RFID system experiences signal interference in the wireless channel, conflict, or collision, which will result in tag recognition or data collection failure. In response to tag conflicts in radio frequency identification (RFID) systems, a novel hybrid blocking query tree algorithm is suggested that leverages blocking prediction and child node hedging techniques to overcome the issues of lengthy time intervals and high communication complexity. The technique uses quadruple and bifurcated query trees as the foundation for its conflict avoidance strategy. The approach minimizes the conflict time and prevents the construction of idle subunits by forcing the reader to create new query prefixes via prediction, which is accomplished by employing locking commands to extract and forecast information about the conflicting bits. According to simulation data, this strategy performs better in terms of lowering the overall number of time slots and communication complexity as well as enhancing identification and labelling abilities than the current adaptive multi-tree search (RLAMS) and improved hybrid query tree (IHQT) techniques. It greatly increases the effectiveness of label identification while lowering the overall amount of time slots and communication complexity.