Label anti-collision method based on Hash value code regrouping
By using the code remnant calculated by tag EPC number hash value in the radio frequency identification system, the problem of degradation of the recognition efficiency of the dynamic frame time slot ALOHA algorithm in a large number of tag scenarios is solved, and the system throughput and inventory efficiency are improved .
Patent Information
- Application Number
- CN202410848574.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-06-27
- Publication Date
- 2024-11-22
AI Technical Summary
In radio frequency identification (RFID) systems, the dynamic frame time slot ALOHA algorithm reduces the recognition efficiency in a large number of dense stacked tag storage scenarios, resulting in a decrease in system throughput.
By calculating the hash hash value of each tag, assigning group numbers according to reader and writer instructions, the grouping of tags is realized, ensuring that the number of tags in each group matches the maximum number of frame slots, and improving identification efficiency.
It effectively improves the throughput of the radio frequency identification system, solves the problem of the ALOHA algorithm recognition efficiency of dynamic frame time slots when there are many tags, and improves the inventory efficiency of high-frequency RFID systems.
Smart Images

Figure CN119005219A_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the field of radio frequency identification, and in particular relates to a tag anti-collision method based on hash value code regrouping. Background Art
[0002] The high-frequency RFID system has advantages that other frequency band RFID systems do not have due to its working frequency band and its working principle of magnetic field coupling, such as insensitivity to liquids, controllable reading range, not easy to misread, and accurate reading of densely stacked RFID tags. It is widely used in industries such as archive management and smart warehousing. The use of high-frequency readers and writers to take inventory of densely stacked electronic and document papers has advantages.
[0003] The ALOHA algorithm is widely used for its simple operation and fast recognition, among which the dynamic frame time slot ALOHA algorithm is the most widely used. When the tag to be identified matches the maximum number of frame time slots, the DFSA algorithm can achieve a maximum recognition efficiency of about 0.368 by dynamically adjusting the frame length. However, for a large number of densely stacked electronic paper inventories, the frame length of the reader cannot be increased infinitely. Therefore, when the number of tags continues to increase, the system throughput will continue to decrease, and the system efficiency of the DFSA algorithm will be seriously affected.
[0004] Therefore, there is an urgent need for a method that comprehensively considers the relationship between the maximum frame time slot number and the number of tags. If it is estimated that the number of tags to be identified exceeds the range that the maximum frame time slot number can match, the number of tags to be answered each time can be reduced by dividing the tags to be identified into multiple groups, thereby ensuring that the tags to be identified in each group match the maximum frame time slot number, improving the inventory efficiency of the tags, and meeting the needs of RFID applications. The present invention is produced to meet this practical need. Summary of the invention
[0005] 1. Technical issues to be resolved
[0006] The technical problem to be solved by the present invention is how to provide a tag anti-collision method based on hash value code regrouping to solve the problem that the recognition efficiency of the dynamic frame time slot ALOHA algorithm drops rapidly when there are many tags in a radio frequency identification (RFID) system.
[0007] (II) Technical solution
[0008] In order to solve the above technical problems, the present invention proposes a tag anti-collision method based on hash value code regrouping, which comprises the following steps:
[0009] S1. Necessity judgment of label grouping
[0010] The reader estimates the tags within its range and compares them with the grouping threshold. If the number of tags is greater than the grouping threshold, grouping is required. Otherwise, no grouping is required and the tags are counted directly.
[0011] S2. Label grouping
[0012] By calculating the hash value of each tag's EPC number, according to the instruction sent by the reader, the code weight of the partial sequence of the hash value is obtained to assign a group number to each tag;
[0013] S3, inventory within tag group
[0014] The reader starts to send commands to query the tags in the group in turn. The commands include the group number that the reader needs to query. When the tag's own group number is equal to the group number sent by the reader, the tag responds to the reader; the remaining group tags that are not selected this time wait for identification.
[0015] (III) Beneficial effects
[0016] The present invention proposes a tag anti-collision method based on hash value code regrouping. The method proposed by the present invention is based on the dynamic frame time slot ALOHA algorithm, uses the code weight of the tag EPC hash code to group the tags within the reader range, and proposes a dynamic frame time slot ALOHA algorithm based on code weight regrouping. The method can solve the problem that the recognition efficiency of the dynamic frame time slot ALOHA algorithm drops rapidly when there are many tags in the radio frequency identification (RFID) system, and effectively improves the throughput of the high-frequency RFID system. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] Figure 1 This is a flow chart of the dynamic frame time slot anti-collision algorithm based on EPC hash code regrouping of the present invention. DETAILED DESCRIPTION
[0018] In order to make the purpose, content and advantages of the present invention more clear, the specific implementation methods of the present invention are further described in detail below in conjunction with the drawings and examples.
[0019] The invention relates to the field of radio frequency identification, and in particular to a dynamic frame time slot ALOHA anti-collision algorithm based on hash value code regrouping.
[0020] The present invention discloses a tag anti-collision algorithm based on hash value code regrouping, which is suitable for a high-frequency RFID system using a dynamic Q value ALOHA algorithm, such as a high-frequency RFID system using the ISO 18000-3 Mode 3 protocol. The method mainly includes: (1) judging the necessity of tag grouping. The reader estimates the tags within its range and compares them with the grouping threshold to determine whether grouping is required. (2) implementing tag grouping. By calculating the hash value of the EPC number of each tag, the code weight of the partial sequence of the hash value is obtained according to the reader instruction, so as to realize the assignment of group numbers to each tag. (3) inventory within the tag group. The reader selects a group of tags for inventory, and the remaining groups of tags that are not selected this time wait for identification.
[0021] The present invention proposes a method that combines the anti-collision process with the EPC hash value code to improve the system throughput in the scenario of a large number of tag inventory. The method includes:
[0022] S1. Necessity judgment of label grouping
[0023] The reader estimates the tags within its range and compares them with the grouping threshold. When the number of tags is greater than the grouping threshold, grouping is required. Otherwise, no grouping is required and inventory is performed directly.
[0024] S11. Estimation of the initial number of tags
[0025] The reader sends the tag inventory command and the Q value in the DFSA algorithm to the tag. The initial frame length is 2. Q-1 The reader estimates the total number of remaining tags to be identified as N according to the tag estimation method. estimate .
[0026] S12. Determine the necessity of grouping
[0027] The estimated number of labels N estimate Compare with the grouping threshold N. When N estimate When it is less than or equal to N, the initial frame length in the group is set to be equal to the number of response tags, and then the DFSA algorithm is called to identify the tags in the group; when N estimate When it is greater than N, grouping is performed and S2 is executed.
[0028] S2. Label grouping
[0029] By calculating the hash value of the EPC number of each tag, the code weight of the partial sequence of the hash value is obtained according to the instruction sent by the reader, so as to assign a group number to each tag.
[0030] S21. Hash value calculation
[0031] The tag performs a hash operation on its own EPC number and outputs a hash value with a length of 256 bits.
[0032] S22, hash value code weight
[0033] The reader sends a command M to the tag. The tag selects the last M bits of the tag's EPC hash value according to the command M sent by the reader, and calculates the code weight, which is the group number assigned to the tag and stores it in the tag's group number register.
[0034] S3, inventory within tag group
[0035] The reader starts to send commands to query the tags in the group in turn, and the commands include the group number that the reader needs to query. When the group number of the tag itself is equal to the group number sent by the reader, the tag responds to the reader, and the reader counts the number of responding tags. If the number of tags in the group is less than or equal to the grouping threshold N, the initial frame length in the group is equal to the number of responding tags, and then the DFSA algorithm is called to identify the tags in the group; if the number of tags in the group is still greater than N, repeat step S2 to continue grouping, in which the reader instructs M+1. The remaining groups of tags that are not selected this time are waiting to be identified.
[0036] Embodiment 1:
[0037] The present invention proposes a method that combines the anti-collision process with the hash value code of the tag EPC to effectively improve the system throughput.
[0038] The following takes the reverse ASK modulation and Manchester coding in ISO 18000-3 Mode 3 as an example to illustrate the specific implementation of the present invention, but it is not intended to be a limitation of the specific implementation method. The specific implementation process of the method is as follows.
[0039] S1. Necessity judgment of label grouping
[0040] The reader estimates the tags within its range and compares them with the grouping threshold. When the number of tags is greater than the grouping threshold, grouping is required. Otherwise, no grouping is required and inventory is performed directly.
[0041] S11. Estimation of the initial number of tags
[0042] The reader sends the tag inventory command and the Q value in the DFSA algorithm to the tag. The initial frame length is 2. Q-1 According to the tag estimation method, the total number of remaining tags to be identified is estimated to be N estimate In specific implementation, a relatively simple algorithm can be used to estimate the number of tags. When a conflict occurs, at least two tags collide in a time slot, and the number of successfully identified time slots S is recorded. s , number of empty time slots S e and the number of collision slots S c , the estimation function of the total number of tags to be identified is: N estimate =S s +2S cThis estimation method has the advantages of being simple.
[0043] S12. Determine the necessity of grouping
[0044] The estimated number of labels N estimate Compare with the grouping threshold N. When N estimate ≤N, set the initial frame length in the group to be equal to the number of response tags, and then call the DFSA algorithm to identify the tags in the group; when N estimate When >N, grouping is performed.
[0045] In the specific implementation, it is assumed that the initial frame length of the DFSA algorithm is 256. If the number of tags to be counted is greater than 256, the system recognition efficiency is very low. 256 is used as the grouping threshold, that is, N = 256. estimate ≤256, set the initial frame length in the group to be equal to the number of response tags, and then call the DFSA algorithm to count the tags in the group; when N estimate When >256, grouping is performed.
[0046] S2. Tag grouping implementation
[0047] S21. Hash value calculation. The tag performs a hash operation on its own EPC number and outputs a 256-bit hash value. The hash algorithm is: MD5, SHA-1, SHA-256 or CRC.
[0048] Table 1 Tag group number generation table
[0049]
[0050] In specific implementation, as shown in Table 1, the first column is the tag EPC value, the front digit is generally the tag manufacturer code, and the back digit is the tag serial number. The manufacturer code in Table 1 is replaced by 0; the second column is the hash value of the tag EPC generated by hash calculation, which is 256 bits long and is expressed in hexadecimal for convenience.
[0051] S22, calculate the tag group number. The reader sends a command M to the tag, and the tag selects the M-bit code weight of the hash sequence according to the command M sent by the reader, which is the group number assigned to the tag, and stores it in the group number register of the tag.
[0052] In specific implementation, the reader sends the instruction M=16 to the tags within its range, and calculates the code weight of the 16-bit binary value after the hash value, which is the group number of each tag. As shown in Table 1, it is assumed that the reader sends the instruction M=16 to the three tags within its range, and the 16-bit bit values after the hash value are ox46bd, ox02e2, and ox469d, which are converted into binary as 100011010111101, 1011100010, and 100011010011101. The code weights of the three groups of binary are 9, 5, and 8 respectively. In this way, the tags are divided into three groups, the tag with the EPC tail number 0x0799 is the 9th group, the tag with the EPC tail number 0x 079C is the 5th group, and the tag with the EPC tail number 0x07B9 is the 8th group.
[0053] S3. Inventory of tags within the group
[0054] When the reader performs an inventory within a group, it first selects a group of tags, then counts the tags within the group, and the remaining groups of tags wait for identification.
[0055] S31, the reader selects a group of tags. After the tags are assigned group numbers, the reader starts to send commands to query the tags in the group one by one. When the group number of the tag itself is equal to the group number sent by the reader, the tag responds to the reader, and the remaining groups of tags wait for identification.
[0056] S32, the reader counts the tags in the group. The reader counts the number of reply tags. If the number of tags in the group is less than or equal to the grouping threshold N = 256, the initial frame length in the group is set to be equal to the number of reply tags, and then the DFSA algorithm is called to identify the tags in the group; if the number of tags in the group is still greater than 256, repeat step S2 to continue grouping, where the reader instructs M+1.
[0057] Embodiment 2:
[0058] A tag anti-collision algorithm based on hash code regrouping, comprising:
[0059] (1) Initial estimation of the number of tags. The reader estimates the number of tags within its range and compares it with the grouping threshold to determine whether grouping is required.
[0060] (2) Tag grouping: By calculating the hash value of each tag’s EPC number and obtaining the code weight of the partial sequence of the hash value according to the reader’s instructions, each tag is assigned a group number.
[0061] (3) Inventory within a tag group. The reader selects a group of tags for inventory, and the remaining groups of tags that are not selected this time wait for identification.
[0062] Furthermore, in step (1), the grouping method is as follows:
[0063] (11) Estimation of the initial number of tags. The reader sends a tag inventory command and the Q value in the DFSA algorithm to the tag. The initial frame length is 2 Q-1 The reader estimates the total number of remaining tags to be identified as N according to the tag estimation method. estimate .
[0064] (12) Determine the necessity of grouping. Set the estimated number of tags N estimate Compare with the grouping threshold N. When N estimate If the number of tags in the group is less than N, set the initial frame length in the group equal to the number of response tags, and then call the DFSA algorithm to identify the tags in the group; when N estimate When it is greater than N, grouping is performed.
[0065] Furthermore, in step (2), the method for taking inventory within the group is as follows:
[0066] (21) Hash value calculation: The tag performs a hash operation on its own EPC number and outputs a hash value with a length of 256 bits.
[0067] (22) Hash value code weight. The reader sends a command M to the tag. The tag selects the M-bit binary value of the hash sequence according to the command M sent by the reader to calculate the code weight, which is the group number assigned to the tag and is stored in the group number register of the tag.
[0068] The method proposed in the present invention is based on the dynamic frame time slot ALOHA algorithm, and utilizes the code weight of the tag EPC hash code to group the tags within the reader range. A dynamic frame time slot ALOHA algorithm based on code weight regrouping is proposed, which can solve the problem that the recognition efficiency of the dynamic frame time slot ALOHA algorithm decreases rapidly when there are many tags in the radio frequency identification (RFID) system, and effectively improve the throughput of the high-frequency RFID system.
[0069] The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the technical principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.
Claims
1. A tag anti-collision method based on hash code regrouping, It is characterized in that The method comprises the following steps: S1. Necessity judgment of label grouping The reader estimates the tags within its range and compares them with the grouping threshold. If the number of tags is greater than the grouping threshold, grouping is required. Otherwise, no grouping is required and the tags are counted directly. S2. Label grouping By calculating the hash value of each tag's EPC number, according to the instruction sent by the reader, the code weight of the partial sequence of the hash value is obtained to assign a group number to each tag; S3, inventory within tag group The reader starts to send commands to query the tags in the group in turn. The commands include the group number that the reader needs to query. When the tag's own group number is equal to the group number sent by the reader, the tag responds to the reader; the remaining group tags that are not selected this time wait for identification.
2. The tag anti-collision method based on hash value code regrouping as claimed in claim 1, It is characterized in that The S1 specifically includes: S11. Estimation of the initial number of tags The reader sends the tag inventory command and the Q value in the DFSA algorithm to the tag. The initial frame length is 2. Q-1 ; The reader estimates the total number of remaining tags to be identified as N according to the tag estimation method estimate ; S12. Determine the necessity of grouping The estimated number of labels N estimate Compared with the grouping threshold N; when N estimate When it is less than or equal to N, the initial frame length in the group is set to be equal to the number of response tags, and then the DFSA algorithm is called to identify the tags in the group; when N estimate When it is greater than N, grouping is performed and S2 is executed.
3. The tag anti-collision method based on hash code regrouping as claimed in claim 2, It is characterized in that When a conflict occurs, at least two tags collide in a time slot, and the number of successfully identified time slots S is recorded. s , number of empty time slots S e and the number of collision slots S c , the estimation function of the total number of tags to be identified is: N estimate =S s +2S c .
4. The tag anti-collision method based on hash code regrouping as claimed in claim 2, It is characterized in that Assuming that the initial frame length of the DFSA algorithm is 256, if the number of tags to be counted is greater than 256, the system recognition efficiency is very low, and 256 is used as the grouping threshold, that is, N=256.
5. The tag anti-collision method based on hash value code regrouping according to any one of claims 2 to 4, It is characterized in that The S2 specifically includes: S21. Hash value calculation The tag performs a hash operation on its own EPC number and outputs a hash value; S22, hash value code weight The reader sends a command M to the tag. The tag selects the last M bits of the tag's EPC hash value according to the command M sent by the reader, and calculates the code weight, which is the group number assigned to the tag and stores it in the tag's group number register.
6. The tag anti-collision method based on hash code regrouping as claimed in claim 5, It is characterized in that The hashing algorithms are: MD5, SHA-1, SHA-256, or CRC.
7. The tag anti-collision method based on hash code regrouping as claimed in claim 5, It is characterized in that In S21, a hash value with a length of 256 bits is output.
8. The tag anti-collision method based on hash code regrouping as claimed in claim 5, It is characterized in that In S22, the reader sends an instruction M=16 to the tags within its range, and calculates the code weight of the 16-bit binary value after the hash value, where the code weight is the group number of each tag.
9. The tag anti-collision method based on hash code regrouping as claimed in claim 5, It is characterized in that The S3 also includes: the reader counts the number of reply tags, if the number of tags in the group is less than or equal to the grouping threshold N, sets the initial frame length in the group to be equal to the number of reply tags, and then calls the DFSA algorithm to identify the tags in the group; if the number of tags in the group is still greater than N, repeats step S2 to continue grouping, where the reader instructs M+1.
10. The tag anti-collision method based on hash code regrouping as claimed in claim 5, It is characterized in that The S3 specifically includes: S31, the reader selects a group of tags. After the tags are assigned group numbers, the reader starts to send commands to query the tags in the group in sequence. When the group number of the tag itself is equal to the group number sent by the reader, the tag responds to the reader, and the remaining groups of tags wait for identification; S32. The reader counts the tags in the group: the reader counts the number of reply tags. If the number of tags in the group is less than or equal to the grouping threshold N, the initial frame length in the group is set to be equal to the number of reply tags, and then the DFSA algorithm is called to identify the tags in the group. If the number of tags in the group is still greater than the grouping threshold N, repeat step S2 to continue grouping, where the reader instructs M+1.
Citation Information
Cited By
RFID-based label card issuing device management method and system
CN120996782A
RFID data acquisition method, device and medium
CN122457999A
