Tree search RFID anti-collision method capable of reducing communication complexity

A tree search and anti-collision technology, which is applied in the field of RFID system anti-collision, can solve the problems of high communication complexity between readers and tags, and many times of reader searches, so as to reduce data communication volume, reduce communication complexity, The effect of increasing the search rate

Pending Publication Date: 2021-02-19
CHENGDU AERONAUTIC POLYTECHNIC
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Aiming at the above-mentioned deficiencies in the prior art, the tree search RFID anti-collision method which reduces the communication complexity provided by the present invention solves the problem that in the existing RFID anti-collision technology, there are too many searches by the reader, and the communication between the reader and the tag is complicated. high degree of problem

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
  • Tree search RFID anti-collision method capable of reducing communication complexity
  • Tree search RFID anti-collision method capable of reducing communication complexity
  • Tree search RFID anti-collision method capable of reducing communication complexity

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0043] Such as figure 1 As shown, a tree search RFID anti-collision method that reduces communication complexity includes the following steps:

[0044] S1. Set the prefix length register Q and the response flag register R in the tag, and initialize them to 0, and set the stack storage area in the reader at the same time;

[0045] Wherein, the prefix length information of the label is stored in the prefix length register Q, and the value of the response flag register R is 0 representing the 0 subset or 1 representing the 1 subset;

[0046] S2. Make the reader send an initial search command request(ε);

[0047] Among them, the initial search command request (ε) is a command that all tags that receive the command send their serial number data to the reader at the same time;

[0048] S3, judging whether the reader has received the serial number data;

[0049] If yes, go to step S4;

[0050] If not, go to step S5;

[0051] S4. Based on the received serial number data, perform ...

Embodiment 2

[0072] Assume that there are 4 tags within the scope of the reader, and the serial number is 10 bits, that is, N=10, as shown in Table 1.

[0073] Table 1 Label and its serial number

[0074]

[0075] The specific search process of the reader is as follows:

[0076] (1) The reader sends the command request (ε), and all tags return the complete serial number to the reader.

[0077] (2) The data received by the reader is "01XX1XXXXX", the highest collision bit is K=7, P=N-K-1=10-7-1=2, and "2" is stored in the stack area of ​​the reader; the reader sends a command request (0,2), since the initial value of R is 0, all tags respond to the command, update the Q register to 2, K=N-P-1=10-2-1=7, and the tag A whose 7th bit is '0' returns The data "1101001" is given to the reader, and the tags B, C, and D whose seventh bit is '1' update R to 1.

[0078] (3) The reader receives the data: "1101001", identifies the tag A, reads and writes the data of the tag A, makes it in a "silen...

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

The invention discloses a tree search RFID anti-collision method capable of reducing communication complexity, and solves the problems of large data communication traffic, identification time delay and the like in an RFID search tree anti-collision algorithm. The method comprises the following steps: introducing a prefix length register and a response mark register into a label, storing prefix number information in a reader stack area, enabling the reader to send the prefix length information to classify and search the labels, wherein the reader and the labels do not send the serial numbers identified by each other any more, so that the communication data volume is effectively reduced. Simulation results show that compared with a traditional binary tree search anti-collision algorithm, thealgorithm can obviously reduce the system communication complexity and improve the tag search rate.

Description

technical field [0001] The invention belongs to the technical field of anti-collision of RFID systems, and in particular relates to a tree search RFID anti-collision method for reducing communication complexity. Background technique [0002] A typical RFID system is generally composed of electronic tags and readers. There are three main situations for RFID anti-collision problems: (1) There are multiple tags within the range of one reader; (2) There is one tag within the range of multiple readers; (3) There are multiple tags within the scope of multiple readers. The problems involved mainly include: multiple tag collisions and multiple readers collisions. Due to the low cost of tags, low energy, small memory, and weak computing and processing capabilities, the difficulty of RFID collisions mainly focuses on the multi-tag anti-collision problem. In the first case, since all electronic tags share a channel with the reader, when multiple tags are within the range of the same r...

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/10
CPCG06K7/10297G06K7/10356
Inventor 莫磊陈伟
Owner CHENGDU AERONAUTIC POLYTECHNIC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap