Anti-collision method based on label serial number sliding window iterative grouping

Abstract

The invention provides an anti-collision method based on label serial number sliding window iterative grouping. The method is based on a binary tree search method and a Manchester encoding principle,sets formed by tag IDs in a reader-writer coverage area are grouped according to conflicting BIT, and accurate identification of the tag IDs is achieved in a recursive mode of grouping and then grouping. After reading the information of the plurality of tags, the reader-writer checks conflicting BIT bits according to a Manchester encoding principle, and after the conflicting BIT bits of the tag IDinformation are determined, subsets of the tags are divided according to the conflicting BIT bits, so that the size of groups is gradually reduced until all tag IDs are read out; and the method has the advantages of high identification precision, the high speed, the short time delay, short time consumption and high identification efficiency under the conditions of many labels and too long label IDs.

Description

technical field [0001] The invention relates to the field of RFID communication, in particular to an anti-collision method based on tag serial number sliding window iterative grouping. Background technique [0002] At present, most of the tag anti-collision methods in RFID systems are based on time-division multiple access technology, mainly including ALOHA-based randomness methods and tree-based deterministic methods. In the pure ALOHA method, if the reader detects that there is mutual interference in the signals, it will send a command to the tag to order it to stop transmitting signals to the reader; after the tag receives the command signal, it will stop sending information and will randomly After waiting for a period of time, the information will be sent to the reader again. The length of each electronic tag standby time segment is random, which can reduce the possibility of collision. When the reader successfully recognizes a tag, it will immediately issue a command ...

AI Technical Summary

Problems solved by technology

The ALOHA-based method and the tree-based method have their own advantages and disadvantages. The former is simple to implement, but there will be a problem of "label starvation", that is, there may be a phenomenon that the label cannot be successfully identified for a long time

In contrast, the tree-based method does not have this problem and has high recognition accuracy, but the method has high computational complexity and requires a long time delay, especially when the tag ID is too long

Images