Label inventory method and device and electronic equipment

Abstract

The invention provides a tag inventory method and device and electronic equipment, and relates to the technical field of wireless, and the method comprises the steps that a reader-writer sends a first message; under the condition that the N response messages received by the reader-writer collide, the reader-writer sends a second message to the N tags; under the condition that the label number of the returned response message is one, the reader-writer backtracks an interference response message which is closest to the first response message of the target label and contains a second response message of the target label, and performs interference elimination on the interference response message according to the first response message to obtain a residual response message; and the reader-writer performs inventory on the first tag and the tag corresponding to the residual response message. According to the method and the device, the response result of the multiple tags is backtracked, and interference elimination is performed on the response result of the multiple tags according to the response result of the single tag, so that the residual response message is decoded, the broadcasting frequency of a reader-writer is reduced, and the inventory efficiency of the tags can be improved.

Description

Technical Field

[0001] This application relates to the field of wireless technology, and in particular to a tag storage method, apparatus and electronic device. Background Technology

[0002] The 3rd Generation Partnership Project (3GPP) Release 18 introduced the Ambient IoT research project, which aims to design a device that can harvest ambient energy (radio, light, vibration, or other energy sources) for communication. Its complexity and energy consumption are far lower than Narrow Band Internet of Things (NB-IoT), using backscattering-based technologies and networks for communication.

[0003] The most similar system in the existing system is EPC C1G2, as well as Ultra High Frequency Radio Frequency Identification (UHF RFID) systems (such as ISO / IEC 18000-6C), which use backscatter communication technology to realize communication between tags and readers. It allows tags to randomly reflect signals sent by readers through time-slot Aloha and uses load modulation to exchange information with base stations.

[0004] Traditional Radio Frequency Identification (RFID) systems mainly consist of RFID tags, readers, and backend applications. The backend application controls the reader to issue commands and receives tag inventory results from the reader. The reader is responsible for inventorying the tags, each storing a unique identification code, typically an Electronic Product Code (EPC). The reader and tags communicate via backscatter, and the tags have certain storage and processing capabilities.

[0005] The reader performs inventory checks on tags by sending commands such as Select, Query, QueryRep, QueryAdjust, and ACK. The Select command selects a specific tag from the tag family; the Query command instructs the selected tag to generate a random number; QueryRep and QueryAdjust decrement and adjust the random number, respectively; finally, when the random number becomes zero, the tag sends a new random number RN16 for identification to the reader; the reader replies with ACK and the corresponding tag's RN16. Upon receiving the ACK and its own RN16, the tag sends its EPC (Extended Process Control). The reader then sends the EPC back to the backend application or sends a handle for further communication. Generally, an inventory check is considered complete when a tag sends its EPC to the reader. See the above process for details. Figure 1 As shown. Based on the current progress of standards, 3GPP Ambient IoT devices are most likely to choose to use technologies similar to UHF RFID or EPC C1G2 and enhance them.

[0006] Currently, the tag inventory methods for passive IoT mainly include the following two:

[0007] like Figure 2 As shown, Figure 2 The diagram illustrates the scenario where messages sent by multiple tags collide using a time-division-based inventory method. When message collisions occur, the inventory efficiency is low, with the theoretical maximum efficiency of this method being only 36.8%, making it unsuitable for scenarios with a massive number of tags in passive IoT.

[0008] like Figure 3 As shown, Figure 3 This illustrates an inventory management method based on a search tree. A search tree is a commonly used algorithm for finding elements within a node. A search tree consists of nodes, each with its parent node and child nodes. Child nodes belonging to the same parent node are siblings, and the number of siblings is the number of branches in the tree. The height (or depth) of the search tree is the longest path from the parent node to all its child nodes.

[0009] The first tree has a height of 4 and 2 siblings, making it a binary tree of height 4. The second tree has a height of 2 and 4 siblings, making it a quadtree of height 2. When the reader / writer is storing data, it first determines the sequence from the current node to all its parent nodes. Then, it broadcasts the sequence from the parent node to its corresponding child node as a prefix. The tag checks if its prefix matches its internally stored EPC. If they match, the tag sends its EPC to the reader / writer.

[0010] However, a tall tree means the reader needs to broadcast more signals, while too many empty time slots in the tree mean slower disk access speed; neither of these is ideal. According to simulation results, the maximum disk access efficiency based on a binary tree is capped at 50%.

[0011] It is evident that all of the above-mentioned label inventory methods suffer from low inventory efficiency. Summary of the Invention

[0012] This application provides a tag inventory method, apparatus, and electronic device to solve the problem of low inventory efficiency in passive Internet of Things (IoT).

[0013] To solve the above-mentioned technical problems, this application is implemented as follows:

[0014] In a first aspect, embodiments of this application provide a tag inventory method, the method comprising:

[0015] The reader sends the first message;

[0016] If the reader receives N response messages to the first message and the N response messages collide, the reader sends a second message to the N tags corresponding to the N response messages, where N is an integer greater than 1.

[0017] When the number of tags returning the response message corresponding to the second message is one, the reader traces back to the interfering response message that is closest in time to the first response message of the target tag among the N tags and includes the second response message of the target tag, and performs interference cancellation on the interfering response message according to the first response message to obtain the residual response message. The target tag includes at least a first tag, the first tag is the tag that returns the response message corresponding to the second message, the first response message is the message that the target tag responds independently, and the second response message is the response message with interfering messages.

[0018] The reader / writer stores the first tag and the tag corresponding to the residual response message.

[0019] Optionally, the reader traces back to the interfering response message that is closest in time to the first response message of the target tag among the N tags and includes the second response message of the target tag, and performs interference cancellation on the interfering response message based on the first response message to obtain a residual response message, including:

[0020] According to the response time of the tags from latest to earliest, the reader sequentially traces back the interfering response messages in the tree structure corresponding to the N response messages, starting from the first response message of the target tag, and including the second response message of the target tag, which is closest to the response time of the first response message. The reader then performs interference elimination on the interfering response messages based on the first response message to obtain the residual response messages, until all tags corresponding to the interfering response messages are decoded or cannot be decoded, at which point the backtracking stops.

[0021] Optionally, the interference response message includes a first interference response message and a second interference response message;

[0022] The process involves, in ascending order of tag response times, the reader sequentially backtracks through the tree structure corresponding to the N response messages, starting with the first response message of the target tag, to the interfering response messages whose response times are closest to the first response message and which include the second response message of the target tag. Interference is then eliminated based on the first response message to obtain residual response messages. Backtracking stops when all tags corresponding to the interfering response messages are decoded or cannot be decoded. This process includes:

[0023] According to the order of the tag response times from latest to earliest, the reader takes the first response message of the first tag as the starting point in the tree structure corresponding to the N response messages, traces back to the first interference response message that is closest in time to the first response message of the first tag and includes the second response message of the first tag, and performs interference elimination on the first interference response message based on the first response message of the first tag to obtain the first residual response message, wherein the number of tags corresponding to the first interference response message is two.

[0024] Starting from the first interference response message, backtrack to the second interference response message that is closest in time to the first interference response message and includes the third response message. Then, based on the first interference response message, perform interference cancellation on the second interference response message to obtain the second residual response message. The backtracking stops when all tags corresponding to the second response message are decoded or cannot be decoded.

[0025] The third response message is a response message sent by the two tags corresponding to the first interference response message, and the third response message is a response message indicating the presence of interference.

[0026] Optionally, the first message includes a first common prefix of the identity identifiers of the N tags, and the method further includes:

[0027] Among the N IDs corresponding to the N tags, obtain the number of preset values ​​that are located after the first common prefix and adjacent to the first common prefix, and obtain the relative size of the proportion of the number of each preset value to the total number of preset values;

[0028] The transmission priority of the second common prefix is ​​determined based on the relative size of the ratio, and the second common prefix includes the preset value;

[0029] The reader sends a second message to the N tags corresponding to the N response messages, including:

[0030] The reader sends a second message, including the second common prefix, to the N tags corresponding to the N response messages according to the sending priority.

[0031] Optionally, the preset value includes a first preset value and a second preset value, the second common prefix includes a first prefix and a second prefix, the first prefix includes the first preset value, and the second prefix includes the second preset value;

[0032] Determining the transmission priority of the second common prefix based on the relative size of the ratio includes:

[0033] If the proportion of the first preset value is greater than the proportion of the second preset value, then the transmission priority of the first prefix is ​​determined to be higher than the transmission priority of the second prefix; or,

[0034] If the proportion of the first preset value is greater than the proportion of the second preset value, the transmission priority of the first prefix is ​​determined to be lower than the transmission priority of the second prefix.

[0035] Optionally, determining that the transmission priority of the first prefix is ​​higher than the transmission priority of the second prefix when the proportion of the first preset value is greater than the proportion of the second preset value includes:

[0036] When the proportion of the first preset value is greater than the proportion of the second preset value, the first prefix and the second prefix are pushed onto the stack in descending order of the proportion, and the transmission priority of the first prefix is ​​determined to be higher than that of the second prefix according to the order in which they are pushed onto the stack.

[0037] The step of determining that the transmission priority of the first prefix is ​​lower than the transmission priority of the second prefix when the proportion of the first preset value is greater than the proportion of the second preset value includes:

[0038] If the proportion of the first preset value is greater than the proportion of the second preset value, the second prefix and the first prefix are pushed onto the stack in ascending order of the proportion, and the transmission priority of the first prefix is ​​determined to be lower than that of the second prefix according to the order in which they are pushed onto the stack.

[0039] Optionally, obtaining the relative size of the proportion of each preset value to the total number of preset values ​​includes:

[0040] Based on the level height of the falling edge of the waveform after the N response messages are superimposed, determine the relative size of the proportion of each preset value to the total number of preset values.

[0041] Secondly, embodiments of this application provide a tag storage device, the device comprising:

[0042] The first sending module is used to send the first message;

[0043] The second sending module is used to send a second message to the N tags corresponding to the N response messages when the reader receives N response messages of the first message and the N response messages collide. N is an integer greater than 1.

[0044] The backtracking module is used to backtrack the interfering response message that is closest in time to the first response message of the target tag among the N tags and includes the second response message of the target tag, when the number of tags that return the response message corresponding to the second message is one. The module then performs interference cancellation on the interfering response message based on the first response message to obtain the residual response message. The target tag includes at least a first tag, which is a tag that returns the response message corresponding to the second message. The first response message is a message that the target tag responds to independently, and the second response message is a response message that contains interfering messages.

[0045] The inventory module is used to inventory the first tag and the tags corresponding to the residual response message.

[0046] Optionally, the backtracking module is specifically used for:

[0047] In the tree structure corresponding to the N response messages, starting from the first response message of the target tag, the interfering response messages that are closest to the response time of the first response message and include the second response message of the target tag are traced back. The interference of the interfering response messages is eliminated according to the first response message to obtain the residual response messages. The tracing stops when all the tags corresponding to the interfering response messages are decoded or cannot be decoded.

[0048] Optionally, the interference response message includes a first interference response message and a second interference response message; the backtracking module includes:

[0049] The first backtracking submodule is used to backtrack the first interference response message that is closest to the first response message of the first tag and includes the second response message of the first tag in the tree structure corresponding to the N response messages, according to the response time of the tags from late to early. The interference of the first interference response message is eliminated based on the first response message of the first tag to obtain the first residual response message. The number of tags corresponding to the first interference response message is two.

[0050] The second backtracking submodule is used to backtrack from the first interference response message to the second interference response message that is closest in time to the first interference response message and includes the third response message, and to perform interference cancellation on the second interference response message according to the first interference response message to obtain the second residual response message, until the backtracking stops when all the tags corresponding to the second response message are decoded or cannot be decoded.

[0051] The third response message is a response message sent by the two tags corresponding to the first interference response message, and the third response message is a response message indicating the presence of interference.

[0052] Optionally, the first message includes a first common prefix of the identity identifiers of the N tags, and the device further includes:

[0053] The acquisition module is used to acquire, from the N IDs corresponding to the N tags, the number of preset values ​​located after the first common prefix and adjacent to the first common prefix, and to acquire the relative size of the proportion of the number of each preset value to the total number of preset values;

[0054] The determining module is used to determine the transmission priority of the second common prefix based on the relative size of the ratio, wherein the second common prefix includes the preset value;

[0055] The second sending module is specifically used for:

[0056] The reader sends a second message, including the second common prefix, to the N tags corresponding to the N response messages according to the sending priority.

[0057] Optionally, the preset value includes a first preset value and a second preset value, the second common prefix includes a first prefix and a second prefix, the first prefix includes the first preset value, and the second prefix includes the second preset value;

[0058] The determining module includes:

[0059] The first determining submodule is used to determine that the transmission priority of the first prefix is ​​higher than the transmission priority of the second prefix when the proportion of the first preset value is greater than the proportion of the second preset value; or,

[0060] The second determining submodule is used to determine that the transmission priority of the first prefix is ​​lower than the transmission priority of the second prefix when the proportion of the first preset value is greater than the proportion of the second preset value.

[0061] Optionally, the first determining submodule is specifically used for:

[0062] When the proportion of the first preset value is greater than the proportion of the second preset value, the first prefix and the second prefix are pushed onto the stack in descending order of the proportion, and the transmission priority of the first prefix is ​​determined to be higher than that of the second prefix according to the order in which they are pushed onto the stack.

[0063] The second determining submodule is specifically used for:

[0064] If the proportion of the first preset value is greater than the proportion of the second preset value, the second prefix and the first prefix are pushed onto the stack in ascending order of the proportion, and the transmission priority of the first prefix is ​​determined to be lower than that of the second prefix according to the order in which they are pushed onto the stack.

[0065] Optionally, the acquisition module is specifically used for:

[0066] Based on the level height of the falling edge of the waveform after the N response messages are superimposed, determine the relative size of the proportion of each preset value to the total number of preset values.

[0067] Thirdly, embodiments of this application provide an electronic device, including: a processor, a memory, and a program stored in the memory and executable on the processor, wherein when the program is executed by the processor, it implements the steps of the tag storage method described in the first aspect.

[0068] Fourthly, embodiments of this application provide a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the steps of the tag storage method described in the first aspect.

[0069] Fifthly, a computer program product is provided, including computer instructions that, when executed by a processor, implement the steps of the tag storage method as described in the first aspect.

[0070] In this embodiment, by backtracking the response results of multiple tags and eliminating interference based on the response results of a single tag, residual response messages are decoded, reducing the number of broadcasts by the reader and improving tag storage efficiency. Attached Figure Description

[0071] To more clearly illustrate the technical solutions of the embodiments of this application, the drawings used in the description of the embodiments of this application will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0072] Figure 1 This is a schematic diagram of the interaction process between a reader and a tag provided in an embodiment of this application;

[0073] Figure 2 This is one of the collision diagrams of a tag response message provided in an embodiment of this application;

[0074] Figure 3 This is a schematic diagram of a search tree provided in an embodiment of this application;

[0075] Figure 4 This is one of the flowcharts of a tag inventory method provided in the embodiments of this application;

[0076] Figure 5 This is a second schematic diagram of a tag response message provided in an embodiment of this application;

[0077] Figure 6 This is one of the schematic diagrams of a tag inventory method provided in an embodiment of this application;

[0078] Figure 7This is a second schematic diagram of a tag inventory method provided in an embodiment of this application;

[0079] Figure 8 This is a schematic diagram illustrating interference cancellation of a response message provided in an embodiment of this application;

[0080] Figure 9 This is a schematic diagram of the display interface of the response signal of a tag provided in an embodiment of this application;

[0081] Figure 10 This is a third schematic diagram of a tag inventory method provided in the embodiments of this application;

[0082] Figure 11 This is a fourth schematic diagram of a tag inventory method provided in the embodiments of this application;

[0083] Figure 12 This is a schematic diagram of a collision position provided in an embodiment of this application;

[0084] Figure 13 This is the fifth schematic diagram of a tag inventory method provided in the embodiments of this application;

[0085] Figure 14 This is a schematic diagram of simulation results for the system efficiency of various trees provided in the embodiments of this application;

[0086] Figure 15 This is a schematic diagram of the simulation results of the system efficiency corresponding to the various traversal methods provided in the embodiments of this application;

[0087] Figure 16 This is a second flowchart of a tag inventory method provided in an embodiment of this application;

[0088] Figure 17 This is a schematic diagram of the structure of a tag storage device provided in an embodiment of this application;

[0089] Figure 18 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Detailed Implementation

[0090] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0091] This application provides a tag inventory method, apparatus, and electronic device to solve the problem of low inventory efficiency in passive Internet of Things (IoT).

[0092] See Figure 4 , Figure 4 This is a flowchart of a tag inventory method provided in an embodiment of this application, such as... Figure 4 As shown, the method includes the following steps:

[0093] Step 401: The reader sends the first message;

[0094] Step 402: If the reader receives N response messages of the first message and the N response messages collide, the reader sends a second message to the N tags corresponding to the N response messages, where N is an integer greater than 1.

[0095] Step 403: When the number of tags returning the response message corresponding to the second message is one, the reader traces back to the interfering response message that is closest in time to the first response message of the target tag among the N tags and includes the second response message of the target tag, and performs interference elimination on the interfering response message according to the first response message to obtain the residual response message. The target tag includes at least a first tag, the first tag is the tag that returns the response message corresponding to the second message, the first response message is the message that the target tag responds independently, and the second response message is the response message that contains interfering messages.

[0096] Step 404: The reader / writer stores the first tag and the tag corresponding to the residual response message.

[0097] During tag inventory, the reader broadcasts a prefix each time. Upon receiving the prefix, the tag matches it with its own identity document (ID) (such as RN16, EPC, TID, etc., a unique identifier in this inventory round). If the prefix matches the tag's own ID, the tag sends all or part of its identification ID. If the reader correctly decodes the tag's identification ID, the tag is successfully inventoryed. This inventory method ensures that all tags are successfully inventoryed.

[0098] In step 401, the reader sends a first message, which may include a common prefix of the multiple tag IDs to be stored.

[0099] In step 402, after receiving the first message, N tags send N response messages. When the N response messages sent by the N tags collide, the reader sends a second message to the N tags. The second message may include a common prefix of the N tag IDs.

[0100] In step 403, N tags send response messages according to the received second message. If the number of tags that receive the returned response message is 1, the reader will backtrack from the response message of the target tag in order of response time from latest to earliest.

[0101] In one alternative implementation, if the target tag only includes the first tag, then backtracking begins with the response message of the first tag. Backtracking continues to the interfering response message that is closest in time to the first response message of the first tag and includes the second response message of the first tag.

[0102] Among them, the first response message of the first tag is an independent response message of the first tag, and the first response message received by the reader is not interfered with by other response messages.

[0103] The second response message of the first tag is the response message corresponding to the first tag in the interference response message received by the reader when the first tag and other tags send response messages to the reader at the same time.

[0104] Because the reader receives interference response messages from multiple tags, the second response message and the residual response message in these response messages interfere with each other. The reader cancels the interference of the interference response message based on the first response message, thereby obtaining the residual response message.

[0105] In another optional implementation, the target label may include a first label and a second label, wherein the second label is one of multiple labels corresponding to the aforementioned interference response message. During backtracking, backtracking begins with the first response message of the first label, and the backtracking process is described above. After a residual response message is determined through backtracking, backtracking continues with the first response message of the second label as the starting point, and the backtracking process is the same as that of the first label, which will not be repeated here.

[0106] When the target tag also includes a third tag, backtracking starts from the response message of the third tag and continues until every tag in the target tag is decoded, or if it cannot be decoded, backtracking stops.

[0107] The reader can decode the first tag through the first response message, and decode the tag corresponding to the residual response message by obtaining the residual response message, thereby completing the inventory of the first tag and the tag corresponding to the residual response message.

[0108] Optionally, the reader traces back to the interfering response message that is closest in time to the first response message of the target tag among the N tags and includes the second response message of the target tag, and performs interference cancellation on the interfering response message based on the first response message to obtain a residual response message, including:

[0109] According to the response time of the tags from latest to earliest, the reader sequentially traces back the interfering response messages in the tree structure corresponding to the N response messages, starting from the first response message of the target tag, and including the second response message of the target tag, which is closest to the response time of the first response message. The reader then performs interference elimination on the interfering response messages based on the first response message to obtain the residual response messages, until all tags corresponding to the interfering response messages are decoded or cannot be decoded, at which point the backtracking stops.

[0110] The tag inventory process can be represented by a tree structure. By adding backtracking functionality to the backtracking tree, the tags can be decoded sequentially. The backtracking tree can use collision trees, ordinary binary trees, query trees, etc. as basic inventory methods. The following explanation uses collision trees as an example.

[0111] Collision trees are a storage method that finds common prefixes based on the results of the previous collision round and determines the prefixes for the next round based on these common prefixes. For example... Figure 5 As shown, the common prefix of the four labels is {01}. By finding the common prefix, the collision tree can avoid empty time slots.

[0112] For the inventory process using collision trees, please refer to [link / reference]. Figure 6 As shown, there are 6 tags with tag IDs {1,2,3,4,8,10} and a length of 4 bits. Using a collision tree disk requires sending 11 Request commands, consuming 11 time slots. After sending a Request command, the prefix stack changes as shown in the {} below the Request command.

[0113] In this embodiment, the temporal order of the response messages sent by the tag is determined within a tree structure corresponding to N response messages. For example, the reader first sends the first message, and the tag sends the response message to the first message; then the reader sends the second message, and the tag sends the response message to the second message. The order of the response times of the two responses can be obtained based on the response times.

[0114] During backtracking, starting with the first response message of the target tag, the backtracking proceeds in ascending order of tag response time, focusing on interfering response messages that are closest in time to the first response message and include the second response message of the target tag. The first response message is the message from which the target tag responds independently, without interference from other response messages. The second response message, however, is a response message that has interference or collisions with residual response messages; the interfering response messages include both the second response message and the residual response messages.

[0115] By eliminating interference in the first response message, the residual response message can be obtained, and the tag corresponding to the residual response message can be decoded.

[0116] When the target label contains the first label, the label corresponding to the residual response message is decoded using the method described above. When the target label includes both the first and second labels, after decoding the residual response message as described above, the interference response message can be traced back from the first response message of the second label to the one closest in time to the first response message of the second label, and includes the second response message of the second label. The label corresponding to the residual response message in the interference response message is then decoded. When the target label contains the first, second, and third labels, this process continues. The backtracking stops when all labels corresponding to multiple response messages in the interference response message have been decoded, or when multiple labels cannot be decoded based on the current situation.

[0117] It should be noted that the above explanation uses a collision tree as an example because it is efficient and its complexity is acceptable. In practical applications, other trees can also be used in the embodiments of this application.

[0118] Optionally, the interference response message includes a first interference response message and a second interference response message;

[0119] The process involves, in ascending order of tag response times, the reader sequentially backtracks through the tree structure corresponding to the N response messages, starting with the first response message of the target tag, to the interfering response messages whose response times are closest to the first response message and which include the second response message of the target tag. Interference is then eliminated based on the first response message to obtain residual response messages. Backtracking stops when all tags corresponding to the interfering response messages are decoded or cannot be decoded. This process includes:

[0120] According to the order of the tag response times from latest to earliest, the reader takes the first response message of the first tag as the starting point in the tree structure corresponding to the N response messages, traces back to the first interference response message that is closest in time to the first response message of the first tag and includes the second response message of the first tag, and performs interference elimination on the first interference response message based on the first response message of the first tag to obtain the first residual response message, wherein the number of tags corresponding to the first interference response message is two.

[0121] Starting from the first interference response message, backtrack to the second interference response message that is closest in time to the first interference response message and includes the third response message. Then, based on the first interference response message, perform interference cancellation on the second interference response message to obtain the second residual response message. The backtracking stops when all tags corresponding to the second response message are decoded or cannot be decoded.

[0122] The third response message is a response message sent by the two tags corresponding to the first interference response message, and the third response message is a response message indicating the presence of interference.

[0123] In the presence of a first interference response message and a second interference response message, the tags corresponding to the first interference response message and the second interference response message are decoded respectively.

[0124] Following the order of tag response times from latest to earliest, starting with the first response message of the first tag, we trace back to the most recent response before the response time of the first response message, and this response includes the second response message of the first tag; this response message is the first interfering response message. Interference removal is performed on the first interfering response message to obtain the first residual response message. Then, starting from the first interfering response message, we further trace back to the most recent second interfering response message before the response time of the first interfering response message, which includes the third response message. Interference removal is performed on the second interfering response message to obtain the second residual response message.

[0125] To facilitate understanding of the above process, the following example uses a tree structure for illustration.

[0126] like Figure 7 As shown, when the reader broadcasts {0010}, it receives a response message from a single tag (the first tag) with tag ID 0010. After decoding this tag, the reader's stacked tag IDs include {0011, 01, 1}. The reader backtracks from the response message of the single tag with ID 0010 to determine the response closest to that response message's time, and this response contains the response message of the tag with ID 0010. That is, when the reader broadcasts the prefix Request 001, it receives a response message including tag IDs 0010 and 0011 (the first interference response message). This response message includes two response messages sent by two tags. The two corresponding messages interfere or collide. Based on the response message corresponding to 0010, which does not have interference, the interference response message is canceled, thereby decoding the tag with ID 0011 (the tag corresponding to the first residual response message).

[0127] The reader traces back from the first interference response message with tag IDs 0010 and 0011 as a starting point to obtain the second interference response message, which is the closest response message before the response time of the first interference response message and contains the response messages of the two tags and the second residual response message. This second interference response message is sent by the tags with tag IDs 0001, 0010, and 0011. By performing interference cancellation on the second interference response message based on the first interference response message with tag IDs 0010 and 0011, the second residual response message can be obtained, thus completing the decoding of the tag corresponding to the second residual response message (the tag with ID 0001).

[0128] In this application, the backtracking function requires the reader to record the corresponding prefix and the response results of multiple tags when a non-single tag response occurs (i.e., a collision occurs); the starting point of each backtracking is when each prefix matches a single tag, and the end point is when the backtracking cannot decode a new tag ID, or there is no response available for backtracking (returning to the root node), or the responses have all been decoded into new tag IDs.

[0129] Figure 7 The tree structure shown has four backtracking rounds. The process of saving each data entry to a single tag and backtracking the results of previous collision responses is called a backtracking chain, and there are four backtracking chains in the diagram. Backtracking chains 1, 3, and 4 terminate when a new tag ID cannot be decoded, while backtracking chain 2 terminates when the response is fully decoded. The tree traversal order is root-left-right (DLR, similar to the preorder traversal of a binary tree).

[0130] The backtracking function requires tags to maintain coarse synchronization and have relatively consistent received power (which can be achieved through power control or path loss estimation compensation, etc.; if the distance is close enough, power control may not be necessary).

[0131] The principle of the backtracking function is as follows: Figure 8 As shown, after a certain inventory check, the reader records a response with multiple tags {10?0} and the prefix {1} at that time. Subsequently, the reader generates the prefix {101} and accepts the unique tag response with tag ID 1010. At this point, the reader traces back to the most recent multi-tag response {10?0} and, based on the response {1010}, performs interference cancellation to obtain a new residual response {1000}, which is the new tag ID. The figure shows a schematic of ASK / OOK.

[0132] The actual interference waveform is as follows: Figure 9 As shown, waveform 1 on the left is the waveform with interference, and waveform 2 on the left is the waveform when the unique tag responds. Based on waveform 2, interference cancellation is performed on waveform 1 to obtain waveform M1 on the right.

[0133] By leveraging the backtracking function of the backtracking tree to decode the tags corresponding to residual response messages, the number of reader broadcasts and tag collisions can be reduced, thereby improving inventory efficiency.

[0134] Optionally, the first message includes a first common prefix of the identity identifiers of the N tags, and the method further includes:

[0135] Among the N IDs corresponding to the N tags, obtain the number of preset values ​​that are located after the first common prefix and adjacent to the first common prefix, and obtain the relative size of the proportion of the number of each preset value to the total number of preset values;

[0136] The transmission priority of the second common prefix is ​​determined based on the relative size of the ratio, and the second common prefix includes the preset value;

[0137] The reader sends a second message to the N tags corresponding to the N response messages, including:

[0138] The reader sends a second message, including the second common prefix, to the N tags corresponding to the N response messages according to the sending priority.

[0139] The first message sent by the reader includes a first common prefix for N tag IDs. After sending the first common prefix, the reader receives response messages from the N tags whose IDs contain the first common prefix. Among the N IDs of the N tags, a preset value is obtained for each ID that is immediately following and adjacent to the first common prefix. Multiple IDs can obtain one or more preset values.

[0140] In one alternative implementation, the common prefixes corresponding to the preset values ​​with a larger proportion are pushed onto the stack first, i.e., they are sent with a higher priority; while the common prefixes corresponding to the preset values ​​with a smaller proportion are pushed onto the stack last, thus sending with a lower priority.

[0141] In one alternative implementation, the common prefixes corresponding to preset values ​​with a smaller proportion are pushed onto the stack first, i.e., they are sent with a higher priority; while the common prefixes corresponding to preset values ​​with a larger proportion are pushed onto the stack last, thus sending with a lower priority.

[0142] For example, in Figure 7In the tree structure shown, when the reader sends a message with a common prefix of 0 (request: 0), it receives response messages from four tags with IDs 0001, 0010, 0011, and 0100. The preset values ​​adjacent to 0 are obtained, including three 0s and one 1. Among these four preset values, the proportion of 0s is greater than the proportion of 1s. Based on the first common prefix and the aforementioned preset values, the second common prefix can be determined to be either 00 or 01. The transmission priority of 00 and 01 is determined based on the proportions of 0s and 1s.

[0143] When the reader sends the above prefix, the higher priority prefix is ​​sent first, and the lower priority prefix is ​​sent later.

[0144] Optionally, the preset value includes a first preset value and a second preset value, the second common prefix includes a first prefix and a second prefix, the first prefix includes the first preset value, and the second prefix includes the second preset value;

[0145] Determining the transmission priority of the second common prefix based on the relative size of the ratio includes:

[0146] If the proportion of the first preset value is greater than the proportion of the second preset value, then the transmission priority of the first prefix is ​​determined to be higher than the transmission priority of the second prefix; or,

[0147] If the proportion of the first preset value is greater than the proportion of the second preset value, the transmission priority of the first prefix is ​​determined to be lower than the transmission priority of the second prefix.

[0148] In one optional implementation, when the number of first preset values ​​is greater than the number of second preset values, that is, when the proportion of the first preset values ​​is greater than the proportion of the second preset values, the transmission priority of the first prefix is ​​higher than the transmission priority of the second prefix.

[0149] In another optional implementation, when the number of first preset values ​​is greater than the number of second preset values, that is, when the proportion of the first preset values ​​is greater than the proportion of the second preset values, the transmission priority of the first prefix is ​​lower than the transmission priority of the second prefix.

[0150] Optionally, determining that the transmission priority of the first prefix is ​​higher than the transmission priority of the second prefix when the proportion of the first preset value is greater than the proportion of the second preset value includes:

[0151] When the proportion of the first preset value is greater than the proportion of the second preset value, the first prefix and the second prefix are pushed onto the stack in descending order of the proportion, and the transmission priority of the first prefix is ​​determined to be higher than that of the second prefix according to the order in which they are pushed onto the stack.

[0152] The step of determining that the transmission priority of the first prefix is ​​lower than the transmission priority of the second prefix when the proportion of the first preset value is greater than the proportion of the second preset value includes:

[0153] If the proportion of the first preset value is greater than the proportion of the second preset value, the second prefix and the first prefix are pushed onto the stack in ascending order of the proportion, and the transmission priority of the first prefix is ​​determined to be lower than that of the second prefix according to the order in which they are pushed onto the stack.

[0154] The traversal efficiency of the collision tree varies depending on the order in which prefixes are pushed onto the stack. In this embodiment, the longest path first (LPF) and shortest path first (SPF) traversal methods can be used. The choice between LPF and SPF is determined by the number of '0's and '1's in the highest collision bit (the collision bit is the first undecoded bit, i.e., the first preset value after the prefix). The LPF algorithm always prioritizes entering the branch with the most '0's or '1's, while SPF always selects the branch with the fewest '0's or '1's. This traversal method offers greater flexibility because the selected branches are not fixed each time and there is no fixed order.

[0155] Examples of using the LPF traversal method are as follows: Figure 10 As shown, an example using the SPF algorithm is as follows: Figure 11 As shown.

[0156] according to Figure 10 and Figure 11 It can be seen that, generally speaking, LPF traversal backtracking is highly efficient, but it is slow in finding the first single label. SPF traversal, on the other hand, can find the first single label as quickly as possible, but its efficiency is slightly lower than that of the SPF algorithm.

[0157] When storing the same tags, the LPF algorithm uses fewer steps and is more efficient than the SPF algorithm. However, the LPF algorithm has a longer traversal chain, resulting in a larger stack memory footprint.

[0158] To obtain a more intuitive understanding of system efficiency, the system efficiency of a backtracking tree can be calculated using the following formula:

[0159]

[0160] By using the different traversal methods described above, the appropriate traversal method can be selected based on actual needs. When using the LPF algorithm, inventory efficiency can be improved.

[0161] Optionally, obtaining the relative size of the proportion of each preset value to the total number of preset values ​​includes:

[0162] Based on the level height of the falling edge of the waveform after the N response messages are superimposed, determine the relative size of the proportion of each preset value to the total number of preset values.

[0163] If PIE coding is used, the method for determining the quantity relationship between 0s and 1s in the collision bits can be based on the level height of the second falling edge in the superimposed waveform.

[0164] like Figure 12 As shown, there are three cases: A, B, and C.

[0165] In case A, the number of 0s and 1s is close, and there is no difference between the two traversal methods, LPF and SPF.

[0166] Case B: The number of 1s is significantly greater than the number of 0s. During LPF traversal, a 1-branch is chosen, that is, prefixes containing 1s are pushed onto the bottom of the stack first. During SPF traversal, a 0-branch is chosen, that is, prefixes containing 0s are pushed onto the bottom of the stack first.

[0167] Case C: The number of 0s is significantly greater than the number of 1s. During LPF traversal, the 0 branch is chosen, that is, prefixes containing 0s are pushed onto the bottom of the stack first. During SPF traversal, the 1 branch is chosen, that is, prefixes containing 1s are pushed onto the bottom of the stack first.

[0168] like Figure 13 As shown in the figure, this application also provides a Full Retraverse Tree (FRT). With the aid of interference cancellation, the response to prefix 0 (Request 0) can be obtained by using the response to the empty prefix (Request{}) and the response to prefix 1 through interference cancellation, thus further improving efficiency. The responses to prefix 00 and prefix 000 can also be achieved using a similar method. Furthermore, the recognition efficiency of FRT can reach a constant 1.

[0169] To verify the performance of this solution, a simulation was performed on the above solution, and the results are as follows: Figure 14 and Figure 15 As shown.

[0170] As shown in the figure, after using the tree-structured storage with backtracking functionality and LPF traversal proposed in this application, the efficiency can reach over 72%. When combined with some efficient hybrid storage methods, its storage efficiency can be further improved to over 95%, which is far superior to traditional algorithms such as slotted ALOHA and collision trees, as well as hybrid and improved algorithms of these two methods.

[0171] For traversal methods such as DRL, DLR, LPF, and SPF, the system efficiency of different traversal methods varies. It can be seen that LPF traversal has the highest system efficiency.

[0172] To facilitate understanding of this embodiment, specific examples are provided below.

[0173] The network elements involved in this embodiment include three types: a server (which stores tag data and the correspondence between tag data and readers, and interacts with readers), a reader (which can be a base station or a terminal, and interacts with the server and tags), and a tag (which has a single EPC identifier and storage capacity, and interacts with the reader). The reader can interact with the server to select tags for storage.

[0174] For label inventory methods, please refer to [link / reference]. Figure 16 As shown, all labels can be stored using the above method.

[0175] This application embodiment improves inventory efficiency by recording tag responses when two or more tags are stored each time. After storing a single tag, backtracking is performed, treating the single tag response as interference, and eliminating interference from the previous multi-tag response to obtain a residual response. This process allows for the possible decoding of new tag IDs based on the residual response. Furthermore, selecting the LPF or SPF traversal method during inventory can further improve inventory efficiency. The inventory method provided in this application embodiment has an efficiency of over 70%, higher than the 36.8% of slotted Aloha and the 50% of binary trees, demonstrating high efficiency. Combined with other enhancement schemes, it can achieve an efficiency of 95%.

[0176] The solution in this application embodiment can be used for massive tag inventory in Ambient IoT. Currently, such problems have not been standardized or specifically discussed. The related signaling is not applicable to massive tags in similar systems. It is simple to implement, has low requirements for tag complexity, does not require additional tag capabilities, and has very high efficiency.

[0177] The tag inventory method provided in this application can be executed by a tag inventory device. This application uses the tag inventory method as an example to illustrate the tag inventory device provided in this application.

[0178] See Figure 17 , Figure 17 This is a schematic diagram of the structure of a tag storage device provided in an embodiment of this application, as shown below. Figure 17 As shown, the tag storage device 1700 includes:

[0179] The first sending module 1701 is used to send the first message;

[0180] The second sending module 1702 is used to send a second message to the N tags corresponding to the N response messages when the reader receives N response messages of the first message and the N response messages collide. N is an integer greater than 1.

[0181] The backtracking module 1703 is used to backtrack the interfering response message that is closest in time to the first response message of the target tag among the N tags and includes the second response message of the target tag when the number of tags that return the response message corresponding to the second message is one, and to perform interference elimination on the interfering response message according to the first response message to obtain the residual response message. The target tag includes at least a first tag, the first tag is the tag that returns the response message corresponding to the second message, the first response message is the message that the target tag responds independently, and the second response message is the response message that contains interfering messages.

[0182] The inventory module 1704 is used to inventory the first tag and the tag corresponding to the residual response message.

[0183] Optionally, the backtracking module is specifically used for:

[0184] In the tree structure corresponding to the N response messages, starting from the first response message of the target tag, the interfering response messages that are closest to the response time of the first response message and include the second response message of the target tag are traced back. The interference of the interfering response messages is eliminated according to the first response message to obtain the residual response messages. The tracing stops when all the tags corresponding to the interfering response messages are decoded or cannot be decoded.

[0185] Optionally, the interference response message includes a first interference response message and a second interference response message;

[0186] The backtracking module includes:

[0187] The first backtracking submodule is used to backtrack the first interference response message that is closest to the first response message of the first tag and includes the second response message of the first tag in the tree structure corresponding to the N response messages, according to the response time of the tags from late to early. The interference of the first interference response message is eliminated based on the first response message of the first tag to obtain the first residual response message. The number of tags corresponding to the first interference response message is two.

[0188] The second backtracking submodule is used to backtrack from the first interference response message to the second interference response message that is closest in time to the first interference response message and includes the third response message, and to perform interference cancellation on the second interference response message according to the first interference response message to obtain the second residual response message, until the backtracking stops when all the tags corresponding to the second response message are decoded or cannot be decoded.

[0189] The third response message is a response message sent by the two tags corresponding to the first interference response message, and the third response message is a response message indicating the presence of interference.

[0190] Optionally, the first message includes a first common prefix of the identity identifiers of the N tags, and the device further includes:

[0191] The acquisition module is used to acquire, from the N IDs corresponding to the N tags, the number of preset values ​​located after the first common prefix and adjacent to the first common prefix, and to acquire the relative size of the proportion of the number of each preset value to the total number of preset values;

[0192] The determining module is used to determine the transmission priority of the second common prefix based on the relative size of the ratio, wherein the second common prefix includes the preset value;

[0193] The second sending module is specifically used for:

[0194] The reader sends a second message, including the second common prefix, to the N tags corresponding to the N response messages according to the sending priority.

[0195] Optionally, the preset value includes a first preset value and a second preset value, the second common prefix includes a first prefix and a second prefix, the first prefix includes the first preset value, and the second prefix includes the second preset value;

[0196] The determining module includes:

[0197] The first determining submodule is used to determine that the transmission priority of the first prefix is ​​higher than the transmission priority of the second prefix when the proportion of the first preset value is greater than the proportion of the second preset value; or,

[0198] The second determining submodule is used to determine that the transmission priority of the first prefix is ​​lower than the transmission priority of the second prefix when the proportion of the first preset value is greater than the proportion of the second preset value.

[0199] Optionally, the first determining submodule is specifically used for:

[0200] When the proportion of the first preset value is greater than the proportion of the second preset value, the first prefix and the second prefix are pushed onto the stack in descending order of the proportion, and the transmission priority of the first prefix is ​​determined to be higher than that of the second prefix according to the order in which they are pushed onto the stack.

[0201] The second determining submodule is specifically used for:

[0202] If the proportion of the first preset value is greater than the proportion of the second preset value, the second prefix and the first prefix are pushed onto the stack in ascending order of the proportion, and the transmission priority of the first prefix is ​​determined to be lower than that of the second prefix according to the order in which they are pushed onto the stack.

[0203] Optionally, the acquisition module is specifically used for:

[0204] Based on the level height of the falling edge of the waveform after the N response messages are superimposed, determine the relative size of the proportion of each preset value to the total number of preset values.

[0205] In the embodiments of this application, the tag storage device can be an electronic device, such as an electronic device with an operating system, or a component in an electronic device, such as an integrated circuit or a chip. For example, the electronic device can be a reader / writer or a terminal.

[0206] The label storage device in this embodiment of the application can achieve... Figure 4 The various processes implemented in the method embodiments can achieve the same technical effect, and will not be described again here to avoid repetition.

[0207] like Figure 18As shown, this application embodiment also provides an electronic device 1800, including: a processor 1801, a memory 1802, and a program stored in the memory 1802 and executable on the processor 1801. When the program is executed by the processor 1801, it implements the various processes of the above-described tag storage method embodiment and can achieve the same technical effect. To avoid repetition, it will not be described again here.

[0208] This application also provides a computer-readable storage medium storing a computer program. When executed by a processor, this computer program implements the various processes of the above-described tag storage method embodiments and achieves the same technical effects. To avoid repetition, it will not be described again here. The computer-readable storage medium may be a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, etc.

[0209] This application also provides a computer program product, including computer instructions, which, when executed by a processor, implement the above-described... Figure 4 The various processes of the method embodiments shown can achieve the same technical effect, and will not be described again here to avoid repetition.

[0210] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0211] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a terminal (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0212] The embodiments of this application have been described above with reference to the accompanying drawings. However, this application is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms under the guidance of this application without departing from the spirit and scope of the claims, and all of these forms are within the protection scope of this application.

Claims

1. A tag inventory method, characterized in that, include: The reader sends the first message; If the reader receives N response messages to the first message and the N response messages collide, the reader sends a second message to the N tags corresponding to the N response messages, where N is an integer greater than 1. When the number of tags returning the response message corresponding to the second message is one, the reader traces back to the interfering response message that is closest in time to the first response message of the target tag among the N tags and includes the second response message of the target tag, and performs interference cancellation on the interfering response message according to the first response message to obtain the residual response message. The target tag includes at least a first tag, the first tag is the tag that returns the response message corresponding to the second message, the first response message is the message that the target tag responds independently, and the second response message is the response message with interfering messages. The reader / writer stores the first tag and the tag corresponding to the residual response message.

2. The method according to claim 1, characterized in that, The reader traces back to the interfering response message that is closest in time to the first response message of the target tag among the N tags and includes the second response message of the target tag. It then performs interference cancellation on the interfering response message based on the first response message to obtain a residual response message, including: According to the response time of the tags from latest to earliest, the reader sequentially traces back the interfering response messages in the tree structure corresponding to the N response messages, starting from the first response message of the target tag, and including the second response message of the target tag, which is closest to the response time of the first response message. The reader then performs interference elimination on the interfering response messages based on the first response message to obtain the residual response messages, until all tags corresponding to the interfering response messages are decoded or cannot be decoded, at which point the backtracking stops.

3. The method according to claim 2, characterized in that, The interference response message includes a first interference response message and a second interference response message; The process involves, in ascending order of tag response times, the reader sequentially backtracks through the tree structure corresponding to the N response messages, starting with the first response message of the target tag, to the interfering response messages whose response times are closest to the first response message and which include the second response message of the target tag. Interference is then eliminated based on the first response message to obtain residual response messages. Backtracking stops when all tags corresponding to the interfering response messages are decoded or cannot be decoded. This process includes: According to the order of the tag response times from latest to earliest, the reader takes the first response message of the first tag as the starting point in the tree structure corresponding to the N response messages, traces back to the first interference response message that is closest in time to the first response message of the first tag and includes the second response message of the first tag, and performs interference elimination on the first interference response message based on the first response message of the first tag to obtain the first residual response message, wherein the number of tags corresponding to the first interference response message is two. Starting from the first interference response message, backtrack to the second interference response message that is closest in time to the first interference response message and includes the third response message. Then, based on the first interference response message, perform interference cancellation on the second interference response message to obtain the second residual response message. The backtracking stops when all tags corresponding to the second response message are decoded or cannot be decoded. The third response message is a response message sent by the two tags corresponding to the first interference response message, and the third response message is a response message indicating the presence of interference.

4. The method according to any one of claims 1 to 3, characterized in that, The first message includes a first common prefix of the identity identifiers of the N tags, and the method further includes: Among the N IDs corresponding to the N tags, obtain the number of preset values ​​that are located after the first common prefix and adjacent to the first common prefix, and obtain the relative size of the proportion of the number of each preset value to the total number of preset values; The transmission priority of the second common prefix is ​​determined based on the relative size of the ratio, and the second common prefix includes the preset value; The reader sends a second message to the N tags corresponding to the N response messages, including: The reader sends a second message, including the second common prefix, to the N tags corresponding to the N response messages according to the sending priority.

5. The method according to claim 4, characterized in that, The preset value includes a first preset value and a second preset value, and the second common prefix includes a first prefix and a second prefix, wherein the first prefix includes the first preset value and the second prefix includes the second preset value; Determining the transmission priority of the second common prefix based on the relative size of the ratio includes: If the proportion of the first preset value is greater than the proportion of the second preset value, the transmission priority of the first prefix is ​​determined to be higher than the transmission priority of the second prefix. or, If the proportion of the first preset value is greater than the proportion of the second preset value, the transmission priority of the first prefix is ​​determined to be lower than the transmission priority of the second prefix.

6. The method according to claim 5, characterized in that, The step of determining that the transmission priority of the first prefix is ​​higher than the transmission priority of the second prefix when the proportion of the first preset value is greater than the proportion of the second preset value includes: When the proportion of the first preset value is greater than the proportion of the second preset value, the first prefix and the second prefix are pushed onto the stack in descending order of the proportion, and the transmission priority of the first prefix is ​​determined to be higher than that of the second prefix according to the order in which they are pushed onto the stack. The step of determining that the transmission priority of the first prefix is ​​lower than the transmission priority of the second prefix when the proportion of the first preset value is greater than the proportion of the second preset value includes: If the proportion of the first preset value is greater than the proportion of the second preset value, the second prefix and the first prefix are pushed onto the stack in ascending order of the proportion, and the transmission priority of the first prefix is ​​determined to be lower than that of the second prefix according to the order in which they are pushed onto the stack.

7. The method according to claim 4, characterized in that, The step of obtaining the relative size of the proportion of each preset value in the preset values ​​to the total number of preset values ​​includes: Based on the level height of the falling edge of the waveform after the N response messages are superimposed, determine the relative size of the proportion of each preset value to the total number of preset values.

8. A label storage device, characterized in that, include: The first sending module is used to send the first message; The second sending module is used to send a second message to the N tags corresponding to the N response messages when the reader receives N response messages of the first message and the N response messages collide. N is an integer greater than 1. The backtracking module is used to backtrack the interfering response message that is closest in time to the first response message of the target tag among the N tags and includes the second response message of the target tag, when the number of tags that return the response message corresponding to the second message is one. The module then performs interference cancellation on the interfering response message based on the first response message to obtain the residual response message. The target tag includes at least a first tag, which is a tag that returns the response message corresponding to the second message. The first response message is a message that the target tag responds to independently, and the second response message is a response message that contains interfering messages. The inventory module is used to inventory the first tag and the tags corresponding to the residual response message.

9. An electronic device, characterized in that, include: A processor, a memory, and a program stored in the memory and executable on the processor, wherein the program, when executed by the processor, implements the steps of the tag inventory method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the steps of the tag inventory method as described in any one of claims 1 to 7.

11. A computer program product, characterized in that, It includes computer instructions that, when executed by a processor, implement the steps of the tag inventory method as described in any one of claims 1 to 7.

Images