K-bit continuous collision bit detection split tree RFID tag anti-collision algorithm

Abstract

The invention discloses a k-bit continuous collision bit detection split tree RFID tag anti-collision algorithm, and solves the technical problem that an existing multi-way tree algorithm is poor in tag recognition capability. According to the method, the collision bit division situation is accurately obtained according to Manchester encoding, and the highest continuous collision bit k is detectedthrough the received collision situation; the collision labels are divided into the 2k subgroups, the obtained continuous collision information is utilized, and then the collision labels are dividedinto the groups with different sizes, so that the situation that a large number of collision time slots exist in a multi-way tree algorithm is eliminated, and the number of the collision time slots and the number of sent information bits can be effectively reduced. MATLAB analog simulation proves that the method has better label identification capability.

Description

technical field [0001] The invention belongs to the technical field of radio frequency identification, and in particular relates to an anti-collision algorithm for k-bit continuous collision bit detection split tree RFID tags. Background technique [0002] Radio Frequency Identification (RFID) technology is a key technology in the sensing layer of the Internet of Things. It uses the signal emitted by the backscatter reader to identify the data stored in the tag. A typical RFID system usually consists of a reader and many tags, each covered with a unique identifier (UID). When multiple tags reply at the same time, a tag collision will occur because all tags share the same wireless channel. Tag collision not only reduces bandwidth utilization, but also increases recognition latency. [0003] Existing tag anti-collision methods are mainly divided into two categories, Aloha-based and branch-tree-based methods. Aloha-based methods are also known as uncertainty methods. Its e...

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to propose a k-bit continuous collision bit detection split tree RFID tag anti-collision algorithm for the problems of long recognition time period and large number of transmission information bits in the current branch tree algorithm, by using continuous multi-bit collision bit information k, divide the collision label into 2 k subgroups, dynamically adjust the subgroup size of each collision slot

Images