Access method and device, communication equipment, computer storage medium and computer program product

Abstract

The invention discloses an access method and device, communication equipment, a computer storage medium and a computer program product, and the method comprises the steps that first equipment sends a first command, and the first command is used for triggering multiple pieces of second equipment to generate random numbers; the first device sends a second command, wherein the second command is used for triggering the plurality of second devices to subtract 1 from the value of the random number of the second devices; wherein the value of the random number is used for the second device to determine whether to send the device information of the second device to the first device; the first device counts the number of collision time slots, the number of idle time slots and the number of successful time slots based on the receiving result of the device information, and determines the number of the second devices based on the number of collision time slots, the number of idle time slots and the number of successful time slots; the first device initiates a random access process based on the number of the second devices; therefore, when a large-scale tag is accessed, the total access time is obviously shortened.

Description

Technical Field

[0001] The present application relates to the field of wireless communication technology, and in particular to an access method and apparatus, communication equipment, computer storage medium, and computer program product. Background Art

[0002] The tags in the existing Radio Frequency Identification (RFID) system work passively, communicate through the backscattering principle, and do not have the ability to actively transmit signals. This feature prevents tags from communicating directly with each other, and reducing or avoiding collisions between multiple tag signals has become a key factor in determining the success rate and speed of tag reading and writing.

[0003] However, the existing anti-collision method is only applicable to the simultaneous access of thousands of tags. However, in the sixth generation mobile communication standard (6-Generation, 6G) scenario, the area covered by the same macro base station is huge, and the scale of tag application in the future will increase exponentially. Therefore, an effective access method is urgently needed to solve this problem. Summary of the invention

[0004] To solve the above technical problems, the embodiments of the present invention provide an access method and apparatus, a communication device, a computer storage medium and a computer program product.

[0005] In a first aspect, the access method provided by the embodiment of the present application includes:

[0006] The first device sends a first command, where the first command is used to trigger multiple second devices to generate random numbers;

[0007] The first device sends a second command, where the second command is used to trigger the multiple second devices to reduce the value of their own random numbers by 1; wherein the value of the random number is used by the second device to determine whether to send the device information of the second device to the first device;

[0008] The first device counts the number of collision time slots, the number of idle time slots and the number of successful time slots based on the reception result of the device information, and determines the number of the second devices based on the number of collision time slots, the number of idle time slots and the number of successful time slots;

[0009] The first device initiates a random access procedure based on the number of the second devices.

[0010] In a second aspect, the access method provided by the embodiment of the present application includes:

[0011] After receiving the first command sent by the first device, the second device generates a random number;

[0012] After receiving the second command sent by the first device, the second device reduces the value of its own random number by 1;

[0013] The second device determines whether to send the device information of the second device to the first device based on the value of the random number; wherein the result of receiving the device information on the first device side is used by the first device to count the number of collision time slots, the number of idle time slots and the number of successful time slots, the number of collision time slots, the number of idle time slots and the number of successful time slots are used by the first device to determine the number of the second devices, and the number of the second devices is used by the first device to initiate a random access process.

[0014] In a third aspect, an access device provided in an embodiment of the present application is applied to a first device, including:

[0015] A sending unit, configured to send a first command, wherein the first command is used to trigger multiple second devices to generate random numbers; and send a second command, wherein the second command is used to trigger the multiple second devices to reduce the value of their own random numbers by 1; wherein the value of the random number is used by the second device to determine whether to send the device information of the second device to the first device;

[0016] a determining unit, configured to count the number of collision time slots, the number of idle time slots, and the number of successful time slots based on the reception result of the device information, and determine the number of the second devices based on the number of collision time slots, the number of idle time slots, and the number of successful time slots;

[0017] An access unit is used to initiate a random access process based on the number of the second devices.

[0018] In a fourth aspect, an access device provided in an embodiment of the present application is applied to a second device, including:

[0019] A receiving unit, configured to generate a random number after receiving a first command sent by a first device; and to reduce the value of the random number by 1 after receiving a second command sent by the first device;

[0020] A determination unit, used to determine whether to send device information of a second device to the first device based on the value of the random number; wherein the result of receiving the device information on the first device side is used by the first device to count the number of collision time slots, the number of idle time slots and the number of successful time slots, the number of collision time slots, the number of idle time slots and the number of successful time slots are used by the first device to determine the number of the second devices, and the number of the second devices is used by the first device to initiate a random access process.

[0021] In a fifth aspect, the communication device provided in an embodiment of the present application includes: a processor and a memory, the memory is used to store a computer program, and the processor is used to call and run the computer program stored in the memory to execute any one of the above-mentioned access methods.

[0022] In a sixth aspect, the computer-readable storage medium provided in an embodiment of the present application is used to store a computer program, and the computer program enables a computer to execute any one of the above-mentioned access methods.

[0023] In a seventh aspect, the computer program product provided in an embodiment of the present application includes computer program instructions, which enable a computer to execute any one of the access methods described above.

[0024] In the technical solution of the embodiment of the present application, the first device triggers multiple second devices to generate random numbers by sending a first command; sending a second command triggers multiple second devices to reduce the value of their own random numbers by 1; wherein the value of the random number is used by the second device to determine whether to send the device information of the second device to the first device; the first device counts the number of collision time slots, the number of idle time slots and the number of successful time slots based on the reception result of the device information, and determines the number of second devices based on the number of collision time slots, the number of idle time slots and the number of successful time slots; the first device initiates a random access process based on the number of second devices; in this way, the process and time required for successful access can be reduced, and the tag access efficiency can be improved while maintaining low complexity. When large-scale tag access is performed, the total access time can be significantly shortened. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] Figure 1 This is a schematic diagram of the access method provided in the embodiment of the present application. Figure 1 ;

[0026] Figure 2 This is a schematic diagram of the access method provided in the embodiment of the present application. Figure 2 ;

[0027] Figure 3 This is a schematic diagram of the access method provided in the embodiment of the present application. Figure 3 ;

[0028] Figure 4 This is a simulation comparison diagram of the access method provided in the embodiment of the present application. Figure 1 ;

[0029] Figure 5 This is a simulation comparison diagram of the access method provided in the embodiment of the present application. Figure 2 ;

[0030] Figure 6 This is a simulation comparison diagram of the access method provided in the embodiment of the present application. Figure 3 ;

[0031] Figure 7 This is a schematic diagram of the structure of the access device provided in the embodiment of the present application. Figure 1 ;

[0032] Figure 8 This is a schematic diagram of the structure of the access device provided in the embodiment of the present application. Figure 2 ;

[0033] Fig. 9 It is a schematic structural diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0034] To facilitate understanding of the technical solutions of the embodiments of the present application, the relevant technologies of the embodiments of the present application are described below. The following related technologies can be arbitrarily combined with the technical solutions of the embodiments of the present application as optional solutions, and they all belong to the protection scope of the embodiments of the present application.

[0035] The tags of the existing RFID radio frequency system adopt a passive working mode and perform link communication through the backscattering principle. Most tags do not have the ability to actively transmit signals. This feature prevents tags from communicating directly with each other, and reducing or avoiding collisions between multiple tag signals has become a key factor in determining the success rate and rate of tag reading and writing. Since the tag circuit complexity is low and the carrier is not actively generated, the existing anti-collision technology solutions mostly use the idea of ​​time division multiplexing, which can be roughly divided into uncertain algorithms based on the ALOHA algorithm, deterministic algorithms based on binary trees, and hybrid methods based on uncertain algorithms and deterministic algorithms.

[0036] Among them, the ALOHA algorithm realizes information exchange through random response of tags and detection of tag status by readers, mainly including Pure ALOHA (PA) algorithm, Slotted ALOHA (SA) algorithm, Frame-slotted ALOHA (FSA) algorithm and Dynamic Frame-slotted ALOHA (DFSA) algorithm. These probabilistic methods enable tags to generate their own random access time points within a specified time range, with the aim of enabling tags to respond at different randomly distributed time points. Because of its relatively simple implementation and ability to guarantee a certain degree of throughput, this type of solution has been widely used. However, when the number of tags increases, the probability of tag collision is extremely high, the algorithm performance is reduced, and due to the possibility of time slot selection, some tags may not be recognized for a long time. Binary tree search algorithms are mostly used in ultra-high frequency bands, mainly including dynamic binary search tree (DBST), regressive-style binary search tree (RBST), jumping and dynamic search tree (JDST) and query tree (QT). Deterministic methods usually require the reader to continuously send requests containing query codes. The tag decides whether to return a signal based on its own query code. The reader initiates a request again when a collision is detected, and handles the query code collision tags separately. However, when the number of tags is large, that is, when the number of tags is large, the frequency of collisions will increase greatly, and each collision can only generate two branches, the recognition time will increase sharply, and the search efficiency will decrease. The hybrid method combines the probabilistic method and the deterministic method, and modifies the implementation process. This type of method is more complex and has fewer practical applications.

[0037] The anti-collision methods used in actual applications (such as protocol 18000-6C) are mainly based on pure random access. The theoretical maximum throughput of these methods does not exceed 36.8%. The existing anti-collision optimization methods are mainly based on optimizing the throughput close to this theoretical maximum value. In fact, the duration of the tag's successful access time slot, idle time slot and collision time slot are all different, and the time taken for a successful time slot is usually more than ten times that of an idle time slot. This means that reducing the time taken for successful tag access can significantly shorten the inventory time; this feature is particularly evident when the number of tags accessed at the same time reaches a certain scale (tens of thousands). Although the scale of simultaneous tag access currently does not usually exceed the thousand level, the area covered by the same macro base station in the 6G scenario is huge, and the scale of tag applications in the future will also increase exponentially. Therefore, the following technical solutions are proposed in the embodiments of the present application.

[0038] To facilitate understanding of the technical solutions of the embodiments of the present application, the technical solutions of the present application are described in detail below through specific embodiments. The above related technologies can be arbitrarily combined with the technical solutions of the embodiments of the present application as optional solutions, and they all belong to the protection scope of the embodiments of the present application. The embodiments of the present application include at least part of the following contents.

[0039] Figure 1 This is a schematic diagram of the access method provided in the embodiment of the present application. Figure 1 ,like Figure 1 As shown, the access method includes:

[0040] Step 101: A first device sends a first command, where the first command is used to trigger multiple second devices to generate random numbers.

[0041] In an embodiment of the present application, the first device may be a reader in an RFID radio frequency system, and the second device may be an electronic tag in an RFID radio frequency system. Specifically, the RFID system is composed of three major parts: an electronic tag, a reader, and a backend database. In a radio frequency identification system with multiple readers and multiple tags, when two or more tags send data to the reader at the same time, the reader will receive data conflicts, resulting in the reader being unable to correctly identify the tag information. It should be noted that the first device can also be called a reader, and the second device can also be called a tag, and this application does not limit this.

[0042] In the embodiment of the present application, the first command may be defined as a Traversal RN16 command, indicating that all second devices receiving the first command will randomly generate a random number. Exemplarily, the random number may be a 16-bit binary value RN16.

[0043] In some embodiments, before the first device sends the first command, it is necessary to pre-set a second device quantity threshold N according to the performance of the first device. The value of the threshold N can be set to N greater than or equal to 5000 and less than or equal to 20000, that is, between 5000≤N≤20000. Specifically, the better the performance of the first device, the smaller the value of N. When the estimated total number of second devices is greater than N, the first device sends the first command, and at the same time, the first device and the second device enter an access mode suitable for large-scale access. The second device participating in the access will generate a random number RN16 after receiving the first command Traversal RN16 command. Here, access refers to the process of the first device identifying the second device, that is, after the first device sends a command, one or more second devices can respond, the first device checks the response of a second device, and requests the second device to send device information. Here, the access process between the first device and the second device may also refer to the inventory process between the first device and the second device.

[0044] Step 102: The first device sends a second command, where the second command is used to trigger multiple second devices to reduce their own random number values ​​by 1; wherein the random number value is used by the second device to determine whether to send the device information of the second device to the first device.

[0045] In the embodiment of the present application, the second device generates a random number after receiving the first command Traversal RN16 command. When the random number is zero, the second device instantly switches to the response state and immediately responds, that is, sends the device information of the second device to the first device. When the random number value of the second device is not zero, it switches to the arbitration state (Arbitrate) and waits for the first device to issue the second command Traversal Next command. Here, the arbitration state refers to the second device that participates in the current inventory or access cycle, but the random number value is not zero.

[0046] In the embodiment of the present application, the second command can be defined as a Traversal Next command, which means that all second devices that receive the second command will reduce the value of their own random numbers by 1. Exemplarily, all second devices that receive the first command will reduce the value of their own random numbers by 1 when receiving the second command, and determine whether the random number after reduction by 1 is zero. The second device whose random number value is zero is instantly converted to a response state and responds immediately, that is, the device information of the second device is sent to the first device. The second device whose random number value is non-zero is converted to an arbitration state and waits for the first device to issue the second command again.

[0047] In the embodiment of the present application, the second device may be an electronic tag, and the device information of the second device may include the electronic product code (EPC) of the tag object, the protocol-control word (PC) of the electronic tag, and the check code (CRC-16 check code) of the stored content. Among them, PC includes the control information of the electronic tag, and EPC is the electronic product code for identifying the tag object. The length of the EPC number of each type of electronic tag (different manufacturers or different models) may be different.

[0048] Step 103: The first device counts the number of collision time slots, the number of idle time slots and the number of successful time slots based on the reception result of the device information, and determines the number of second devices based on the number of collision time slots, the number of idle time slots and the number of successful time slots.

[0049] In an embodiment of the present application, the first device determines the collision time slot, the idle time slot and the success time slot based on the number of device information sent by the tag, and counts the number of collision time slots, the number of idle time slots and the number of success time slots, and determines the number of second devices according to the statistical results, wherein the number of second devices includes the number of second devices that have completed access and the number of second devices to be identified.

[0050] In some embodiments, the first device counts the number of collision time slots, the number of idle time slots, and the number of successful time slots based on the reception result of the device information, including: if the first device receives a piece of device information in a time slot, it determines that the time slot is a successful time slot; if the first device receives multiple pieces of device information in a time slot, it determines that the time slot is a collision time slot; if the first device does not receive device information in a time slot, it determines that the time slot is an idle time slot; the first device counts the number of collision time slots, the number of idle time slots, and the number of successful time slots based on the reception result of the device information in multiple time slots.

[0051] Exemplarily, the random number is RN16, and the first value is 00000000000000000. The second device determines whether to send device information to the first device based on whether the value of the random number is the first value. Specifically, when there is only one second device whose random number value is zero, the second device sends its own EPC value to the first device, and the first device determines that the time slot is a successful time slot and completes access to the second device. When there is more than one second device whose random number value is zero, the first device receives multiple EPC values, and the EPC contains a CRC check code, the first device identifies and records the occurrence of a collision, and determines that the time slot is a collision time slot. When no second device has a random number value of zero, the first device does not receive device information, and the first device determines that the time slot is an idle time slot. The first device counts the number of collision time slots, the number of idle time slots, and the number of successful time slots based on the reception results of the device information in multiple time slots.

[0052] In some implementations, in step 102, the first device sends the second command, including: the first device sends the second command multiple times, and the number of times the second command is sent is determined based on a maximum value of the random number.

[0053] Exemplarily, when the random number is RN16, the maximum value of the random number is 65535, that is, the first device will send the second command a total of 65535 times. When the first device determines that the number of times the second command is sent reaches the maximum value, the first device stops sending the second command, indicating that the inventory of the first phase is completed.

[0054] In some implementations, the first device sends the second command multiple times, including: after the first device sends the second command once, it waits for a first period of time before sending the second command next time.

[0055] Here, after the first device sends the second command once, it determines whether the device information sent by the second device is received within the first time length. If the device information sent by the second device is not received within the first time length, the first device sends the second command for the next time. If the device information sent by the second device is received within the first time length, the first device records the device information and sends the second command for the next time. It should be noted that the setting of the first time length is related to the time accuracy error, and this application does not limit the specific value of the first time length.

[0056] In some embodiments, the first device counts the number of collision time slots, the number of idle time slots, and the number of successful time slots based on the reception result of the device information, including: the first device determines the time slot type of one or more time slots based on the reception result of the device information within a first time length, and the time slot type is a collision time slot, an idle time slot, or a successful time slot; the first device counts the number of collision time slots, the number of idle time slots, and the number of successful time slots based on the time slot type of one or more time slots.

[0057] Exemplarily, if the first device receives device information sent by the second device within the first time length, and the device information is only the EPC of one second device, the first device determines that the time slot is a successful time slot, and completes access to the second device, and after completing the access, sends the second command again to all second devices that have received the first command. Alternatively, if the first device receives device information sent by the second device within the first time length, the device information includes multiple EPC values, and the EPC includes a CRC check code, the first device identifies and records the occurrence of a collision, determines that the time slot is a collision time slot, and sends the second command again to all second devices that have received the first command. Alternatively, if the first device does not receive device information within the first time length, the first device determines that the time slot is an idle time slot, and sends the second command again to all second devices that have received the first command. When the first device determines that the number of times the second command is sent reaches the maximum value, the first device stops sending the second command, and counts multiple time slot types during this period, that is, the accumulated number of collision time slots, idle time slots, and successful time slots.

[0058] Step 104: The first device initiates a random access process based on the number of second devices.

[0059] In an embodiment of the present application, the first device determines the number of second devices to be identified based on the recorded number of collision time slots, the number of idle time slots, and the number of successful time slots. Specifically, the number of second devices includes the number of second devices that have completed access and the number of second devices to be identified, wherein the second device that has completed access refers to the tag that has completed access in the successful time slot, and the second device to be identified refers to the tag that has collided. The number of second devices to be identified can be estimated by the number of collision time slots, the number of idle time slots, and the number of successful time slots. According to the number of second devices to be identified, traditional DFSA-based access is performed to complete the second stage of random access process, that is, the second stage inventory, and finally complete the random access process of the tag.

[0060] In some embodiments, the first device initiates a random access process based on the number of second devices, including: the first device determines a value of a first parameter based on the number of second devices, and sends a query command carrying the first parameter, where the query command is used to trigger a round of random access process.

[0061] Here, the first device can estimate the number of the second devices to be identified by the number of collision time slots, the number of idle time slots and the number of successful time slots, and generate a first parameter, i.e., the initial Q value, according to the number of the second devices to be identified, and then use the Q value to send a query command to the tag, the query command can be expressed as a Query command, and the query command is used to start the second stage of access to the second device to be identified. Specifically, the query command specifies a time slot frame L of a fixed length, and the frame length L is an integer power of 2, i.e., L=2^Q. The second device can randomly select a time slot between (1, L) to respond to the query command. If no second device responds to a time slot, it is an idle time slot. If only one second device responds, it is a successful time slot. At this time, the second device can be successfully read by the first device. If multiple second devices respond at the same time, it is a collision time slot. When a frame ends, the first device counts the number of idle time slots, collision time slots and successful time slots, and uses this as a parameter to estimate the number of remaining unidentified second devices, and then adjusts the length of the next frame, and repeats the above process until all second devices to be identified are identified.

[0062] From the above, it can be seen that in the access method provided in the embodiment of the present application, the first device sends a first command, and the first command is used to trigger multiple second devices to generate random numbers; the first device sends a second command, and the second command is used to trigger multiple second devices to reduce the value of their own random numbers by 1; wherein the value of the random number is used by the second device to determine whether to send the device information of the second device to the first device; the first device counts the number of collision time slots, the number of idle time slots and the number of successful time slots based on the reception result of the device information, and determines the number of second devices based on the number of collision time slots, the number of idle time slots and the number of successful time slots; the first device initiates a random access process based on the number of second devices; in this way, on the one hand, by traversing random numbers instead of the DFSA random access in the prior art, the time taken for successful tag access is optimized, while retaining the randomness of the time slots, thereby improving the access efficiency during large-scale tag access. The access efficiency of the system is improved by introducing the flexibility of using different access methods for large-scale and small-scale tag access. On the other hand, compared with the uncertain access mode, when the number of tags is large, the duration of a single access slot can be reduced, thereby greatly reducing the total time required for all tags to access. On the other hand, compared with the deterministic access mode, access using RN16 can avoid the long collision check time caused by the long EPC bit number, and enable separate access even if multiple tags have the same EPC.

[0063] Figure 2 This is a schematic diagram of the access method provided in the embodiment of the present application. Figure 2 ,like Figure 2 As shown, the access method includes:

[0064] Step 201: After receiving a first command sent by a first device, the second device generates a random number.

[0065] In an embodiment of the present application, the first device may be a reader in an RFID radio frequency system, and the second device may be an electronic tag in an RFID radio frequency system. Specifically, the RFID system is composed of three major parts: an electronic tag, a reader, and a backend database. In a radio frequency identification system with multiple readers and multiple tags, when two or more tags send data to the reader at the same time, the reader will receive data conflicts, resulting in the reader being unable to correctly identify the tag information. It should be noted that the first device can also be called a reader, and the second device can also be called a tag, and this application does not limit this.

[0066] In the embodiment of the present application, the first command may be defined as a Traversal RN16 command, indicating that all second devices receiving the first command will randomly generate a random number. Exemplarily, the random number may be a 16-bit binary value RN16.

[0067] In some embodiments, before the first device sends the first command, it is necessary to pre-set a second device quantity threshold N according to the performance of the first device. The value of the threshold N can be set to N greater than or equal to 5000 and less than or equal to 20000, that is, between 5000≤N≤20000. Specifically, the better the performance of the first device, the smaller the value of N. When the estimated total number of second devices is greater than N, the first device sends the first command, and at the same time, the first device and the second device enter an access mode suitable for large-scale access. The second device participating in the access will generate a random number RN16 after receiving the first command Traversal RN16 command. Here, access refers to the process of the first device identifying the second device, that is, after the first device sends a command, one or more second devices can respond, the first device checks the response of a second device, and requests the second device to send device information. Here, the access process between the first device and the second device may also refer to the inventory process between the first device and the second device.

[0068] Step 202: After receiving the second command sent by the first device, the second device reduces the value of its own random number by 1.

[0069] In the embodiment of the present application, the second device generates a random number after receiving the first command Traversal RN16 command. When the random number is zero, the second device instantly switches to the response state and immediately responds, that is, sends the device information of the second device to the first device. When the random number value of the second device is not zero, it switches to the arbitration state (Arbitrate) and waits for the first device to issue the second command Traversal Next command. Here, the arbitration state refers to the second device that participates in the current inventory or access cycle, but the random number value is not zero.

[0070] In the embodiment of the present application, the second command can be defined as a Traversal Next command, which means that all second devices that receive the second command will reduce the value of their own random numbers by 1. Exemplarily, all second devices that receive the first command will reduce the value of their own random numbers by 1 when receiving the second command, and determine whether the random number after reduction by 1 is zero. The second device whose random number value is zero is instantly converted to a response state and responds immediately, that is, the device information of the second device is sent to the first device. The second device whose random number value is non-zero is converted to an arbitration state and waits for the first device to issue the second command again.

[0071] In the embodiment of the present application, the second device may be a tag, and the device information of the second device may include the electronic product code (EPC) of the tag object, the protocol-control word (PC) of the electronic tag, and the check code (CRC-16 check code) of the stored content. Among them: PC includes the control information of the electronic tag, EPC is the electronic product code for identifying the tag object, and the length of the EPC number of each type of electronic tag (different manufacturers or different models) may be different.

[0072] Step 203, the second device determines whether to send the device information of the second device to the first device based on the value of the random number; wherein, the result of receiving the device information on the first device side is used by the first device to count the number of collision time slots, the number of idle time slots and the number of successful time slots, the number of collision time slots, the number of idle time slots and the number of successful time slots are used by the first device to determine the number of second devices, and the number of second devices is used by the first device to initiate a random access process.

[0073] In an embodiment of the present application, the first device determines the collision time slot, the idle time slot and the success time slot based on the number of device information sent by the tag, and counts the number of collision time slots, the number of idle time slots and the number of success time slots, and determines the number of second devices according to the statistical results, wherein the number of second devices includes the number of second devices that have completed access and the number of second devices to be identified.

[0074] In some embodiments, the second device determines whether to send the device information of the second device to the first device based on the value of the random number, including: if the value of the random number of the second device is a first value, the second device determines to send the device information of the second device to the first device; if the value of the random number of the second device is not the first value, the second device determines not to send the device information of the second device to the first device.

[0075] Exemplarily, the random number is RN16, and the first value is 00000000000000000. The second device determines whether to send device information to the first device based on whether the value of the random number is the first value. Specifically, when there is only one second device whose random number value is zero, the second device sends its own EPC value to the first device, and the first device determines that the time slot is a successful time slot and completes access to the second device. When there is more than one second device whose random number value is zero, the first device receives multiple EPC values, and the EPC contains a CRC check code, the first device identifies and records the occurrence of a collision, and determines that the time slot is a collision time slot. When no second device has a random number value of zero, the first device does not receive device information, and the first device determines that the time slot is an idle time slot. The first device counts the number of collision time slots, the number of idle time slots, and the number of successful time slots based on the reception results of the device information in multiple time slots.

[0076] In some implementations, the second device receives the second command sent by the first device, including: the second device receives the second command sent by the first device multiple times, and the number of times the second command is sent is determined based on a maximum value of the random number.

[0077] Exemplarily, when the random number is RN16, the maximum value of the random number is 65535, that is, the first device will send the second command a total of 65535 times. When the first device determines that the number of times the second command is sent reaches the maximum value, the first device stops sending the second command, indicating that the inventory of the first phase is completed.

[0078] In some implementations, the second device receives a query command carrying a first parameter sent by the first device, where the query command is used to trigger a round of random access process, and a value of the first parameter is determined based on the number of second devices.

[0079] Here, the first device determines the number of second devices to be identified based on the recorded number of collision time slots, the number of idle time slots, and the number of successful time slots. Specifically, the number of second devices includes the number of second devices that have completed access and the number of second devices to be identified, wherein the second device that has completed access refers to the tag that has completed access in the successful time slot, and the second device to be identified refers to the tag that has collided. The number of second devices to be identified can be estimated by the number of collision time slots, the number of idle time slots, and the number of successful time slots. According to the number of second devices to be identified, traditional DFSA-based access is performed to complete the second stage of random access process, that is, the second stage inventory, and finally complete the random access process of the tag.

[0080] Specifically, the first device can estimate the number of second devices to be identified through the number of collision time slots, the number of idle time slots and the number of successful time slots, and generate a first parameter, i.e., the initial Q value, according to the number of second devices to be identified, and then use the Q value to send a query command to the tag, the query command can be expressed as a Query command, and the query command is used to start the second stage of access to the second device to be identified. Specifically, the query command specifies a fixed-length time slot frame L, and the frame length L is an integer power of 2, i.e., L=2^Q. The second device can randomly select a time slot between (1, L) to respond to the query command. If no second device responds to a time slot, it is an idle time slot. If only one second device responds, it is a successful time slot. At this time, the second device can be successfully read by the first device. If multiple second devices respond at the same time, it is a collision time slot. When a frame ends, the first device counts the number of idle time slots, collision time slots and successful time slots, and uses this as a parameter to estimate the number of remaining unidentified second devices, and then adjusts the length of the next frame, and repeats the above process until all second devices to be identified are identified.

[0081] From the above, it can be seen that in the access method provided in the embodiment of the present application, the second device generates a random number after receiving the first command sent by the first device; after the second device receives the second command sent by the first device, it subtracts 1 from the value of its own random number; the second device determines whether to send the device information of the second device to the first device based on the value of the random number; wherein, the reception result of the device information on the first device side is used by the first device to count the number of collision time slots, the number of idle time slots and the number of successful time slots, the number of collision time slots, the number of idle time slots and the number of successful time slots are used by the first device to determine the number of second devices, and the number of second devices is used by the first device to initiate a random access process; in this way, on the one hand, by traversing random numbers instead of the DFSA random access in the prior art, the time taken for successful tag access is optimized, while retaining the randomness of the time slots, thereby improving the access efficiency during large-scale tag access. The access efficiency of the system is improved by introducing the flexibility of using different access methods for large-scale and small-scale tag access. On the other hand, compared with the uncertain access mode, when the number of tags is large, the duration of a single access slot can be reduced, thereby greatly reducing the total time required for all tags to access. On the other hand, compared with the deterministic access mode, access using RN16 can avoid the long collision check time caused by the long EPC bit number, and enable separate access even if multiple tags have the same EPC.

[0082] Embodiment 1

[0083] The embodiment of the present application provides an RFID anti-collision method that combines a deterministic method with DFSA for large-scale tag access. When a large number of tags are accessed at the same time, the method provided by the embodiment of the present application can improve access efficiency. Figure 3 This is a schematic diagram of the access method provided in the embodiment of the present application. Figure 3 ,like Figure 3 As shown, the specific process is as follows:

[0084] Step 301: The reader sends a first command to enable random access.

[0085] Here, the reader sends a first command to large-scale tags within a certain range, and the first command can be defined as a Traversal RN16 command.

[0086] Step 302: The tag receives the first command and randomly generates an RN16.

[0087] Step 303: Check whether the tag compares its own RN16 with the first value.

[0088] Here, the first value is 0000000000000000.

[0089] Step 304: If the tag compares its own RN16 and finds that it is not the first value, the tag maintains the arbitration state.

[0090] Here, the arbitration state refers to tags that participate in the current access or inventory state but have a non-zero RN16 value.

[0091] Step 305: If the tag compares its own RN16 to the first value, the tag sends its own EPC code to the reader.

[0092] Step 306: The reader determines whether the device information is received within the first time period.

[0093] Step 307: If the reader receives the device information within the first time period, the reader determines whether a collision is detected during the EPC reception process.

[0094] Step 308: If the reader does not detect a collision during the process of receiving the EPC, the tag is successfully connected, and the reader records the EPC corresponding to the tag.

[0095] Step 309: The reader determines whether the second command has been sent 65535 times.

[0096] Here, the second command may be defined as a TraversalNext command, and 65535 is the maximum value of the random number RN16.

[0097] Step 310: The reader sends a second command, and the received tag subtracts 1 from RN16.

[0098] Here, when the reader / writer determines in step 306 that no device information is received within the first time period, step 310 is executed; when the reader / writer determines in step 307 that a collision is detected during the EPC reception process, step 310 is executed; when the reader / writer determines in step 309 that the second command is not sent 65535 times, step 310 is executed.

[0099] Step 311: After the reader sends the second command a total of 65535 times, the reader initiates a DFSA-based random access based on the number of tags to be identified.

[0100] Here, when the reader sends a total of 65535 second commands, it indicates that the first phase of the inventory is completed. The reader estimates the number of tags to be identified based on the recorded number of collision time slots, idle time slots and successful time slots, and generates an initial Q value based on the number of tags to be identified. The Q value is then used to send a Query command in accordance with protocol 18000-6C for traditional DFSA access, and finally the second phase of the inventory is completed.

[0101] Step 312: Access is completed.

[0102] In this way, by combining the traversal RN16 access method with the DFSA method, a label access process with granularity from large to small can be implemented.

[0103] Embodiment 2

[0104] Figure 4 , Figure 5 , Figure 6 The advantages of the embodiments of the present application in terms of recognition efficiency and energy efficiency compared with the classic anti-collision method are given respectively, where DFSA is a dynamic frame time slot ALOHA method. Specifically, since the reader performance and backscatter parameters (BLF, encoding method, etc.) have an impact on the actual access duration, the present application selects 3 groups of different parameters for simulation comparison under the assumption that the setting method and reader performance are consistent. The results are as follows: Figure 4 , Figure 5 , Figure 6 shown.

[0105] Figure 4 This is a simulation comparison diagram of the access method provided in the embodiment of the present application. Figure 1 ,like Figure 4 As shown, the time taken for a traditional DFSA tag to successfully access a single time slot is 13000us, and the time taken for a tag provided in an embodiment of the present application to successfully access a single time slot is 10000us, and other parameters such as the collision time slot and the idle time slot duration remain consistent. Figure 5 This is a simulation comparison diagram of the access method provided in the embodiment of the present application. Figure 2 ,like Figure 5 As shown, the time taken for a traditional DFSA tag to successfully access a single time slot is 12000us, and the time taken for a tag provided in an embodiment of the present application to successfully access a single time slot is 10000us, and other parameters such as the collision time slot and the idle time slot duration remain consistent. Figure 6 This is a simulation comparison diagram of the access method provided in the embodiment of the present application. Figure 3 ,like Figure 6 As shown, the time taken for a traditional DFSA tag to successfully access a single time slot is 6000us, and the time taken for a tag provided in an embodiment of the present application to successfully access a single time slot is 5000us, and other parameters such as the collision time slot and the idle time slot duration remain consistent.

[0106] Thus, compared with the traditional single access method, the embodiment of the present application introduces the flexibility of using different access methods for large-scale and small-scale tag access, thereby improving the system's inventory efficiency. Simulations show that even when the traditional DFSA algorithm is used to achieve the highest theoretical throughput of 36.8%, the present application still significantly improves the system access efficiency.

[0107] Figure 7This is a schematic diagram of the structure of the access device provided in the embodiment of the present application. Figure 1 , applied to terminal devices such as Figure 7 As shown, the access device 700 includes:

[0108] A sending unit 701 is used to send a first command, where the first command is used to trigger multiple second devices to generate random numbers; and to send a second command, where the second command is used to trigger the multiple second devices to reduce the value of their own random numbers by 1; wherein the value of the random number is used by the second device to determine whether to send the device information of the second device to the first device.

[0109] The determination unit 702 is used to count the number of collision time slots, the number of idle time slots and the number of successful time slots based on the reception result of the device information, and determine the number of the second devices based on the number of collision time slots, the number of idle time slots and the number of successful time slots.

[0110] The access unit 703 is configured to initiate a random access process based on the number of the second devices.

[0111] In some embodiments, the determination unit 702 is also used to determine that if the first device receives a device information in a time slot, then the time slot is a successful time slot; if the first device receives multiple device information in a time slot, then the time slot is determined to be a collision time slot; if the first device does not receive device information in a time slot, then the time slot is determined to be an idle time slot; based on the reception results of the device information in multiple time slots, the number of collision time slots, the number of idle time slots and the number of successful time slots are counted.

[0112] In some implementations, the sending unit 701 is further configured to send the second command multiple times, and the number of times the second command is sent is determined based on the maximum value of the random number.

[0113] In some implementations, the sending unit 701 is further configured to, after sending the second command once, wait for a first period of time before sending the second command next time.

[0114] In some embodiments, the determination unit 702 is also used to determine the time slot type of one or more time slots based on the reception result of the device information within the first time length, and the time slot type is a collision time slot, an idle time slot, or a successful time slot; based on the time slot type of the one or more time slots, the number of collision time slots, the number of idle time slots, and the number of successful time slots are counted.

[0115] In some implementations, the determining unit 702 is further used to determine a value of the first parameter based on the number of the second devices; the sending unit 701 is further used to send a query command carrying the first parameter, and the query command is used to trigger a round of random access process.

[0116] Those skilled in the art should understand that Figure 7 The implementation functions of each unit in the access device shown can be understood by referring to the relevant description of the aforementioned method. Figure 7 The functions of each unit in the access device shown can be implemented by a program running on a processor, or by a specific logic circuit.

[0117] Figure 8 This is a schematic diagram of the structure of the access device provided in the embodiment of the present application. Figure 2 , applied to network equipment, such as Figure 8 As shown, the access device 800 includes:

[0118] The receiving unit 801 is used to generate a random number after receiving a first command sent by a first device; after receiving a second command sent by the first device, the value of the random number itself is reduced by 1.

[0119] The determination unit 802 is used to determine whether to send the device information of the second device to the first device based on the value of the random number; wherein the reception result of the device information on the first device side is used by the first device to count the number of collision time slots, the number of idle time slots and the number of successful time slots, the number of collision time slots, the number of idle time slots and the number of successful time slots are used by the first device to determine the number of the second devices, and the number of the second devices is used by the first device to initiate a random access process.

[0120] In some embodiments, the determination unit 802 is further used to, if the value of the random number of the second device is a first value, determine that the second device sends the device information of the second device to the first device; if the value of the random number of the second device is not the first value, determine that the second device does not send the device information of the second device to the first device.

[0121] In some implementations, the receiving unit 801 is further configured to receive a second command sent multiple times by the first device, where the number of times the second command is sent is determined based on a maximum value of the random number.

[0122] In some implementations, the receiving unit 801 is further used to receive a query command carrying a first parameter sent by the first device, where the query command is used to trigger a round of random access process, and the value of the first parameter is determined based on the number of the second devices.

[0123] Those skilled in the art should understand that Figure 8 The implementation functions of each unit in the access device shown can be understood by referring to the relevant description of the aforementioned method. Figure 8The functions of each unit in the access device shown can be implemented by a program running on a processor, or by a specific logic circuit.

[0124] Fig. 9 900 is a schematic structural diagram of a communication device provided in an embodiment of the present application. The communication device may be a terminal device or a network device. Fig. 9 The communication device 900 shown includes a processor 910, which can call and run a computer program from a memory to implement the method in the embodiment of the present application.

[0125] Alternatively, if Fig. 9 As shown, the communication device 900 may further include a memory 920. The processor 910 may call and run a computer program from the memory 920 to implement the method in the embodiment of the present application.

[0126] The memory 920 may be a separate device independent of the processor 910 , or may be integrated into the processor 910 .

[0127] Alternatively, if Fig. 9 As shown, the communication device 900 may further include a transceiver 930, and the processor 910 may control the transceiver 930 to communicate with other devices, specifically, may send information or data to other devices, or receive information or data sent by other devices.

[0128] The transceiver 930 may include a transmitter and a receiver. The transceiver 930 may further include an antenna, and the number of antennas may be one or more.

[0129] Optionally, the communication device 900 may specifically be a network device of an embodiment of the present application, and the communication device 900 may implement corresponding processes implemented by the network device in each method of the embodiment of the present application, which will not be described in detail here for the sake of brevity.

[0130] Optionally, the communication device 900 may specifically be a mobile terminal / terminal device of an embodiment of the present application, and the communication device 900 may implement the corresponding processes implemented by the mobile terminal / terminal device in each method of the embodiment of the present application, which will not be described again for the sake of brevity.

[0131] It should be understood that the processor of the embodiment of the present application may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method embodiment can be completed by the hardware integrated logic circuit or software instructions in the processor. The above processor can be a general processor, a digital signal processor (Digital Signal Processor, DSP), an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general processor can be a microprocessor or the processor can also be any conventional processor. The steps of the method disclosed in the embodiment of the present application can be directly embodied as a hardware decoding processor to perform, or the hardware and software modules in the decoding processor are combined and performed. The software module can be located in a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, and other mature storage media in the art. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0132] It can be understood that the memory in the embodiments of the present application can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories. Among them, 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), or a flash memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct RAM bus random access memory (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0133] It should be understood that the above-mentioned memory is exemplary but not restrictive. For example, the memory in the embodiments of the present application may also be static random access memory (static RAM, SRAM), dynamic random access memory (dynamic RAM, DRAM), synchronous dynamic random access memory (synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous link dynamic random access memory (synch link DRAM, SLDRAM) and direct memory bus random access memory (Direct Rambus RAM, DR RAM), etc. That is to say, the memory in the embodiments of the present application is intended to include but not limited to these and any other suitable types of memory.

[0134] An embodiment of the present application also provides a computer-readable storage medium for storing a computer program.

[0135] Optionally, the computer-readable storage medium can be applied to the network device in the embodiments of the present application, and the computer program enables the computer to execute the corresponding processes implemented by the network device in the various methods of the embodiments of the present application. For the sake of brevity, they are not repeated here.

[0136] Optionally, the computer-readable storage medium can be applied to the mobile terminal / terminal device in the embodiments of the present application, and the computer program enables the computer to execute the corresponding processes implemented by the mobile terminal / terminal device in the various methods of the embodiments of the present application. For the sake of brevity, they are not repeated here.

[0137] An embodiment of the present application also provides a computer program product, including computer program instructions.

[0138] Optionally, the computer program product can be applied to the network device in the embodiments of the present application, and the computer program instructions enable the computer to execute the corresponding processes implemented by the network device in the various methods of the embodiments of the present application. For the sake of brevity, they are not repeated here.

[0139] Optionally, the computer program product can be applied to the mobile terminal / terminal device in the embodiments of the present application, and the computer program instructions enable the computer to execute the corresponding processes implemented by the mobile terminal / terminal device in the various methods of the embodiments of the present application. For the sake of brevity, they are not repeated here.

[0140] The embodiment of the present application also provides a computer program.

[0141] Optionally, the computer program can be applied to the network device in the embodiments of the present application. When the computer program runs on a computer, the computer executes the corresponding processes implemented by the network device in the various methods in the embodiments of the present application. For the sake of brevity, they are not described here.

[0142] Optionally, the computer program can be applied to the mobile terminal / terminal device in the embodiments of the present application. When the computer program runs on the computer, the computer executes the corresponding processes implemented by the mobile terminal / terminal device in the various methods of the embodiments of the present application. For the sake of brevity, they are not repeated here.

[0143] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0144] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0145] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0146] The units described as separate components may or may not be physically separated, and the components shown 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 solution of this embodiment.

[0147] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0148] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0149] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. An access method, characterized in that: The method comprises: The first device sends a first command, where the first command is used to trigger multiple second devices to generate random numbers; The first device sends a second command, where the second command is used to trigger the multiple second devices to reduce the value of their own random numbers by 1; wherein the value of the random number is used by the second device to determine whether to send the device information of the second device to the first device; The first device counts the number of collision time slots, the number of idle time slots and the number of successful time slots based on the reception result of the device information, and determines the number of the second devices based on the number of collision time slots, the number of idle time slots and the number of successful time slots; The first device initiates a random access procedure based on the number of the second devices.

2. The method according to claim 1, characterized in that The first device counts the number of collision time slots, the number of idle time slots and the number of successful time slots based on the reception result of the device information, including: If the first device receives a piece of device information in a time slot, determining the time slot as a successful time slot; If the first device receives multiple pieces of device information in one time slot, determining that the time slot is a collision time slot; If the first device does not receive device information in a time slot, determining that the time slot is an idle time slot; The first device counts the number of collision time slots, the number of idle time slots and the number of successful time slots based on the reception results of the device information in the multiple time slots.

3. The method according to claim 1, characterized in that: The first device sends a second command, including: The first device sends a second command multiple times, and the number of times the second command is sent is determined based on the maximum value of the random number.

4. The method according to claim 3, characterized in that: The first device sends the second command multiple times, including: After sending the second command once, the first device waits for a first period of time before sending the second command again.

5. The method according to claim 4, characterized in that The first device counts the number of collision time slots, the number of idle time slots and the number of successful time slots based on the reception result of the device information, including: The first device determines the time slot type of one or more time slots based on the reception result of the device information within the first time length, and the time slot type is a collision time slot, an idle time slot, or a success time slot; The first device counts the number of collision time slots, the number of idle time slots, and the number of successful time slots based on the time slot type of the one or more time slots.

6. The method according to any one of claims 1 to 5, characterized in that The first device initiating a random access process based on the number of the second devices, including: The first device determines a value of a first parameter based on the number of the second devices, and sends a query command carrying the first parameter, where the query command is used to trigger a round of random access process.

7. An access method, characterized in that: The method comprises: After receiving the first command sent by the first device, the second device generates a random number; After receiving the second command sent by the first device, the second device reduces the value of its own random number by 1; The second device determines whether to send the device information of the second device to the first device based on the value of the random number; wherein the result of receiving the device information on the first device side is used by the first device to count the number of collision time slots, the number of idle time slots and the number of successful time slots, the number of collision time slots, the number of idle time slots and the number of successful time slots are used by the first device to determine the number of the second devices, and the number of the second devices is used by the first device to initiate a random access process.

8. The method according to claim 7, characterized in that The second device determines, based on the value of the random number, whether to send the device information of the second device to the first device, including: If the value of the random number of the second device is the first value, the second device determines to send the device information of the second device to the first device; If the value of the random number of the second device is not the first value, the second device determines not to send the device information of the second device to the first device.

9. The method according to claim 7, characterized in that: The second device receiving the second command sent by the first device includes: The second device receives a second command sent multiple times by the first device, where the number of times the second command is sent is determined based on a maximum value of the random number.

10. The method according to any one of claims 7 to 9, characterized in that The method further comprises: The second device receives a query command carrying a first parameter sent by the first device, where the query command is used to trigger a round of random access process, and a value of the first parameter is determined based on the number of the second devices.

11. An access device, characterized in that: Applied to a first device, the apparatus comprises: A sending unit, configured to send a first command, wherein the first command is used to trigger multiple second devices to generate random numbers; and send a second command, wherein the second command is used to trigger the multiple second devices to reduce the value of their own random numbers by 1; wherein the value of the random number is used by the second device to determine whether to send the device information of the second device to the first device; a determining unit, configured to count the number of collision time slots, the number of idle time slots, and the number of successful time slots based on the reception result of the device information, and determine the number of the second devices based on the number of collision time slots, the number of idle time slots, and the number of successful time slots; An access unit is used to initiate a random access process based on the number of the second devices.

12. An access device, characterized in that: Applied to a second device, the apparatus comprises: A receiving unit, configured to generate a random number after receiving a first command sent by a first device; and to reduce the value of the random number by 1 after receiving a second command sent by the first device; A determination unit, used to determine whether to send device information of a second device to the first device based on the value of the random number; wherein the result of receiving the device information on the first device side is used by the first device to count the number of collision time slots, the number of idle time slots and the number of successful time slots, the number of collision time slots, the number of idle time slots and the number of successful time slots are used by the first device to determine the number of the second devices, and the number of the second devices is used by the first device to initiate a random access process.

13. A communication device, characterized in that: include: A processor and a memory, the memory being used to store a computer program, the processor being used to call and run the computer program stored in the memory to execute the method according to any one of claims 1 to 10.

14. A computer-readable storage medium, characterized in that: Used to store a computer program, wherein the computer program causes a computer to execute the method according to any one of claims 1 to 10.

15. A computer program product, characterized in that The method comprises computer program instructions which cause a computer to execute the method as claimed in any one of claims 1 to 10.

Images