A resource scheduling method and node

Abstract

The embodiment of the present application discloses a resource scheduling method and node, which relates to the field of communication technology. When a user generates burst data, each node can quickly allocate resources to soft resources in a distributed manner, reduce transmission delay, and reduce resource scheduling complexity. The method is as follows: a first node receives a first resource indication sent by a second node, the first resource indication is used to indicate the first resource selection of the second node to send data, and the first node is the superior node of the second node; the first node determines the second resource indication based on the first resource indication and the reserved resources of the node related to the second node, and the node related to the second node includes the first node, the neighboring nodes of the lower nodes of the first node that have the same level as the second node, and the superior node of the first node; the first node sends the second resource indication to the second node. The embodiment of the present application is used for resource scheduling between nodes in a network.

Description

Resource scheduling method and node Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a resource scheduling method and node. Background Art

[0002] A wireless mesh network (WMN) is a self-organizing, multi-hop wireless network capable of flexible networking to form a functional, self-healing network infrastructure. It supports mobile users while ensuring reliable information transmission over long distances. Due to its advantages, such as strong self-healing, scalability, reliability, and flexible networking, WMNs have attracted significant attention from both academia and industry, and are considered a key networking technology for B5G and 6G. Previous research on WMNs focused on random access WMNs. However, with the development of cellular networks, non-random access WMNs are becoming increasingly important. However, efficient resource scheduling methods for non-random WMNs are currently lacking. In non-random WMNs, time slot resources can generally be divided into two categories: hard slots and soft slots. Hard slots are used to transmit periodic services and are allocated by centralized resource management. Soft slots are used to transmit non-periodic bursty data. Slot locations are pre-assigned by centralized resource management and distributed based on data usage.

[0003] To utilize soft time slots to accommodate bursty data transmission, the current 5th Generation Mobile Communication Technology (5G) standard allocates resource blocks (RBs) within soft time slots using a serial allocation process. Specifically, for example, in an Integrated Access and Backhaul (IAB) mesh network, for all IAB nodes assigned a soft time slot, starting with the top (highest) IAB node, once IAB node 1 completes RB allocation, the lower-level IAB node 2 assigned the same soft time slot will continue to allocate RBs. However, the RBs already allocated by IAB node 1 cannot be used by IAB node 2. This allocation process repeats until the bottom (lowest) IAB node completes RB allocation, achieving orthogonal soft time slot allocation for each relay node. However, when the network scale is large, the serial allocation process can lead to significant delays, preventing IAB nodes generating bursty data from obtaining RB resources in a timely manner. Moreover, the serial allocation process can only avoid resource conflicts between adjacent IAB nodes. Resource conflicts still exist between non-adjacent IAB nodes. Usually, IAB donors are required to coordinate conflicts in the centralized stage or perform multiple rounds of signaling interactions in the distributed stage, which increases the scheduling complexity.

[0004] Summary of the Invention

[0005] The embodiments of the present application provide a resource scheduling method and node. When a user generates burst data, each node can quickly and distributively allocate soft resources, thereby reducing transmission delay and reducing resource scheduling complexity.

[0006] To achieve the above objectives, the present invention adopts the following technical solutions:

[0007] In a first aspect, a resource scheduling method is provided, which includes: a first node receives a first resource indication sent by a second node, the first resource indication is used to indicate a first resource selection for the second node to send data, and the first node is the superior node of the second node; the first node determines a second resource indication based on the first resource indication and reserved resources of nodes related to the second node, and the nodes related to the second node include the first node, nodes at the same level as the second node among the subordinate nodes of the first node, and the superior node of the first node; the first node sends a second resource indication to the second node, and the second resource indication is used for a second resource selection for the second node to send data.

[0008] The first node and the second node in this application can be, for example, distributed nodes in a Mesh network. The first node can be understood as the parent node of the second node. The resource can be understood as an RB resource, specifically a soft RB resource. In this application, the data sent by the second node can be understood as burst data. In this application, a node related to any node can be understood as a conflicting node related to any node. For example, when any node is the second node, a node related to the second node can be understood as a conflicting node related to the second node.

[0009] When the first node receives the first resource indication of the second node, the resource conflict can be eliminated according to the first resource indication and the reserved resources of the relevant conflicting nodes to obtain the second resource indication. In this way, the resource scheduling method provided by the present application enables each node to perform distributed resource scheduling in parallel. Only one signaling interaction (sending the first resource indication and receiving the second resource indication) is performed between the upper and lower nodes to complete the distributed resource scheduling, reducing the signaling transmission overhead and transmission delay. Moreover, this conflict elimination mechanism improves resource utilization and avoids the chain reaction of multi-hop network resource allocation.

[0010] In one possible design, when the reserved resource range of the second node meets the resource requirements for sending data by the second node, the resources indicated by the first resource indication are determined within the reserved resource range of the second node. Alternatively, when the reserved resource range of the second node does not meet the resource requirements for sending data by the second node, the resources indicated by the first resource indication are determined within the reserved resource range of the second node and the reserved resource range of at least one conflicting node related to the second node.

[0011] The reserved resource range corresponding to each node can be understood as the node's resource preference range, that is, the node can select RBs within the corresponding resource preference range. When a second node wants to make a resource request, if the RBs within the second node's resource preference range meet the resource requirements, RBs can be selected within the second node's resource preference range to determine the first resource indication. If the RBs within the second node's resource preference range do not meet the resource requirements, some RBs can be selected within the conflicting node's resource preference range, and the first resource indication is obtained by combining the RBs selected from the second node's own resource preference range and the RBs selected from the conflicting node's resource preference range.

[0012] In one possible design, before the first node receives the first resource indication sent by the second node, the method also includes: the first node receives a first conflict table configured by the centralized scheduling node, the first conflict table including indications of conflicting nodes related to subordinate nodes of the first node.

[0013] In this way, when the first node receives a resource request sent by the subordinate node (child node) of the first node, the first node can determine the conflict node related to the subordinate node according to the first conflict table, so as to determine whether a resource conflict occurs according to the resource preference range of the conflict node.

[0014] In one possible design, the first node determining the second resource indication based on the first resource indication and reserved resources of a conflicting node related to the second node includes:

[0015] If the first portion of the resources indicated by the first resource indication conflicts with the second portion of the resources within the reserved resource range of the first node's parent node, the first node determines a second resource indication, where the resources indicated by the second resource indication include the remaining resources after removing the first portion of the resources indicated by the first resource indication. This is equivalent to a conflict between the resources of the first node's parent node and the resources of the first node's child node. In this case, the first node can assign the conflicting resources to the parent node to eliminate the resource conflict.

[0016] If the first part of the resources indicated by the first resource indication conflicts with the second part of the resources in the reserved resource range of any other node, the first node determines a second resource indication, where the resources indicated by the second resource indication include the resources remaining after removing the first part of the resources from the resources indicated by the first resource indication. In other words, if it is not a resource conflict between a parent node and a child node, when the first node determines that the resources indicated by the first resource indication in the resource request of the second node conflict with the reserved resource range of any other node, the first node may assign the conflicting resources to any other node to eliminate the resource conflict.

[0017] If the first part of the resources indicated by the first resource indication conflicts with the second part of the resources occupied by the third node, and the second part of the resources is within the reserved resource range of the fourth node, the first node determines the second resource indication, and the resources indicated by the second resource indication include the third part of the resources indicated by the first resource indication that does not conflict with the second part of the resources, and the fourth part of the resources determined from the second part of the resources in proportion. In this case, that is, the first node determines that two nodes have requested RBs within the resource preference range of the third node, resulting in a resource conflict. If the third node itself does not select resources from the RBs in its own PB, resulting in a resource conflict, RBs can be allocated from the resource preference range of the third node based on the proportion of the resource requirements of the two nodes to eliminate the resource conflict between the two nodes.

[0018] In one possible design, the first node determines the second resource indication based on the first resource indication and the reserved resources of the conflicting node related to the second node, including: if the first part of the resources indicated by the first resource indication conflicts with the second part of the resources in the reserved resource range of the third node, then the first node determines the second resource indication according to the service priority of the second node and the service priority of the third node. When the service priority of the second node is higher than the service priority of the third node, the resources indicated by the second resource indication include the resources indicated by the first resource indication; when the service priority of the second node is lower than the service priority of the third node, the resources indicated by the second resource indication include the resources remaining after removing the first part of the resources from the resources indicated by the first resource indication.

[0019] In this design, for the last two cases in the previous possible design, when the first node has priority over the second node and the third node, and when there is a priority difference between the second node and the third node, the node corresponding to the high-priority service in the second node and the third node can preferentially occupy the resources of the conflicting part to eliminate resource conflicts.

[0020] In one possible design, for each of the first node's subordinate nodes, the first conflict table includes an indication of at least one conflicting node corresponding to each link in the links associated with each subordinate node, and an indication of a conflicting link corresponding to each conflicting node in the at least one conflicting node. For example, the first node is MAN1, and MAN1 stores a conflict table for the second node MAN3. For each link in MAN3, the conflict table includes a conflicting node corresponding to the link and a conflicting link under the conflicting node. When the first node is performing conflict resolution, it can determine whether the resources of the link that conflicts with the link in the request conflict based on the conflict table and the link in the resource request, thereby improving resource utilization.

[0021] In one possible design, when the first node receives the first resource indication sent by the second node, the method further includes: the first node receives a link indication sent by the second node, where the link indication is used to indicate at least one link occupied by the second node when sending data. The first node determines the second resource indication based on the first resource indication and the reserved resources of the conflicting node related to the second node, including: the first node determines the second resource indication based on the first resource indication and the resources of the conflicting link in the reserved resources of the conflicting node related to the second node that conflict with at least one link.

[0022] In this way, the first node can improve resource utilization according to whether resource conflicts occur between links, that is, resources can be reused as long as there are no conflicts between links.

[0023] In one possible design, the first node receives a first resource indication sent by the second node, including: the first node receives a resource request signaling sent by the second node, and the resource request signaling includes the first resource indication; the first node sends a second resource indication to the second node, including: the first node sends a conflict elimination signaling to the second node, and the conflict elimination signaling includes the second resource indication.

[0024] The resources occupied by the resource request signaling and the resources occupied by the conflict resolution signaling sent by the first node are pre-configured by the centralized scheduling node.

[0025] When the centralized scheduling node configures hard resources for each node to send control signaling such as resource request signaling and conflict resolution signaling, each node can send resource request signaling and conflict resolution signaling according to the configured hard resources. When the conflicting node sends resource request signaling or conflict resolution signaling, resource conflict will not occur. Nodes that do not conflict can also reuse resources to improve resource utilization.

[0026] In a second aspect, a resource scheduling method is provided, the method comprising: a second node sending a first resource indication to a first node, the first resource indication being used to indicate a first resource selection for the second node to send data, the first node being a superior node of the second node; and the second node receiving a second resource indication sent by the first node, the second resource indication being used to indicate a second resource selection for the second node to send data.

[0027] Among them, the second resource indication is determined by the first node based on the first resource indication and the reserved resources of the nodes related to the second node. The nodes related to the second node include the first node, the nodes at the same level as the second node among the lower-level nodes of the first node, and the upper-level node of the first node.

[0028] The beneficial effects of the second aspect can be found in the description of the first aspect.

[0029] In one possible design, the second node sending the first resource indication to the first node includes: the second node sending the first resource indication to the upper neighbor node and the lower neighbor node of the second node; wherein the upper neighbor node of the second node includes the first node and the third node.

[0030] The method further includes: the second node receiving a third resource indication sent by the third node, where the third resource indication is used to indicate a third resource selection for the second node to send data.

[0031] The superior neighbor node is the parent node of the second node, and the subordinate neighbor node is the child node of the second node. When the second node sends a resource request signaling, it can send it to both the parent node and the child node. The parent node resolves the resource conflict.

[0032] In one possible design, the method also includes: the second node determines the resources for sending data by the second node based on the second resource indication and the third resource indication; wherein the resources for sending data by the second node include overlapping resources in the second resource selection and the third resource selection.

[0033] That is, when the second node receives the resource selection ranges of at least two parent nodes, it may only select the same resources in the resource selection ranges of the at least two parent nodes to send data, so as to avoid resource conflicts.

[0034] In one possible design, before the second node sends the first resource indication, the method also includes: when the reserved resource range of the second node meets the resource requirements of the second node to send data, the second node determines the first resource indication based on the reserved resource range of the second node.

[0035] Or, when the reserved resource range of the second node does not meet the resource requirements of the second node for sending data, the second node determines the first resource indication based on the reserved resource range of the second node and the reserved resource range of at least one conflicting node related to the second node.

[0036] The beneficial effects of this design can be found in the description of the first aspect.

[0037] In one possible design, before the second node sends the first resource indication to the first node, the method also includes: the second node receives configuration information sent by the centralized scheduling node, the configuration information including the reserved resource range of the second node and the reserved resource range of the conflicting nodes related to the second node.

[0038] The beneficial effects of this design can be found in the description of the first aspect.

[0039] In one possible design, the second node sending the first resource indication to the first node includes: the second node sending resource request signaling to the first node, the resource request signaling including the first resource indication;

[0040] The second node receiving the second resource indication sent by the first node includes: the second node receiving conflict elimination signaling sent by the first node, the conflict elimination signaling including the second resource indication;

[0041] The resources occupied by the resource request signaling and the resources occupied by the conflict resolution signaling sent by the first node are pre-configured by the centralized scheduling node.

[0042] The beneficial effects of this design can be found in the description of the first aspect.

[0043] In one possible design, the method also includes: an indication of the service priority of the data sent by the second node to the first node, and the indication of the service priority is used by the first node to determine the second resource indication based on the service priority of the data sent by the first node and the service priority of the conflicting node with the second node when the first node determines that the first resource indication conflicts with the reserved resource range of the conflicting node with the second node.

[0044] The beneficial effects of this design can be found in the description of the first aspect.

[0045] According to a third aspect, a resource scheduling method is provided, the method comprising: determining, by a centralized scheduling node, reserved resource ranges corresponding to a plurality of distributed nodes, and a reserved resource range of a node associated with each of the plurality of distributed nodes. The centralized scheduling node sends, to a first node, the reserved resource range corresponding to the first node and the reserved resource ranges of nodes associated with the first node, wherein the nodes associated with the first node include an upper-level node of the first node, nodes at the same level as the first node and adjacent to the first node, and nodes at a higher level than the upper-level node of the first node.

[0046] The first node is a distributed node among multiple distributed nodes, and the reserved resource range corresponding to the first node and the reserved resource range of nodes related to the first node are used for resource selection when the first node sends data.

[0047] In this way, when the first node wants to send data, the first node can determine the resource selection of the first node based on the reserved resource range corresponding to the first node and the reserved resource range of the conflicting node related to the first node, and send the resource selection of the first node to the upper node and the lower node of the first node. For the upper node of the first node, the upper node of the first node can eliminate resource conflicts based on the resource selection of the first node, so that when the first node sends data, it does not generate resource conflicts with the resources of the conflicting node of the first node.

[0048] In one possible design, the method further includes: the centralized scheduling node configuring a conflict table for each distributed node. For a first node, the first conflict table corresponding to the first node includes an indication of conflicting nodes associated with subordinate nodes of the first node. When the subordinate node of the first node includes a second node, the conflicting nodes associated with the second node include the first node, nodes of the first node's subordinate nodes that are at the same level as the second node, and the first node's superior node.

[0049] The beneficial effects of this design can be found in the description of the first aspect.

[0050] In one possible design, for each subordinate node of the first node, the first conflict table includes an indication of at least one conflicting node corresponding to each link in the links associated with each subordinate node, and an indication of a conflicting link corresponding to each conflicting node in the at least one conflicting node.

[0051] In one possible design, the method further includes: the centralized scheduling node determining, based on the first conflict table, resources occupied by the second node when sending resource request signaling to the first node, and resources occupied by the first node when sending conflict resolution signaling to the second node, where the second node is a subordinate node of the first node. The centralized scheduling node sends first configuration information to the second node, the first configuration information including an indication of resources occupied when the second node sends resource request signaling to the first node; and the centralized scheduling node sends second configuration information to the first node, the second configuration information including an indication of resources occupied when the first node sends conflict resolution signaling to the second node.

[0052] The first node may be the parent node of the second node. When the second node wants to send resource request signaling to the first node, it may determine the resource for the resource request signaling according to the first configuration information, and send the resource request signaling to the first node on the determined resource for the resource request signaling. When the first node sends conflict elimination signaling to the second node, it may determine the resource for the conflict elimination signaling according to the second configuration information, and send the conflict elimination signaling to the second node on the determined resource for the conflict elimination signaling. In this way, the first node and the second node send signaling according to the resource for the control signaling configured by the centralized scheduling node, which can avoid resource conflicts when related conflicting nodes send control signaling at the same time.

[0053] In a fourth aspect, a first node is provided, comprising: a receiving unit configured to receive a first resource indication sent by a second node, the first resource indication being used to indicate a first resource selection for the second node to send data, wherein the first node is a superior node of the second node; a determining unit configured to determine a second resource indication based on the first resource indication and reserved resources of nodes related to the second node, wherein the nodes related to the second node include the first node, nodes at the same level as the second node among subordinate nodes of the first node, and the superior node of the first node; and a sending unit configured to send a second resource indication to the second node, the second resource indication being used to indicate a second resource selection for the second node to send data.

[0054] The beneficial effects of the fourth aspect can be found in the description of the first aspect.

[0055] In one possible design, when the reserved resource range of the second node meets the resource requirements for sending data by the second node, the resources indicated by the first resource indication are determined within the reserved resource range of the second node. Alternatively, when the reserved resource range of the second node does not meet the resource requirements for sending data by the second node, the resources indicated by the first resource indication are determined within the reserved resource range of the second node and the reserved resource range of at least one conflicting node related to the second node.

[0056] In one possible design, before the first node receives the first resource indication sent by the second node, the receiving unit is further used to: receive a first conflict table configured by the centralized scheduling node, the first conflict table including indications of conflicting nodes related to subordinate nodes of the first node.

[0057] In one possible design, the determination unit is used to:

[0058] If a first portion of resources in the resources indicated by the first resource indication conflicts with a second portion of resources in a reserved resource range of an upper-level node of the first node, the first node determines a second resource indication, where the resources indicated by the second resource indication include resources remaining after removing the first portion of resources from the resources indicated by the first resource indication;

[0059] If a first portion of resources in the resources indicated by the first resource indication conflicts with a second portion of resources in the reserved resource range of any other node, the first node determines a second resource indication, where the resources indicated by the second resource indication include resources remaining after removing the first portion of resources from the resources indicated by the first resource indication;

[0060] If the first part of the resources indicated by the first resource indication conflicts with the second part of the resources occupied by the third node, and the second part of the resources is within the reserved resource range of the fourth node, the first node determines the second resource indication, and the resources indicated by the second resource indication include the third part of the resources indicated by the first resource indication that does not conflict with the second part of the resources, and the fourth part of the resources determined from the second part of the resources in proportion.

[0061] In one possible design, the determination unit is configured to: if a first portion of resources in the resources indicated by the first resource indication conflicts with a second portion of resources in the reserved resource range of the third node, then the first node determines the second resource indication according to the service priority of the second node and the service priority of the third node. When the service priority of the second node is higher than the service priority of the third node, the resources indicated by the second resource indication include the resources indicated by the first resource indication; and when the service priority of the second node is lower than the service priority of the third node, the resources indicated by the second resource indication include the resources remaining after removing the first portion of resources from the resources indicated by the first resource indication.

[0062] In one possible design, for each subordinate node of the first node, the first conflict table includes an indication of at least one conflicting node corresponding to each link in the links associated with each subordinate node, and an indication of a conflicting link corresponding to each conflicting node in the at least one conflicting node.

[0063] In one possible design, the receiving unit is further configured to: the first node receive a link indication sent by the second node, where the link indication is used to indicate at least one link occupied by the second node when sending data. The determining unit is further configured to: the first node determine a second resource indication based on the first resource indication and resources of a conflicting link that conflicts with the at least one link in reserved resources of a conflicting node associated with the second node.

[0064] In one possible design, the receiving unit is further configured to: receive, by the first node, resource request signaling sent by the second node, the resource request signaling including a first resource indication; and transmit, by the first node, a second resource indication to the second node, the first node transmitting, by the second node, conflict resolution signaling, the conflict resolution signaling including the second resource indication. The resources occupied by the resource request signaling and the resources occupied by the conflict resolution signaling transmitted by the first node are preconfigured by the centralized scheduling node.

[0065] In a fifth aspect, a second node is provided, the second node comprising: a sending unit configured to send a first resource indication to a first node, the first resource indication being used to indicate a first resource selection for the second node to send data, the first node being an upper-level node of the second node. A receiving unit configured to receive a second resource indication sent by the first node, the second resource indication being used to indicate a second resource selection for the second node to send data. The second resource indication is determined by the first node based on the first resource indication and reserved resources of nodes related to the second node, the nodes related to the second node comprising the first node, nodes at the same level as the second node among lower-level nodes of the first node, and an upper-level node of the first node.

[0066] The beneficial effects of the fifth aspect can be found in the description of the second aspect.

[0067] In one possible design, the sending unit is configured to send a first resource indication to an upper-level neighbor node and a lower-level neighbor node of a second node, wherein the upper-level neighbor node of the second node includes the first node and a third node. The receiving unit is further configured to receive a third resource indication sent by the third node, wherein the third resource indication is configured to indicate a third resource selection for the second node to transmit data.

[0068] In one possible design, a determination unit is further included, which is used to determine the resources for the second node to send data based on the second resource indication and the third resource indication; wherein the resources for the second node to send data include overlapping resources in the second resource selection and the third resource selection.

[0069] In one possible design, the determination unit is also used to determine the first resource indication based on the reserved resource range of the second node when the reserved resource range of the second node meets the resource requirements of the second node for sending data.

[0070] Or, the determination unit is also used to determine the first resource indication based on the reserved resource range of the second node and the reserved resource range of at least one conflicting node related to the second node when the reserved resource range of the second node does not meet the resource requirements of the second node for sending data.

[0071] In one possible design, before the second node sends the first resource indication to the first node, the receiving unit is also used to: receive configuration information sent by the centralized scheduling node, the configuration information including the reserved resource range of the second node and the reserved resource range of the conflicting nodes related to the second node.

[0072] In one possible design, the sending unit is configured to send a resource request signaling to the first node, where the resource request signaling includes a first resource indication. The receiving unit is configured to receive a conflict elimination signaling sent by the first node, where the conflict elimination signaling includes a second resource indication.

[0073] The resources occupied by the resource request signaling and the resources occupied by the conflict resolution signaling sent by the first node are pre-configured by the centralized scheduling node.

[0074] In one possible design, the sending unit is also used to: send an indication of the service priority of data to the first node, and the indication of the service priority is used by the first node to determine the second resource indication based on the service priority of the data sent by the first node and the service priority of the conflicting node with the second node when the first node determines that the first resource indication conflicts with the reserved resource range of the conflicting node with the second node.

[0075] In a sixth aspect, a centralized scheduling node is provided, comprising a configuration unit configured to determine a reserved resource range corresponding to each of a plurality of distributed nodes and a reserved resource range of a node associated with each of the plurality of distributed nodes. A sending unit configured to send, to a first node, the reserved resource range corresponding to the first node and the reserved resource range of nodes associated with the first node, wherein the nodes associated with the first node include an upper-level node of the first node, nodes at the same level as the first node and adjacent to the first node, and nodes at a higher level than the upper-level node of the first node.

[0076] The beneficial effects of the sixth aspect can be found in the description of the third aspect.

[0077] The first node is a distributed node among multiple distributed nodes, and the reserved resource range corresponding to the first node and the reserved resource range of nodes related to the first node are used for resource selection when the first node sends data.

[0078] In one possible design, the configuration unit is further configured to: configure a conflict table for each distributed node at the centralized scheduling node. For a first node, the first conflict table corresponding to the first node includes an indication of conflicting nodes associated with subordinate nodes of the first node. When the subordinate node of the first node includes a second node, the conflicting nodes associated with the second node include the first node, nodes at the same level as the second node among the subordinate nodes of the first node, and the superior node of the first node.

[0079] In one possible design, for each subordinate node of the first node, the first conflict table includes an indication of at least one conflicting node corresponding to each link in the links associated with each subordinate node, and an indication of a conflicting link corresponding to each conflicting node in the at least one conflicting node.

[0080] In one possible design, the configuration unit is further configured to: determine, based on the first conflict table, the resources occupied by the second node when sending resource request signaling to the first node, and the resources occupied by the first node when sending conflict resolution signaling to the second node, where the second node is a subordinate node of the first node. The sending unit is configured to send first configuration information to the first node, the first configuration information including an indication of the resources occupied when the first node sends conflict resolution signaling to the second node; and the sending unit is further configured to send second configuration information to the second node, the second configuration information including an indication of the resources occupied when the second node sends resource request signaling to the first node.

[0081] In a seventh aspect, a distributed node is provided. The distributed node comprises: a transceiver, a memory, and a processor, wherein the memory, the transceiver, and the processor are coupled. The memory is configured to store computer program code, wherein the computer program code comprises computer instructions. The transceiver is configured to receive and transmit data. When the processor executes the computer instructions, the distributed node executes the resource scheduling method described in the first aspect and any possible design of the first aspect.

[0082] In an eighth aspect, a distributed node is provided, comprising: a transceiver, a memory, and a processor, wherein the memory, the transceiver, and the processor are coupled. The memory is configured to store computer program code, wherein the computer program code comprises computer instructions. The transceiver is configured to receive and transmit data. When the processor executes the computer instructions, the distributed node performs the resource scheduling method described in the second aspect and any possible design of the second aspect.

[0083] In a ninth aspect, a distributed node is provided, comprising: a transceiver, a memory, and a processor, wherein the memory, the transceiver, and the processor are coupled. The memory is configured to store computer program code, wherein the computer program code comprises computer instructions. The transceiver is configured to receive and transmit data. When the processor executes the computer instructions, the distributed node performs the resource scheduling method described in the third aspect and any possible design of the third aspect.

[0084] In a tenth aspect, a chip is provided, which is coupled to a memory and is used to read and execute program instructions stored in the memory to implement the resource scheduling method as described in the first aspect or any one of the first aspects.

[0085] In an eleventh aspect, a chip is provided, which is coupled to a memory and is used to read and execute program instructions stored in the memory to implement the resource scheduling method as described in the second aspect or any one of the second aspects.

[0086] In a twelfth aspect, a chip is provided, which is coupled to a memory and is used to read and execute program instructions stored in the memory to implement the resource scheduling method as described in the third aspect or any one of the third aspects above.

[0087] In a thirteenth aspect, an embodiment of the present application provides a communication device, which is included in an electronic device, and has the function of implementing the behavior of the first node in the above-mentioned first aspect and any possible implementation method. This function can be implemented by hardware, or by hardware executing corresponding software implementation. The hardware or software includes one or more modules or units corresponding to the above-mentioned functions. For example, a determination module or unit, a sending module or unit, a receiving module or unit, etc.

[0088] In a fourteenth aspect, an embodiment of the present application provides a communication device, which is included in an electronic device, and has the function of implementing the behavior of the first node in the second aspect and any possible implementation method. This function can be implemented by hardware, or by hardware executing corresponding software implementation. The hardware or software includes one or more modules or units corresponding to the above functions. For example, a determination module or unit, a sending module or unit, a receiving module or unit, etc.

[0089] In a fifteenth aspect, an embodiment of the present application provides a communication device, which is included in an electronic device, and the device has the function of implementing the behavior of the first node in the third aspect and any possible implementation method. This function can be implemented by hardware, or by hardware executing corresponding software implementation. The hardware or software includes one or more modules or units corresponding to the above functions. For example, a configuration module or unit, a sending module or unit, a receiving module or unit, etc.

[0090] In the sixteenth aspect, an embodiment of the present application provides a computer-readable storage medium, including computer instructions. When the computer instructions are executed on an electronic device, the electronic device executes the resource scheduling method in the above-mentioned first aspect and any possible implementation method.

[0091] In the seventeenth aspect, an embodiment of the present application provides a computer-readable storage medium, including computer instructions. When the computer instructions are executed on an electronic device, the electronic device executes the resource scheduling method in the above-mentioned second aspect and any possible implementation method.

[0092] In the eighteenth aspect, an embodiment of the present application provides a computer-readable storage medium, including computer instructions. When the computer instructions are executed on an electronic device, the electronic device executes the resource scheduling method in the above-mentioned third aspect and any possible implementation method.

[0093] In the nineteenth aspect, an embodiment of the present application provides a computer program product, which, when running on a computer or processor, enables the computer or processor to execute the resource scheduling method in the above-mentioned first aspect and any possible implementation method.

[0094] In the twentieth aspect, an embodiment of the present application provides a computer program product, which, when running on a computer or processor, enables the computer or processor to execute the resource scheduling method in the above-mentioned second aspect and any possible implementation method.

[0095] In the twenty-first aspect, an embodiment of the present application provides a computer program product, which, when running on a computer or processor, enables the computer or processor to execute the resource scheduling method in the above-mentioned third aspect and any possible implementation method.

[0096] It can be understood that any of the first nodes, second nodes, centralized scheduling nodes, chips, communication devices, computer-readable storage media or computer program products provided above can be applied to the corresponding methods provided above. Therefore, the beneficial effects that can be achieved can refer to the beneficial effects in the corresponding methods and will not be repeated here.

[0097] These and other aspects of the present application will become more readily apparent from the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0098] FIG1 is a schematic diagram of a process in which RB allocation in a soft timeslot follows serial allocation, provided by an embodiment of the present application;

[0099] FIG2 is a schematic diagram of a network architecture provided in an embodiment of the present application;

[0100] FIG3 is a schematic diagram of a network architecture provided in an embodiment of the present application;

[0101] FIG4 is a flow chart of a resource scheduling method provided in an embodiment of the present application;

[0102] FIG5 is a flow chart of a resource scheduling method provided in an embodiment of the present application;

[0103] FIG6 is a flow chart of a resource scheduling method provided in an embodiment of the present application;

[0104] FIG7 is a schematic diagram of a flow chart of a resource scheduling method provided in an embodiment of the present application;

[0105] FIG8 is a schematic diagram of resource allocation provided in an embodiment of the present application;

[0106] FIG9 is a schematic diagram of resource allocation of a control portion in the Mesh topology shown in FIG3 according to an embodiment of the present application;

[0107] FIG10 is a schematic diagram of a centralized scheduling of data hard resources provided in an embodiment of the present application;

[0108] FIG11 is a schematic diagram of data soft resources of MAN1 and MAN3 provided in an embodiment of the present application;

[0109] FIG12 is a schematic diagram of PB allocation of soft resources in a distributed cycle provided by an embodiment of the present application;

[0110] FIG13 is a schematic diagram of RB resource ranges of PBs of a Mesh gateway, MAN1, MAN2, and MAN4, and a schematic diagram of RB resource occupation by each when making a resource request, provided in an embodiment of the present application;

[0111] FIG14 is a schematic diagram of conflict resolution provided by an embodiment of the present application;

[0112] FIG15 is a schematic diagram of a distributed resource scheduling process provided by an embodiment of the present application;

[0113] FIG16 is a schematic diagram of a possible composition of a distributed node provided in an embodiment of the present application;

[0114] FIG17 is a schematic diagram of possible components of a MAN provided in an embodiment of the present application;

[0115] FIG18 is a schematic diagram of a possible composition of a centralized scheduling node provided in an embodiment of the present application. DETAILED DESCRIPTION

[0116] The technical solutions in the embodiments of the present application will be described below in conjunction with the accompanying drawings in the embodiments of the present application. In the description of the embodiments of the present application, unless otherwise specified, " / " means or, for example, A / B can mean A or B; "and / or" in this article is merely a description of the association relationship of associated objects, indicating that three relationships can exist, for example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, in the description of the embodiments of the present application, "multiple" means two or more than two.

[0117] In the following, the terms "first" and "second" are used for descriptive purposes only and should not be understood to indicate or imply relative importance or implicitly specify the number of the technical features indicated. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features. In the description of this embodiment, unless otherwise specified, "plurality" means two or more.

[0118] To meet the surging transmission demands in wireless networks, the network architecture of 5G / 6th generation mobile networks (6G) is evolving from single-hop networks to multi-hop mesh networks. For example, the IAB network defined in 3rd Generation Partnership Project (3GPP) TS 38.174 is a multi-hop wireless mesh network. 3GPP will also standardize multi-hop extensions for sidelinks in its upcoming standards, such as 3GPP TR 38.836, which standardizes sidelink relays.

[0119] Regarding data transmission and resource management in mesh networks, in addition to random access mesh network resource management based on the Institute of Electrical and Electronics Engineers (IEEE) 802.11 series of standards, many major networks currently utilize non-random access mesh networks to support data transmission, such as IAB networks. Non-random mesh networks can better ensure the Quality of Service (QoS) of periodic data transmission within the network through centralized scheduling. However, current networks experience a large amount of bursty data traffic, such as video services. For bursty data, non-random mesh networks face significant challenges in resource management flexibility and efficiency. Using centralized scheduling to handle bursty data would result in significant latency and fail to promptly meet the transmission latency requirements of bursty data. Current distributed scheduling, however, faces challenges such as low resource utilization, high contention rates, high signaling overhead, and chain reactions, making it unsuitable for large-scale mesh networks.

[0120] The current 5G NR standard designs a resource management architecture that combines centralized and distributed management for IAB networks, a non-random access mesh network. IAB nodes have a parent-child relationship, with IAB link resources managed by the parent node. IAB donor nodes (equivalent to the mesh gateway in a mesh network) allocate time slot resources to IAB nodes. In each time slot, the IAB node determines the specific resource blocks used by child IAB nodes and access terminals.

[0121] Among them, time slot resources in the IAB network are divided into two categories: hard time slots and soft time slots.

[0122] Hard timeslots are used to transmit periodic services and are allocated by centralized resource management. During a hard timeslot, an IAB parent node can directly utilize all RBs corresponding to the hard timeslot to communicate with its child IAB nodes and access terminals. The IAB donor ensures that no other IAB nodes (collision IAB nodes) use the same hard timeslot, potentially interfering with each other.

[0123] Soft slots are used to transmit non-periodic bursty data. Soft slot locations are pre-allocated by centralized resource management, and their specific usage is distributed based on data requests. When an IAB node is allocated a soft slot, it is shared with other conflicting IAB nodes. Therefore, potential resource conflicts may arise when IAB nodes allocate RBs in shared soft slots. Therefore, for an IAB node, the availability of RBs in a soft slot is determined in a distributed manner by its parent IAB node based on data requests.

[0124] To utilize soft slots for burst data transmission, RB allocation in soft slots currently follows a serial allocation process. This process requires that when an IAB node determines available RB resources, it must begin with the IAB node at the top of the topology (the highest level in the hierarchy) where the IAB node resides and determine which RBs are available that are not in use by any other upper-level IAB node. Figure 1 illustrates the serial allocation process for RB allocation in soft slots. IAB nodes include distributed units (DUs) and mobile terminals (MTs). For example, IAB node 1 is at the highest level in the hierarchy. For the downlink, when IAB node 1's DU allocates all DH (downlink hard resources) RB resources, IAB node 2 and lower-level nodes can no longer occupy DH RB resources. DUs can then allocate resources within FS (uplink and downlink soft resources). If IAB node 2 and upper-level nodes occupy but have not fully occupied DU FS RB resources, IAB node 3 can continue to allocate DU FS RB resources. Similarly, if IAB node 3 and upper nodes occupy some RB resources in MTF but not all of them, IAB node 4 can continue to allocate some RB resources in MTF that are not fully occupied. The uplink RB resource allocation process is similar to that of the downlink.

[0125] As can be seen, when the IAB network scales large, the aforementioned serial allocation process results in significant latency, preventing IAB nodes generating bursty data from acquiring resources in a timely manner. Furthermore, this serial allocation process only effectively avoids conflicts between adjacent IAB nodes and cannot resolve conflicts between unconnected IAB nodes (but within mutual interference range). Therefore, it typically requires IAB donors to coordinate conflicts in a centralized phase or multiple rounds of signaling interactions in a distributed phase, resulting in high scheduling complexity. Furthermore, each parent node only allows its child nodes to use its remaining unused resources, eliminating resource reuse and resulting in low resource utilization.

[0126] In another technique, a centralized scheduling node performs statistical analysis on burst data from nodes and centrally allocates all RB resources based on historical burst statistics. However, this centralized resource allocation approach can result in significant resource waste when burst data statistics are difficult to obtain or when burst data lacks good statistical characteristics.

[0127] In this regard, the present application proposes a resource scheduling method and node. When a user generates burst data, each IAB node or the Mesh Access Node (MAN) in the Mesh network can quickly allocate resources in the network in a distributed manner, rather than the top-down serial resource allocation shown in Figure 1. This can reduce the transmission delay of burst data and improve resource utilization.

[0128] Moreover, the present application performs distributed resource scheduling for burst data, which can respond to changes in burst data in real time and achieve higher resource utilization.

[0129] In other words, this application is aimed at designing a distributed resource management mechanism for non-random access Mesh networks that can both guarantee the QoS requirements of periodic services and flexibly allocate resources for non-periodic burst data. In some embodiments, this application is mainly aimed at static Mesh networks or Mesh networks with low mobility, such as IAB networks.

[0130] In other words, scheduling bursty data in non-random access mesh networks is a fundamental and critical issue for improving mesh network performance. Existing technologies lack a mechanism to truly address this issue, resulting in significant resource access latency, unavoidable resource conflicts, chain reactions, and high resource access complexity.

[0131] The resource scheduling method proposed in this application can be understood as a distributed resource scheduling solution assisted by a centralized mechanism. When a MAN needs to reserve resources for bursty data, it can do so in a distributed and parallel manner, without having to wait for other nodes to allocate resources. Once each MAN reserves resources, resource conflicts can be resolved quickly and distributedly, minimizing signaling interactions with neighboring nodes and eliminating the need for direct mesh gateway conflict resolution. This leverages the advantages of mesh gateways and simplifies the complexity of distributed resource reservation and conflict resolution.

[0132] Based on this, in the resource scheduling method of the present application, a centralized assisted distributed resource scheduling mechanism can be implemented in the following manner.

[0133] 1) Constructing resource management hierarchies and establishing conflict tables: Given a topology, the Mesh Gateway constructs a multi-level hierarchical architecture with upper and lower management relationships for all MANs in the network. Based on the resource management hierarchy, the Mesh Gateway establishes a conflict table for each MAN containing all conflict relationships of the next-level nodes.

[0134] 2) Centralized assisted control signaling, periodic data resource allocation, and resource preference configuration (centralized scheduling period, large time scale). Specifically, the Mesh Gateway performs centralized hard resource allocation for control signaling and periodic data on a large time scale to ensure that control signaling and periodic data transmission resources do not conflict; the Mesh Gateway allocates an optional range of soft resources for burst data and configures resource preferences for each MAN within the optional range of soft resources (which can be understood as the reserved resource range below) to support distributed resource scheduling and conflict resolution;

[0135] 3) Distributed resource scheduling and conflict resolution mechanism based on resource preferences (distributed scheduling period, small time scale). Specifically, each MAN distributes soft resource occupation requests within and outside the preferences to the upper-level node based on the traffic volume of burst data. Each MAN also performs conflict resolution for the resource occupation requests of subordinate MANs based on the conflict table.

[0136] In this way, the present application can quickly implement distributed soft resource scheduling for burst data in a non-random Mesh network, thereby reducing the transmission delay of burst data and improving the utilization of network time and frequency resources.

[0137] As shown in Figure 2, the network architecture of the present application may include a centralized scheduling node 20, multiple distributed nodes 21, and multiple terminal nodes 22 connected to each distributed node 21. The terminal nodes 22 may be connected to the distributed nodes 21 via wireless links, and then connected to the external network through the centralized scheduling node 20.

[0138] When the network architecture is applied in a Mesh network, as shown in FIG3 , the centralized scheduling node 20 may be a Mesh gateway (gateway 30 in FIG3 ), the multiple distributed nodes 21 may be multiple MANs, and the end node 22 may be a user terminal.

[0139] A mesh gateway is connected to multiple MANs. For example, the mesh gateway is connected to multiple MANs (MAN1 to MAN9), each of which is connected to multiple user terminals (for example, MAN6 is connected to user terminals 31 to 33). User terminals can connect to the mesh gateway via multi-hop MANs, forming a mesh topology for the entire network. The mesh network is connected to the external network through the mesh gateway. User terminals transmit periodic and bursty data to the external network, including uplink and downlink data.

[0140] The MAN provides services to user terminals or relays data from other MANs. For example, in an IAB network, the MAN may be an IAB node.

[0141] A mesh gateway is a portal that connects a mesh network to other networks and is responsible for the centralized management, control, and scheduling of the mesh network. This mesh gateway can also be considered a specialized MAN. For example, in an IAB network, a mesh gateway can be an IAB donor node.

[0142] A user terminal is a user equipment (UE) connected to a MAN and can generate uplink data to an external network or receive downlink data from an external network. For example, in an IAB network, a user terminal can be a user equipment in the IAB network.

[0143] Applying the network architecture provided by this application, the embodiments of this application are introduced below.

[0144] Figure 4 is a flow chart of a resource scheduling method provided by this application. The method includes the following process.

[0145] 401. A first node receives a first resource indication sent by a second node, where the first resource indication is used to indicate a first resource selection for the second node to send data, and the first node is an upper-level node of the second node.

[0146] The first node and the second node can be understood as distributed nodes under a centralized scheduling node. The resources here can be understood as RB resources in soft time slot resources (hereinafter referred to as soft resources). The data sent by the second node can be understood as burst data. The embodiments of the present application are described using burst data as an example.

[0147] The first resource selection can be understood as the second node determining the resource range based on the reserved resource range configured for the second node by the centralized scheduling node and the reserved resource ranges of the conflicting nodes associated with the second node. The specific method for determining this selection will be illustrated below with examples. When the second node generates and transmits burst data, it first determines its own first resource range and sends a first resource indication to its superior node, the first node, so that the first node can determine how to resolve the resource conflict between the second node and the conflicting node based on the first resource range.

[0148] In some embodiments, the second node may further send a first resource indication to a subordinate node of the second node, ie, a child node, so that the subordinate node of the second node can determine whether a resource conflict occurs between the subordinate node and its child node according to the first resource indication.

[0149] 402. The first node determines the second resource indication based on the first resource indication and the reserved resources of the nodes related to the second node, where the nodes related to the second node include the first node, the nodes at the same level as the second node among the subordinate nodes of the first node, and the superior node of the first node.

[0150] The first node can be understood as a node that eliminates resource conflicts with the second node. A node associated with the second node can be understood as a conflicting node associated with the second node. The first node can eliminate resource conflicts based on the first resource selection determined by the second node and the reserved resources of the conflicting nodes associated with the second node stored by the first node, thereby obtaining a second resource indication.

[0151] For example, it is assumed that the first node is MAN1 in the network architecture of Figure 3, and the second node is MAN3 in the network architecture of Figure 3. MAN1 stores the conflict relationship between MAN1's ​​subordinate nodes MAN3 and MAN4. Among them, MAN3's conflicting nodes include the neighboring node MAN4 at the same level as MAN3, and the upper-level nodes MAN1 and Mesh gateway at a higher level than MAN3. In other words, the resources of MAN1, MAN4 and Mesh gateway when transmitting burst data may conflict with the resources of MAN3 when transmitting burst data. When MAN1 receives the first resource indication from MAN3, MAN1 can eliminate the resource conflict based on the conflict relationship of MAN3 and obtain the second resource indication.

[0152] 403. The first node sends a second resource indication to the second node, where the second resource indication is used for a second resource selection for the second node to send data.

[0153] In this way, when the second node receives the second resource indication after resource conflict is eliminated by the first node, the second node can send burst data on the resources indicated by the second resource indication after conflict is eliminated, and no resource conflict occurs.

[0154] Therefore, the resource scheduling method provided by this application enables distributed resource scheduling to be performed in parallel on each node. Distributed resource scheduling can be completed with only one signaling interaction between the upper and lower nodes (sending a first resource indication and receiving a second resource indication), reducing signaling transmission overhead and transmission latency. Furthermore, this conflict resolution mechanism improves resource utilization and avoids chain reactions in multi-hop network resource allocation.

[0155] Corresponding to the flowchart shown in Figure 4, Figure 5 is a schematic flow chart of a resource scheduling method provided by this application. The method includes the following process.

[0156] 501. A second node sends a first resource indication to a first node, where the first resource indication is used to indicate a first resource selection for the second node to send data. The first node is an upper-level node of the second node.

[0157] The implementation of step 501 can refer to the description of step 401.

[0158] 502. The second node receives a second resource indication sent by the first node, where the second resource indication is used for a second resource selection for the second node to send data.

[0159] Among them, the second resource indication is determined by the first node based on the first resource indication and the reserved resources of the conflicting nodes related to the second node. The conflicting nodes related to the second node include the first node, the nodes at the same level as the second node among the subordinate nodes of the first node, and the superior node of the first node.

[0160] The implementation of step 502 can refer to the description of steps 402 and 403.

[0161] The resource scheduling method provided in this embodiment can achieve the same technical effect as the resource scheduling method corresponding to FIG4 .

[0162] Corresponding to the processes shown in Figure 4 and Figure 5 , Figure 6 is a schematic flow chart of a resource scheduling method provided by the present application. The method includes the following processes.

[0163] 601. A centralized scheduling node determines reserved resource ranges corresponding to a plurality of distributed nodes, and a reserved resource range of a node associated with each of the plurality of distributed nodes.

[0164] Taking Figure 3 as an example, the centralized scheduling node can be understood as a mesh gateway, and the multiple distributed nodes include MAN1 to MAN9. This means that the mesh gateway has configured a reserved resource range for each of MAN1 to MAN9, and also configured a reserved resource range for each conflicting node associated with each MAN.

[0165] The reserved resource range can be used to select resources within the reserved resource range when a distributed node sends burst data. In other words, the reserved resource range can be understood as the resource preference range configured by the centralized distribution node for the distributed node. That is, when a distributed node wants to send burst data, it can select resources within the corresponding resource preference range.

[0166] 602. The centralized scheduling node sends the reserved resource range corresponding to the first node and the reserved resource range of the nodes related to the first node to the first node. The nodes related to the first node include the upper node of the first node, the nodes at the same level as the first node and adjacent to the first node, and the nodes at a higher level than the upper node of the first node.

[0167] The first node is a distributed node communicating with the centralized scheduling node, and the reserved resource range corresponding to the first node and the reserved resource range of the conflicting node related to the first node are used for resource selection when the first node sends burst data.

[0168] In this way, when the first node wants to send burst data, the first node can determine the resource selection of the first node based on the reserved resource range corresponding to the first node and the reserved resource range of the conflicting node related to the first node, and send the resource selection of the first node to the upper node and the lower node of the first node. For the upper node of the first node, the upper node of the first node can eliminate resource conflicts based on the resource selection of the first node, so that when the first node sends burst data, it does not generate resource conflicts with the resources of the conflicting node of the first node.

[0169] Therefore, in the resource scheduling method provided by this application, a centralized node can assist each node in performing distributed resource scheduling in parallel. Only one signaling interaction is performed between the upper and lower nodes (the lower node sends the resource selection of the lower node, and the lower node receives the resource configuration after the upper node performs conflict resolution), which can complete distributed resource scheduling and reduce the signaling transmission overhead and transmission latency. Moreover, this conflict resolution mechanism improves resource utilization and avoids the chain reaction of multi-hop network resource allocation.

[0170] In conjunction with the method embodiments corresponding to Figures 4, 5 and 6, the resource scheduling method of the present application is described below based on the network architecture of the Mesh network. Figure 7 shows a resource scheduling method provided by an embodiment of the present application, which includes the following process.

[0171] 701. The centralized scheduling node configures a conflict table for each distributed node.

[0172] In some embodiments, it is assumed that the distributed node includes a first node, a second node, and a third node, and the second node and the third node are two subordinate nodes of the first node. For the first node, a first conflict table about the second node and a second conflict table about the third node configured by the centralized scheduling node can be saved in the first node. Taking the first conflict table as an example, the first conflict table includes an indication of the conflicting nodes related to the subordinate node (second node) of the first node. Among them, the conflicting nodes related to the second node include the first node, the neighboring nodes of the subordinate nodes of the first node that have the same level as the second node, and the superior node of the first node.

[0173] The upper-level node of the first node, that is, the node at a higher level than the first node, is the parent node of the first node.

[0174] For example, taking the centralized scheduling node as a mesh gateway, the mesh gateway can establish a resource management hierarchy for all MANs in the mesh network based on the mesh network's topological connectivity. As shown in Figure 3, the arrows indicate the hierarchical hierarchy of superior-subordinate or parent-child relationships. Based on the mesh network's topology and resource management hierarchy, the mesh gateway can construct a conflict table for each MAN, containing the conflict relationships of all lower-level nodes. For example, if the first node is MAN1, the second node is MAN3, and the third node is MAN4, the mesh gateway can configure a conflict table for MAN1 containing two lower-level nodes: MAN3 and MAN4. In other words, the principle for constructing the conflict table by the mesh gateway may include: the conflicting MANs include MANs at the same level or a higher level than the lower-level nodes. For example, the conflicting nodes corresponding to MAN3 include MAN4, a neighboring node at the same level as MAN3, MAN1, and the mesh gateway at a higher level than MAN1. If MAN1 is considered the parent node, the two lower-level nodes of MAN1 can also be understood as MAN1's ​​two child nodes. Table 1 shows an example of the conflict table configured by the mesh gateway for MAN1.

[0175] Table 1 Conflict table of Mesh gateway configuration for MAN1

[0176] Lower-level node conflicts MANMAN3Mesh gateway, MAN1 and MAN4MAN4MAN3, MAN1 and Mesh gateway

[0177] In some embodiments, each conflict table can be further configured at a per-link level. That is, in addition to configuring conflict nodes, conflict links corresponding to each link can also be configured. This can improve resource reuse when the granularity is refined to a per-link level.

[0178] For example, for each subordinate node of the first node, the first conflict table includes an indication of at least one conflicting node corresponding to each link in the links related to each subordinate node, and an indication of a conflicting link corresponding to each conflicting node in the at least one conflicting node.

[0179] For example, criteria for determining a conflicting link may include: the sending node of one link and the receiving node of another link are within the interference range of each other; the two links have the same sending node or receiving node; the sending node of one link is the receiving node of the other link (full-duplex links do not include this criterion). Table 2 shows all conflicting MANs and conflicting links for MAN3, the subordinate node of MAN1.

[0180] Table 2 MAN3 conflict table configured by Mesh gateway for MAN1

[0181]

[0182]

[0183] 3→7 in Table 2 indicates the link from MAN3 to MAN7. The meanings of other links are similar to 3→7. For example, G→1 indicates the link from Mesh gateway to MAN1, UE→1 indicates the link from UE under MAN1 to MAN1, and 4→UE indicates the link from MAN4 to UE under MAN4.

[0184] 702. The centralized scheduling node sends a conflict table to each distributed node.

[0185] Accordingly, each distributed node under the centralized scheduling node receives the conflict table sent by the centralized scheduling node.

[0186] In some embodiments, the first node serves as one of the distributed nodes. The first node receives a first conflict table configured by the centralized scheduling node. The first conflict table includes indications of conflicting nodes related to subordinate nodes of the first node.

[0187] Exemplarily, after generating a conflict table for each MAN, the mesh gateway sends the table to each MAN node. The MAN node then stores the table for subsequent use in distributed resource scheduling. For example, when the mesh gateway generates a first conflict table for the first node MAN1, the table includes conflicting MANs for MAN3 and MAN4, or conflicting MANs and conflicting links for MAN3 and MAN4. The mesh gateway then sends the table to MAN1. After receiving the table, MAN1 can store it for use in distributed resource scheduling.

[0188] 703. The centralized scheduling node performs resource allocation for control signaling, hard resource allocation for periodic data, and soft resource allocation for non-periodic data for each distributed node.

[0189] In some embodiments, the Mesh gateway may perform resource allocation for control signaling, hard resource allocation for periodic data, and resource range configuration for soft resources for non-periodic data for each MAN within a centralized scheduling period.

[0190] Figure 8 shows a schematic diagram of resource allocation. For a mesh gateway, the corresponding centralized scheduling period lasts relatively long, for example, dozens of data frames. Each centralized scheduling period includes multiple distributed scheduling periods. The mesh gateway can divide the RBs in each distributed scheduling period into three parts: a control portion, a data hard portion, and a data soft portion.

[0191] The control section is the resource reserved for each MAN to transmit control signaling. It can be understood as the range of resources available to each MAN for control signaling. When a MAN requests resources for burst data and resolves resource conflicts, it can use these resources to transmit signaling. The mesh gateway ensures that these control resources do not conflict. These resources are also considered hard resources.

[0192] The data hard portion is the hard resource allocated by the mesh gateway for periodic data. This can be understood as the resource range that each MAN can use to transmit periodic data. The mesh gateway also ensures that these resources do not cause resource conflicts among the MANs and that the QoS of periodic data is guaranteed.

[0193] The data soft part is the resources reserved by the Mesh gateway for burst data, which can be understood as the resource range that each MAN can use to transmit burst data.

[0194] After the Mesh gateway configures the hard and soft resources of each MAN based on large-scale business statistics during the centralized scheduling cycle, each MAN can perform resource scheduling for soft resource requests and soft resource responses between MANs during the distributed scheduling cycle.

[0195] In the Mesh topology, for the control part, the Mesh gateway can configure dedicated hard resources for request signaling and hard resources for response signaling for each MAN and link, which are used for the transmission of request signaling for soft resources sent between MANs and the transmission of response signaling for soft resources sent between MANs.

[0196] For example, taking the mesh topology shown in Figure 3 as an example, Figure 9 shows a schematic diagram of resource allocation for the control portion of the mesh topology shown in Figure 3. The mesh gateway can select some hard resources in the first two time slots: time slot 1 and time slot 2, respectively, for use in distributed scheduling resource request signaling and conflict resolution signaling. The mesh gateway can ensure that control signaling transmission does not cause conflicts, ensuring robustness, and maximize resource reuse based on the inter-node link conflict relationship (e.g., the conflict table shown in Table 2). That is, non-conflicting links can reuse the same RB. For example, an example of resources used for transmitting control signaling between MANs can be shown in Figure 9. Figure 9 shows the control resources allocated to multiple links in multiple orthogonal frequency division multiplexing (OFDM) symbols in time slot 1 for transmitting resource request signaling. In this application, one RB can correspond to the resources of one OFDM symbol on 12 subcarriers. Referring to Figure 9 , for example, link: G→1 and link: 2→4 are not conflicting links and can reuse control resources, occupying the same RB. Figure 9 also shows the control resources allocated to multiple links in multiple OFDM symbols in time slot 2, which can transmit conflict cancellation signaling.

[0197] Corresponding to the above steps, the centralized scheduling node may determine, according to the first conflict table, the resources occupied when the first node sends the resource request signaling and the resources occupied when the first node sends the conflict elimination signaling.

[0198] For the data hard part, the Mesh gateway can allocate hard resources for periodic data to ensure that the data hard resources allocated to each link in the data hard part do not conflict, and the QoS of the periodic data can be guaranteed. Among them, the RB resources that can be used for periodic data can be understood as the remaining resources in the hard resources except for the resources of the control part. Figure 10 shows a schematic diagram of centralized scheduling of data hard resources. After the Mesh gateway allocates hard resources for periodic data to each link, the remaining resources can be used for the transmission of non-periodic burst data. The soft resources for link transmission of burst data are determined by each MAN in a distributed manner, thereby improving the flexibility of resource allocation. For example, link:G→1 and link:2→4 are not conflicting links, and the resources of the data hard part can be reused.

[0199] For the soft portion of data, soft resources come from resources other than the periodic hard resources. Due to inter-link interference and half-duplex limitations, the data soft resources allocated to each MAN may differ. For example, under the topology of Figure 3 and the hard resource allocation shown in Figure 10, the data soft resources of MAN 1 may be as shown in Figure 11 (a), and the data soft resources of MAN 3 may be as shown in Figure 11 (b).

[0200] The data soft resources allocated to each MAN can be understood as the soft resource range available for burst data transmission for that MAN. For example, Figure 11(a) shows the soft resource range available for MAN1 when sending burst data, and Figure 11(b) shows the soft resource range available for MAN3 when sending burst data.

[0201] Furthermore, in some embodiments, in addition to allocating resources for the control part, the data hard part, and the data soft part, the Mesh gateway may also configure a preferred resource block (PB) for the optional soft resource range of each MAN.

[0202] The PB partitioning must satisfy the following characteristics: 1) Each MAN's PB is a set of preconfigured RBs within the optional soft resource range allocated by the mesh gateway during a centralized scheduling cycle. This set of preconfigured RBs forms a resource pool within the soft resource range. 2) The PBs of a MAN are orthogonal to those of the conflicting MANs, meaning that there is no resource overlap. 3) PBs of MANs that do not cause resource conflicts can be reused.

[0203] Since for the soft resources of a MAN, all RBs in the soft resources need to be divided into the PB of the MAN, the number of RBs in the PB of each MAN can be determined according to other algorithms, such as proportional balancing.

[0204] For example, Figure 12 shows a schematic diagram of the PB allocation of soft resources in a distributed cycle, based on the mesh gateway and MAN1, MAN2, MAN4, and MAN5 in the mesh topology shown in Figure 3. There is a conflict between the mesh gateway (the gateway in Figure 12) and MAN1, MAN2, and MAN4. The PBs corresponding to the mesh gateway and MAN1, MAN2, and MAN4 are orthogonal, meaning they do not overlap. MAN1 and MAN5 do not conflict with each other's resources, meaning there is no conflict relationship, and the PBs of MAN1 and MAN5 can be reused.

[0205] In this embodiment of the present application, the PB corresponding to each MAN can be referred to as the reserved resource range corresponding to each MAN. That is, the reserved resource range corresponding to a MAN is orthogonal to the reserved resource range of the conflicting MAN. The reserved resource ranges of MANs that do not cause resource conflicts can be reused.

[0206] 704. The centralized scheduling node sends configuration information to each distributed node respectively. The configuration information corresponding to each distributed node includes resource allocation for control signaling, hard resource allocation for periodic data, and soft resource allocation for non-periodic data.

[0207] Accordingly, each distributed node under the centralized scheduling node may receive configuration information from the centralized scheduling node.

[0208] Taking the example of a distributed node including a first node and a second node, where the second node is a subordinate node of the first node, the centralized node sends second configuration information to the second node, and the second configuration information includes an indication of the resources occupied when the second node sends a resource request signaling to the first node; the centralized scheduling node also sends first configuration information to the first node, and the first configuration information includes an indication of the resources occupied when the first node sends a conflict elimination signaling to the second node.

[0209] In addition, the first configuration information sent by the centralized node to the first node also includes a hard resource allocation allocated to the first node for the first node to transmit periodic data. The first configuration information sent by the centralized node to the first node also includes a soft resource allocation allocated to the first node for non-periodic data, such as an optional soft resource range corresponding to the first node.

[0210] Similarly, the second configuration information sent by the centralized node to the second node also includes hard resource allocations allocated to the second node for periodic data transmission by the second node. The second configuration information sent by the centralized node to the second node also includes soft resource allocations allocated to the second node for aperiodic data, such as an optional soft resource range corresponding to the second node.

[0211] In addition, the first configuration information may further include an indication of the reserved resource range of the first node and the reserved resource range of the conflicting nodes related to the first node. The second configuration information may further include an indication of the reserved resource range of the second node and the reserved resource range of the conflicting nodes related to the second node.

[0212] For example, when the first node is MAN1, the first configuration information of MAN1 further includes an indication of a PB allocated to MAN1, and indications of PBs corresponding to the conflicting nodes MAN2 and Mesh gateway related to MAN1, respectively.

[0213] Similarly, for example, when the second node is MAN3, the second configuration information of MAN3 also includes an indication of the PB allocated to MAN3, and indications of the PBs corresponding to the conflicting nodes MAN4, MAN1 and Mesh gateway related to MAN3.

[0214] Step 704 can be understood as occurring at time 0, time m, and so on, as shown in Figure 8 , where m is an integer. That is, after the mesh gateway allocates hard and soft resources to each distributed node during the previous centralized scheduling period, it can send configuration information to each distributed node. This configuration information is used by each distributed node for resource scheduling during multiple distributed periods within the next centralized scheduling period. The configuration information corresponding to different centralized scheduling periods may or may not be the same. If the configuration information corresponding to different centralized scheduling periods is the same, it can be understood that once the mesh network topology is established, the configuration information of each node in the mesh network topology remains unchanged.

[0215] 705. The second node sends a first resource indication to its upper neighbor node and lower neighbor node, where the first resource indication is used to indicate a first resource selection for the second node to send burst data. The upper neighbor node includes the first node.

[0216] After each distributed node in the Mesh network topology receives the configuration information corresponding to each distributed node, within each distributed scheduling cycle, each distributed node can perform distributed resource scheduling based on PB burst data, including resource request and conflict resolution.

[0217] First, regarding the resource request mechanism, when any distributed node generates burst data to be sent, it can request the upper node to occupy soft resources. The following principles can be adopted.

[0218] Taking the second node generating burst data as an example, when the first resource indication in the request can be determined based on the reserved resource range of the second node and the reserved resource range of at least one conflicting node related to the second node, the principle includes:

[0219] 1) When the reserved resource range of the second node meets the resource requirements of the second node for sending burst data, the resources indicated by the first resource indication are determined within the reserved resource range of the second node. That is, the second node determines the first resource indication based on the reserved resource range of the second node.

[0220] For example, when the second node acts as a MAN that needs to request soft resources, the second node may first select RBs in the PB corresponding to the second node in a default order. If the RBs occupied by the burst data to be sent by the second node are larger than the PB of the second node itself, and the RBs in the PB of the second node itself can meet the resource requirements of the second node for sending the burst data, the second node may select an RB in the PB of the second node that can support the resource requirements of the burst data, and obtain a first resource indication. The first resource indication is used to indicate the first resource selection previously determined by the second node itself for sending the burst data.

[0221] Based on the network architecture shown in Figure 3, Figure 13 (a) shows the RB resource ranges for the PBs of the mesh gateway, MAN1, MAN2, and MAN4. Figure 13 (b) shows the first resource selection when the RB resources in MAN1 and MAN2's respective PBs are insufficient to support the current burst data resource requirements. Assuming the second node is MAN4, when a burst data is generated, the PB corresponding to MAN4 is sufficient to support the burst data resource requirements. MAN4 can determine the RBs in its corresponding PB and obtain the first resource indication.

[0222] 2) When the reserved resource range of the second node does not meet the resource requirements for the second node to transmit burst data, the resources indicated by the first resource indication are determined from the reserved resource range of the second node and the reserved resource range of at least one conflicting node associated with the second node. That is, the second node determines the first resource indication based on the reserved resource range of the second node and the reserved resource range of at least one conflicting node associated with the second node.

[0223] For example, if the second node acts as a MAN that needs to request soft resources, and the RB in the PB of the second node cannot meet the resource requirements of the second node for sending burst data, the second node can randomly select an RB that can meet the resource requirements in the PB of the conflicting node related to the second node.

[0224] For example, as shown in (a) of Figure 13 , when the second node is MAN1, if the RBs in MAN1's ​​PB are insufficient to support MAN1 in sending burst data, as shown in (b) of Figure 13 , MAN1 may also randomly select RBs from the PBs corresponding to the mesh gateway, MAN2, and MAN4, respectively. The RBs used by MAN1 to send burst data include not only MAN1's ​​own PB but also RBs randomly selected from the PBs corresponding to the mesh gateway, MAN2, and MAN4, respectively. That is, the RBs indicated by the first resource indication include RBs randomly selected from MAN1's ​​own PB, the mesh gateway, MAN2, and MAN4, respectively.

[0225] Similar to MAN1, as shown in (a) of Figure 13, when the second node is MAN2, if the RBs in MAN2's PB are insufficient to support MAN2 in sending burst data, as shown in (b) of Figure 13, MAN2 may also randomly select RBs from the PBs corresponding to the mesh gateway, MAN1, and MAN4, respectively. The RBs for MAN2 to send burst data include not only MAN2's own PB but also RBs randomly selected from the PBs corresponding to the mesh gateway, MAN1, and MAN4, respectively. That is, the RBs indicated by the first resource indication include RBs randomly selected from MAN2's own PB, the mesh gateway, MAN1, and MAN4, respectively.

[0226] In addition, the principles in step 705 may also include:

[0227] 3) To avoid serious resource conflict of a distributed node, when the second node selects RBs in the reserved resource range of the conflicting node related to the second node, the number of selected RBs may be proportional to the number of RBs in the reserved resource range of the related conflicting node.

[0228] This means that when the second node needs to select RBs from the PBs of the relevant conflicting nodes, it can select RBs in proportion to the number of PBs in the conflicting nodes to be selected. For example, if the PB of conflicting node 1 has more RBs than the PB of conflicting node 2, the second node can randomly select more RBs from the PB of conflicting node 1 than from the PB of conflicting node 2.

[0229] 4) The second node sends an indication of the service priority of the burst data to the first node. The indication of the service priority is used by the first node to determine the second resource indication based on the service priority of the burst data sent by the first node and the service priority of the conflicting node with the second node when the first node determines that the first resource indication conflicts with the reserved resource range of the conflicting node with the second node.

[0230] Thus, when the first node is performing conflict resolution, it can consider the service priority of the burst data to be sent by the second node and the service priority of the burst data to be sent by the conflicting node, thereby determining how to resolve the resource conflict based on the comparison of the service priorities. Specific examples will be provided below.

[0231] It should be noted that the process of each distributed node determining the location of the RB in the resource request according to the PB can be carried out in parallel.

[0232] After the second node determines the first resource indication for requesting occupation, the second node may send the first resource indication to the upper neighboring node and the lower neighboring node of the second node.

[0233] In other words, the second node may send the first resource indication to both the parent node adjacent to the second node and the child node adjacent to the second node.

[0234] For example, when the parent nodes adjacent to the second node include the first node and the third node, and the child nodes adjacent to the second node include the fourth node and the fifth node, the second node needs to send a first resource indication to the first node, the third node, the fourth node, and the fifth node. The node used to resolve the resource conflict of the second node is the upper-level neighboring node of the second node.

[0235] Exemplarily, the second node may send a resource request signaling to the upper neighbor node and the lower neighbor node of the second node, and the resource request signaling includes a first resource indication. The hard resources occupied by the resource request signaling can determine the link resources of the resource request signaling according to the hard resources of the request signaling configured for each node in step 703 to avoid link conflicts. Specifically, the hard resources occupied by the resource request signaling can be determined with reference to the second configuration information configured for the second node. For example, when the second node is MAN4 and the first node is MAN1, MAN4 sends a resource request signaling to MAN1. The resource allocation method of the control part shown in Figure 9 can be referred to to determine the hard resources of link:4→1 to send the resource request signaling.

[0236] Furthermore, in some embodiments, when the first node receives a first resource indication sent by the second node, the method further includes: the first node receiving a link indication sent by the second node, where the link indication indicates at least one link occupied by the second node when transmitting burst data. In this manner, when the first node resolves resource conflicts, it may refer to a conflict table similar to that in Table 2 to resolve link resource conflicts. A specific example is provided below.

[0237] 706. The first node determines the second resource indication based on the first resource indication and the reserved resource range of the conflicting nodes related to the second node, where the conflicting nodes related to the second node include neighboring nodes at the same level as the second node and upper-level nodes at a higher level than the level of the second node.

[0238] As described in step 705, because some distributed nodes' reserved resource ranges are insufficient to support their own burst data transmission, they occupy RBs in the reserved resource ranges of other distributed nodes, potentially causing resource conflicts. Therefore, when any distributed node receives a first resource indication from a subordinate node, it is necessary to perform resource conflict analysis and, if a resource conflict is determined, resolve the conflict to obtain a second, conflict-resolved resource indication.

[0239] In some embodiments, the rules followed by the first node in performing conflict resolution may be as follows.

[0240] 1) If the first part of the resources indicated by the first resource indication conflicts with the second part of the resources in the reserved resource range of the upper-level node of the first node, the first node determines a second resource indication, and the resources indicated by the second resource indication include the resources remaining after removing the first part of the resources indicated by the first resource indication.

[0241] The first portion of resources may be understood as a portion of the resources indicated by the first resource indication, including resources that overlap with the resources indicated by the first resource indication. The second portion of resources may be understood as a portion of the resources within the reserved resource range of the parent node of the first node, including resources that overlap with the reserved resource range of the parent node of the first node.

[0242] That is, in this rule, when a resource conflict occurs in the selection of resources for sending burst data between the upper neighbor node and the lower neighbor node of the first node, the resources in the resource conflict need to be removed from the resources indicated by the lower neighbor node.

[0243] For example, based on the network architecture of Figure 3, as shown in (a) of Figure 14, when the second node is MAN4, the first node is MAN1, MAN1 is the upper neighbor node of MAN4, that is, the parent node, and the upper node of MAN1, the Mesh gateway, is the conflicting node of MAN4. When MAN1 receives the first resource indication in the resource request signaling of MAN4, if the first part of the resources indicated by the first resource indication of MAN4 overlaps / conflicts with the second part of the resources to be sent / received by PB1 of the Mesh gateway for burst data, the conflicting part is shown as A, MAN1 can remove the conflicting part A of the resources indicated by the first resource indication, and the remaining resources in the resources indicated by the first resource indication after the removal are the resources indicated by the second resource indication. In other words, the second part of the resources still belongs to the Mesh gateway.

[0244] 2) If the first part of the resources indicated by the first resource indication conflicts with the second part of the resources in the reserved resource range of any other node, the first node determines a second resource indication, and the resources indicated by the second resource indication include the resources remaining after removing the first part of the resources indicated by the first resource indication.

[0245] That is, in this rule, if a distributed node occupies an RB in the PB of any other distributed node and a resource conflict occurs, any other distributed node has the priority to own the conflicting resource portion.

[0246] For example, as shown in (b) of FIG14 , when the second node is MAN4 and the first node is MAN1, if MAN1 determines that the first portion of the resources indicated by the first resource indication sent by MAN4 conflicts with the second portion of the resources in the PB of the third node MAN3 for sending / receiving burst data, where the conflicting portion is indicated by B, and MAN3 is a conflicting node for MAN4, then upon determining that MAN4 occupies the RBs used by MAN3, MAN1 may remove the first portion of resources B that conflict with MAN4, thereby obtaining a second resource indication. That is, the RBs included in the second resource indication sent by MAN1 to MAN4 are the RBs remaining after removing the first portion of resources B from the resources indicated by the first resource indication.

[0247] 3) If the first part of the resources indicated by the first resource indication conflicts with the second part of the resources occupied by the third node, and the second part of the resources is within the reserved resource range of the fourth node, the first node determines the second resource indication, and the resources indicated by the second resource indication include the third part of the resources indicated by the first resource indication that does not conflict with the second part of the resources, and the fourth part of the resources determined from the second part of the resources in proportion.

[0248] In this rule, when two distributed nodes conflict in occupying the RBs in the PB of another distributed node, that is, both occupy the same RB part in the PB of another distributed node, and there is no resource conflict between the RB selected by the other distributed node in its own PB for sending burst data and the RB selected by the above two distributed nodes for sending burst data, the upper-level neighboring node of the two distributed nodes shall allocate the same RB part to the two distributed nodes in a proportional and balanced manner.

[0249] For example, as shown in (c) of FIG14 , when the second node is MAN4 and the first node is MAN1, if MAN1 determines that a first portion of the resources indicated by the first resource indication sent by MAN4 conflicts with a second portion of the resources occupied by the third node MAN3, where the conflicting portion is indicated by C, and the second portion of the resources C is in the PB of the fourth node MAN2, for the portion of the PB of MAN2 where the resources conflict between MAN3 and MAN4 occurs, and MAN2 is not used to send burst data, the first node may proportionally allocate a portion of the resources D from the conflicting portion C to MAN4, and proportionally allocate another portion of the resources E from the conflicting portion C to MAN3. For example, the proportion is determined according to the number of RBs requested by MAN4 and MAN3, that is, if MAN4's resource demand is greater than MAN3's resource demand, MAN1 may proportionally allocate more RBs to MAN4.

[0250] In some embodiments, the rules 2) and 3) followed by the first node in performing conflict resolution may further include the following rule 4).

[0251] 4) If the first part of the resources indicated by the first resource indication conflicts with the second part of the resources in the reserved resource range of the third node, the first node determines the second resource indication according to the service priority of the second node and the service priority of the third node.

[0252] This rule 4) applies to the situation in which there is a difference in service priority in the above rules 2) and 3), that is, the high-priority service occupies limited resources.

[0253] Among them, when the business priority of the second node is higher than the business priority of the third node, the resources indicated by the second resource indication include the resources indicated by the first resource indication; when the business priority of the second node is lower than the business priority of the third node, the resources indicated by the second resource indication include the resources remaining after removing the first part of the resources from the resources indicated by the first resource indication.

[0254] That is, in this rule, resource conflicts can also be eliminated by combining the service priority of the resource carrier, and the higher-priority service will take priority in occupying resources, while services with the same priority or no priority can be conflicted according to the above rules 1) to 3).

[0255] For example, when the second node is MAN4, the first node is MAN1, and the third node is MAN3, if MAN1 receives the first resource indication from MAN4, the first part of the resources indicated by the first resource indication conflicts with the second part of the resources occupied in the PB of the third node, and the conflicting part is, for example, B shown in (b) of Figure 14. At this time, MAN1 can compare the service priority of the burst data to be sent by MAN4 with the service priority of the burst data carried by the second part of the resources occupied by MAN3. If the service priority of MAN4 is higher than that of MAN3, MAN1 can decide to give the conflicting part B to MAN4. If the service priority of MAN4 is lower than that of MAN3, MAN1 can decide to give the RBs other than the conflicting part B to MAN4 from the resources indicated by the first resource indication.

[0256] Furthermore, in some embodiments, referring to Table 2, considering that the conflict table configured by the Mesh gateway for each distributed node also includes conflicting links related to the links of the distributed node, when executing step 706, the second resource indication may be determined according to the conflict relationship between the links.

[0257] That is to say, the above-mentioned first node determines the second resource indication based on the first resource indication and the reserved resources of the conflicting node related to the second node, which may include: the first node determines the second resource indication based on the resources of the conflicting link with at least one link in the first resource indication and the reserved resources of the conflicting node related to the second node.

[0258] For example, assume that in step 705, referring to Table 2, the second node is MAN3. The resource request signaling sent by MAN3 to the first node MAN1 carries not only the first resource indication but also an indication of the link related to the burst data to be sent by MAN3. For example, the link related to the burst data to be sent by MAN3 includes link 3→7 from MAN3 to MAN7, and the RBs indicated by the first resource indication include RBs in the mesh gateway's PB. The conflicting MAN corresponding to link 3→7 includes a mesh gateway, and the conflicting links under the mesh gateway corresponding to link 3→7 include G→1. If the RBs indicated by the first resource indication include RBs for link G→1 under the mesh gateway, according to rule 1) in step 706, the mesh gateway is MAN1's ​​superior node. To resolve the resource conflict, MAN1 may remove the RBs for link G→1 from the RBs indicated by the first resource indication. The removed RBs will then be owned by the mesh gateway. The remaining RBs after the removal of the RBs indicated by the first resource indication can be used by MAN3 to send burst data.

[0259] In this way, based on the configuration of the conflict table by the centralized scheduling node, the distributed nodes can be assisted to eliminate resource conflicts, which simplifies the complexity of the distributed nodes in eliminating resource conflicts.

[0260] 707. The first node sends a second resource indication to the second node, where the second resource indication is used for the second node to select a second resource for sending burst data.

[0261] In some embodiments, the first node sending the second resource indication to the second node includes: the first node sending conflict resolution signaling to the second node, where the conflict resolution signaling includes the second resource indication.

[0262] For example, when the first node is MAN1 and the second node is MAN4, when MAN1 sends conflict elimination signaling to MAN4, it can refer to the hard resource allocation for response signaling (resource allocation for conflict elimination signaling) shown in Figure 9, that is, the hard resource for response signaling indicated by the first configuration information, to determine the link resource of link: 1→4. MAN1 can send a conflict elimination instruction to MAN4 on the link resource of link: 1→4 to avoid link conflict in the control part.

[0263] In some embodiments, considering that a distributed node may have multiple upper-level neighboring nodes, if multiple upper-level neighboring nodes make different decisions on the RB requested by a distributed node, the distributed node may only use the same RB in the decisions made by multiple upper-level neighboring nodes to send burst data.

[0264] For example, in addition to step 707, the second node also receives a third resource indication sent by the third node, where the third resource indication is used to indicate a third resource selection for the second node to send burst data. The second node determines a resource for the second node to send burst data based on the second resource indication and the third resource indication.

[0265] The resources used by the second node to send burst data include overlapping resources in the second resource selection and the third resource selection.

[0266] From the description of the above steps, it can be seen that in distributed resource scheduling, each distributed node can send resource request signaling in the control part of time slot 1 (the first time slot) scheduled by the centralized scheduling node, and send conflict elimination signaling in the control part of time slot 2 (the second time slot) scheduled by the centralized scheduling node.

[0267] Exemplarily, referring to FIG15 , the process of distributed resource scheduling may include:

[0268] 1) MAN4 determines the RBs it wishes to occupy within the soft resources and sends a first resource indication to all adjacent MANs via resource request signaling. These adjacent MANs include the superior neighbor nodes MAN1 and MAN2, as well as the subordinate neighbor nodes MAN7 and MAN8. Specifically, MAN4 sends a first resource request signaling message carrying the first resource indication to MAN1, a second resource request signaling message carrying the first resource indication to MAN2, a third resource request signaling message carrying the first resource indication to MAN7, and a fourth resource request signaling message carrying the first resource indication to MAN8. Different resource request signaling messages have different destination addresses.

[0269] 2) MAN1 eliminates resource conflicts in the resources indicated by the first resource indication for MAN4 and feeds back first conflict resolution signaling to MAN4. MAN2 also eliminates resource conflicts in the resources indicated by the first resource indication for MAN4 and feeds back second conflict resolution signaling to MAN4. Although MAN7 and MAN8 do not eliminate resource conflicts for MAN4, they can eliminate resource conflicts for their subordinate nodes based on the received first resource indication.

[0270] 3) MAN4 determines the resources that MAN4 ultimately uses to send the burst data according to the first conflict resolution signaling and the second conflict resolution signaling.

[0271] As described in the above embodiments, the resource scheduling method provided by this application allows each MAN to reserve resources for the burst and resolve resource conflicts in a distributed manner when burst data is generated. Throughout this process, each distributed node only needs to exchange signaling with its superior node once, eliminating the need to follow a serial process or transmit resource allocation results to a centralized node. This reduces resource allocation latency and provides higher quality of service.

[0272] Furthermore, the resource conflict resolution in this application considers conflicts between directly connected distributed nodes as well as conflicts between indirectly connected distributed nodes. First, resource preference PB is used to enable nodes to select different resources as much as possible, and then resource conflicts are quickly resolved with the help of superior nodes. This ensures the absence of resource conflicts while improving resource reuse.

[0273] The conflict resolution of this application will not cause additional conflicts, that is, it will not cause a chain reaction. Moreover, the advantages of centralized nodes are utilized to simplify the complexity of distributed resource reservation and resource conflict resolution.

[0274] Compared to existing solutions, this application either considers serial distributed resource allocation for soft resources, resulting in long burst data transmission delays and insufficient resource utilization; or uses centralized statistical methods for fully centralized resource allocation, resulting in significant resource waste when burst data deviates from statistical information or when burst data statistics are difficult to obtain. The centralized-assisted distributed resource scheduling method proposed in this application can not only meet the service quality of periodic data, but also quickly schedule soft resources through a distributed scheduling method, reducing data latency, eliminating distributed scheduling conflicts, and improving resource utilization efficiency.

[0275] It is understandable that in order to implement the above functions, the node includes hardware and / or software modules that perform the corresponding functions. In combination with the algorithm steps of each example described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application in combination with the embodiments, but such implementation should not be considered to be beyond the scope of this application.

[0276] In this embodiment, nodes can be divided into functional modules based on the above-described method examples. For example, different functional modules can be divided according to their functions, or two or more functions can be integrated into a single processing module. The integrated modules can be implemented in hardware. It should be noted that the module division in this embodiment is illustrative and represents only one logical functional division. In actual implementation, other division methods may be used.

[0277] In the case of dividing the functional modules according to their functions, FIG16 shows a possible schematic diagram of the composition of the distributed node 160 involved in the above embodiment. As shown in FIG16 , the distributed node 160 may include a determining unit 1601, a sending unit 1602, and a receiving unit 1603. The distributed node 160 may be, for example, the first node, the second node, the third node, or the fourth node in this application.

[0278] The determining unit 1601 may be configured to support the node 160 in executing the above steps 402 , 601 , 706 , etc., and / or other processes of the technology described herein.

[0279] The sending unit 1602 may be configured to support the node 160 in executing the above steps 403 , 501 , 602 , 705 , 707 , etc., and / or other processes for the technology described herein.

[0280] The receiving unit 1603 may be configured to support the node 160 in executing the above steps 401 , 502 , 702 , 704 , etc., and / or other processes for the technology described herein.

[0281] It should be noted that all relevant contents of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module and will not be repeated here.

[0282] The distributed node 160 provided in this embodiment is used to execute the above resource scheduling method, and thus can achieve the same effect as the above implementation method.

[0283] When integrated, distributed node 160 may include a processing module, a storage module, and a communication module. The processing module may be used to control and manage the actions of distributed node 160. For example, it may be used to support distributed node 160 in executing the steps performed by determining unit 1601. The storage module may be used to support distributed node 160 in storing program code and data. The communication module may be used to support distributed node 160 in executing the steps performed by transmitting unit 1602 and receiving unit 1603, i.e., to support communication between distributed node 160 and other devices, such as other nodes, UEs, or centralized scheduling nodes.

[0284] The processing module may be a processor or a controller. It may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of this application. The processor may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of digital signal processing (DSP) and a microprocessor, and so on. The storage module may be a memory. The communication module may specifically be a device that interacts with other electronic devices, such as a radio frequency circuit, a Bluetooth chip, or a Wi-Fi chip.

[0285] In one embodiment, when the processing module is a processor, the storage module is a memory, and the communication module is a transceiver, the distributed node involved in this embodiment may be MAN170 having the structure shown in FIG17 .

[0286] In the case of dividing the functional modules according to their functions, FIG18 shows a possible schematic diagram of the composition of the centralized scheduling node 180 involved in the above embodiment. As shown in FIG18 , the centralized scheduling node 180 may include: a determining unit 1801, a sending unit 1802, and a configuring unit 1803. The centralized scheduling node 180.

[0287] The determining unit 1801 may be used to support the centralized scheduling node 180 in executing the above-mentioned step 601 and / or other processes of the technology described herein.

[0288] The sending unit 1802 may be configured to support the centralized scheduling node 180 in executing the above steps 602 , 702 , 704 , etc., and / or other processes for the technology described herein.

[0289] The configuration unit 1803 may be used to support the centralized scheduling node 180 in executing the above steps 701 and 703 , and / or other processes of the technology described herein.

[0290] It should be noted that all relevant contents of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module and will not be repeated here.

[0291] The centralized scheduling node 180 provided in this embodiment is used to execute the above resource scheduling method, and thus can achieve the same effect as the above implementation method.

[0292] When integrated, the centralized scheduling node 180 may include a processing module, a storage module, and a communication module. The processing module may be used to control and manage the actions of the centralized scheduling node 180. For example, it may be used to support the centralized scheduling node 180 in executing the steps performed by the determining unit 1801 and the configuring unit 1803. The storage module may be used to support the centralized scheduling node 180 in storing program code and data. The communication module may be used to support the centralized scheduling node 180 in executing the steps performed by the sending unit 1802, i.e., to support communication between the centralized scheduling node 180 and other devices, such as distributed nodes.

[0293] The processing module may be a processor or a controller. It may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the disclosure of this application. The processor may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of digital signal processing (DSP) and a microprocessor, and so on. The storage module may be a memory. The communication module may specifically be a device that interacts with other electronic devices, such as a radio frequency circuit, a Bluetooth chip, or a Wi-Fi chip.

[0294] In one embodiment, when the processing module is a processor, the storage module is a memory, and the communication module is a transceiver, the distributed node involved in this embodiment may be a MAN having the structure shown in FIG17 .

[0295] An embodiment of the present application further provides an electronic device comprising one or more processors and one or more memories. The one or more memories are coupled to the one or more processors and are configured to store computer program code, the computer program code comprising computer instructions. When the one or more processors execute the computer instructions, the electronic device executes the above-described related method steps to implement the resource scheduling method of the above-described embodiment.

[0296] An embodiment of the present application further provides a computer storage medium storing computer instructions. When the computer instructions are executed on an electronic device, the electronic device executes the above-mentioned related method steps to implement the resource scheduling method in the above-mentioned embodiment.

[0297] An embodiment of the present application further provides a computer program product. When the computer program product is run on a computer, the computer is caused to execute the above-mentioned related steps to implement the resource scheduling method executed by the node in the above-mentioned embodiment.

[0298] In addition, an embodiment of the present application also provides a device, which can specifically be a chip, component or module, and the device may include a connected processor and memory; wherein the memory is used to store computer execution instructions, and when the device is running, the processor can execute the computer execution instructions stored in the memory to enable the chip to execute the resource scheduling method executed by the electronic device in the above-mentioned method embodiments.

[0299] Among them, the electronic device, computer storage medium, computer program product or chip provided in this embodiment is used to execute the corresponding method provided above. Therefore, the beneficial effects that can be achieved can refer to the beneficial effects in the corresponding method provided above, and will not be repeated here.

[0300] Another embodiment of the present application provides a system, which may include the above-mentioned centralized scheduling node and the above-mentioned at least one distributed node, and may be used to implement the above-mentioned resource scheduling method.

[0301] Through the description of the above implementation methods, technical personnel in the relevant field can understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be distributed and completed by different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0302] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the modules or units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another device, 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.

[0303] The units described as separate components may or may not be physically separate, and the components shown as units may be one physical unit or multiple physical units, that is, they may be located in one place or distributed in multiple places. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0304] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0305] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for enabling a device (which can be a single-chip microcomputer, chip, etc.) or a processor (processor) to execute all or part of the steps of the method 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.

[0306] The above content is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of the present application. Therefore, the scope of protection of the present application should be based on the scope of protection of the claims.

Claims

1. A resource scheduling method, characterized in that: The method comprises: A first node receives a first resource indication sent by a second node, where the first resource indication is used to indicate a first resource selection for the second node to send data, and the first node is an upper-level node of the second node; The first node determines a second resource indication based on the first resource indication and reserved resources of nodes related to the second node, where the nodes related to the second node include the first node, nodes at the same level as the second node among subordinate nodes of the first node, and an upper-level node of the first node; The first node sends the second resource indication to the second node, where the second resource indication is used for a second resource selection for the second node to send data.

2. The method according to claim 1, characterized in that When the reserved resource range of the second node meets the resource requirement of the second node for sending data, the resources indicated by the first resource indication are determined within the reserved resource range of the second node; Or, when the reserved resource range of the second node does not meet the resource requirements of the second node for sending data, the resources indicated by the first resource indication are determined within the reserved resource range of the second node and the reserved resource range of at least one conflicting node related to the second node.

3. The method according to claim 1 or 2, characterized in that Before the first node receives the first resource indication sent by the second node, the method further includes: The first node receives a first conflict table configured by a centralized scheduling node, wherein the first conflict table includes indications of conflicting nodes associated with subordinate nodes of the first node.

4. The method according to claim 3, characterized in that The first node determining the second resource indication according to the first resource indication and the reserved resources of the conflicting node related to the second node includes: If a first portion of resources in the resources indicated by the first resource indication conflicts with a second portion of resources in a reserved resource range of an upper-level node of the first node, the first node determines the second resource indication, where the resources indicated by the second resource indication include resources remaining after removing the first portion of resources from the resources indicated by the first resource indication; If a first portion of resources in the resources indicated by the first resource indication conflicts with a second portion of resources in a reserved resource range of any other node, the first node determines the second resource indication, where the resources indicated by the second resource indication include resources remaining after removing the first portion of resources from the resources indicated by the first resource indication; If the first part of the resources indicated by the first resource indication conflicts with the second part of the resources occupied by the third node, and the second part of the resources is within the reserved resource range of the fourth node, the first node determines the second resource indication, and the resources indicated by the second resource indication include the third part of the resources indicated by the first resource indication that does not conflict with the second part of the resources, and the fourth part of the resources determined from the second part of the resources in proportion.

5. The method according to claim 3, characterized in that The first node determining the second resource indication according to the first resource indication and the reserved resources of the conflicting node related to the second node includes: If a first portion of resources in the resources indicated by the first resource indication conflicts with a second portion of resources in the reserved resource range of the third node, the first node determines the second resource indication according to the service priority of the second node and the service priority of the third node; Among them, when the service priority of the second node is higher than the service priority of the third node, the resources indicated by the second resource indication include the resources indicated by the first resource indication; when the service priority of the second node is lower than the service priority of the third node, the resources indicated by the second resource indication include the resources remaining after removing the first part of resources from the resources indicated by the first resource indication.

6. The method according to claim 3, characterized in that For each subordinate node of the first node, the first conflict table includes an indication of at least one conflicting node corresponding to each link in the links related to each subordinate node, and an indication of a conflicting link corresponding to each conflicting node in the at least one conflicting node.

7. The method according to claim 6, characterized in that When the first node receives the first resource indication sent by the second node, the method further includes: the first node receiving a link indication sent by the second node, where the link indication is used to indicate at least one link occupied by the second node when sending data; The first node determining the second resource indication according to the first resource indication and the reserved resources of the conflicting node related to the second node includes: The first node determines the second resource indication according to the first resource indication and resources of a conflicting link with the at least one link in reserved resources of a conflicting node related to the second node.

8. The method according to any one of claims 1 to 7, characterized in that The first node receiving the first resource indication sent by the second node includes: the first node receiving resource request signaling sent by the second node, the resource request signaling including the first resource indication; The first node sending the second resource indication to the second node includes: the first node sending conflict elimination signaling to the second node, where the conflict elimination signaling includes the second resource indication; The resources occupied by the resource request signaling and the resources occupied by the conflict resolution signaling are pre-configured by a centralized scheduling node.

9. A resource scheduling method, characterized in that: The method comprises: The second node sends a first resource indication to the first node, where the first resource indication is used to indicate a first resource selection for the second node to send data, and the first node is an upper-level node of the second node; The second node receives, by the first node, a second resource indication sent by the first node, where the second resource indication is used for a second resource selection for the second node to send data; Among them, the second resource indication is determined by the first node based on the first resource indication and the reserved resources of the nodes related to the second node, and the nodes related to the second node include the first node, the nodes at the same level as the second node among the subordinate nodes of the first node, and the upper node of the first node.

10. The method according to claim 9, characterized in that The second node sending the first resource indication to the first node includes: The second node sends a first resource indication to an upper neighboring node and a lower neighboring node of the second node; The upper-level neighboring nodes of the second node include the first node and the third node; The method further comprises: The second node receives a third resource indication sent by the third node, where the third resource indication is used to indicate a third resource selection for the second node to send data.

11. The method according to claim 10, characterized in that The method further comprises: The second node determines, according to the second resource indication and the third resource indication, a resource for the second node to send data; The resources used by the second node to send data include overlapping resources in the second resource selection and the third resource selection.

12. The method according to any one of claims 9 to 11, characterized in that: Before the second node sends the first resource indication, the method further includes: When the reserved resource range of the second node meets the resource requirement of the second node for sending data, the second node determines the first resource indication according to the reserved resource range of the second node; Or, when the reserved resource range of the second node does not meet the resource requirements of the second node for sending data, the second node determines the first resource indication based on the reserved resource range of the second node and the reserved resource range of at least one conflicting node related to the second node.

13. The method according to claim 12, characterized in that Before the second node sends the first resource indication to the first node, the method further includes: The second node receives configuration information sent by the centralized scheduling node, where the configuration information includes a reserved resource range of the second node and a reserved resource range of a conflicting node related to the second node.

14. The method according to any one of claims 9 to 13, characterized in that: The second node sending the first resource indication to the first node includes: the second node sending resource request signaling to the first node, where the resource request signaling includes the first resource indication; The second node receiving the second resource indication sent by the first node includes: the second node receiving conflict elimination signaling sent by the first node, the conflict elimination signaling including the second resource indication; The resources occupied by the resource request signaling and the resources occupied by the conflict resolution signaling are pre-configured by a centralized scheduling node.

15. The method according to any one of claims 9 to 14, characterized in that: The method further comprises: The second node sends an indication of the service priority of the data to the first node. The indication of the service priority is used by the first node to determine the second resource indication based on the service priority of the data sent by the first node and the service priority of the conflicting node with the second node when the first node determines that the first resource indication conflicts with the reserved resource range of the conflicting node with the second node.

16. A resource scheduling method, characterized in that: The method comprises: The centralized scheduling node determines the reserved resource ranges corresponding to the plurality of distributed nodes, and the reserved resource range of the node associated with each of the plurality of distributed nodes; The centralized scheduling node sends, to a first node, a reserved resource range corresponding to the first node and reserved resource ranges of nodes related to the first node, where the nodes related to the first node include an upper-level node of the first node, nodes at the same level as the first node and adjacent to the first node, and nodes at a higher level than the upper-level node of the first node; The first node is a distributed node among the multiple distributed nodes, and the reserved resource range corresponding to the first node and the reserved resource range of the nodes related to the first node are used for resource selection when the first node sends data.

17. The method according to claim 16, characterized in that The method further comprises: The centralized scheduling node configures a conflict table for each distributed node; Wherein, for the first node, the first conflict table corresponding to the first node includes indications of conflicting nodes related to subordinate nodes of the first node; When the subordinate nodes of the first node include the second node, the conflicting nodes related to the second node include the first node, nodes at the same level as the second node among the subordinate nodes of the first node, and the superior node of the first node.

18. The method according to claim 17, characterized in that For each subordinate node of the first node, the first conflict table includes an indication of at least one conflicting node corresponding to each link in the links related to each subordinate node, and an indication of a conflicting link corresponding to each conflicting node in the at least one conflicting node.

19. The method according to claim 18, characterized in that The method further comprises: The centralized scheduling node determines, according to the first conflict table, resources occupied by a second node when sending a resource request signaling to the first node, and resources occupied by the first node when sending a conflict elimination signaling to the second node, where the second node is a subordinate node of the first node; The centralized scheduling node sends first configuration information to the first node, where the first configuration information includes an indication of resources occupied when the first node sends conflict resolution signaling to the second node; The centralized scheduling node sends second configuration information to the second node, where the second configuration information includes an indication of resources occupied when the second node sends resource request signaling to the first node.

20. A distributed node, characterized in that: The distributed node includes: a transceiver, a memory, and a processor, wherein the memory, the transceiver, and the processor are coupled; The memory is used to store computer program code, wherein the computer program code includes computer instructions; The transceiver is used to receive data and send data; When the processor executes the computer instructions, the distributed node executes the resource scheduling method according to any one of claims 1 to 8.

21. A distributed node, characterized in that: The distributed node includes: a transceiver, a memory, and a processor, wherein the memory, the transceiver, and the processor are coupled; The memory is used to store computer program code, wherein the computer program code includes computer instructions; The transceiver is used to receive data and send data; When the processor executes the computer instructions, the distributed node executes the resource scheduling method according to any one of claims 9 to 15.

22. A centralized scheduling node, characterized in that: The centralized scheduling node includes: a transceiver, a memory, and a processor, wherein the memory, the transceiver, and the processor are coupled; The memory is used to store computer program code, wherein the computer program code includes computer instructions; The transceiver is used to receive data and send data; When the processor executes the computer instructions, the centralized scheduling node executes the resource scheduling method according to any one of claims 16 to 19.

23. A computer-readable storage medium, characterized in that The method comprises computer instructions, which, when executed on an electronic device, cause the electronic device to execute the method according to any one of claims 1 to 8.

24. A computer-readable storage medium, characterized in that The method comprises computer instructions, which, when the computer instructions are executed on an electronic device, cause the electronic device to execute the method according to any one of claims 9 to 15.

25. A computer-readable storage medium, characterized in that The method comprises computer instructions, which, when executed on an electronic device, cause the electronic device to execute the method according to any one of claims 16 to 19.

Images