WO2024078613A1 - 一种标签盘存方法、装置、节点和存储介质 - Google Patents

一种标签盘存方法、装置、节点和存储介质 Download PDF

Info

Publication number
WO2024078613A1
WO2024078613A1 PCT/CN2023/124485 CN2023124485W WO2024078613A1 WO 2024078613 A1 WO2024078613 A1 WO 2024078613A1 CN 2023124485 W CN2023124485 W CN 2023124485W WO 2024078613 A1 WO2024078613 A1 WO 2024078613A1
Authority
WO
WIPO (PCT)
Prior art keywords
tag
message
response
node
information
Prior art date
Application number
PCT/CN2023/124485
Other languages
English (en)
French (fr)
Inventor
刘康怡
刘亮
陈宁宇
柴丽
谢芳
Original Assignee
中国移动通信有限公司研究院
中国移动通信集团有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中国移动通信有限公司研究院, 中国移动通信集团有限公司 filed Critical 中国移动通信有限公司研究院
Publication of WO2024078613A1 publication Critical patent/WO2024078613A1/zh

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K17/00—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
    • G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation

Definitions

  • the present disclosure relates to the field of Internet of Things communication technology, and in particular to a tag inventory method, device, node and storage medium.
  • the inventory of tags in the Radio Frequency Identification (RFID) system is implemented by using the method of generating random numbers by tags.
  • This method is suitable for inventorying the overall number of tags in a certain area and finding the specific number of tags of a certain type, but it is not suitable for obtaining the specific location of tags or tracking tags.
  • the process overhead of the reader to find a specific tag in a wide area scenario is large.
  • tags with sensing or similar capabilities it is difficult to initiate communication when the tags need to report data.
  • the embodiments of the present disclosure provide a tag inventory method, device, node and storage medium.
  • an embodiment of the present disclosure provides a tag inventory method, comprising:
  • the node sends a first message, wherein the first message includes at least first identity information of the node; the first identity information is used by at least one tag to determine whether to respond to the first message;
  • the node receives a first response of a first tag to the first message, where the first response includes first identification information generated by the first tag; the first tag is any tag among the at least one tag that is determined to respond to the first message;
  • the node takes inventory of the first tag based on the first identification information.
  • the first message also includes at least one of the following: First response time information of a message start time and time length; first length information used to indicate the length or maximum length of first identification information generated by the tag; and a first timestamp used to indicate the sending time of the first message.
  • the method also includes: when the node determines that the first responses sent by at least some of the at least one tag collide, the node resends the first message; wherein the resent first message also includes a mask, and the mask is used to match the first tag of the resent first response; re-receive the first response of the first tag to the first message, and re-inventory the first tag based on the first identification information included in the first response.
  • the length of the mask is less than or equal to the maximum length of the first identification information.
  • the method also includes: when the node determines that the first responses sent by at least some of the at least one tag collide, the node resends the first message; wherein the resent first message includes second response time information, and the time length indicated by the second response time information is greater than the time length indicated by the first response time information; re-receive the first response of the first tag to the first message, and re-inventory the first tag based on the first identification information included in the first response.
  • the node takes inventory of the first tag based on the first identification information, including: the node sends a second message, the second message includes the first identification information; the node receives a second response of the first tag to the second message, and sends a first confirmation message to the first tag; the first confirmation message includes the second response; the node receives the coded information sent by the first tag.
  • the method before the node sends the second message, the method further includes: the node sends a third message, the third message includes the first identification information; the third message is used to indicate that the first tag is switched to the first state.
  • the method also includes: the node sends second confirmation information of the first response, the second confirmation information includes second length information for indicating the length or maximum length of the identification information; the second length information is used for the label to regenerate the first identification information.
  • the second confirmation information also includes third response time information, which is used to indicate the starting time and time length of the tag sending the regenerated first identification information.
  • an embodiment of the present disclosure provides a tag inventory method, including:
  • the tag receives a first message sent by a node, wherein the first message includes at least first identity information of the node;
  • the tag determines whether the first identity information matches the stored second identity information; if it is determined that the first identity information does not match the second identity information, sends a first response to the first message, the first response includes the first identification information generated by the tag; the first identification information is used for the node to take inventory.
  • the first message also includes at least one of the following: first response time information used to indicate the starting time and time length of the tag's response to the first message; first length information used to indicate the length or maximum length of the first identification information generated by the tag; and a first timestamp used to indicate the sending time of the first message.
  • the method after the tag receives the first message sent by the node, the method also includes: the tag sends the first response when it determines that the power signal strength is lower than the first threshold or the communication signal strength is lower than the second threshold; and/or the tag sends the first response when it determines that the time difference between the first timestamp and the stored second timestamp is greater than a third threshold.
  • the first message also includes a mask.
  • the method Before sending the first response to the first message, the method also includes: the tag determines whether the prefix bit of the first identification information matches the mask; when it is determined that the first identity information does not match the second identity information, sending the first response to the first message includes: when it is determined that the first identity information does not match the second identity information, and when it is determined that the prefix bit of the first identification information matches the mask, sending the first response.
  • the length of the mask is less than or equal to the maximum length of the first identification information.
  • the method also includes: the tag receives a second message sent by the node, the second message includes the first identification information; the tag sends a second response to the second message, and receives first confirmation information from the node to the second response; the first confirmation information includes the second response; the tag sends encoded information to the node.
  • the method before the tag receives the second message sent by the node, the method further includes: the tag receives a third message sent by the node; when it is determined that the identification information included in the third message matches the generated first identification information, the tag switches to the first state; the tag receives the second message sent by the node, including: the tag in the first state In a state of the first node, a second message sent by the node is received.
  • the method also includes: the tag receives second confirmation information of the node to the first response, the second confirmation information includes second length information for indicating the length or maximum length of the identification information; the first identification information is regenerated based on the second length information; the tag sends the regenerated first identification information.
  • the second confirmation information also includes third response time information, which is used to indicate the starting time and time length of the tag sending the regenerated first identification information.
  • the method further includes: the tag storing the first identity information and/or the first timestamp.
  • an embodiment of the present disclosure provides a label inventory device, which is applied to a node, and the device includes a first communication unit and a first processing unit; wherein the first communication unit is used to send a first message, and the first message includes at least first identity information of the node; the first identity information is used for at least one tag to determine whether to respond to the first message; and is also used to receive a first response of a first tag to the first message, and the first response includes first identification information generated by the first tag; the first tag is any tag among the at least one tag that is determined to respond to the first message; and the first processing unit is used to inventory the first tag based on the first identification information.
  • the first message also includes at least one of the following: first response time information used to indicate the starting time and time length of the tag's response to the first message; first length information used to indicate the length or maximum length of the first identification information generated by the tag; and a first timestamp used to indicate the sending time of the first message.
  • the first communication unit is also used to resend the first message when it is determined that the first responses sent by at least part of the at least one tag collide; wherein the resent first message also includes a mask, and the mask is used to match the first tag that resends the first response; and re-receive the first response of the first tag to the first message; the first processing unit is also used to re-inventory the first tag based on the first identification information included in the first response.
  • the length of the mask is less than or equal to the maximum length of the first identification information.
  • the first communication unit is also used to determine the at least one tag.
  • the first message is resent; wherein the resent first message includes second response time information, and the time length indicated by the second response time information is greater than the time length indicated by the first response time information; and the first response of the first tag to the first message is re-received; the first processing unit is also used to re-inventory the first tag based on the first identification information included in the first response.
  • the first communication unit is also used to send a second message, the second message includes the first identification information; and receive a second response of the first tag to the second message, and send a first confirmation message to the first tag; the first confirmation message includes the second response; and is also used to receive the encoded information sent by the first tag.
  • the first communication unit is further used to send a third message, and the third message includes the first identification information; the third message is used to instruct the first tag to switch to the first state.
  • the first communication unit is also used to send second confirmation information of the first response, and the second confirmation information includes second length information for indicating the length or maximum length of the identification information; the second length information is used for the tag to regenerate the first identification information.
  • the second confirmation information also includes third response time information, which is used to indicate the starting time and time length of the tag sending the regenerated first identification information.
  • an embodiment of the present disclosure provides a label inventory device, which is applied to a label, and the device includes a second communication unit and a second processing unit; wherein the second communication unit is used to receive a first message sent by a node, and the first message includes at least the first identity information of the node; the second processing unit is used to determine whether the first identity information matches the stored second identity information; the second communication unit is also used to send a first response to the first message when the second processing unit determines that the first identity information does not match the second identity information, and the first response includes the first identification information generated by the label; the first identification information is used for the node to perform inventory.
  • the first message also includes at least one of the following: first response time information used to indicate the starting time and time length of the tag's response to the first message; first length information used to indicate the length or maximum length of the first identification information generated by the tag; and a first timestamp used to indicate the sending time of the first message.
  • the second communication unit is also used to determine that the power supply signal strength is lower than the first threshold
  • the first response is sent when the value or communication signal strength is lower than a second threshold; and/or the second communication unit is also used to send the first response when it is determined that the time difference between the first timestamp and the stored second timestamp is greater than a third threshold.
  • the first message also includes a mask
  • the second processing unit is also used to determine whether the prefix bits of the first identification information match the mask
  • the second communication unit sends the first response when the second processing unit determines that the first identity information does not match the second identity information, and determines that the prefix bits of the first identification information match the mask.
  • the length of the mask is less than or equal to the maximum length of the first identification information.
  • the second communication unit is also used to receive a second message sent by the node, the second message includes the first identification information; and send a second response to the second message, receive first confirmation information of the node to the second response; the first confirmation information includes the second response; and is also used to send encoded information to the node.
  • the second communication unit is also used to receive a third message sent by the node; the second processing unit is also used to switch to the first state when it is determined that the identification information included in the third message matches the generated first identification information; the second communication unit is also used to receive the second message sent by the node when in the first state.
  • the second communication unit is also used to receive second confirmation information from the node to the first response, and the second confirmation information includes second length information for indicating the length or maximum length of the identification information; the second processing unit is also used to regenerate the first identification information based on the second length information; the second communication unit is also used to send the regenerated first identification information.
  • the second confirmation information also includes third response time information, which is used to indicate the starting time and time length of the tag sending the regenerated first identification information.
  • the second processing unit is further used to store the first identity information and/or the first timestamp.
  • an embodiment of the present disclosure provides a node, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the method described in the first aspect or the second aspect when executing the program.
  • an embodiment of the present disclosure provides a computer-readable storage medium storing A computer instruction, which, when executed by a processor, implements the steps of the method described in the first aspect or the second aspect.
  • the disclosed embodiments provide a tag inventory method, device, node and storage medium, wherein the node sends a first message including at least first identity information, so that at least one tag with a response requirement can send a first response and carry the generated first identification information in the first response.
  • the node can directly select a tag based on the first identification information, which is more efficient than the traditional random number method and at least ensures that tags that need to report data or whose locations have changed can notify the node through the first response, thereby enhancing the network's ability to track tags and the tags' ability to report data.
  • FIG1 is a schematic diagram of an inventory process between a reader and a tag in the related art
  • FIG2 is a flowchart of a tag inventory method according to an embodiment of the present disclosure
  • FIG. 3 is a schematic diagram of the relationship between a node sending a first message and a tag sending a first response according to an embodiment of the present disclosure
  • FIG4 is a schematic diagram of a mask included in a first message according to an embodiment of the present disclosure.
  • FIG. 5 is a schematic diagram of the relationship between the node sending the second confirmation information and the tag resending the first identification information according to an embodiment of the present disclosure
  • FIG6 is a second flow chart of the tag inventory method according to an embodiment of the present disclosure.
  • FIG. 7 is a flowchart of an application example of the tag inventory solution according to an embodiment of the present disclosure.
  • FIG8 is a second flow chart of an application example of the tag inventory solution according to an embodiment of the present disclosure.
  • FIG. 9 is a flowchart of an application example of the tag inventory solution according to an embodiment of the present disclosure.
  • FIG10 is a schematic diagram of the first structure of the label inventory device according to an embodiment of the present disclosure.
  • FIG11 is a second schematic diagram of the structure of the label inventory device according to an embodiment of the present disclosure.
  • FIG. 12 is a schematic diagram of the hardware structure of a node according to an embodiment of the present disclosure.
  • RFID systems are mainly composed of RFID tags, readers and background applications.
  • the background application is responsible for controlling the reader to issue commands and receiving the tag inventory results sent back by the reader.
  • the reader is responsible for inventorying tags.
  • the tag stores a unique identification code, which is generally an Electronic Product Code (EPC).
  • EPC Electronic Product Code
  • the reader and the tag communicate through backscattering, and the tag has a certain storage capacity and processing capacity.
  • Figure 1 is a schematic diagram of the inventory process between the reader and the tag in the related technology.
  • the reader takes inventory of the tag by sending commands such as Select, Query, QueryRep, QueryAdjust, and Acknowledge (ACK) to the tag.
  • commands such as Select, Query, QueryRep, QueryAdjust, and Acknowledge (ACK) to the tag.
  • ACK Acknowledge
  • the Select command is responsible for selecting a specific tag in the tag family; the Query command is used to generate a random number for the selected tag; the QueryRep and QueryAdjust commands respectively reduce the random number and modulate the size of the random number; finally, when the random number becomes zero, the tag sends a new random number RN16 for identification to the reader; the reader replies ACK and the RN16 of the corresponding tag, and the tag sends its own EPC after receiving the ACK and its own RN16. The reader then transmits the EPC back to the background application or sends a handle for further communication. Generally, when the tag sends its own EPC to the reader, it is considered that an inventory is completed.
  • FIG2 is a flowchart of the tag inventory method of the present disclosure embodiment. As shown in FIG1, the method includes:
  • Step 101 A node sends a first message, where the first message includes at least first identity information of the node; the first identity information is used by at least one tag to determine whether to respond to the first message;
  • Step 102 The node receives a first response of a first tag to the first message, where the first response includes first identification information generated by the first tag; the first tag is any tag among the at least one tag that is determined to respond to the first message;
  • Step 103 The node takes inventory of the first tag based on the first identification information.
  • the node has at least the function of a reader/writer or an energy supplier, and can be a reader/writer, or an energy supplier associated with a reader/writer, or a device having both energy supply and reading/writing functions, etc.
  • the first identity information is the identity information of the reader/writer associated with the energy supplier.
  • the first message is an inventory signaling.
  • the node broadcasts its own first identity information based on the first message, and the first identity information is the identity identification information of the node.
  • Information (Identity, ID) is used to uniquely identify the node.
  • Each of the at least one tag can store the first identity information included in the received first message.
  • the tag After receiving the first message, the tag can determine whether to respond to the first message according to the first identity information, for example, respond to the first message when it is determined that the first identity information does not match the stored identity information, or respond to the first message when the tag has a sending requirement.
  • the first identification information is a temporary identification generated by the first tag.
  • the any tag when it is determined to respond to the first message, the any tag sends a first response to the first message. If no collision occurs, the node can receive the first response and obtain the first identification information generated by the any tag from the first response. It should be noted that the first identification information is not used to uniquely identify the first tag.
  • the node can notify the part of the tags to regenerate the first identification information by sending the first message again or sending confirmation information of the first response.
  • the first response also includes the first identity information, so that the node determines that the first response is a response to the first message.
  • the node takes inventory of the first tag based on the first identification information included in the first response.
  • the node may send a selection command including the first identification information, for example, using the first identification information in a Select command to select the first tag for inventory; or, after receiving the first response sent by multiple tags, the node may send a reply signaling, wherein the reply signaling includes the first identification information corresponding to the tag, which is used to instruct the tag to send a complete EPC code.
  • the tag may detect whether the identification information carried therein is consistent with the first identification information generated by itself, and send its own EPC code if the identification information is consistent, thereby implementing an inventory of the tag.
  • both reader 1 and 2 can broadcast their own unique identity (i.e., first identity information), such as reader ID, through a first message.
  • first identity information such as reader ID
  • the tag is located within the coverage of reader 1 and can receive a first message sent by reader 1, which carries the first reader ID of reader 1.
  • the tag stores the first reader ID and can send a first response to the first message, which carries a temporarily generated first identification information and the first reader ID.
  • reader 1 can determine that the tag is located within its coverage. range, and can take inventory of the tags based on the first identification information; thereafter, when the tag receives the first message again, it can determine whether the reader ID carried in the received first message matches the first reader ID stored previously.
  • the tag can determine whether to respond to the received first message based on whether it has the need to report data. Thus, if the tag can always successfully match the reader ID, it can be determined that the tag has always been within the coverage range of reader 1. However, if in a certain inventory process, the first message received by the tag carries the second reader ID of reader 2, the tag will not be able to successfully match the second reader ID with the first reader ID stored previously. At this time, the position of the tag changes, that is, the tag is within the coverage range of reader 2. The tag sends a first response to the first message, which carries the temporarily generated first identification information and the second reader ID. After receiving the first response, reader 2 can determine that the tag is within its own coverage range and take inventory of the tag based on the received first identification information.
  • the node sends a first message including at least first identity information, so that at least one tag with a response requirement can send a first response and carry the generated first identification information in the first response.
  • the node can directly select the tag based on the first identification information, which is more efficient than the traditional random number method and at least ensures that the tag that needs to report data or location changes can notify the node through the first response, thereby enhancing the network's ability to track tags and the tag's ability to report data.
  • the method may further include: the node sending the inventory result of the at least one tag to the server.
  • the node may report the inventory result to the server, and the server may store the information of all tags locally according to the movement of the tags and the status of the nodes to which the tags are connected, and sense the changes of the tags and update them in real time, so that when the node queries the tags, it only needs to access the local storage of the server, which can greatly reduce the inventory load of the node.
  • the first message may also include at least one of the following: first response time information for indicating the starting time and time length of the tag's response to the first message; first length information for indicating the length or maximum length of the first identification information generated by the tag; and a first timestamp for indicating the sending time of the first message.
  • the first response time information indicates the tag reply time window, which may include a tag reply time start point and a tag reply time window length.
  • the tag reply time start point is used to ensure that the tag can complete charging and enable its internal circuit.
  • the tag reply time window length is used to indicate that the tag is allowed to reply within the length of the time window. It may be related to the number of tags within the node coverage (communication) range. The tags covered by the node The more, the longer the tag reply time window should be to reduce the probability of tag collision.
  • the first length information indicates the length or maximum length of the first identification information generated by the tag to ensure that the first identification information generated by at least one tag is different, and to prevent the tag from colliding when responding to the first message, the first length information should be shortened as much as possible.
  • the first timestamp can be used by the tag to determine the time difference between multiple first messages received, and can further be used by the tag to determine whether to respond to the first message.
  • the first message may carry the first response time information, the first length information, and the first timestamp in the form of system information (System Information, SI).
  • Figure 3 is a schematic diagram of the relationship between the node sending the first message and the tag sending the first response in an embodiment of the present disclosure.
  • the first message may include a header (Header), first identity information (Reader ID) and first system information (SI), and the first system information may include the tag response time starting point (Tdelay) and the tag response time window length (Tag Response Window).
  • Tdelay tag response time starting point
  • Tag Response Window tag response time window length
  • Any tag in the at least one tag that is determined to respond to the first message sends a corresponding first response within the tag response time window indicated by the first system information, which carries the generated first identification information (the ID of each tag in Figure 3).
  • the disclosed embodiment also provides a label inventory method, and this embodiment is aimed at the situation where the label response collides.
  • the node can directly inventory the labels based on the first identification information, and for labels that collide, such as label 1 and label 2, and label 5 and label 6 shown in Figure 3, after step 103, the node can perform anti-collision processing on these colliding labels.
  • the method may also include: step 104a, when the node determines that the first responses sent by at least some of the at least one tag collide, the node resends the first message; wherein the resent first message also includes a mask, and the mask is used to match the first tag of the resent first response; re-receiving the first response of the first tag to the first message, and re-inventorying the first tag based on the first identification information included in the first response.
  • the node may resend the first message, and a mask may be added to the resent first message to match the first label of the resent first response.
  • the node may repeatedly perform step 104a to complete the inventory of all labels in the at least one label. It is worth noting that in the process of repeatedly performing step 104a, the first message includes
  • the masks are different, for example, they may be different values and/or different lengths.
  • the resent first message includes at least one bit mask, and the at least one bit mask is used for the first label in the at least one label whose corresponding first identification information prefix bit matches the at least one bit mask to resend the first response.
  • the node may carry at least one bit mask in the first message, and the label may prefix match its own first identification information with the at least one bit mask after receiving the first message, and only the label whose first identification information matches the mask may send the first response in this competition reply.
  • the node may change the value and/or length of the mask included therein when sending the first message next time until all label replies are free of collision.
  • the length of the mask is less than or equal to the maximum length of the first identification information.
  • FIG. 4 is a schematic diagram of a mask included in a first message according to an embodiment of the present disclosure.
  • the maximum length of the first identification information is 4 bits.
  • the node may send first messages carrying masks of "0" and "1" in sequence, as shown in FIG4 .
  • the node receives each first response corresponding to the first message with a mask of "0"
  • no collision occurs, and the label with the first digit of the first identification information being "0" may be inventoried.
  • the node receives multiple first responses corresponding to the first message with a mask of "1”
  • a collision occurs, and a second round of contention reply is required.
  • the node resends the first message, and the resent first message may include masks of "10" and "11" in sequence.
  • the node receives each first response corresponding to the first message with a mask of "11"
  • no collision occurs, and the label with the first digits of the first identification information being "11" may be inventoried.
  • the node receives each first response corresponding to the first message with a mask of "10”
  • the mask included in the first message sent by the node in FIG4 can traverse all labels corresponding to the first identification information.
  • the method may also include: step 104b, when the node determines that the first responses sent by at least some of the at least one tag collide, the node resends the first message; wherein the resent first message includes second response time information, and the time length indicated by the second response time information is greater than the time length indicated by the first response time information; re-receiving the first response of the first tag to the first message, and re-inventorying the first tag based on the first identification information included in the first response.
  • the node may resend the first message, and the resent first message includes the second response time information, wherein the time length indicated by the second response time information is greater than the time length indicated by the first response time information included in the first message previously sent by the node.
  • the node may repeat step 104b to complete the inventory of all labels in the at least one label.
  • the first message is resent, wherein the resent first message may include third response time information, and the time length indicated by the third response time information is less than or equal to the first response time information.
  • the node can start a new round of broadcasting (i.e., sending the first message).
  • the length of the time window indicated by the first message in the new round of inventory can be determined based on whether a collision occurred last time. If a collision occurs, the time window indicated by the first message is lengthened, otherwise it is shortened or remains unchanged.
  • the collision probability of tag replies is reduced by inventorying non-colliding tags each time and controlling the length of the time window until all tags are inventoryed.
  • the node takes inventory of the first tag based on the first identification information, which may include: the node sends a second message, the second message includes the first identification information; the node receives a second response of the first tag to the second message, and sends a first confirmation message to the first tag; the first confirmation message includes the second response; the node receives the coded information sent by the first tag.
  • the second message may be a query command, such as a Query command; the second response may be a random number sent by the tag, such as a random number with a length of 16 bits (RN16);
  • the first confirmation message may be, for example, an ACK command;
  • the coded information may be, for example, the EPC code of the tag.
  • the method may further include: the node sends a third message, the third message includes the first identification information; and the third message is used to indicate that the first tag is switched to the first state.
  • the third message may be a selection command, such as a Select command.
  • the node may send a Select command, which may carry the first identification information included in the first response.
  • the tag finds that the identification information carried in the Select command is consistent with the first identification information generated by itself, the tag enters the ready-to-reply state.
  • the node may send a Query command, which may carry the first identification information.
  • the tag receives the first identification information including itself, After receiving the Query command, the tag sends RN16 to the node. After receiving it, the node sends an ACK command and carries RN16 in the ACK command.
  • the tag receives the ACK command that is consistent with the RN16 generated by itself, the tag sends the EPC code to the node to complete the inventory.
  • the method may further include: the node sends a second confirmation message of the first response, the second confirmation message includes second length information for indicating the length or maximum length of the identification information; the second length information is used for the label to regenerate the first identification information.
  • the second confirmation message also includes the first identification information.
  • Figure 5 is a schematic diagram of the relationship between the node sending the second confirmation information and the tag resending the first identification information in the embodiment of the present disclosure.
  • the node may send a second confirmation message of the first response, and the second confirmation message may, for example, be a response-type command, such as a reply command, and carry second length information in the second confirmation message to indicate that the tag regenerates the first identification information with a length or a maximum length of the second length information, wherein the value of the second length information may be determined according to the number of tags with the same first identification information.
  • the second confirmation information also includes third response time information, which is used to indicate the starting time and time length of the tag sending the regenerated first identification information. It should be noted that if a collision also occurs when the tag sends the regenerated first identification information, as shown in Figure 5, the node can solve the collision problem according to step 104a or step 104b.
  • FIG6 is a second flow chart of the tag inventory method of the present disclosure embodiment. As shown in FIG6 , the method includes:
  • Step 201 A tag receives a first message sent by a node, where the first message includes at least first identity information of the node;
  • Step 202 The tag determines whether the first identity information matches the stored second identity information; if it is determined that the first identity information does not match the second identity information, a first response to the first message is sent, the first response including the first identification information generated by the tag; the first identification information is used for inventory of the node.
  • the tag is a tag that has been fully charged.
  • the second identity information may be the identity of the node included in the first message previously received by the tag.
  • the method may further include: after the inventory is completed, the tag stores the first identity information, or the tag modifies the stored second identity information into the first identity information.
  • the tag can store the identity information (i.e., the second identity information) of the reader/writer carried by the reader/writer or charger from which the tag received the command the last time in the non-volatile memory.
  • the tag can determine whether it is still within the coverage of the reader/writer that received the command before by matching the first identity information carried in the new command with the stored second identity information, that is, the tag can determine whether its position has changed, and send a first response carrying the temporarily generated first identification information when it determines that there is no match (position change); on the other hand, after receiving a command carrying the identity information of the reader/writer, even if the identity information carried therein matches the stored identity information, if the tag determines that it has the need to send data, it can also send the first response.
  • this embodiment only requires the tag to store the identity information of the reader/writer from which the tag received the command the last time in the non-volatile memory, and the reader/writer broadcasts its own identity information, and no other hardware upgrades are required for the reader/writer and the tag.
  • the tag receives a first message including the first identity information of the node.
  • the tag may send a first response to the node, which carries the generated first identification information, so that the node performs an inventory based on the first identification information.
  • the first message may also include at least one of the following: first response time information for indicating the starting time and time length of the tag's response to the first message; first length information for indicating the length or maximum length of the first identification information generated by the tag; and a first timestamp for indicating the sending time of the first message.
  • the method may also include: the tag sends the first response when it determines that the power signal strength is lower than the first threshold or the communication signal strength is lower than the second threshold; and/or the tag sends the first response when it determines that the time difference between the first timestamp and the stored second timestamp is greater than a third threshold.
  • the tag since the tag cannot predict whether it will leave the coverage area of the node, in this embodiment, when the tag measures that the power supply signal strength is lower than the first threshold or the communication signal strength is lower than the second threshold, even if the second identity information stored in the tag matches the first identity information included in the currently received first message, the tag sends the first response of the first message to the node to start the inventory process.
  • the tag can also store the time of the first message responded to in the previous inventory process (i.e., the first timestamp in the first message).
  • the tag also sends the first response of the first message to the node to start the inventory process.
  • the time when the node does not receive the first response sent by a certain tag exceeds the fourth threshold, the data information about the tag can also be deleted.
  • the first message also includes a mask.
  • the method may further include: the tag determines whether the prefix bits of the first identification information match the mask; when it is determined that the first identity information does not match the second identity information, sending the first response to the first message may include: when it is determined that the first identity information does not match the second identity information, and when it is determined that the prefix bits of the first identification information match the mask, sending the first response.
  • This embodiment is aimed at the case where the first response previously sent by the tag collides.
  • the node cannot complete the inventory of the tag due to the collision, so the identity information stored in the tag is still the identity information of the node in the previous inventory process.
  • the node can resend the first message in this inventory process, and the resent first message includes a mask.
  • the tag After receiving the resent first message, the tag still needs to determine whether the first identity information included in the first message matches the stored second identity information, and on the other hand, it also needs to determine whether the prefix bit of the first identification information generated by itself matches the mask in the first message. If it is determined that both match, the first response is sent.
  • the length of the mask is less than or equal to the maximum length of the first identification information.
  • the method may also include: the tag receives a second message sent by the node, the second message includes the first identification information; the tag sends a second response to the second message, and receives first confirmation information from the node to the second response; the first confirmation information includes the second response; and the tag sends encoded information to the node.
  • the method further includes: The tag receives a third message sent by the node; when it is determined that the identification information included in the third message matches the generated first identification information, the tag switches to the first state; the tag receives a second message sent by the node, which may include: the tag receives the second message sent by the node when it is in the first state.
  • the method may also include: the tag receives second confirmation information from the node to the first response, the second confirmation information includes second length information for indicating the length or maximum length of the identification information; regenerates the first identification information based on the second length information; and the tag sends the regenerated first identification information.
  • the second confirmation information also includes third response time information, which is used to indicate the starting time and time length for the tag to send the regenerated first identification information.
  • the method may further include: the tag storing the first identity information and/or the first timestamp.
  • the tag stores the first identity information and/or the first timestamp; or, the tag modifies the stored second identity information to the first identity information, and/or modifies the stored second timestamp to the first timestamp.
  • FIG7 is a flowchart of an application example of the tag inventory solution of the embodiment of the present disclosure.
  • the node is a reader.
  • a round of inventory process includes: the reader broadcasts a first message, which carries its own reader ID (first identity information); after receiving the first message, the tag determines whether the reader ID is consistent with the previously stored reader ID (second identity information).
  • the tag multiple
  • the tag ID first identification information
  • the tag sends a first response, which carries the reader ID in the first message and the tag ID generated by itself;
  • the reader detects whether the tag reply has a collision, and collects the tag IDs that have not collided; the collected tag IDs are used to inventory the non-colliding tags one by one, and the reader ID stored in the tags whose inventory has been completed is modified until the reader determines that all tags that have not collided have been inventoried; in the case of collision in the tag reply, the reader increases the mask length in the first message broadcast next time, and repeats the above process until all tag replies have no collision, completing a round of inventory process for multiple tags.
  • FIG8 is a second flow chart of an application example of the tag inventory solution of an embodiment of the present disclosure.
  • the node is a reader.
  • a round of inventory process includes: the reader broadcasts a first message, which carries its own reader ID (first identity information); after receiving the first message, the tag determines whether the reader ID is consistent with the previously stored reader ID (second identity information).
  • tags send a first response, which carries the reader ID in the first message and the tag ID generated by itself; the reader detects whether the tag reply has a collision, and collects the tag IDs that have not collided; the collected tag IDs are used to inventory the non-colliding tags one by one, and the reader ID stored in the tags that have been inventoried is modified until the reader determines that all tags that have not collided have been inventoried; the reader updates the time window length in the first message broadcast next time according to whether the tag reply has a collision, and repeats the above process until all tag replies have no collision, completing a round of inventory process for multiple tags.
  • FIG9 is a third flowchart of an application example of the tag inventory solution of an embodiment of the present disclosure.
  • the node is an energy supplier or a reader/writer, and the energy supplier is associated with the reader/writer.
  • a round of inventory process includes: the energy supplier broadcasts a first message, which carries the associated reader ID (first identity information); after receiving the first message, the tag determines whether the reader ID in the first message is consistent with the previously stored reader ID (second identity information).
  • the (multiple) tags send a first response, which carries the reader ID in the first message and the tag ID (first identification information) generated by itself; the energy supplier detects whether the tag replies that there is no collision, and if there is no collision, notifies the reader of all the tag IDs and collision conditions that have not collided; the reader uses the tag ID provided by the energy supplier to inventory the non-colliding tags one by one, and modifies the reader ID stored in the inventoryed tags until the reader determines that all non-colliding tags have been inventoried; for the tags that have collided, if the energy supplier can still detect the collision, the response time window length is updated in the first message broadcast next time according to the collision situation, and the above process is repeated until all tags reply that there is no collision, and a round of inventory process for multiple tags is completed.
  • This example combines an energy supplier with receiving capability to assist the reader in taking inventory. With the assistance of the energy supplier, the reader only needs to take inventory according to the first identification information provided by the energy supplier, which can greatly reduce the load on the reader.
  • FIG10 is a schematic diagram of the composition structure of the label inventory device of the present disclosure.
  • the label inventory device 300 includes a first communication unit 301 and a first processing unit 302;
  • the first communication unit 301 is used to send a first message, the first message at least including The first identity information of the node; the first identity information is used by at least one tag to determine whether to respond to the first message; and is also used to receive a first response of the first tag to the first message, the first response including the first identification information generated by the first tag; the first tag is any tag among the at least one tag that is determined to respond to the first message;
  • the first processing unit 302 is configured to perform an inventory of the first tags based on the first identification information.
  • the first message also includes at least one of the following: first response time information for indicating the starting time and time length of the tag's response to the first message; first length information for indicating the length or maximum length of the first identification information generated by the tag; and a first timestamp for indicating the sending time of the first message.
  • the first communication unit 301 is also used to resend the first message when it is determined that the first responses sent by at least part of the at least one tag collide; wherein the resent first message also includes a mask, and the mask is used to match the first tag that resends the first response; and re-receive the first response of the first tag to the first message; the first processing unit 302 is also used to re-inventory the first tag based on the first identification information included in the first response.
  • the length of the mask is less than or equal to the maximum length of the first identification information.
  • the first communication unit 301 is also used to resend the first message when it is determined that the first responses sent by at least part of the at least one tag collide; wherein the resent first message includes second response time information, and the time length indicated by the second response time information is greater than the time length indicated by the first response time information; and re-receive the first response of the first tag to the first message; the first processing unit 302 is also used to re-inventory the first tag based on the first identification information included in the first response.
  • the first communication unit 301 is also used to send a second message, the second message includes the first identification information; and receive a second response of the first tag to the second message, and send a first confirmation message to the first tag; the first confirmation message includes the second response; and is also used to receive the encoded information sent by the first tag.
  • the first communication unit 301 is further used to send a third message, where the third message includes the first identification information; and the third message is used to instruct the first tag to switch to the first state.
  • the first communication unit 301 is further used to send second confirmation information of the first response, and the second confirmation information includes second length information for indicating the length or maximum length of the identification information; the second length information is used for the tag to regenerate the first identification information.
  • the second confirmation information further includes third response time information, which is used to indicate the starting time point and time length for the tag to send the regenerated first identification information.
  • the first communication unit 301 in the device 300 can be implemented by a communication module (including: a basic communication suite, an operating system, a communication module, a standardized interface and protocol, etc.) and a transceiver antenna in practical applications;
  • the first processing unit 302 in the device 300 can be implemented by a central processing unit (CPU), a digital signal processor (DSP), a microcontroller unit (MCU) or a programmable gate array (FPGA) in the device 300 in practical applications.
  • CPU central processing unit
  • DSP digital signal processor
  • MCU microcontroller unit
  • FPGA programmable gate array
  • FIG11 is a second schematic diagram of the structure of the tag inventory device of the present disclosure.
  • the tag inventory device 400 includes a second communication unit 401 and a second processing unit 402;
  • the second communication unit 401 is configured to receive a first message sent by a node, where the first message includes at least first identity information of the node;
  • the second processing unit 402 is used to determine whether the first identity information matches the stored second identity information
  • the second communication unit 401 is further used to send a first response to the first message when the second processing unit determines that the first identity information does not match the second identity information, and the first response includes first identification information generated by the label; the first identification information is used for the node to take inventory.
  • the first message further includes at least one of the following: first response time information for indicating the time starting point and time length of the tag's response to the first message; First length information indicating the length or maximum length of the first identification information generated by the tag; and a first timestamp used to indicate the sending time of the first message.
  • the second communication unit 401 is also used to send the first response when it is determined that the power supply signal strength is lower than the first threshold or the communication signal strength is lower than the second threshold; and/or the second communication unit 401 is also used to send the first response when it is determined that the time difference between the first timestamp and the stored second timestamp is greater than a third threshold.
  • the first message also includes a mask
  • the second processing unit 402 is further used to determine whether the prefix bits of the first identification information match the mask
  • the second communication unit 401 sends the first response when the second processing unit determines that the first identity information does not match the second identity information, and determines that the prefix bits of the first identification information match the mask.
  • the length of the mask is less than or equal to the maximum length of the first identification information.
  • the second communication unit 401 is also used to receive a second message sent by the node, the second message including the first identification information; and send a second response to the second message, receive first confirmation information of the node to the second response; the first confirmation information includes the second response; and is also used to send encoded information to the node.
  • the second communication unit 401 is also used to receive a third message sent by the node; the second processing unit 402 is also used to switch to the first state when it is determined that the identification information included in the third message matches the generated first identification information; the second communication unit 401 is also used to receive the second message sent by the node when in the first state.
  • the second communication unit 401 is also used to receive second confirmation information of the node to the first response, the second confirmation information including second length information for indicating the length or maximum length of the identification information; the second processing unit 402 is also used to regenerate the first identification information based on the second length information; the second communication unit 401 is also used to send the regenerated first identification information.
  • the second confirmation information further includes third response time information, which is used to indicate the starting time point and time length for the tag to send the regenerated first identification information.
  • the second processing unit 402 is further configured to store the first identity information and/or the first timestamp.
  • the second communication unit 401 in the device 400 can be implemented by a communication module (including: basic communication kit, operating system, communication module, standardized interface and protocol, etc.) and a transceiver antenna in actual applications;
  • the second processing unit 402 in the device 400 can be implemented by the CPU, DSP, MCU or FPGA in the device 400 in actual applications.
  • the label inventory device provided in the above embodiment only uses the division of the above program modules as an example when performing label inventory.
  • the above processing can be assigned to different program modules as needed, that is, the internal structure of the device is divided into different program modules to complete all or part of the above-described processing.
  • the label inventory device provided in the above embodiment and the label inventory method embodiment belong to the same concept, and the specific implementation process is detailed in the method embodiment, which will not be repeated here.
  • FIG12 is a schematic diagram of the hardware structure of a node of an embodiment of the present disclosure, and the node 500 may be a reader/writer, an energy supply or a tag.
  • the node 500 shown in FIG12 includes: at least one processor 501, a memory 502 and at least one network interface 503.
  • the various components in the node 500 are coupled together through a bus system 504. It is understandable that the bus system 504 is used to realize the connection and communication between these components.
  • the bus system 504 also includes a power bus, a control bus and a status signal bus. However, for the sake of clarity, various buses are marked as bus systems 504 in FIG12.
  • the memory 502 can be a volatile memory or a non-volatile memory, and can also include both volatile and non-volatile memories.
  • the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a magnetic random access memory (FRAM), a flash memory, a magnetic surface memory, an optical disk, or a compact disc read-only memory (CD-ROM); the magnetic surface memory can be a disk memory or a tape memory.
  • the volatile memory can be a random access memory (RAM), which is used as an external cache.
  • RAM random access memory
  • RAM random access memory
  • many forms of RAM are available, such as static random
  • the memory 502 described in the embodiments of the present disclosure is intended to include, but is not limited to, these and any other suitable types of memory.
  • the memory 502 in the embodiment of the present disclosure is used to store various types of data to support the operation of the node 500.
  • Examples of such data include: any computer program used to operate on the node 500, such as a program for implementing the methods of various embodiments of the present disclosure.
  • the method disclosed in the above embodiment of the present disclosure can be applied to the processor 501, or implemented by the processor 501.
  • the processor 501 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit in the processor 501 or the instruction in the form of software.
  • the above processor 501 can be a general processor, a digital signal processor (Digital Signal Processor, DSP), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • the processor 501 can implement or execute the disclosed methods, steps and logic block diagrams in the embodiment of the present disclosure.
  • the general processor can be a microprocessor or any conventional processor, etc.
  • the steps of the method disclosed in the embodiment of the present disclosure can be directly embodied as a hardware decoding processor to execute, or a combination of hardware and software modules in the decoding processor to execute.
  • the software module can be located in a storage medium, which is located in the memory 502.
  • the processor 501 reads the information in the memory 502 and completes the steps of the above methods in combination with its hardware.
  • the node 500 may be implemented by one or more application specific integrated circuits (ASICs), DSPs, programmable logic devices (PLDs), complex programmable logic devices (CPLDs), field programmable gate arrays (FPGAs), or other devices.
  • ASICs application specific integrated circuits
  • DSPs digital signal processors
  • PLDs programmable logic devices
  • CPLDs complex programmable logic devices
  • FPGAs field programmable gate arrays
  • Gate Array, FPGA general processor, controller, microcontroller (Micro Controller Unit, MCU), microprocessor (Microprocessor), or other electronic components are implemented to execute the above method.
  • the present disclosure also provides a computer-readable storage medium, such as a memory 502 including a computer program, which can be executed by a processor 501 of a node 500 to complete the steps described in the aforementioned methods.
  • the computer-readable storage medium can be a memory such as FRAM, ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface memory, optical disk, or CD-ROM; or it can be various devices including one or any combination of the above memories, such as a mobile phone, a computer, a tablet device, a personal digital assistant, etc.
  • the disclosed devices and methods can be implemented in other ways.
  • the device embodiments described above are only schematic.
  • the division of the units is only a logical function division.
  • the coupling, direct coupling, or communication connection between the components shown or discussed can be through some interfaces, and the indirect coupling or communication connection of the devices or units can be electrical, mechanical or other forms.
  • the units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units; some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.
  • all functional units in the embodiments of the present disclosure may be integrated into one processing unit, or each unit may be separately used as a unit, or two or more units may be integrated into one unit; the above-mentioned integrated units may be implemented in the form of hardware or in the form of a processor. It is implemented in the form of hardware plus software functional units.
  • the integrated unit of the present disclosure is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium.
  • the technical solution of the embodiment of the present disclosure can essentially or in other words, the part that contributes to the relevant technology can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the methods described in each embodiment of the present disclosure.
  • the aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, ROM, RAM, magnetic disks or optical disks.

Landscapes

  • Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Electromagnetism (AREA)
  • General Health & Medical Sciences (AREA)
  • Toxicology (AREA)
  • Artificial Intelligence (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

一种标签盘存方法、装置、节点和存储介质，方法包括：节点发送第一消息，第一消息至少包括节点的第一身份信息；第一身份信息用于至少一个标签确定是否响应第一消息；节点接收第一标签对第一消息的第一响应，第一响应包括第一标签生成的第一标识信息；第一标签为至少一个标签中、确定响应第一消息的任一标签；节点基于第一标识信息对第一标签进行盘存。

Description

一种标签盘存方法、装置、节点和存储介质
相关申请的交叉引用
本申请主张在2022年10月13日在中国提交的中国专利申请号No.202211258089.2的优先权，其全部内容通过引用包含于此。
技术领域
本公开涉及物联网通信技术领域，尤其涉及一种标签盘存方法、装置、节点和存储介质。
背景技术
目前，射频识别(Radio Frequency Identification，RFID)系统中对标签的盘存利用标签生成随机数的方法实现，适合盘存某一区域内标签的整体数量，以及查找某一类标签的具体数量，但不适合获取标签的具体位置或跟踪标签，且读写器在广域场景下查找某个特定标签的流程开销较大。同时，对于具有传感或类似能力的标签，标签需要上报数据时难以发起通信。
发明内容
为解决相关技术中存在的技术问题，本公开实施例提供一种标签盘存方法、装置、节点和存储介质。
为达到上述目的，本公开实施例的技术方案是这样实现的：
第一方面，本公开实施例提供一种标签盘存方法，包括：
节点发送第一消息，所述第一消息至少包括所述节点的第一身份信息；所述第一身份信息用于至少一个标签确定是否响应所述第一消息；
所述节点接收第一标签对所述第一消息的第一响应，所述第一响应包括所述第一标签生成的第一标识信息；所述第一标签为所述至少一个标签中、确定响应所述第一消息的任一标签；
所述节点基于所述第一标识信息对所述第一标签进行盘存。
上述方案中，所述第一消息还包括以下至少之一：用于指示标签响应第 一消息的时间起点和时间长度的第一响应时间信息；用于指示标签生成的第一标识信息的长度或最大长度的第一长度信息；用于指示第一消息的发送时间的第一时间戳。
上述方案中，所述方法还包括：所述节点在确定所述至少一个标签中的至少部分标签各自发送的第一响应发生碰撞的情况下，重新发送所述第一消息；其中，重新发送的所述第一消息中还包括掩码，所述掩码用于匹配重新发送第一响应的第一标签；重新接收第一标签对所述第一消息的第一响应，以及重新基于所述第一响应中包括的第一标识信息对所述第一标签进行盘存。
上述方案中，所述掩码的长度小于或等于所述第一标识信息的最大长度。
上述方案中，所述方法还包括：所述节点在确定所述至少一个标签中的至少部分标签各自发送的第一响应发生碰撞的情况下，重新发送所述第一消息；其中，重新发送的所述第一消息中包括第二响应时间信息，所述第二响应时间信息指示的时间长度大于所述第一响应时间信息指示的时间长度；重新接收第一标签对所述第一消息的第一响应，以及重新基于所述第一响应中包括的第一标识信息对所述第一标签进行盘存。
上述方案中，所述节点基于所述第一标识信息对所述第一标签进行盘存，包括：所述节点发送第二消息，所述第二消息包括所述第一标识信息；所述节点接收所述第一标签对所述第二消息的第二响应，以及向所述第一标签发送第一确认信息；所述第一确认信息包括所述第二响应；所述节点接收所述第一标签发送的编码信息。
上述方案中，所述节点发送第二消息之前，所述方法还包括：所述节点发送第三消息，所述第三消息包括所述第一标识信息；所述第三消息用于指示所述第一标签切换为第一状态。
上述方案中，所述方法还包括：所述节点发送所述第一响应的第二确认信息，所述第二确认信息包括用于指示标识信息的长度或最大长度的第二长度信息；所述第二长度信息用于标签重新生成所述第一标识信息。
上述方案中，所述第二确认信息还包括第三响应时间信息，用于指示标签发送重新生成的第一标识信息的时间起点和时间长度。
第二方面，本公开实施例提供了一种标签盘存方法，包括：
标签接收节点发送的第一消息，所述第一消息至少包括所述节点的第一身份信息；
所述标签判断所述第一身份信息与存储的第二身份信息是否匹配；在确定所述第一身份信息与所述第二身份信息不匹配的情况下，发送所述第一消息的第一响应，所述第一响应包括所述标签生成的第一标识信息；所述第一标识信息用于所述节点进行盘存。
上述方案中，所述第一消息还包括以下至少之一：用于指示标签响应第一消息的时间起点和时间长度的第一响应时间信息；用于指示标签生成的第一标识信息的长度或最大长度的第一长度信息；用于指示第一消息的发送时间的第一时间戳。
上述方案中，所述标签接收节点发送的第一消息之后，所述方法还包括：所述标签在确定供能信号强度低于第一阈值或者通信信号强度低于第二阈值的情况下，发送所述第一响应；和/或，所述标签在确定所述第一时间戳与存储的第二时间戳的时间差大于第三阈值的情况下，发送所述第一响应。
上述方案中，所述第一消息还包括掩码，所述发送所述第一消息的第一响应之前，所述方法还包括：所述标签判断所述第一标识信息的前缀位与所述掩码是否匹配；所述在确定所述第一身份信息与所述第二身份信息不匹配的情况下，发送第一消息的第一响应，包括：在确定所述第一身份信息与所述第二身份信息不匹配、且确定所述第一标识信息的前缀位与所述掩码匹配的情况下，发送所述第一响应。
上述方案中，所述掩码的长度小于或等于所述第一标识信息的最大长度。
上述方案中，所述方法还包括：所述标签接收所述节点发送的第二消息，所述第二消息包括所述第一标识信息；所述标签发送所述第二消息的第二响应，以及接收所述节点对所述第二响应的第一确认信息；所述第一确认信息包括所述第二响应；所述标签向所述节点发送编码信息。
上述方案中，所述标签接收所述节点发送的第二消息之前，所述方法还包括：所述标签接收所述节点发送的第三消息；在确定所述第三消息包括的标识信息与生成的所述第一标识信息匹配一致的情况下，所述标签切换为第一状态；所述标签接收所述节点发送的第二消息，包括：所述标签在处于第 一状态的情况下，接收所述节点发送的第二消息。
上述方案中，所述方法还包括：所述标签接收所述节点对所述第一响应的第二确认信息，所述第二确认信息包括用于指示标识信息的长度或最大长度的第二长度信息；基于所述第二长度信息重新生成所述第一标识信息；所述标签发送重新生成的所述第一标识信息。
上述方案中，所述第二确认信息还包括第三响应时间信息，用于指示标签发送重新生成的第一标识信息的时间起点和时间长度。
上述方案中，所述方法还包括：所述标签存储所述第一身份信息和/或所述第一时间戳。
第三方面，本公开实施例提供了一种标签盘存装置，所述装置应用于节点，所述装置包括第一通信单元和第一处理单元；其中，所述第一通信单元，用于发送第一消息，所述第一消息至少包括所述节点的第一身份信息；所述第一身份信息用于至少一个标签确定是否响应所述第一消息；还用于接收第一标签对所述第一消息的第一响应，所述第一响应包括所述第一标签生成的第一标识信息；所述第一标签为所述至少一个标签中、确定响应所述第一消息的任一标签；所述第一处理单元，用于基于所述第一标识信息对所述第一标签进行盘存。
上述方案中，所述第一消息还包括以下至少之一：用于指示标签响应第一消息的时间起点和时间长度的第一响应时间信息；用于指示标签生成的第一标识信息的长度或最大长度的第一长度信息；用于指示第一消息的发送时间的第一时间戳。
上述方案中，所述第一通信单元还用于在确定所述至少一个标签中的至少部分标签各自发送的第一响应发生碰撞的情况下，重新发送所述第一消息；其中，重新发送的所述第一消息中还包括掩码，所述掩码用于匹配重新发送第一响应的第一标签；以及，重新接收第一标签对所述第一消息的第一响应；所述第一处理单元还用于重新基于所述第一响应中包括的第一标识信息对所述第一标签进行盘存。
上述方案中，所述掩码的长度小于或等于所述第一标识信息的最大长度。
上述方案中，所述第一通信单元还用于在确定所述至少一个标签中的至 少部分标签各自发送的第一响应发生碰撞的情况下，重新发送所述第一消息；其中，重新发送的所述第一消息中包括第二响应时间信息，所述第二响应时间信息指示的时间长度大于所述第一响应时间信息指示的时间长度；以及，重新接收第一标签对所述第一消息的第一响应；所述第一处理单元还用于重新基于所述第一响应中包括的第一标识信息对所述第一标签进行盘存。
上述方案中，所述第一通信单元还用于发送第二消息，所述第二消息包括所述第一标识信息；以及接收所述第一标签对所述第二消息的第二响应，向所述第一标签发送第一确认信息；所述第一确认信息包括所述第二响应；还用于接收所述第一标签发送的编码信息。
上述方案中，所述第一通信单元还用于发送第三消息，所述第三消息包括所述第一标识信息；所述第三消息用于指示所述第一标签切换为第一状态。
上述方案中，所述第一通信单元还用于发送所述第一响应的第二确认信息，所述第二确认信息包括用于指示标识信息的长度或最大长度的第二长度信息；所述第二长度信息用于标签重新生成所述第一标识信息。
上述方案中，所述第二确认信息还包括第三响应时间信息，用于指示标签发送重新生成的第一标识信息的时间起点和时间长度。
第四方面，本公开实施例提供了一种标签盘存装置，所述装置应用于标签，所述装置包括第二通信单元和第二处理单元；其中，所述第二通信单元，用于接收节点发送的第一消息，所述第一消息至少包括所述节点的第一身份信息；所述第二处理单元，用于判断所述第一身份信息与存储的第二身份信息是否匹配；所述第二通信单元，还用于在所述第二处理单元确定所述第一身份信息与所述第二身份信息不匹配的情况下，发送所述第一消息的第一响应，所述第一响应包括所述标签生成的第一标识信息；所述第一标识信息用于所述节点进行盘存。
上述方案中，所述第一消息还包括以下至少之一：用于指示标签响应第一消息的时间起点和时间长度的第一响应时间信息；用于指示标签生成的第一标识信息的长度或最大长度的第一长度信息；用于指示第一消息的发送时间的第一时间戳。
上述方案中，所述第二通信单元还用于在确定供能信号强度低于第一阈 值或者通信信号强度低于第二阈值的情况下，发送所述第一响应；和/或，所述第二通信单元还用于在确定所述第一时间戳与存储的第二时间戳的时间差大于第三阈值的情况下，发送所述第一响应。
上述方案中，所述第一消息还包括掩码，所述第二处理单元还用于判断所述第一标识信息的前缀位与所述掩码是否匹配；所述第二通信单元在所述第二处理单元确定所述第一身份信息与所述第二身份信息不匹配、且确定所述第一标识信息的前缀位与所述掩码匹配的情况下，发送所述第一响应。
上述方案中，所述掩码的长度小于或等于所述第一标识信息的最大长度。
上述方案中，所述第二通信单元还用于接收所述节点发送的第二消息，所述第二消息包括所述第一标识信息；以及发送所述第二消息的第二响应，接收所述节点对所述第二响应的第一确认信息；所述第一确认信息包括所述第二响应；还用于向所述节点发送编码信息。
上述方案中，所述第二通信单元还用于接收所述节点发送的第三消息；所述第二处理单元还用于在确定所述第三消息包括的标识信息与生成的所述第一标识信息匹配一致的情况下，切换为第一状态；所述第二通信单元还用于在处于第一状态的情况下，接收所述节点发送的第二消息。
上述方案中，所述第二通信单元还用于接收所述节点对所述第一响应的第二确认信息，所述第二确认信息包括用于指示标识信息的长度或最大长度的第二长度信息；所述第二处理单元还用于基于所述第二长度信息重新生成所述第一标识信息；所述第二通信单元还用于发送重新生成的所述第一标识信息。
上述方案中，所述第二确认信息还包括第三响应时间信息，用于指示标签发送重新生成的第一标识信息的时间起点和时间长度。
上述方案中，所述第二处理单元还用于存储所述第一身份信息和/或所述第一时间戳。
第五方面，本公开实施例提供了一种节点，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述程序时实现前述第一方面或第二方面所述方法的步骤。
第六方面，本公开实施例提供了一种计算机可读存储介质，其上存储有 计算机指令，该指令被处理器执行时实现前述第一方面或第二方面所述方法的步骤。
本公开实施例提供了一种标签盘存方法、装置、节点和存储介质，节点发送至少包括第一身份信息的第一消息，使得具有响应需求的至少一个标签可发送第一响应，并在所述第一响应中携带生成的第一标识信息，节点可基于第一标识信息直接选中标签，相比传统的随机数方法盘存效率更高，且至少保证需要上报数据或位置发生变化的标签可通过所述第一响应通知节点，增强了网络追踪标签的能力和标签上报数据的能力。
附图说明
图1为相关技术中读写器与标签之间的盘存流程示意图；
图2为本公开实施例的标签盘存方法的流程示意图一；
图3为本公开实施例的节点发送第一消息与标签发送第一响应之间的关系示意图；
图4为本公开实施例的第一消息中包括的掩码的示意图；
图5为本公开实施例的节点发送第二确认信息与标签重新发送第一标识信息之间的关系示意图；
图6为本公开实施例的标签盘存方法的流程示意图二；
图7为本公开实施例的标签盘存方案的应用示例流程图一；
图8为本公开实施例的标签盘存方案的应用示例流程图二；
图9本公开实施例的标签盘存方案的应用示例流程图三；
图10为本公开实施例的标签盘存装置的组成结构示意图一；
图11为本公开实施例的标签盘存装置的组成结构示意图二；
图12为本公开实施例的节点的硬件结构示意图。
具体实施方式
下面结合附图及具体实施例对本公开作进一步详细的说明。在对本公开实施例的标签盘存方案进行详细说明之前，首先对相关技术中的标签盘存流程进行简要说明。
传统的射频识别系统主要由射频标签、读写器和后台应用组成。其中，后台应用负责控制读写器下发命令和接收读写器发回的标签盘存结果，读写器负责盘存标签，标签中存储着唯一识别编码，一般是电子产品编码(Electronic Product Code，EPC)。读写器和标签通过反向散射通信，标签具有一定的存储能力和处理能力。
图1为相关技术中读写器与标签之间的盘存流程示意图。如图1所示，读写器通过对标签发送选择(Select)、查询(Query)、查询回复(QueryRep)、查询调节(QueryAdjust)、确认(Acknowledge，ACK)等命令对标签进行盘存。其中，Select命令负责选取标签族中的特定标签；Query命令用于让选中的标签生成随机数；QueryRep和QueryAdjust命令分别让随机数自减和调制随机数大小；最终当随机数变为零时，标签发送一个新的用于标识的随机数RN16给读写器；读写器回复ACK和对应标签的RN16，标签收到ACK和自己的RN16后发送自己的EPC，读写器再将EPC传回后台应用或发送句柄(handle)进行进一步的通信。一般当标签发送自己的EPC给读写器，就认为是完成了一次盘存。
本公开实施例提供一种标签盘存方法。图2为本公开实施例的标签盘存方法的流程示意图一，如图1所示，所述方法包括：
步骤101、节点发送第一消息，所述第一消息至少包括所述节点的第一身份信息；所述第一身份信息用于至少一个标签确定是否响应所述第一消息；
步骤102、所述节点接收第一标签对所述第一消息的第一响应，所述第一响应包括所述第一标签生成的第一标识信息；所述第一标签为所述至少一个标签中、确定响应所述第一消息的任一标签；
步骤103、所述节点基于所述第一标识信息对所述第一标签进行盘存。
本实施例中，所述节点至少具备读写器或供能器的功能，可以是读写器，也可以是与读写器关联的供能器，或者还可以是同时具备供能和读写功能的设备等。其中，在所述节点为供能器的情况下，所述第一身份信息为所述供能器关联的读写器的身份信息。
可选的，所述第一消息为盘存类信令。步骤101中，节点基于所述第一消息广播自身的第一身份信息，所述第一身份信息为所述节点的身份标识信 息(Identity，ID)，用于唯一标识所述节点。所述至少一个标签中各个标签可以存储收到的第一消息中包括的第一身份信息，标签在收到所述第一消息后可根据所述第一身份信息确定是否响应所述第一消息，例如在确定所述第一身份信息与存储的身份信息不匹配的情况下响应所述第一消息，或者标签有发送需求时也可响应所述第一消息。
所述第一标识信息为第一标签生成的临时标识。步骤102中，对于所述至少一个标签中的任一标签，在确定响应所述第一消息的情况下，所述任一标签发送第一消息的第一响应，在未发生碰撞的情况下节点可接收所述第一响应，并从所述第一响应中获得所述任一标签生成的所述第一标识信息。需要说明的是，所述第一标识信息并不用于唯一标识所述第一标签，可选的，在所述至少一个标签中的部分标签对应相同的第一标识信息的情况下，节点可通过再次发送所述第一消息或发送所述第一响应的确认信息，来通知该部分标签重新生成第一标识信息。
可选的，所述第一响应中还包括所述第一身份信息，以使节点确定所述第一响应是对所述第一消息的响应。
步骤103中，节点基于所述第一响应中包括的第一标识信息对所述第一标签进行盘存。示例性的，节点可发送包括所述第一标识信息的选择类命令，例如在Select命令中使用所述第一标识信息选择所述第一标签进行盘存；或者，节点在收到多个标签发送的第一响应后，可发送回复信令，所述回复信令中包括标签对应的第一标识信息，用于指示标签发送完整的EPC码，标签在接收到所述回复信令后可检测其中携带的标识信息与自身生成的第一标识信息是否一致，并在检测一致的情况下发送自身的EPC码，由此实现对标签的盘存。
以覆盖不同区域的读写器1和读写器2为例，读写器1和2均可通过第一消息广播自身的唯一身份标识(即第一身份信息)，例如读写器ID，初始时标签位于读写器1的覆盖范围内，可接收到读写器1发送的第一消息，其中携带读写器1的第一读写器ID，标签存储所述第一读写器ID，并可发送对该第一消息的第一响应，其中携带临时生成的第一标识信息，还可携带所述第一读写器ID，而读写器1在接收到第一响应后可确定标签位于自身的覆盖 范围内，并可基于该第一标识信息对标签进行盘存；此后，标签再次接收到第一消息时，可判断接收到的第一消息中携带的读写器ID是否与之前存储的第一读写器ID匹配，在匹配的情况下标签可基于自身是否具有上报数据的需求来确定是否响应接收到的第一消息，由此，若标签始终能够成功匹配读写器ID，则可确定标签一直处于读写器1的覆盖范围内，而若在某次盘存流程中，标签收到的第一消息中携带读写器2的第二读写器ID，标签将无法成功匹配该第二读写器ID与先前存储的第一读写器ID，此时标签位置发生变化，即标签位于读写器2的覆盖范围内，标签发送对该第一消息的第一响应，其中携带临时生成的第一标识信息，同时还可携带所述第二读写器ID，读写器2接收到该第一响应后可确定标签位于自身的覆盖范围内，并基于接收到的第一标识信息对标签进行盘存。
本实施例中，节点发送至少包括第一身份信息的第一消息，使得具有响应需求的至少一个标签可发送第一响应，并在所述第一响应中携带生成的第一标识信息，节点可基于第一标识信息直接选中标签，相比传统的随机数方法盘存效率更高，且至少保证需要上报数据或位置发生变化的标签可通过所述第一响应通知节点，增强了网络追踪标签的能力和标签上报数据的能力。
可选的，所述方法还可以包括：所述节点向服务器发送所述至少一个标签的盘存结果。本实施例中，节点可将盘存结果上报至服务器，服务器可以根据标签的移动情况和标签连接到的节点的状况，将所有标签的信息存储在本地，并感知标签的变化实时更新，这样节点查询标签时只需访问服务器本地存储即可，可大大降低节点的盘存负荷。
在本公开的一种可选实施例中，所述第一消息还可以包括以下至少之一：用于指示标签响应第一消息的时间起点和时间长度的第一响应时间信息；用于指示标签生成的第一标识信息的长度或最大长度的第一长度信息；用于指示第一消息的发送时间的第一时间戳。
其中，所述第一响应时间信息指示标签回复时间窗，可以包括标签回复时间起点和标签回复时间窗长，所述标签回复时间起点用于保证标签能完成充能启用其内部电路，标签回复时间窗长用于指示标签在时间窗的长度内才允许回复，可与节点覆盖(通信)范围内的标签数量有关，节点覆盖的标签 越多，所述标签回复时间窗长应当越长，以降低标签碰撞概率。所述第一长度信息指示标签生成的第一标识信息的长度或者最大长度，以尽量确保至少一个标签各自生成的第一标识信息不同，且为防止标签响应第一消息发生碰撞，所述第一长度信息应尽可能缩短。所述第一时间戳可用于标签确定收到的多个第一消息之间的时间差，进一步可用于标签确定是否响应第一消息。
可选的，所述第一消息可采用系统信息(System Information，SI)的形式携带所述第一响应时间信息、所述第一长度信息、所述第一时间戳。图3为本公开实施例的节点发送第一消息与标签发送第一响应之间的关系示意图，如图3所示，所述第一消息可包括标头(Header)、第一身份信息(Reader ID)和第一系统信息(SI)，所述第一系统信息可包括标签回复时间起点(Tdelay)和标签回复时间窗长(Tag Response Window)。所述至少一个标签中确定响应第一消息的任一标签在所述第一系统信息指示的标签回复时间窗内发送对应的第一响应，其中携带生成的第一标识信息(图3中各标签的ID)。
基于前述步骤101至步骤103所述，本公开实施例还提供一种标签盘存方法，本实施例针对标签响应发生碰撞的情况。对于未发生碰撞的标签，如图3所示的标签0、标签3、标签4和标签7等，节点可直接基于第一标识信息对标签进行盘存，而对于发生碰撞的标签，如图3所示的标签1和标签2，以及标签5和标签6等，在步骤103之后，节点可针对这些发生碰撞的标签进行防碰撞处理。
作为一种可选的实施方式，所述方法还可以包括：步骤104a、所述节点在确定所述至少一个标签中的至少部分标签各自发送的第一响应发生碰撞的情况下，重新发送所述第一消息；其中，重新发送的所述第一消息中还包括掩码，所述掩码用于匹配重新发送第一响应的第一标签；重新接收第一标签对所述第一消息的第一响应，以及重新基于所述第一响应中包括的第一标识信息对所述第一标签进行盘存。
本实施例中，在盘存完未碰撞的标签后，节点可重新发送第一消息，重新发送的第一消息中可增加掩码，用于匹配重新发送第一响应的第一标签。所述节点可重复执行步骤104a，以完成对所述至少一个标签中所有标签的盘存。值得注意的是，在重复执行所述步骤104a的过程中，第一消息中包括的 掩码不同，例如可以是不同数值和/或不同长度。
可选的，重新发送的所述第一消息中包括至少一位掩码，所述至少一位掩码用于所述至少一个标签中、对应的第一标识信息的前缀位与所述至少一位掩码匹配的第一标签重新发送第一响应。例如，节点可在第一消息中携带至少一位掩码，标签在收到所述第一消息后可将自身的第一标识信息与所述至少一位掩码进行前缀匹配，只有第一标识信息与掩码匹配的标签才可在本次竞争回复中发送第一响应。可选的，在重新接收的第一响应仍然发生碰撞的情况下，节点可在下次发送第一消息时改变其中包括的掩码的数值和/或长度，直到所有标签回复均未发生碰撞。
在一实施例中，所述掩码的长度小于或等于所述第一标识信息的最大长度。
图4为本公开实施例的第一消息中包括的掩码的示意图，图4中第一标识信息的最大长度为4个比特位(bit)。在第一轮竞争回复中，节点可依次发送携带掩码为“0”和“1”的第一消息，如图4所示，节点在接收掩码为“0”的第一消息对应的各个第一响应时未发生碰撞，可对第一标识信息第一位为“0”的标签进行盘存；节点在接收掩码为“1”的第一消息对应的多个第一响应时发生碰撞，则需进行第二轮竞争回复，节点重新发送第一消息，重新发送的第一消息可依次包括“10”和“11”的掩码，其中，节点在接收到掩码为“11”的第一消息对应的各个第一响应时未发生碰撞，可对第一标识信息前两位为“11”的标签进行盘存；节点在接收掩码为“10”的第一消息对应的对个第一响应时仍发生碰撞，则继续进行第三轮竞争回复；以此类推，知道所有标签回复均未发生碰撞，例如图4中节点发送的第一消息中包括的掩码可遍历完所有第一标识信息对应的标签。
作为另一种可选的实施方式，所述方法还可以包括：步骤104b、所述节点在确定所述至少一个标签中的至少部分标签各自发送的第一响应发生碰撞的情况下，重新发送所述第一消息；其中，重新发送的所述第一消息中包括第二响应时间信息，所述第二响应时间信息指示的时间长度大于所述第一响应时间信息指示的时间长度；重新接收第一标签对所述第一消息的第一响应，以及重新基于所述第一响应中包括的第一标识信息对所述第一标签进行盘存。
本实施例中，在盘存完未碰撞的标签后，节点可重新发送第一消息，重新发送的第一消息中包括第二响应时间信息，其中，所述第二响应时间信息所指示的时间长度大于节点在先发送的第一消息中包括的第一响应时间信息所指示的时间长度。同样地，所述节点可重复执行步骤104b，以完成对所述至少一个标签中所有标签的盘存。
在一实施例中，步骤103之后，若节点确定所述至少一个标签各自发送的第一响应均未发生碰撞，重新发送第一消息，其中，重新发送的所述第一消息中可包括第三响应时间信息，所述第三响应时间信息所指示的时间长度小于或等于所述第一响应时间信息。也就是说，节点盘存完未碰撞标签后可开启新一轮的广播(即发送第一消息)，新一轮盘存中第一消息所指示的时间窗的长短可根据上一次是否发生碰撞确定，如发生碰撞则第一消息指示的时间窗加长，反之缩短或不变；通过每次盘存未碰撞的标签并控制时间窗长度来降低标签回复的碰撞概率，直到盘存完全部标签为止。
在本公开的一种可选实施例中，所述节点基于所述第一标识信息对所述第一标签进行盘存，可以包括：所述节点发送第二消息，所述第二消息包括所述第一标识信息；所述节点接收所述第一标签对所述第二消息的第二响应，以及向所述第一标签发送第一确认信息；所述第一确认信息包括所述第二响应；所述节点接收所述第一标签发送的编码信息。示例性的，所述第二消息可以是查询类命令，例如可以是Query命令；所述第二响应可以是标签发送的随机数，例如可以是长度为16bit的随机数(RN16)；所述第一确认信息例如可以是ACK命令；所述编码信息例如可以是标签的EPC码。
可选的，所述节点发送第二消息之前，所述方法还可以包括：所述节点发送第三消息，所述第三消息包括所述第一标识信息；所述第三消息用于指示所述第一标签切换为第一状态。
示例性的，所述第三消息可以是选择类命令，例如可以是Select命令。具体地，节点可发送Select命令，Select命令中可携带第一响应中包括的第一标识信息，当标签在Select命令中发现其中携带的标识信息与自身生成的第一标识信息一致时，标签进入准备回复状态。随后，节点可发送Query命令，Query命令中可携带所述第一标识信息，当标签收到包括自身的第一标识信 息的Query命令后，发送RN16至节点，节点收到后发送ACK命令，并在ACK命令中携带RN16。当标签收到与自身生成的RN16一致的ACK命令后，标签发送EPC码至节点，完成本次盘存。
作为一种可选的实施方式，所述方法还可以包括：所述节点发送所述第一响应的第二确认信息，所述第二确认信息包括用于指示标识信息的长度或最大长度的第二长度信息；所述第二长度信息用于标签重新生成所述第一标识信息。可选的，所述第二确认信息中还包括所述第一标识信息。
本实施例针对所述至少一个标签中多个标签生成相同的第一标识信息的情况，图5为本公开实施例的节点发送第二确认信息与标签重新发送第一标识信息之间的关系示意图，如图5所示，当节点检测到相同的多个未发生碰撞的第一响应中包括相同的第一标识信息时，节点可发送所述第一响应的第二确认信息，所述第二确认信息例如可以是应答类命令，例如回复(Response)命令，并在所述第二确认信息中携带第二长度信息，以指示标签重新生成长度或最大长度为第二长度信息的第一标识信息，其中，所述第二长度信息的取值可根据第一标识信息相同的标签数量确定。
可选的，所述第二确认信息还包括第三响应时间信息，用于指示标签发送重新生成的第一标识信息的时间起点和时间长度。需要说明的是，若标签发送重新生成的第一标识信息时也发生碰撞，如图5所示，节点可按照步骤104a或步骤104b解决碰撞问题。
本公开实施例还提供一种标签盘存方法，应用于标签中。图6为本公开实施例的标签盘存方法的流程示意图二，如图6所示，所述方法包括：
步骤201、标签接收节点发送的第一消息，所述第一消息至少包括所述节点的第一身份信息；
步骤202、所述标签判断所述第一身份信息与存储的第二身份信息是否匹配；在确定所述第一身份信息与所述第二身份信息不匹配的情况下，发送所述第一消息的第一响应，所述第一响应包括所述标签生成的第一标识信息；所述第一标识信息用于所述节点进行盘存。
可选的，所述标签为充能完成的标签。
所述第二身份信息可以是标签在先接收的第一消息中包括的节点的身份 信息。作为一种示例，所述方法还可以包括：在盘存完成后，所述标签存储所述第一身份信息，或者，所述标签将存储的第二身份信息修改为所述第一身份信息。
也就是说，标签可在非易失性存储器上存储标签最近一次接收到命令的读写器或充能器中、所携带的读写器的身份信息(即第二身份信息)。一方面，标签在接收到新的命令(即第一消息)后，可通过匹配新的命令中所携带的第一身份信息与存储的第二身份信息，来判断自身是否仍处于之前接收到命令的读写器的覆盖范围内，即标签可判断自身是否发生位置变化，在确定不匹配(位置发生变化)的情况下发送第一响应，其中携带临时生成的第一标识信息；另一方面，标签在接收携带读写器的身份信息的命令后，即使其中携带的身份信息与存储的身份信息匹配，若标签确定自身有发送数据的需求，也可发送所述第一响应。可以理解，本实施例相较于传统的Select-Query查询方法，仅需标签在非易失性存储器上存储标签最近一次接收到命令的读写器的身份信息，而读写器广播自身的身份信息，除此之外不需要对读写器和标签做其他任何硬件上的升级。
本实施例中，标签接收包括节点的第一身份信息的第一消息，在标签确定第一身份信息与存储的第二身份信息不匹配时，可向节点发送第一响应，其中携带生成的第一标识信息，以使节点基于所述第一标识信息进行盘存，增强了网络侧对标签位置变化的管理能力，提高了广域场景下标签盘存流程效率，且不需对标签增加额外功能即可完全兼容现有盘存流程或设备。
在本公开的一种可选实施例中，所述第一消息还可以包括以下至少之一：用于指示标签响应第一消息的时间起点和时间长度的第一响应时间信息；用于指示标签生成的第一标识信息的长度或最大长度的第一长度信息；用于指示第一消息的发送时间的第一时间戳。
作为一种可选的实施方式，所述标签接收节点发送的第一消息之后，所述方法还可以包括：所述标签在确定供能信号强度低于第一阈值或者通信信号强度低于第二阈值的情况下，发送所述第一响应；和/或，所述标签在确定所述第一时间戳与存储的第二时间戳的时间差大于第三阈值的情况下，发送所述第一响应。
由于标签不可预知自身是否会离开节点的覆盖区域，故本实施例中当标签测量到供能信号强度低于第一阈值或者通信信号强度低于第二阈值时，即使标签保存的第二身份信息与当前接收到的第一消息中包括的第一身份信息匹配一致，标签也向节点发送第一消息的第一响应，以启动盘存流程。此外，标签内部还可存储上一盘存流程中所响应的第一消息的时间(即该第一消息中的第一时间戳)，当当前接收到的第一消息中包括的第一时间戳与标签存储的第二时间戳的差值大于第三阈值时，标签也同样向节点发送第一消息的第一响应，以启动盘存流程。相应地，当节点未接收到某一标签发送的第一响应的时间超过第四阈值时，也可删除关于该标签的数据信息。
在一实施例中，所述第一消息还包括掩码，所述发送所述第一消息的第一响应之前，所述方法还可以包括：所述标签判断所述第一标识信息的前缀位与所述掩码是否匹配；所述在确定所述第一身份信息与所述第二身份信息不匹配的情况下，发送第一消息的第一响应，可以包括：在确定所述第一身份信息与所述第二身份信息不匹配、且确定所述第一标识信息的前缀位与所述掩码匹配的情况下，发送所述第一响应。
本实施例针对标签在先发送的第一响应发生碰撞的情况，此情况下，由于发生碰撞的原因节点无法完成对标签的盘存，故标签中所存储的身份信息仍然是上一盘存流程中的节点的身份信息。节点在本次盘存流程中可重新发送第一消息，且重新发送的第一消息中包括掩码，标签在接收到该重新发送的第一消息后，一方面仍需判断第一消息包括的第一身份信息与存储的第二身份信息是否匹配，另一方面还需判断自身生成的第一标识信息的前缀位与所述第一消息中的掩码是否匹配，在确定两者均匹配的情况下发送第一响应。
可选的，所述掩码的长度小于或等于所述第一标识信息的最大长度。
在本公开的一种可选实施例中，所述方法还可以包括：所述标签接收所述节点发送的第二消息，所述第二消息包括所述第一标识信息；所述标签发送所述第二消息的第二响应，以及接收所述节点对所述第二响应的第一确认信息；所述第一确认信息包括所述第二响应；所述标签向所述节点发送编码信息。
可选的，所述标签接收所述节点发送的第二消息之前，所述方法还包括： 所述标签接收所述节点发送的第三消息；在确定所述第三消息包括的标识信息与生成的所述第一标识信息匹配一致的情况下，所述标签切换为第一状态；所述标签接收所述节点发送的第二消息，可以包括：所述标签在处于第一状态的情况下，接收所述节点发送的第二消息。
作为一种可选的实施方式，所述方法还可以包括：所述标签接收所述节点对所述第一响应的第二确认信息，所述第二确认信息包括用于指示标识信息的长度或最大长度的第二长度信息；基于所述第二长度信息重新生成所述第一标识信息；所述标签发送重新生成的所述第一标识信息。
可选的，所述第二确认信息还包括第三响应时间信息，用于指示标签发送重新生成的第一标识信息的时间起点和时间长度。
在一实施例中，所述方法还可以包括：所述标签存储所述第一身份信息和/或所述第一时间戳。可选的，所述标签向所述节点发送编码信息之后，所述标签存储所述第一身份信息和/或所述第一时间戳；或者，所述标签将存储的第二身份信息修改为所述第一身份信息，和/或，将存储的第二时间戳修改为所述第一时间戳。
下面结合具体的应用场景对本公开实施例的标签盘存方案进行说明。
图7为本公开实施例的标签盘存方案的应用示例流程图一，本示例中，所述节点为读写器。如图7所示，一轮盘存流程包括：读写器广播第一消息，其中携带自身的读写器ID(第一身份信息)；标签收到第一消息后判断该读写器ID与之前存储的读写器ID(第二身份信息)是否一致，在不一致的情况下，若所述第一消息中还包括掩码，则标签ID(第一标识信息)与所述掩码匹配一致的(多个)标签发送第一响应，其中携带第一消息中的读写器ID和自身生成的标签ID；读写器检测标签回复是否发生碰撞，并收集未发生碰撞的标签ID；使用收集的标签ID逐个盘存未碰撞标签，并修改盘存完成的标签所存储的读写器ID，直到读写器确定盘存完全部未发生碰撞的标签；对于标签回复存在碰撞的情况，读写器在下次广播的第一消息中增加掩码长度，重复上述流程，直到所有标签回复均未发生碰撞，完成对多个标签的一轮盘存流程。
图8为本公开实施例的标签盘存方案的应用示例流程图二，本示例中， 所述节点为读写器。如图8所示，一轮盘存流程包括：读写器广播第一消息，其中携带自身的读写器ID(第一身份信息)；标签收到第一消息后判断该读写器ID与之前存储的读写器ID(第二身份信息)是否一致，在不一致的情况下，(多个)标签发送第一响应，其中携带第一消息中的读写器ID和自身生成的标签ID；读写器检测标签回复是否发生碰撞，并收集未发生碰撞的标签ID；使用收集的标签ID逐个盘存未碰撞标签，并修改盘存完成的标签所存储的读写器ID，直到读写器确定盘存完全部未发生碰撞的标签；读写器根据标签回复是否发生碰撞更新下次广播的第一消息中的时间窗窗长，重复上述流程，直到所有标签回复均未发生碰撞，完成对多个标签的一轮盘存流程。
图9为本公开实施例的标签盘存方案的应用示例流程图三，本示例中，所述节点为供能器或读写器，所述供能器与所述读写器关联。如图9所示，一轮盘存流程包括：供能器广播第一消息，其中携带关联的读写器ID(第一身份信息)；标签收到第一消息后判断第一消息中的读写器ID与之前存储的读写器ID(第二身份信息)是否一致，在不一致的情况下，(多个)标签发送第一响应，其中携带第一消息中的读写器ID和自身生成的标签ID(第一标识信息)；供能器检测标签回复是否未发生碰撞，在未发生碰撞的情况下通知读写器所有未发生碰撞的标签ID和碰撞情况；读写器使用供能器提供的标签ID逐个盘存未碰撞标签，并修改盘存完的标签所存储的读写器ID，直到读写器确定盘存完全部未碰撞标签；对于发生碰撞的标签，若供能器仍能检测到发生碰撞，则根据碰撞情况在下次广播的第一消息中更新回复时间窗窗长，重复上述流程，直到所有标签回复均未发生碰撞，完成对多个标签的一轮盘存流程。
本示例结合有接收能力的供能器来辅助读写器进行盘存，在供能器的辅助下，读写器只需按照供能器提供的第一标识信息进行盘存即可，可极大降低读写器的负荷。
本公开实施例还提供一种标签盘存装置，所述装置应用于节点。图10为本公开实施例的标签盘存装置的组成结构示意图一，如图10所示，标签盘存装置300包括第一通信单元301和第一处理单元302；其中，
所述第一通信单元301，用于发送第一消息，所述第一消息至少包括所 述节点的第一身份信息；所述第一身份信息用于至少一个标签确定是否响应所述第一消息；还用于接收第一标签对所述第一消息的第一响应，所述第一响应包括所述第一标签生成的第一标识信息；所述第一标签为所述至少一个标签中、确定响应所述第一消息的任一标签；
所述第一处理单元302，用于基于所述第一标识信息对所述第一标签进行盘存。
在本公开的一种可选实施例中，所述第一消息还包括以下至少之一：用于指示标签响应第一消息的时间起点和时间长度的第一响应时间信息；用于指示标签生成的第一标识信息的长度或最大长度的第一长度信息；用于指示第一消息的发送时间的第一时间戳。
在本公开的一种可选实施例中，所述第一通信单元301还用于在确定所述至少一个标签中的至少部分标签各自发送的第一响应发生碰撞的情况下，重新发送所述第一消息；其中，重新发送的所述第一消息中还包括掩码，所述掩码用于匹配重新发送第一响应的第一标签；以及，重新接收第一标签对所述第一消息的第一响应；所述第一处理单元302还用于重新基于所述第一响应中包括的第一标识信息对所述第一标签进行盘存。
在本公开的一种可选实施例中，所述掩码的长度小于或等于所述第一标识信息的最大长度。
在本公开的一种可选实施例中，所述第一通信单元301还用于在确定所述至少一个标签中的至少部分标签各自发送的第一响应发生碰撞的情况下，重新发送所述第一消息；其中，重新发送的所述第一消息中包括第二响应时间信息，所述第二响应时间信息指示的时间长度大于所述第一响应时间信息指示的时间长度；以及，重新接收第一标签对所述第一消息的第一响应；所述第一处理单元302还用于重新基于所述第一响应中包括的第一标识信息对所述第一标签进行盘存。
在本公开的一种可选实施例中，所述第一通信单元301还用于发送第二消息，所述第二消息包括所述第一标识信息；以及接收所述第一标签对所述第二消息的第二响应，向所述第一标签发送第一确认信息；所述第一确认信息包括所述第二响应；还用于接收所述第一标签发送的编码信息。
在本公开的一种可选实施例中，所述第一通信单元301还用于发送第三消息，所述第三消息包括所述第一标识信息；所述第三消息用于指示所述第一标签切换为第一状态。
在本公开的一种可选实施例中，所述第一通信单元301还用于发送所述第一响应的第二确认信息，所述第二确认信息包括用于指示标识信息的长度或最大长度的第二长度信息；所述第二长度信息用于标签重新生成所述第一标识信息。
在本公开的一种可选实施例中，所述第二确认信息还包括第三响应时间信息，用于指示标签发送重新生成的第一标识信息的时间起点和时间长度。
本公开实施例中，所述装置300中的第一通信单元301，在实际应用中可通过通信模组(包含：基础通信套件、操作系统、通信模块、标准化接口和协议等)及收发天线实现；所述装置300中的第一处理单元302，在实际应用中均可由所述装置300中的中央处理器(Central Processing Unit，CPU)、数字信号处理器(Digital Signal Processor，DSP)、微控制单元(Microcontroller Unit，MCU)或可编程门阵列(Field－Programmable Gate Array，FPGA)实现。
本公开实施例还提供一种标签盘存装置，所述装置应用于标签。图11为本公开实施例的标签盘存装置的组成结构示意图二，如图11所示，标签盘存装置400包括第二通信单元401和第二处理单元402；其中，
所述第二通信单元401，用于接收节点发送的第一消息，所述第一消息至少包括所述节点的第一身份信息；
所述第二处理单元402，用于判断所述第一身份信息与存储的第二身份信息是否匹配；
所述第二通信单元401，还用于在所述第二处理单元确定所述第一身份信息与所述第二身份信息不匹配的情况下，发送所述第一消息的第一响应，所述第一响应包括所述标签生成的第一标识信息；所述第一标识信息用于所述节点进行盘存。
在本公开的一种可选实施例中，所述第一消息还包括以下至少之一：用于指示标签响应第一消息的时间起点和时间长度的第一响应时间信息；用于 指示标签生成的第一标识信息的长度或最大长度的第一长度信息；用于指示第一消息的发送时间的第一时间戳。
在本公开的一种可选实施例中，所述第二通信单元401还用于在确定供能信号强度低于第一阈值或者通信信号强度低于第二阈值的情况下，发送所述第一响应；和/或，所述第二通信单元401还用于在确定所述第一时间戳与存储的第二时间戳的时间差大于第三阈值的情况下，发送所述第一响应。
在本公开的一种可选实施例中，所述第一消息还包括掩码，所述第二处理单元402还用于判断所述第一标识信息的前缀位与所述掩码是否匹配；所述第二通信单元401在所述第二处理单元确定所述第一身份信息与所述第二身份信息不匹配、且确定所述第一标识信息的前缀位与所述掩码匹配的情况下，发送所述第一响应。
在本公开的一种可选实施例中，所述掩码的长度小于或等于所述第一标识信息的最大长度。
在本公开的一种可选实施例中，所述第二通信单元401还用于接收所述节点发送的第二消息，所述第二消息包括所述第一标识信息；以及发送所述第二消息的第二响应，接收所述节点对所述第二响应的第一确认信息；所述第一确认信息包括所述第二响应；还用于向所述节点发送编码信息。
在本公开的一种可选实施例中，所述第二通信单元401还用于接收所述节点发送的第三消息；所述第二处理单元402还用于在确定所述第三消息包括的标识信息与生成的所述第一标识信息匹配一致的情况下，切换为第一状态；所述第二通信单元401还用于在处于第一状态的情况下，接收所述节点发送的第二消息。
在本公开的一种可选实施例中，所述第二通信单元401还用于接收所述节点对所述第一响应的第二确认信息，所述第二确认信息包括用于指示标识信息的长度或最大长度的第二长度信息；所述第二处理单元402还用于基于所述第二长度信息重新生成所述第一标识信息；所述第二通信单元401还用于发送重新生成的所述第一标识信息。
在本公开的一种可选实施例中，所述第二确认信息还包括第三响应时间信息，用于指示标签发送重新生成的第一标识信息的时间起点和时间长度。
在本公开的一种可选实施例中，所述第二处理单元402还用于存储所述第一身份信息和/或所述第一时间戳。
本公开实施例中，所述装置400中的第二通信单元401，在实际应用中可通过通信模组(包含：基础通信套件、操作系统、通信模块、标准化接口和协议等)及收发天线实现；所述装置400中的第二处理单元402，在实际应用中均可由所述装置400中的CPU、DSP、MCU或FPGA实现。
需要说明的是：上述实施例提供的标签盘存装置在进行标签盘存时，仅以上述各程序模块的划分进行举例说明，实际应用中，可以根据需要而将上述处理分配由不同的程序模块完成，即将装置的内部结构划分成不同的程序模块，以完成以上描述的全部或者部分处理。另外，上述实施例提供的标签盘存装置与标签盘存方法实施例属于同一构思，其具体实现过程详见方法实施例，这里不再赘述。
图12为本公开实施例的节点的硬件结构示意图，节点500可以是读写器、供能器或者标签。图12所示的节点500包括：至少一个处理器501、存储器502和至少一个网络接口503。节点500中的各个组件通过总线系统504耦合在一起。可理解，总线系统504用于实现这些组件之间的连接通信。总线系统504除包括数据总线之外，还包括电源总线、控制总线和状态信号总线。但是为了清楚说明起见，在图12中将各种总线都标为总线系统504。
可以理解，存储器502可以是易失性存储器或非易失性存储器，也可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(Read Only Memory，ROM)、可编程只读存储器(Programmable Read-Only Memory，PROM)、可擦除可编程只读存储器(Erasable Programmable Read-Only Memory，EPROM)、电可擦除可编程只读存储器(Electrically Erasable Programmable Read-Only Memory，EEPROM)、磁性随机存取存储器(Ferromagnetic Random Access Memory，FRAM)、快闪存储器(Flash Memory)、磁表面存储器、光盘、或只读光盘(Compact Disc Read-Only Memory，CD-ROM)；磁表面存储器可以是磁盘存储器或磁带存储器。易失性存储器可以是随机存取存储器(Random Access Memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机 存取存储器(Static Random Access Memory，SRAM)、同步静态随机存取存储器(Synchronous Static Random Access Memory，SSRAM)、动态随机存取存储器(Dynamic Random Access Memory，DRAM)、同步动态随机存取存储器(Synchronous Dynamic Random Access Memory，SDRAM)、双倍数据速率同步动态随机存取存储器(Double Data Rate Synchronous Dynamic Random Access Memory，DDRSDRAM)、增强型同步动态随机存取存储器(Enhanced Synchronous Dynamic Random Access Memory，ESDRAM)、同步连接动态随机存取存储器(SyncLink Dynamic Random Access Memory，SLDRAM)、直接内存总线随机存取存储器(Direct Rambus Random Access Memory，DRRAM)。本公开实施例描述的存储器502旨在包括但不限于这些和任意其它适合类型的存储器。
本公开实施例中的存储器502用于存储各种类型的数据以支持节点500的操作。这些数据的示例包括：用于在节点500上操作的任何计算机程序，如实现本公开各实施例方法的程序。
上述本公开实施例揭示的方法可以应用于处理器501中，或者由处理器501实现。处理器501可能是一种集成电路芯片，具有信号的处理能力。在实现过程中，上述方法的各步骤可以通过处理器501中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器501可以是通用处理器、数字信号处理器(Digital Signal Processor，DSP)，或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等。处理器501可以实现或者执行本公开实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者任何常规的处理器等。结合本公开实施例所公开的方法的步骤，可以直接体现为硬件译码处理器执行完成，或者用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于存储介质中，该存储介质位于存储器502，处理器501读取存储器502中的信息，结合其硬件完成前述各方法的步骤。
在示例性实施例中，节点500可以被一个或多个应用专用集成电路(Application Specific Integrated Circuit，ASIC)、DSP、可编程逻辑器件(Programmable Logic Device，PLD)、复杂可编程逻辑器件(Complex Programmable Logic Device，CPLD)、现场可编程门阵列(Field-Programmable  Gate Array，FPGA)、通用处理器、控制器、微控制器(Micro Controller Unit，MCU)、微处理器(Microprocessor)、或其他电子元件实现，用于执行前述方法。
在示例性实施例中，本公开实施例还提供了一种计算机可读存储介质，例如包括计算机程序的存储器502，上述计算机程序可由节点500的处理器501执行，以完成前述各方法所述步骤。计算机可读存储介质可以是FRAM、ROM、PROM、EPROM、EEPROM、Flash Memory、磁表面存储器、光盘、或CD-ROM等存储器；也可以是包括上述存储器之一或任意组合的各种设备，如移动电话、计算机、平板设备、个人数字助理等。
本公开所提供的几个方法实施例中所揭露的方法，在不冲突的情况下可以任意组合，得到新的方法实施例。
本公开所提供的几个产品实施例中所揭露的特征，在不冲突的情况下可以任意组合，得到新的产品实施例。
本公开所提供的几个方法或设备实施例中所揭露的特征，在不冲突的情况下可以任意组合，得到新的方法实施例或设备实施例。
在本公开所提供的几个实施例中，应该理解到，所揭露的设备和方法，可以通过其它的方式实现。以上所描述的设备实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，如：多个单元或组件可以结合，或可以集成到另一个系统，或一些特征可以忽略，或不执行。另外，所显示或讨论的各组成部分相互之间的耦合、或直接耦合、或通信连接可以是通过一些接口，设备或单元的间接耦合或通信连接，可以是电性的、机械的或其它形式的。
上述作为分离部件说明的单元可以是、或也可以不是物理上分开的，作为单元显示的部件可以是、或也可以不是物理单元，即可以位于一个地方，也可以分布到多个网络单元上；可以根据实际的需要选择其中的部分或全部单元来实现本实施例方案的目的。
另外，在本公开各实施例中的各功能单元可以全部集成在一个处理单元中，也可以是各单元分别单独作为一个单元，也可以两个或两个以上单元集成在一个单元中；上述集成的单元既可以采用硬件的形式实现，也可以采用 硬件加软件功能单元的形式实现。
本领域普通技术人员可以理解：实现上述方法实施例的全部或部分步骤可以通过程序指令相关的硬件来完成，前述的程序可以存储于一计算机可读取存储介质中，该程序在执行时，执行包括上述方法实施例的步骤；而前述的存储介质包括：移动存储设备、只读存储器(Read-Only Memory，ROM)、随机存取存储器(Random Access Memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
或者，本公开上述集成的单元如果以软件功能模块的形式实现并作为独立的产品销售或使用时，也可以存储在一个计算机可读取存储介质中。基于这样的理解，本公开实施例的技术方案本质上或者说对相关技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机、服务器、或者网络设备等)执行本公开各个实施例所述方法的全部或部分。而前述的存储介质包括：移动存储设备、ROM、RAM、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本公开的具体实施方式，但本公开的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本公开揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本公开的保护范围之内。因此，本公开的保护范围应以所述权利要求的保护范围为准。

Claims (23)

  1. 一种标签盘存方法，包括：
    节点发送第一消息，所述第一消息至少包括所述节点的第一身份信息；所述第一身份信息用于至少一个标签确定是否响应所述第一消息；
    所述节点接收第一标签对所述第一消息的第一响应，所述第一响应包括所述第一标签生成的第一标识信息；所述第一标签为所述至少一个标签中、确定响应所述第一消息的任一标签；
    所述节点基于所述第一标识信息对所述第一标签进行盘存。
  2. 根据权利要求1所述的方法，其中，所述第一消息还包括以下至少之一：
    用于指示标签响应第一消息的时间起点和时间长度的第一响应时间信息；
    用于指示标签生成的第一标识信息的长度或最大长度的第一长度信息；
    用于指示第一消息的发送时间的第一时间戳。
  3. 根据权利要求1或2所述的方法，还包括：
    所述节点在确定所述至少一个标签中的至少部分标签各自发送的第一响应发生碰撞的情况下，重新发送所述第一消息；其中，重新发送的所述第一消息中还包括掩码，所述掩码用于匹配重新发送第一响应的第一标签；
    重新接收第一标签对所述第一消息的第一响应，以及重新基于所述第一响应中包括的第一标识信息对所述第一标签进行盘存。
  4. 根据权利要求3所述的方法，其中，所述掩码的长度小于或等于所述第一标识信息的最大长度。
  5. 根据权利要求2所述的方法，还包括：
    所述节点在确定所述至少一个标签中的至少部分标签各自发送的第一响应发生碰撞的情况下，重新发送所述第一消息；其中，重新发送的所述第一消息中包括第二响应时间信息，所述第二响应时间信息指示的时间长度大于所述第一响应时间信息指示的时间长度；
    重新接收第一标签对所述第一消息的第一响应，以及重新基于所述第一响应中包括的第一标识信息对所述第一标签进行盘存。
  6. 根据权利要求1所述的方法，其中，所述节点基于所述第一标识信息对所述第一标签进行盘存，包括：
    所述节点发送第二消息，所述第二消息包括所述第一标识信息；
    所述节点接收所述第一标签对所述第二消息的第二响应，以及向所述第一标签发送第一确认信息；所述第一确认信息包括所述第二响应；
    所述节点接收所述第一标签发送的编码信息。
  7. 根据权利要求6所述的方法，其中，所述节点发送第二消息之前，所述方法还包括：
    所述节点发送第三消息，所述第三消息包括所述第一标识信息；所述第三消息用于指示所述第一标签切换为第一状态。
  8. 根据权利要求1所述的方法，还包括：
    所述节点发送所述第一响应的第二确认信息，所述第二确认信息包括用于指示标识信息的长度或最大长度的第二长度信息；所述第二长度信息用于标签重新生成所述第一标识信息。
  9. 根据权利要求8所述的方法，其中，所述第二确认信息还包括第三响应时间信息，用于指示标签发送重新生成的第一标识信息的时间起点和时间长度。
  10. 一种标签盘存方法，包括：
    标签接收节点发送的第一消息，所述第一消息至少包括所述节点的第一身份信息；
    所述标签判断所述第一身份信息与存储的第二身份信息是否匹配；在确定所述第一身份信息与所述第二身份信息不匹配的情况下，发送所述第一消息的第一响应，所述第一响应包括所述标签生成的第一标识信息；所述第一标识信息用于所述节点进行盘存。
  11. 根据权利要求10所述的方法，其中，所述第一消息还包括以下至少之一：
    用于指示标签响应第一消息的时间起点和时间长度的第一响应时间信息；
    用于指示标签生成的第一标识信息的长度或最大长度的第一长度信息；
    用于指示第一消息的发送时间的第一时间戳。
  12. 根据权利要求11所述的方法，其中，所述标签接收节点发送的第一消息之后，所述方法还包括：
    所述标签在确定供能信号强度低于第一阈值或者通信信号强度低于第二阈值的情况下，发送所述第一响应；和/或，
    所述标签在确定所述第一时间戳与存储的第二时间戳的时间差大于第三阈值的情况下，发送所述第一响应。
  13. 根据权利要求10至12任一项所述的方法，其中，所述第一消息还包括掩码，所述发送所述第一消息的第一响应之前，所述方法还包括：
    所述标签判断所述第一标识信息的前缀位与所述掩码是否匹配；
    所述在确定所述第一身份信息与所述第二身份信息不匹配的情况下，发送第一消息的第一响应，包括：
    在确定所述第一身份信息与所述第二身份信息不匹配、且确定所述第一标识信息的前缀位与所述掩码匹配的情况下，发送所述第一响应。
  14. 根据权利要求13所述的方法，其中，所述掩码的长度小于或等于所述第一标识信息的最大长度。
  15. 根据权利要求10所述的方法，还包括：
    所述标签接收所述节点发送的第二消息，所述第二消息包括所述第一标识信息；
    所述标签发送所述第二消息的第二响应，以及接收所述节点对所述第二响应的第一确认信息；所述第一确认信息包括所述第二响应；
    所述标签向所述节点发送编码信息。
  16. 根据权利要求15所述的方法，其中，所述标签接收所述节点发送的第二消息之前，所述方法还包括：
    所述标签接收所述节点发送的第三消息；
    在确定所述第三消息包括的标识信息与生成的所述第一标识信息匹配一致的情况下，所述标签切换为第一状态；
    所述标签接收所述节点发送的第二消息，包括：
    所述标签在处于第一状态的情况下，接收所述节点发送的第二消息。
  17. 根据权利要求10所述的方法，还包括：
    所述标签接收所述节点对所述第一响应的第二确认信息，所述第二确认信息包括用于指示标识信息的长度或最大长度的第二长度信息；
    基于所述第二长度信息重新生成所述第一标识信息；
    所述标签发送重新生成的所述第一标识信息。
  18. 根据权利要求17所述的方法，其中，所述第二确认信息还包括第三响应时间信息，用于指示标签发送重新生成的第一标识信息的时间起点和时间长度。
  19. 根据权利要求11所述的方法，还包括：
    所述标签存储所述第一身份信息和/或所述第一时间戳。
  20. 一种标签盘存装置，所述装置应用于节点，所述装置包括第一通信单元和第一处理单元；其中，
    所述第一通信单元，用于发送第一消息，所述第一消息至少包括所述节点的第一身份信息；所述第一身份信息用于至少一个标签确定是否响应所述第一消息；还用于接收第一标签对所述第一消息的第一响应，所述第一响应包括所述第一标签生成的第一标识信息；所述第一标签为所述至少一个标签中、确定响应所述第一消息的任一标签；
    所述第一处理单元，用于基于所述第一标识信息对所述第一标签进行盘存。
  21. 一种标签盘存装置，所述装置应用于标签，所述装置包括第二通信单元和第二处理单元；其中，
    所述第二通信单元，用于接收节点发送的第一消息，所述第一消息至少包括所述节点的第一身份信息；
    所述第二处理单元，用于判断所述第一身份信息与存储的第二身份信息是否匹配；
    所述第二通信单元，还用于在所述第二处理单元确定所述第一身份信息与所述第二身份信息不匹配的情况下，发送所述第一消息的第一响应，所述第一响应包括所述标签生成的第一标识信息；所述第一标识信息用于所述节点进行盘存。
  22. 一种节点，包括存储器、处理器及存储在存储器上并可在处理器上 运行的计算机程序，所述处理器执行所述程序时实现权利要求1至9任一项所述方法的步骤；或者，所述处理器执行所述程序时实现权利要求10至19任一项所述方法的步骤。
  23. 一种计算机可读存储介质，其上存储有计算机指令，该指令被处理器执行时实现权利要求1至9任一项所述方法的步骤；或者，该指令被处理器执行时实现权利要求10至19任一项所述方法的步骤。
PCT/CN2023/124485 2022-10-13 2023-10-13 一种标签盘存方法、装置、节点和存储介质 WO2024078613A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211258089.2 2022-10-13
CN202211258089.2A CN117933277A (zh) 2022-10-13 2022-10-13 一种标签盘存方法、装置、节点和存储介质

Publications (1)

Publication Number Publication Date
WO2024078613A1 true WO2024078613A1 (zh) 2024-04-18

Family

ID=90668853

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/124485 WO2024078613A1 (zh) 2022-10-13 2023-10-13 一种标签盘存方法、装置、节点和存储介质

Country Status (2)

Country Link
CN (1) CN117933277A (zh)
WO (1) WO2024078613A1 (zh)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050280505A1 (en) * 2004-05-25 2005-12-22 Impinj, Inc. Inventorying RFID tags by employing a query parameter Q that is adjusted for improving
CN105260870A (zh) * 2015-10-12 2016-01-20 用友网络科技股份有限公司 身份验证方法、身份验证系统和终端
US10049317B1 (en) * 2010-02-01 2018-08-14 Impinj, Inc. RFID tags with public and private inventory states
CN110727666A (zh) * 2019-09-25 2020-01-24 中冶赛迪重庆信息技术有限公司 面向工业互联网平台的缓存组件、方法、设备及存储介质
CN114386440A (zh) * 2020-10-16 2022-04-22 杭州旗捷科技有限公司 一种射频识别中信息防碰撞方法、系统、设备及存储介质
CN114692790A (zh) * 2020-12-31 2022-07-01 上海华为技术有限公司 一种通信方法及相关设备
CN114841180A (zh) * 2021-01-30 2022-08-02 上海华为技术有限公司 一种盘存标签的方法以及相关设备
CN114980352A (zh) * 2021-02-27 2022-08-30 上海华为技术有限公司 一种数据传输方法及其设备

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050280505A1 (en) * 2004-05-25 2005-12-22 Impinj, Inc. Inventorying RFID tags by employing a query parameter Q that is adjusted for improving
US10049317B1 (en) * 2010-02-01 2018-08-14 Impinj, Inc. RFID tags with public and private inventory states
CN105260870A (zh) * 2015-10-12 2016-01-20 用友网络科技股份有限公司 身份验证方法、身份验证系统和终端
CN110727666A (zh) * 2019-09-25 2020-01-24 中冶赛迪重庆信息技术有限公司 面向工业互联网平台的缓存组件、方法、设备及存储介质
CN114386440A (zh) * 2020-10-16 2022-04-22 杭州旗捷科技有限公司 一种射频识别中信息防碰撞方法、系统、设备及存储介质
CN114692790A (zh) * 2020-12-31 2022-07-01 上海华为技术有限公司 一种通信方法及相关设备
CN114841180A (zh) * 2021-01-30 2022-08-02 上海华为技术有限公司 一种盘存标签的方法以及相关设备
CN114980352A (zh) * 2021-02-27 2022-08-30 上海华为技术有限公司 一种数据传输方法及其设备

Also Published As

Publication number Publication date
CN117933277A (zh) 2024-04-26

Similar Documents

Publication Publication Date Title
US7274284B2 (en) Method for RF card detection in a contactless system
US6456191B1 (en) Tag system with anti-collision features
EP1916616B1 (en) Method for response control of an RFID tag, corresponding RFID system, reader/wrtiter and computer porgram
CN108229230B (zh) 用于提供关于射频标签的识别和访问的方法
US20030052161A1 (en) Method of communication in a radio frequency identification system
JPH0894746A (ja) 複数アイテム無線周波数タグ識別プロトコル
WO2009065311A1 (en) Binary tree method for multi-tag anti-collision
JP6470824B2 (ja) 無線周波数タグに対する識別とアクセスを提供する方法
JP2002507756A (ja) 複数個の遠隔ユニットと制御ユニットとの間の通信の方法
KR20060115694A (ko) Ｒｆｉｄ 시스템의 쿼리 트리 기반 태그 인식 방법
US9405941B2 (en) Simultaneous programming of selected tags
US20050237158A1 (en) RFID tag systems, RFID tags and RFID processes using N-ary FSK
WO2024078613A1 (zh) 一种标签盘存方法、装置、节点和存储介质
JP2007094773A (ja) Ｉｃタグ、ｉｃタグシステム及びそのデータ通信方法
JP2007026465A (ja) データ・キャリア整理分類方法
JP4157208B2 (ja) 制御装置と制御装置の通信制御方法
CN114841180A (zh) 一种盘存标签的方法以及相关设备
EP1676404B1 (en) Communication system and anti-collision method
JP2003525500A (ja) 電子タグのコードの同時識別によって電子タグを読み出すためのプロセス
CN102298684B (zh) 避免射频识别系统中信号干扰的方法、系统及阅读器
CN102479312A (zh) 避免射频识别系统中信号干扰的方法
CN103679096A (zh) 一种优化的rfid防碰撞方法
KR101234588B1 (ko) 넘버링을 이용한 ｒｆｉｄ 태그 수집 시스템 및 그 방법
JP2001257696A (ja) マスタスレーブ間の通信方式
US9582691B2 (en) Simultaneous programming of selected tags

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23876812

Country of ref document: EP

Kind code of ref document: A1