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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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