Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Large-scale RFID system lost tag identification method based on balanced collision binary tree

A technology of tag identification and binary tree, applied in the field of radio frequency identification

Active Publication Date: 2022-04-12
SUN YAT SEN UNIV
View PDF8 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the existing technology still has some limitations

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Large-scale RFID system lost tag identification method based on balanced collision binary tree
  • Large-scale RFID system lost tag identification method based on balanced collision binary tree
  • Large-scale RFID system lost tag identification method based on balanced collision binary tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0057] Please refer to figure 1 , a method for identifying lost tags in a large-scale RFID system based on a balanced collision binary tree, comprising the following steps:

[0058] S1, respectively constructing pseudo IDs for each tag in the target RFID system;

[0059] S2. Construct a balanced collision binary tree of the target RFID system according to the pseudo ID;

[0060] Wherein, the balanced collision binary tree is composed of a root node, a leaf node above the root node with an out-degree of 0, and an internal node with an out-degree of 2; the leaf node is used to execute a singleton time slot or is a collision slot containing two tags; the internal node is only used to store data, and does not perform tag response and identification operations;

[0061] S3, based on the Manchester coding principle and the first-listen-then-dialogue mechanism between the RFID reader and the tag, starting from the root node, proceeding layer by layer to a higher layer, and collidin...

Embodiment 2

[0117] A large-scale RFID system lost tag recognition system based on a balanced collision binary tree, please refer to Figure 11 , including a pseudo-ID building module 1, a balanced collision binary tree building module 2, and a traversal identification module 3; Connect the traversal identification module 3; wherein:

[0118] The pseudo-ID construction module 1 is used to construct pseudo-IDs for each tag in the target RFID system respectively;

[0119] The balanced collision binary tree construction module 2 is used to construct a balanced collision binary tree of the target RFID system according to the pseudo ID;

[0120]Wherein, the balanced collision binary tree is composed of a root node, a leaf node above the root node with an out-degree of 0, and an internal node with an out-degree of 2; the leaf node is used to execute a singleton time slot or is a collision slot containing two tags; the internal node is only used to store data, and does not perform tag response ...

Embodiment 3

[0123] A medium on which a computer program is stored, and when the computer program is executed by a processor, the steps of the method for identifying lost tags in a large-scale RFID system based on a balanced collision binary tree in Embodiment 1 are realized.

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

Aiming at the limitation of the prior art, the invention provides the method for identifying the lost tag of the large RFID system based on the balanced collision binary tree, the data structure of the balanced collision binary tree is proposed and used for the first time in the field, and a binary query tree of which the leaf nodes are highly balanced is constructed for a target RFID system, so that the lost tag of the target RFID system is identified. Compared with a traditional collision tree, the height is obviously reduced, and the time overhead of broadcasting information by the reader-writer is further greatly reduced; the Manchester encoding principle and the CPT tree structure are combined, so that the use of an empty time slot is thoroughly avoided, and whether two tags are lost or not can be synchronously detected from one time slot only by using one-bit information, thereby greatly improving the utilization rate of frames and time slots. On the premise of ensuring the same recognition accuracy, compared with the prior art, the method has the advantages that the progressive overhead is maximally reduced by a multiple factor which is nearly log N, the performance is greatly improved in various parameter environments, and the robustness and the expansibility are good.

Description

technical field [0001] The invention relates to the technical field of radio frequency identification, in particular to the application of a new balanced collision binary tree on a large RFID system, and more specifically, to a method for identifying lost tags in a large RFID system based on a balanced collision binary tree. Background technique [0002] A typical RFID (Radio Frequency Identification, radio frequency identification) communication system is mainly composed of three parts: 1) tags (tags), each tag has a unique ID (electronic code), and passive tags can transmit radio frequency from the reader The energy is captured in the signal and communicates with the reader, but the passive tags cannot communicate with each other; 2) the reader (reader), which can write data to the tag through the radio frequency signal, and can also read from the tag The information and perception related data of the stored items; 3) the back-end server (the back-end server), which is con...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06K7/10G06N5/00G06K17/00
CPCY02D30/70
Inventor 刘康怀陈林
Owner SUN YAT SEN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com