Resource allocation method, and related apparatus

Abstract

The present application relates to the field of communications. Provided are a resource allocation method, and a related apparatus. The method is applied to a first node. The method comprises: determining that a first node is an allocation node; and allocating resources to nodes in the group where the first node is located, wherein the group comprises allocation nodes and a neighbor nodes of the allocation nodes. An allocation node can allocate non-overlapping resources to links, which are to be subjected to allocation, between nodes in the group where the allocation node is located, such that it can be ensured that there is no resource collision within the group of each allocation node, thereby reducing the probability of resource collisions in an entire sidelink mesh network.

Description

A resource allocation method and related device

[0001] This application claims priority to the Chinese patent application filed with the China Patent Office on December 26, 2023, with application number 202311819234.4 and application name “A Resource Allocation Method and Related Devices”, the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of communications, and in particular to a resource allocation method and related devices. Background Art

[0003] Currently, a known resource allocation method is one in which a source node sends a request to reserve (RTR) signaling to a destination node hop by hop through intermediate nodes along the path. The destination node then replies with a clear to reserve (CTR) signaling to the source node hop by hop through the intermediate nodes, thereby establishing resource reservations for the source node's real-time data stream. The RTR signaling includes the transmission period and duration of the new data stream, while the CTR signaling updates the reservation table recorded at all nodes along the path (including the source, intermediate, and destination nodes on a multi-hop path). If the reservation is successfully established, the nodes along the path can use the reserved time-domain resources for periodic transmission of real-time data.

[0004] Although the above resource allocation method realizes multi-hop resource reservation, when multiple data streams are to be sent, the probability of resource collision is high. Summary of the Invention

[0005] The present application provides a resource allocation method and related apparatus, in order to reduce the probability of resource collision when multiple data streams are to be sent.

[0006] In a first aspect, the present application provides a resource allocation method, which is applied to a sidelink mesh network. The method can be executed by a first node in the sidelink mesh network, and the first node can be any node in the sidelink mesh network. The first node can be a terminal device, or a component configured in the terminal device (such as a chip, chip system, etc.), or a logic module or software capable of implementing all or part of the terminal device functions, which is not limited by the present application.

[0007] Exemplarily, the method includes: determining that the first node is an allocation node; allocating resources to nodes in a group where the first node is located; the group includes: the allocation node and neighboring nodes of the allocation node.

[0008] Based on the above scheme, nodes in the side-by-side multi-hop network need to determine their own role type before each round of resource allocation. When the role type of the node is an allocation node, the allocation node can allocate non-overlapping resources to the nodes in its group, thereby ensuring that resource collisions will not occur in the group of each allocation node, thereby reducing the probability of resource collisions in the entire side-by-side multi-hop network.

[0009] In addition, when allocating resources, the allocation node allocates time-frequency resources to the link to be allocated, not just time domain resources, thereby reducing the problem of frequency domain resource waste.

[0010] In combination with the first aspect, in some possible implementations, determining that the first node is an allocation node includes: based on the effective degree of the first node and the effective degrees of the neighbor nodes of the first node, determining that the first node is an allocation node, and the allocation node satisfies: its own effective degree is non-zero, and no neighbor node has an effective degree exceeding its own effective degree; the effective degree of the node is the number of links to be allocated with the node as the sending node and / or receiving node of the target data flow, and the link to be allocated is a link that will carry at least one target data flow, and the target data flow satisfies: the load exceeds a preset load threshold, or the quality of service (QoS) flow identifier (ID) (Qos flow ID, QFI) exceeds a preset QFI threshold.

[0011] In this application, the role types of nodes can include allocating nodes, allocated nodes, and completing allocation nodes. Among them, the allocating node satisfies: its own effective degree is non-zero, and no neighbor node has an effective degree exceeding its own effective degree; the allocated node satisfies: its own effective degree is non-zero, and there is a neighbor node with an effective degree exceeding its own effective degree; the completing allocation node satisfies: its own effective degree is zero.

[0012] In combination with the first aspect, in some possible implementations, before determining that the first node is an allocation node based on the effective degree of the first node and the effective degree of the neighbor node of the first node, the method also includes: determining the effective degree of the first node based on the to-be-sent data flow of the first node on the link between the first node and the neighbor node of the first node, and the effective degree announcement (EDA) signaling received from the neighbor node of the first node, the to-be-sent data flow is the data flow to be sent by the first node; determining the effective degree of the neighbor node of the first node based on the EDA signaling received from the neighbor node of the first node; wherein the EDA signaling includes at least one of the following: the effective degree of the sending node of the EDA signaling, the current link to be allocated of the sending node of the EDA signaling, and the outflow priority of the current link to be allocated; the outflow priority is determined based on the QFI of the target data flow in the to-be-sent data flow.

[0013] In combination with the first aspect, in some possible implementations, the effective degree of the first node is determined based on the to-be-sent data flow of the first node on the link between the first node and the neighbor node of the first node, and the EDA signaling received from the neighbor node of the first node, including: based on the to-be-sent data flow of the first node on the link between the first node and the neighbor node of the first node, recording the current link to be allocated and the outflow priority of the link to be allocated, as well as the current effective degree of the first node; receiving the EDA signaling from the neighbor node of the first node; based on the EDA signaling of the neighbor node of the first node, recording the effective degree of the neighbor node of the first node and the inflow priority of the link to be allocated related to the first node, the inflow priority being equal to the outflow priority of the target link to be allocated in the current link to be allocated of the neighbor node of the first node, the target link to be allocated being the link to be allocated related to the first node; updating the effective degree of the first node based on the inflow priority of the link to be allocated related to the first node.

[0014] In combination with the first aspect, in some possible implementations, the method further includes: sending the EDA signaling to a neighboring node of the first node; and / or receiving the EDA signaling from a neighboring node of the first node.

[0015] In combination with the first aspect, in some possible implementations, allocating resources to nodes within the group to which the first node belongs includes: when the first node is the allocation node, sending a request to allocate (RTA) signaling to the neighboring nodes within the group of the first node, where the RTA signaling is used to request allocation of resources for other nodes; and when receiving a clear to allocate (CTA) signaling from all neighboring nodes within the group of the first node, allocating resources to the to-be-allocated links between the nodes within the group, where the CTA signaling is used to indicate: the data transmission requirements of the node sending the CTA signaling, and / or the resources allocated by other allocation nodes other than the first node.

[0016] With reference to the first aspect, in some possible implementations, the RTA signaling carries a contention value of a sending node of the RTA signaling.

[0017] In this implementation, when an allocating node requests to allocate resources to its neighboring node, it can inform its neighboring node of its own contention value through RTA signaling, so that its neighboring node can determine whether to allow the allocating node to allocate resources to itself based on its contention value, thereby avoiding the problem of resource collision caused by multiple allocating nodes simultaneously allocating reserved resources to the allocated node.

[0018] With reference to the first aspect, in some possible implementations, the RTA signaling carries location information of a first resource, and the first resource is used to transmit the CTA signaling.

[0019] It should be understood that the "first resource" here is different from the above-mentioned "first resource allocation result". The "first resource" is the resource used to transmit CTA signaling, and the above-mentioned "first resource allocation result" is the resource allocation status of the resource used to transmit data.

[0020] In combination with the first aspect, in some possible implementations, before allocating resources to the to-be-allocated links between nodes in the group where the first node is located, the method further includes: determining the group where the first node is located.

[0021] In combination with the first aspect, in some possible implementations, after allocating resources to the links to be allocated between the nodes in the group where the first node is located, the method also includes: sending a finish to allocate (FTA) signaling to the neighboring nodes in the group of the first node, and the FTA signaling is used to indicate: the resource allocation results on the links to be allocated between the nodes in the group where the sending node of the FTA signaling is located.

[0022] In combination with the first aspect, in some possible implementations, before sending FTA signaling to the neighboring nodes in the group where the first node is located, the method also includes: updating the effective degree of the first node based on the resource allocation results on the links to be allocated between the nodes in the group where the first node is located.

[0023] With reference to the first aspect, in some possible implementations, the FTA signaling carries the updated effective degree of the first node.

[0024] In combination with the first aspect, in some possible implementations, the FTA signaling carries a contention value and / or a medium access control (MAC) identifier (MAC ID) of an allocation node in the group to which the sending node of the FTA signaling belongs.

[0025] In this implementation, FTA signaling carries the contention value of the allocation node within the group to which the sending node of the FTA signaling belongs, so that when the allocated node receives FTA signaling from multiple neighboring nodes and finds that there are overlapping resources, the allocated node can determine whether to use the overlapping resources based on the contention values ​​of the allocation nodes in different groups, so as to adjust the use of the overlapping resources, which can further reduce the problem of resource collision.

[0026] In combination with the first aspect, in some possible implementations, the FTA signaling includes a first resource allocation result encapsulated in the MAC layer and a second resource allocation result encapsulated in the physical layer, the first resource allocation result indicates the correspondence between the link to be allocated and the resource, and the second resource allocation result includes a bit map, which includes multiple bits, and the multiple bits correspond to multiple resource units, and each bit indicates whether the corresponding resource unit has been allocated.

[0027] The resource unit used for allocation may be a time-frequency resource with a time slot as the time unit and a subchannel as the frequency unit. In actual application scenarios, the resource unit may also be a time-frequency resource with a larger or smaller granularity, which is not limited in this application.

[0028] It can be understood that the granularity of the first resource allocation result is different from that of the second resource allocation result, wherein the first resource allocation result can indicate which link to be allocated is allocated which resource; the second resource allocation result can indicate which resources have been allocated without indicating the correspondence between the resource unit and the link to be allocated.

[0029] In combination with the first aspect, in some possible implementations, the second resource allocation result is indicated by two-stage sidelink control information (SCI), the two-stage SCI including first-stage SCI and second-stage SCI, the first-stage SCI indicates the type of the second-stage SCI, and the second-stage SCI contains the second resource allocation result.

[0030] The second-order SCI includes the second resource allocation result, which may mean that the second-order SCI includes indication information of the second resource allocation result, or in other words, the second-order SCI indicates the second resource allocation result.

[0031] In combination with the first aspect, in some possible implementations, the resources used to transmit control signaling are randomly determined by the sending node of the control signaling based on historical listening information and / or historical allocation information, excluding resources used to transmit data. The historical listening information includes: reserved resources of non-networked nodes detected before the control signaling is sent this time; the historical allocation information includes: resource allocation results recorded by the sending node of the control signaling by parsing the received FTA signaling before the control signaling is sent this time; wherein, the control signaling is RTA signaling, EDA signaling or FTA signaling.

[0032] It can be understood that in the resource allocation method provided in the present application, the node can use a random transmission method based on time series prediction to send control signaling such as EDA signaling, RTA signaling or FTA signaling.

[0033] Based on the above technical solutions, during each round of allocation, each node determines its role type by comparing its effective degree within a local area (a one-hop neighborhood centered on the node itself). The allocating node completes resource allocation for the links to be allocated within the one-hop neighborhood by randomly starting and coordinating the order, and notifies the resource allocation results to avoid resource conflicts on interfering links. This ensures that when nodes use reserved resources during the current round of data transmission, link interference does not occur. The allocated node can eliminate startup conflicts of the allocating node and conflicts in resources allocated by different allocating nodes based on the contention value of the allocating node. This effectively reduces resource collisions.

[0034] In a second aspect, the present application provides a resource allocation method, which is applied to a sideways multi-hop network. The method can be executed by a second node in the sideways multi-hop network, and the second node can be any node in the sideways multi-hop network. The second node can be a terminal device, or a component configured in the terminal device (such as a chip, chip system, etc.), or a logic module or software capable of implementing all or part of the terminal device functions, which is not limited by the present application.

[0035] Exemplarily, the method includes: determining that the second node is an allocated node, the allocated node is a node that requires other nodes to allocate resources to itself; receiving RTA signaling from a first node, the first node is an allocating node, and the first node is a neighbor node of the second node, the RTA signaling is used to request allocation of resources to other nodes, and the allocating node is a node that needs to allocate resources to other nodes; sending CTA signaling to the first node, the CTA signaling is used to indicate: the data transmission requirements of the second node, and / or, the resources allocated by other allocating nodes other than the first node.

[0036] Based on the above technical solution, the nodes in the side-by-side multi-hop network need to determine their own role type before each round of resource allocation. When the role type of the node is an assigned node, the assigned node can accept the non-overlapping resources allocated to it by the allocating node to ensure that there will be no resource collision in the group where each assigned node is located, thereby reducing the probability of resource collision in the entire side-by-side multi-hop network.

[0037] In combination with the second aspect, in some possible implementations, determining that the second node is an assigned node includes: based on the effective degree of the second node and the effective degree of the second node's neighbor nodes, determining that the second node is an assigned node, and the assigned node satisfies: its own effective degree is non-zero, and there are neighbor nodes whose effective degrees exceed its own effective degree; the effective degree of the node is the number of links to be assigned with the node as the sending node and / or receiving node of the target data flow, and the link to be assigned is a link that will carry at least one target data flow, and the target data flow satisfies: the load exceeds a preset load threshold, or the QFI exceeds a preset QFI threshold.

[0038] In this application, the role types of nodes can include allocating nodes, allocated nodes, and completing allocation nodes. Among them, the allocating node satisfies: its own effective degree is non-zero, and no neighbor node has an effective degree exceeding its own effective degree; the allocated node satisfies: its own effective degree is non-zero, and there is a neighbor node with an effective degree exceeding its own effective degree; the completing allocation node satisfies: its own effective degree is zero.

[0039] In combination with the second aspect, in some possible implementations, before determining that the second node is an allocation node based on the effective degree of the second node and the effective degree of the neighbor node of the second node, the method also includes: determining the effective degree of the second node based on the to-be-sent data flow of the second node on the link between the second node and the neighbor node of the second node, and the EDA signaling received from the neighbor node of the second node, the to-be-sent data flow is the data flow to be sent by the second node; determining the effective degree of the neighbor node of the second node based on the EDA signaling received from the neighbor node of the second node; wherein the EDA signaling includes at least one of the following: the effective degree of the sending node of the EDA signaling, the current link to be allocated of the sending node of the EDA signaling, and the outflow priority of the current link to be allocated; the outflow priority is determined based on the QFI of the target data flow in the to-be-sent data flow.

[0040] In combination with the second aspect, in some possible implementations, the effective degree of the second node is determined based on the to-be-sent data flow of the second node on the link between the second node and the neighboring node of the second node, and the EDA signaling received from the neighboring node of the second node, including: based on the to-be-sent data flow of the second node on the link between the second node and the neighboring node of the second node, recording the current link to be allocated of the second node and the outflow priority of the link to be allocated, as well as the current effective degree; receiving the EDA signaling from the neighboring node of the second node; based on the EDA signaling of the neighboring node of the second node, recording the effective degree of the neighboring node of the second node and the inflow priority of the link to be allocated related to the second node, the inflow priority being equal to the outflow priority of the target link to be allocated in the current link to be allocated of the neighboring node of the second node, the target link to be allocated being the link to be allocated related to the second node; based on the inflow priority of the link to be allocated related to the second node, updating the effective degree of the second node.

[0041] In combination with the second aspect, in some possible implementations, the method further includes: sending EDA signaling to a neighboring node of the second node.

[0042] In combination with the second aspect, in some possible implementations, the method further includes: receiving EDA signaling from a neighboring node of the second node.

[0043] In combination with the second aspect, in some possible implementations, the method also includes: receiving FTA signaling from a neighbor node of the second node, the FTA signaling being used to indicate: the resource allocation result on the link to be allocated between the nodes in the group where the sending node of the FTA signaling is located, the group including: the allocation node and the neighbor nodes of the allocation node.

[0044] In combination with the second aspect, in some possible implementations, the method further includes: sending FTA signaling to a neighboring node of the second node.

[0045] In combination with the second aspect, in some possible implementations, before sending FTA signaling to the neighboring nodes of the second node, the method further includes: updating the effective degree of the second node based on the resource allocation results on each to-be-allocated link in the group where the second node is located.

[0046] In conjunction with the second aspect, in some possible implementations, the FTA signaling carries the updated effective degree of the second node.

[0047] In combination with the second aspect, in some possible implementations, the method also includes: when the second node receives the FTA signaling from multiple neighboring nodes, based on the resources allocated to the links to be allocated between each node in the groups where the multiple neighboring nodes are respectively located, and the resources allocated to the links to be allocated between each node in the group where the second node is located, determining that there is overlap in the resources allocated to the interference links of the second node in different groups, the interference links of the second node include the links to be allocated with the second node as the endpoint and the links to be allocated with the neighboring nodes of the second node as the end nodes; and determining whether to use or not use the overlapping resources based on the contention value of the allocation nodes in each group where each interference link with overlapping resources is located.

[0048] In combination with the second aspect, in some possible implementations, determining whether to use or not to use the overlapping resources is based on the contention value of the allocation nodes in each group where each interfering link with overlapping resources is located, including: when the contention value of the allocation node in the group where the first link to be allocated is located is greater than the contention value of the allocation node in the group where the second link to be allocated is located, using the resources that overlap with the resources allocated to the second link to be allocated; or, when the contention value of the allocation node in the group where the first link to be allocated is located is less than the contention value of the allocation node in the group where the second link to be allocated is located, not using the resources that overlap with the resources allocated to the second link to be allocated; or, when the contention value of the allocation node in the group where the first link to be allocated is equal to the contention value of the allocation node in the group where the second link to be allocated is located, determining whether to use or not to use the overlapping resources based on the first MAC ID and the second MAC ID, determines whether to use or not use resources that overlap with the resources allocated on the second link to be allocated; wherein, the first link to be allocated and the second link to be allocated are links in which the allocated resources in the interference link of the second node overlap, the first link to be allocated and the second node are in the same group, and the second link to be allocated and the first node are not in the same group; the first MAC ID is the MAC ID of the allocation node in the allocation domain where the first link to be allocated is located, and the second MAC ID is the MAC ID of the allocation node in the allocation domain where the second link to be allocated is located.

[0049] When the assigned node receives FTA signaling from multiple neighboring nodes, the assigned node can actively determine whether there are overlapping resources. If there are overlapping resources, the assigned node can independently determine whether to use the overlapping resources to adjust the use of the overlapping resources, which can further reduce the problem of resource collision.

[0050] In combination with the second aspect, in some possible implementations, when resources that overlap with the resources allocated on the second link to be allocated are not used, the method further includes: updating the allocated link of the second node that does not use the overlapping resources to a link to be allocated, and updating the effective degree of the second node; when the effective degree is non-zero, sending EDA signaling to the neighboring nodes of the second node, the EDA signaling including the effective degree of the second node and / or the current link to be allocated of the second node.

[0051] In combination with the second aspect, in some possible implementations, the method further includes: upon simultaneously receiving RTA signaling from multiple distribution nodes, determining a target distribution node from the multiple distribution nodes; and sending the CTA signaling to the target distribution node.

[0052] In combination with the second aspect, in some possible implementations, determining the target allocation node from the multiple allocation nodes includes: determining the target allocation node from the multiple allocation nodes based on multiple contention values ​​corresponding to the multiple allocation nodes.

[0053] In combination with the second aspect, in some possible implementations, a target allocation node is determined from the multiple allocation nodes based on the multiple competition values ​​corresponding to the multiple allocation nodes, including: determining the node with the largest competition value among the multiple allocation nodes as the target allocation node; or, when the competition values ​​of the multiple allocation nodes are the same, determining the target allocation node from the multiple allocation nodes based on the MAC IDs of the multiple allocation nodes.

[0054] In this implementation, when an assigned node receives RTA signaling from multiple allocating nodes at the same time, the assigned node can determine one allocating node from the multiple allocating nodes as the target allocating node and reply to the RTA signaling of the target allocating node. That is, only the target allocating node is allowed to allocate resources to the assigned node, thereby avoiding the problem of resource collision caused by multiple allocating nodes starting to allocate resources to the assigned node.

[0055] In combination with the second aspect, in some possible implementations, the contention value of a node is determined based on the priority level of the node; wherein, the priority level is determined based on the outgoing priority level and the incoming priority level on the link to be allocated of the node, the outgoing priority level is determined based on the QFI of the target data flow in the data flow to be sent by the node, and the incoming priority level is determined based on the QFI of the target data flow in the data flow to be received by the node from the neighboring node, and the data flow to be sent is the data flow to be sent by the node.

[0056] In combination with the second aspect, in some possible implementations, the FTA signaling includes a first resource allocation result encapsulated in the MAC layer and a second resource allocation result encapsulated in the physical layer, the first resource allocation result indicates the correspondence between the link to be allocated and the resource, and the second resource allocation result includes a bit map, which includes multiple bits, and the multiple bits correspond to multiple resource units, and each bit indicates whether the corresponding resource unit has been allocated.

[0057] The resource unit used for allocation may be a time-frequency resource with a time slot as the time unit and a subchannel as the frequency unit. In actual application scenarios, the resource unit may also be a time-frequency resource with a larger or smaller granularity, which is not limited in this application.

[0058] It can be understood that the granularity of the first resource allocation result is different from that of the second resource allocation result, wherein the first resource allocation result can indicate which link to be allocated is allocated which resource; the second resource allocation result can indicate which resources have been allocated without indicating the correspondence between the resource unit and the link to be allocated.

[0059] In combination with the second aspect, in some possible implementations, the second resource allocation result is indicated by a two-order SCI, which includes a first-order SCI and a second-order SCI, the first-order SCI indicates the type of the second-order SCI, and the second-order SCI contains the second resource allocation result.

[0060] The second-order SCI includes the second resource allocation result, which may mean that the second-order SCI includes indication information of the second resource allocation result, or in other words, the second-order SCI indicates the second resource allocation result.

[0061] With reference to the second aspect, in some possible implementations, the RTA signaling carries a contention value of a sending node of the RTA signaling.

[0062] With reference to the second aspect, in some possible implementations, the RTA signaling carries location information of a first resource, and the first resource is used to transmit the CTA signaling.

[0063] It should be understood that the "first resource" here is different from the above-mentioned "first resource allocation result". The "first resource" is the resource used to transmit CTA signaling, and the above-mentioned "first resource allocation result" is the resource allocation status of the resource used to transmit data.

[0064] In combination with the second aspect, in some possible implementations, the resources used to transmit control signaling are randomly determined by the sending node of the control signaling based on historical listening information and / or historical allocation information, excluding resources used to transmit data. The historical listening information includes: reserved resources of non-networked nodes detected before the control signaling is sent this time; the historical allocation information includes: resource allocation results recorded by the sending node of the control signaling by parsing the received FTA signaling before the control signaling is sent this time; wherein, the control signaling is RTA signaling, EDA signaling or FTA signaling.

[0065] It can be understood that in the resource allocation method provided in the present application, the node can use a random transmission method based on time series prediction to send control signaling such as EDA signaling, RTA signaling or FTA signaling.

[0066] Based on the above technical solutions, during each round of allocation, each node determines its role type by comparing its effective degree within a local area (a one-hop neighborhood centered on the node itself). The allocating node completes resource allocation for the links to be allocated within the one-hop neighborhood by randomly starting and coordinating the order, and notifies the resource allocation results to avoid resource conflicts on interfering links. This ensures that when nodes use reserved resources during the current round of data transmission, link interference does not occur. The allocated node can eliminate startup conflicts of the allocating node and conflicts in resources allocated by different allocating nodes based on the contention value of the allocating node. This effectively reduces resource collisions.

[0067] In a third aspect, the present application provides a communications device that can implement the methods described in any of the first and second aspects and any possible implementation of the first and second aspects. The device includes corresponding modules for executing the methods described above. The modules included in the device can be implemented in software and / or hardware.

[0068] In a fourth aspect, the present application provides a communication device comprising a processor. The processor is coupled to a memory and can be used to execute a program in the memory to implement the method described in the first aspect, the second aspect, and any possible implementation of the first aspect, the second aspect, or any possible implementation of the second aspect.

[0069] Optionally, the communication device further includes a memory.

[0070] Optionally, the communication device further includes a communication interface, and the processor is coupled to the communication interface.

[0071] In a fifth aspect, the present application provides a communication system, comprising at least one first node and at least one second node. The first node is configured to perform the functions of the first node in the first aspect and any possible implementation of the first aspect, and the second node is configured to perform the functions of the second node in the second aspect and any possible implementation of the second aspect.

[0072] In a sixth aspect, the present application provides a chip system comprising at least one processor for supporting the implementation of the functions involved in the above-mentioned first aspect to the second aspect and any possible implementation of the first aspect to any possible implementation of the second aspect, for example, receiving or processing the data and / or indication information involved in the above-mentioned method.

[0073] In one possible design, the chip system further includes a memory, which is used to store program instructions and data, and the memory is located inside or outside the processor.

[0074] The chip system can be composed of chips, or can include chips and other discrete devices.

[0075] In the seventh aspect, the present application provides a readable storage medium on which a program (also referred to as code, or instructions) is stored. When the program is executed by a processor, the methods in the above-mentioned first aspect to the second aspect and any possible implementation of the first aspect to any possible implementation of the second aspect are executed.

[0076] In an eighth aspect, the present application provides a program product, which includes: a program (also referred to as code, or instructions), which, when run, enables the methods in the above-mentioned first aspect to the second aspect and any possible implementation of the first aspect to any possible implementation of the second aspect to be executed.

[0077] It should be understood that the third to eighth aspects of the present application correspond to the technical solutions of the first and second aspects of the present application, and the beneficial effects achieved by each aspect and the corresponding feasible implementation methods are similar and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0078] FIG1 is a schematic diagram of a communication system;

[0079] FIG2 is a schematic diagram of a resource allocation method;

[0080] FIG3 is a schematic diagram of another resource allocation method;

[0081] FIG4 is a schematic diagram of a sideways multi-hop network applicable to the method provided in an embodiment of the present application;

[0082] FIG5 is a schematic flow chart of a resource allocation method provided in an embodiment of the present application;

[0083] FIG6 is a time diagram of a resource allocation process and a data transmission process provided in an embodiment of the present application;

[0084] FIG7 is a schematic diagram of a node determining a role type through load-driven effective degree broadcast and uncovered link-driven effective degree broadcast provided by an embodiment of the present application;

[0085] FIG8 is a schematic diagram of a signaling interaction for an allocation node to complete a resource allocation according to an embodiment of the present application;

[0086] FIG9 is a schematic diagram of an allocation domain provided in an embodiment of the present application;

[0087] FIG10 is another schematic flowchart of the resource allocation method provided in an embodiment of the present application;

[0088] 11 is a schematic diagram of a second node receiving RTA signaling from multiple distribution nodes simultaneously according to an embodiment of the present application;

[0089] FIG12 is a schematic diagram of an adjustment process after the second node does not use overlapping resources according to an embodiment of the present application;

[0090] FIG13 is a schematic diagram of the structure of FTA signaling provided in an embodiment of the present application;

[0091] FIG14 is a schematic diagram of random transmission of control signaling based on sliding window time series prediction provided by an embodiment of the present application;

[0092] FIG15 is another schematic diagram of a resource allocation method provided in an embodiment of the present application;

[0093] FIG16 is a schematic block diagram of a communication device provided in an embodiment of the present application;

[0094] FIG17 is another schematic block diagram of a communication device provided in an embodiment of the present application;

[0095] FIG18 is a schematic structural diagram of a terminal device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0096] The technical solution in this application will be described below with reference to the accompanying drawings.

[0097] First, in this application, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a device, system, product or apparatus comprising a series of modules, modules or units is not necessarily limited to those modules, modules or units explicitly listed, but may include other modules, modules or units that are not explicitly listed or are inherent to these devices, systems, products or apparatuses.

[0098] Second, in this application, words such as "exemplarily" and "for example" are used to indicate examples, illustrations, or explanations. Any embodiment or design described as "exemplarily" or "for example" in the embodiments of this application should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplarily" and "for example" is intended to present the relevant concepts in a concrete manner.

[0099] Third, in this application, "when...", "in the case of...", "if" and "if" all mean that the device will take corresponding actions under certain objective circumstances, which does not limit the time, nor does it require that the device must perform judgment actions when it is implemented, nor does it mean that there are other limitations.

[0100] Fourth, in this application, the terms "first" and "second" are used to distinguish between identical or similar items with substantially the same function or effect. For example, the terms "first node" and "second node" are used to distinguish between different nodes and do not limit their order. Those skilled in the art will understand that the terms "first" and "second" do not limit the quantity or order of execution, and the terms "first" and "second" do not necessarily indicate differences.

[0101] Fifth, in this application, preset can be understood as predefined, defined, predefined, stored, pre-stored, pre-negotiated, or pre-configured, etc.

[0102] Sixth, in this application, "at least one" means one or more. "And / or" describes 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, where A and B can be singular or plural. The character " / " generally indicates that the associated objects are in an "or" relationship, but it does not exclude the situation where it indicates that the associated objects are in an "and" relationship. The specific meaning can be understood in conjunction with the context.

[0103] Seventh, the "sending" and "receiving" in this application indicate the direction of signal transmission. For example, "the first node sends CTA signaling to the target allocation node" can be understood as the destination end of the CTA signaling is the target allocation node, which can include direct sending through the air interface, and also include indirect sending through the air interface by other units or modules. "The first node receives FTA signaling from the neighboring node of the first node" can be understood as the source end of the FTA signaling is the neighboring node of the first node, which can include direct receiving from the neighboring node of the first node through the air interface, and also include indirect receiving from the neighboring node of the first node from other units or modules through the air interface. "Sending" can also be understood as the "output" of the chip interface, and "receiving" can also be understood as the "input" of the chip interface.

[0104] In other words, sending and receiving can be performed between devices, for example, between a first node and a neighboring node of the first node; it can also be performed within a device, for example, sending or receiving between components, modules, chips, software modules or hardware modules within the device through a bus, wiring or interface.

[0105] Eighth, in this application, indications include explicit indications (also called direct indications) and implicit indications (also called indirect indications). Specifically, explicit indication information A refers to including information A; implicit indication information A refers to indicating information A through the correspondence between information A and information B and directly indicating information B. The correspondence between information A and information B can be predefined, pre-stored, pre-burned, or pre-configured; or, it can also refer to indicating information A through information B and preset rules.

[0106] Ninth, in this application, information C is used to determine information D, which includes both information D being determined solely based on information C and information D being determined based on information C and other information. Furthermore, information C can also be used to determine information D indirectly, for example, where information D is determined based on information E, and information E is determined based on information C.

[0107] Tenth, in this application, for the convenience of understanding and explanation, multiple signalings are introduced, such as EDA signaling, RTA signaling, CTA signaling and FTA signaling. The names of these signalings are only used to distinguish different functions and should not constitute any limitation on this application. They can also be defined as other names, such as first signaling, second signaling, etc., without limitation.

[0108] FIG1 is a schematic diagram of a communication system.

[0109] In recent years, to meet the surging service demands in wireless networks, the fifth-generation (5G) / sixth-generation (6G) network architecture has begun to evolve from a single-hop to a multi-hop sidelink mesh network (hereinafter referred to as a sidelink multi-hop network), as shown in Figure 1. The straight line with double arrows in the figure represents a sidelink. For example, the third-generation partnership project (3GPP) standard technical report (TR) 38.836 defines two single-hop relay scenarios for the sidelink: terminal (user equipment, UE) to network relay (UE-to-network relay) and terminal to terminal relay (UE-to-UE relay). In addition, the 3GPP standard TR 23.700-33 enhances the capabilities of sidelink single-hop relay in indirect path switching and multipath transmission. The current 5G standard takes into account the compatibility of future multi-hop transmission in its design, but has not yet implemented the multi-hop transmission capability. Therefore, facing the future 6G standard, opening up the sidelink multi-hop transmission path and realizing the sidelink multi-hop network is a key issue in line with the evolution direction of wireless network architecture.

[0110] In order to achieve an efficient side-by-side multi-hop network, the design of a resource allocation scheme is crucial. Currently known resource allocation methods mainly include the following three categories: centralized resource allocation methods, hybrid resource allocation methods, and distributed resource allocation methods. Traditional centralized resource allocation methods require a central node to collect link status and traffic information from the entire network to solve non-convex and difficult problems. They have the disadvantages of long response time and high algorithm complexity, and are susceptible to single point failures. Although the hybrid resource allocation method reduces the computational complexity and response time of the central node, it still requires the central node to periodically collect information and issue decisions, and is also susceptible to single point failures. The distributed resource allocation method does not require central node control, is not affected by single point failures, can quickly respond to network changes, and has strong flexibility and scalability. Therefore, the distributed resource allocation method is more suitable for side-by-side multi-hop networks.

[0111] However, currently known distributed resource allocation methods generally have the problems of low resource reservation efficiency caused by single-link coordination and high probability of resource collision under multi-data stream transmission.

[0112] Figure 2 is a schematic diagram of a distributed resource allocation method. As shown in Figure 2, the source node sends RTR signaling to the destination node hop by hop through the intermediate nodes along the path. The destination node replies CTR signaling to the source node hop by hop through the intermediate nodes to establish resource reservation for the source node's real-time data stream. Control signaling (including RTR signaling and CTR signaling) is accessed through a distributed coordination function (DCF) in a random competition manner. RTR signaling includes the transmission period and transmission duration of the data stream to be sent, and CTR signaling can be used to instruct the nodes along the path (including the source node, intermediate nodes, and destination node on the multi-hop path) to update their respective recorded resource reservation tables. If the reservation is successfully established, the nodes along the path can use the reserved time domain resources for periodic transmission of real-time data. Once a node along the path discovers that the time domain resources requested by the data stream to be sent have been reserved for other data streams, the node along the path needs to release the time domain resources for the data stream to be sent and reschedule the time domain resources for the data stream to be sent. In the absence of suitable time domain resources, the node along the path can refuse to reserve time domain resources for the data stream to be sent and refuse to transmit the data stream to be sent.

[0113] Although the distributed resource allocation method shown in Figure 2 implements multi-hop resource reservation, when multiple data streams are to be sent, some nodes along the path of different multi-hop data streams may be hidden nodes. Hidden nodes cannot detect each other's reserved resources, resulting in a high probability of resource collision. In addition, the distributed resource allocation method shown in Figure 2 only considers reserving time domain resources for nodes. Some frequency domain resources corresponding to the reserved time domain resources are wasted, resulting in low resource utilization. Furthermore, the distributed resource allocation method shown in Figure 2 uses a single-link carrier sense multiple access (CSMA) method to send RTR signaling and CTR signaling hop by hop, resulting in low reservation efficiency and success rate. Furthermore, in the distributed resource allocation method shown in Figure 2, when the resources reserved by the nodes along the way for different data streams to be sent conflict, the nodes along the way need to release and re-reserve the reserved resources for the data streams to be sent where the resource conflict occurs. This increases the signaling overhead and runtime, and the resource allocation efficiency is low.

[0114] FIG3 is a schematic diagram of another distributed resource allocation method. A currently known distributed resource allocation method for a vehicle to everything (V2X) sidelink network improves the reliability of data transmission by authorizing the sending node to allocate resources through the receiving node. As shown in FIG3 , the sending node listens and selects reserved resources based on Mode 2 (Mode 2) of the sidelink. After listening, the sending node selects reserved resources based on the listening results and sends information about the reserved resources to the receiving node. The receiving node feeds back the allowed reserved resources to the sending node based on its own listening results. Other nodes can listen to the allowed reserved resources fed back by the receiving node to the sending node, and after listening to the allowed reserved resources fed back by the receiving node to the sending node, they can exclude the reserved resources authorized to the sending node. The sending node can transmit data to the receiving node on the reserved resources authorized by the receiving node.

[0115] Although the distributed resource allocation method shown in Figure 3 solves the hidden node problem and improves communication reliability, based on Mode 2 of the sidelink, nodes cannot listen when transmitting and cannot send when listening. When multiple nodes simultaneously send information about reserved resources or resources permitted for reservation, these nodes cannot hear each other's reserved resources. Therefore, the probability of resource collisions is high. This is especially true when there are a large number of nodes or a large number of data streams to be transmitted, as the probability of resource collisions using random resource selection is relatively high. Furthermore, the distributed resource allocation method shown in Figure 3 only considers the selection of reserved resources for single-hop data and does not consider the selection of reserved resources for multi-hop data.

[0116] In response to the above technical problems, the present application provides a resource allocation method, in which a node needs to determine its own role type before each round of resource allocation. When the role type of the node is an allocation node, the allocation node can allocate non-overlapping resources to the nodes in its group, thereby ensuring that no resource collision occurs in the group of each allocation node, thereby reducing the probability of resource collision in the entire side-by-side multi-hop network.

[0117] To facilitate understanding of the embodiments of the present application, some technical terms or vocabulary involved in the present application are briefly explained below.

[0118] 1. Link to be allocated: In the present application, the link to be allocated may be a link that will carry at least one target data flow, wherein the target data flow satisfies: the load exceeds a preset load threshold, or the QFI exceeds a preset QFI threshold.

[0119] 2. Allocated links: In this application, an allocated link may be a link to which resource allocation has been completed. That is, after resources are allocated to a link to be allocated, the link to be allocated becomes an allocated link.

[0120] 3. Link not participating in allocation: In this application, a link not participating in allocation can be a link that does not have any target data stream to be transmitted, that is, the load of no data stream to be transmitted exceeds the preset load threshold, and the QFI of no data stream to be transmitted exceeds the preset QFI threshold.

[0121] 4. Link type: In this application, link types may include links to be allocated, allocated links, and links not participating in allocation.

[0122] 5. Effective degree: In this application, the effective degree of a node can be the number of links to be allocated with the node as the sending node and / or receiving node of the target data flow, that is, the effective degree of a node can be the number of links to be allocated with the node as the endpoint, that is, the effective degree of a node can be the number of links to be allocated connected to the node.

[0123] 6. Outflow priority: In the present application, the outflow priority of a node on any link to be allocated (i.e., any link to be allocated connected to the node) can be determined based on the QFI of the target data flow in the data flow to be sent by the node on the link to be allocated, wherein the data flow to be sent by the node on the link to be allocated is the data flow that the node will send to other nodes through the allocation link.

[0124] For example, the outflow priority level on any link to be allocated of the node = the sum of the QFIs of the target data flows of the node in the data flows to be sent on the link to be allocated; or, the outflow priority level on any link to be allocated of the node = the sum of the QFIs of the target data flows of the node in the data flows to be sent on the link to be allocated × the preset first parameter value; or, the outflow priority level on any link to be allocated of the node = the sum of the QFIs of the target data flows of the node in the data flows to be sent on the link to be allocated ÷ the number of target data flows of the node in the data flows to be sent on the link to be allocated; or, the outflow priority level on any link to be allocated of the node = the maximum value of the QFIs of the target data flows of the node in the data flows to be sent on the link to be allocated; and so on. The present application does not impose any limitation on the specific calculation method of how to obtain the outflow priority level of the node on the link to be allocated based on the QFI of the target data flows in the data flows to be sent on a certain link to be allocated.

[0125] In addition, in the present application, the outflow priority of a node may be determined based on the outflow priority of all links to be allocated to the node.

[0126] For example, the outflow priority of a node = the sum of the outflow priority levels of all the links to be assigned of the node; or, the outflow priority of a node = the sum of the outflow priority levels of all the links to be assigned of the node × the preset second parameter value; or, the outflow priority of a node = the sum of the outflow priority levels of all the links to be assigned of the node ÷ the number of all the links to be assigned of the node; or, the outflow priority of a node = the maximum value of the outflow priority levels of all the links to be assigned of the node; and so on. The present application does not impose any limitation on the specific calculation method of how to obtain the outflow priority of a node based on the outflow priority levels of all the links to be assigned of the node.

[0127] 7. Inflow priority: In the present application, the inflow priority on any link to be allocated of a node can be determined based on the QFI of the target data flow in the data flow to be received by the node on the link to be allocated, wherein the data flow to be received by the node on the link to be allocated is the data flow that the node will receive from other nodes through the allocation link, that is, the data flow that other nodes will send to the node through the allocation link.

[0128] For example, the inflow priority level on any link to be allocated of the node = the sum of the QFIs of the target data flows of the node in the data flows to be received on the link to be allocated; or, the inflow priority level on any link to be allocated of the node = the sum of the QFIs of the target data flows of the node in the data flows to be received on the link to be allocated × a preset third parameter value; or, the inflow priority level on any link to be allocated of the node = the sum of the QFIs of the target data flows of the node in the data flows to be received on the link to be allocated ÷ the number of target data flows of the node in the data flows to be received on the link to be allocated; or, the inflow priority level on any link to be allocated of the node = the maximum value of the QFIs of the target data flows of the node in the data flows to be received on the link to be allocated; and so on. The present application does not impose any limitation on the specific calculation method of how to obtain the inflow priority level of the node on the link to be allocated based on the QFI of the target data flows of the node in the data flows to be received on a certain link to be allocated.

[0129] In addition, in the present application, the inflow priority level of a node may be determined based on the inflow priority levels of all links to be allocated to the node.

[0130] For example, the inflow priority level of a node = the sum of the inflow priority levels of all the links to be allocated of the node; or, the inflow priority level of a node = the sum of the inflow priority levels of all the links to be allocated of the node × the preset fourth parameter value; or, the inflow priority level of a node = the sum of the inflow priority levels of all the links to be allocated of the node ÷ the number of all the links to be allocated of the node; or, the inflow priority level of a node = the maximum value of the inflow priority levels of all the links to be allocated of the node; and so on. The present application does not impose any limitation on the specific calculation method of how to obtain the inflow priority level of a node based on the inflow priority levels of all the links to be allocated of the node.

[0131] It can be understood that, taking the link to be allocated between the first node and the second node as an example, the outgoing priority level of the first node on the link to be allocated between the first node and the second node = the incoming priority level of the second node on the link to be allocated between the first node and the second node, and the incoming priority level of the first node on the link to be allocated between the first node and the second node = the outgoing priority level of the second node on the link to be allocated between the first node and the second node.

[0132] 8. Priority: In the present application, the priority of the link to be allocated can be determined based on the outflow priority and inflow priority of any endpoint of the link to be allocated on the link to be allocated. For example, taking the link to be allocated between the first node and the second node as an example, the priority of the link to be allocated between the first node and the second node = the outflow priority of the first node on the link to be allocated + the inflow priority of the first node on the link to be allocated = the outflow priority of the second node on the link to be allocated + the inflow priority of the second node on the link to be allocated; or, the priority of the link to be allocated between the first node and the second node = (the outflow priority of the first node on the link to be allocated + the inflow priority of the first node on the link to be allocated) × the preset fifth parameter value = (the outflow priority of the second node on the link to be allocated + the inflow priority of the second node on the link to be allocated) × the preset fifth parameter value; or, the priority of the link to be allocated between the first node and the second node = (the outflow priority of the first node on the link to be allocated + the inflow priority of the second node on the link to be allocated) (the priority level of the link to be allocated between the first node and the second node is the maximum value of the outgoing priority level and the incoming priority level of the first node on the link to be allocated, or the maximum value of the outgoing priority level and the incoming priority level of the second node on the link to be allocated; etc., and the present application does not impose any limitation on this. It can be understood that, the target data flow satisfies: the load exceeds the preset load threshold, or the QFI exceeds the preset QFI threshold. That is, the target data flow refers to the data flow whose load or QFI meets the preset requirements.

[0133] In the present application, the priority of a node may be determined based on the priorities of all links to be allocated connected to the node, or may be determined based on the outflow priority of the node and the inflow priority of the node.

[0134] For example, the priority of a node = the sum of the priorities of all the links to be allocated connected to the node; or, the priority of a node = the sum of the priorities of all the links to be allocated connected to the node × the preset sixth parameter value; or, the priority of a node = the sum of the priorities of all the links to be allocated connected to the node ÷ the number of all the links to be allocated connected to the node; or, the priority of a node is the maximum value among the priorities of all the links to be allocated connected to the node; etc. This application does not impose any limitation on the specific calculation method of how to obtain the priority of a node based on the priority of all the links to be allocated connected to the node.

[0135] For another example, the priority of a node = the outflow priority of the node + the inflow priority of the node; or, the priority of a node = (the outflow priority of the node + the inflow priority of the node) × the preset seventh parameter value; or, the priority of a node = (the outflow priority of the node + the inflow priority of the node) ÷ (the number of inflow data flows of the node + the number of outflow data flows of the node); or, the priority of a node is the maximum value of the outflow priority of the node and the inflow priority of the node; etc. The present application does not impose any limitation on the specific calculation method of how to obtain the priority of a node based on the outflow priority of the node and the inflow priority of the node.

[0136] 9. Competition value: In this application, the competition value of a node can be determined based on the priority levels of all the links to be allocated connected to the node. For example, the competition value of a node = the sum of the priority levels of all the links to be allocated connected to the node; or, the competition value of a node = the sum of the priority levels of all the links to be allocated connected to the node × the preset sixth parameter value; or, the competition value of a node = the sum of the priority levels of all the links to be allocated connected to the node ÷ the number of all the links to be allocated connected to the node; or, the competition value of a node is the maximum value among the priority levels of all the links to be allocated connected to the node; etc. This application does not impose any restrictions on the specific calculation method for obtaining the competition value of a node based on the priority levels of all the links to be allocated connected to the node.

[0137] It is understandable that, in some possible implementations, the contention value of a node may be equal to the priority level of the node.

[0138] It can also be understood that the first to seventh parameter values ​​mentioned above can be pre-set. In actual application scenarios, the first to seventh parameter values ​​can be the same values ​​or different values, and this application does not impose any restrictions on this.

[0139] 10. Allocation node: In the present application, an allocation node may be a node that needs to allocate resources to other nodes, that is, a node that needs to allocate resources for data transmission of other nodes.

[0140] 11. Assigned node: In this application, an assigned node is a node that requires other nodes to allocate resources to it, that is, a node that requires other nodes to allocate resources for its data transmission.

[0141] 12. Allocation completion node: In this application, an allocation completion node is a node that does not need to allocate resources to other nodes, nor does it need other nodes to allocate resources to itself.

[0142] 13. Role Type: In this application, the role types of nodes include allocating nodes, allocated nodes, and assigning nodes. An allocating node satisfies: its effective degree is non-zero, and no neighbor node has an effective degree exceeding its own; an allocated node satisfies: its effective degree is non-zero, and a neighbor node has an effective degree exceeding its own; and an assigning node satisfies: its effective degree is zero.

[0143] 14. Allocation domain: In the present application, the allocation domain may include: the allocation node, the neighboring nodes of the allocation node, and the links to be allocated within the one-hop neighborhood of the allocation node. The allocation domain is also the group where the allocation node is located, and the group includes: the allocation node and the neighboring nodes of the allocation node. The group where the node is located may also include the links to be allocated between the allocation node and the neighboring nodes of the allocation node, and the links to be allocated between the neighboring nodes of the allocation node and the neighboring nodes of the allocation node. In other words, "links to be allocated within the one-hop neighborhood of the allocation node" may refer to the links to be allocated between the allocation node and the neighboring nodes of the allocation node, and the links to be allocated between the neighboring nodes of the allocation node and the neighboring nodes of the allocation node.

[0144] 15. Uncovered link: In this application, a link to be allocated that does not belong to any allocation domain may be referred to as an uncovered link.

[0145] 16. Interference links: In this application, the interference links of a node may include the links to be allocated with the node as the endpoint and the links to be allocated with the node's neighboring nodes as end nodes.

[0146] 17. Multi-hop network: Also known as a mesh network, it is a network that transmits data and control instructions between network nodes through dynamic routing.

[0147] The sidewalk multi-hop network involved in this application refers to a multi-hop network in which all nodes are UEs. In this application, the nodes in the sidewalk multi-hop network can be referred to as wireless mesh nodes.

[0148] FIG4 is a schematic diagram of a sideways multi-hop network applicable to the method provided in an embodiment of the present application.

[0149] FIG4 shows a sidelink multi-hop network. The sidelink multi-hop network may include multiple wireless mesh nodes (hereinafter referred to as "nodes" for ease of description), for example, nodes N1 to N12. The links between nodes are sidelinks. In the sidelink multi-hop network, each node may have a proximity service communication 5 (PC5) interface to support sidelink communication. Each node also has the ability to generate, process, forward, and receive data streams, and may serve as a source node, relay node, or destination node for the transmission of sidelink multi-hop data streams (hereinafter referred to as multi-hop data streams).

[0150] In this application, wireless mesh nodes can have two distributed resource allocation modes to support different business data. These two distributed resource allocation modes are enhanced Mode 2 (EM) and the multi-hop mesh mode (MM) of the distributed allocation method provided by this application. EM can support short bursts of data, such as data generated by clicking on web pages and data generated by chatting; MM can support long bursts of data, such as data generated by browsing web pages, data generated by file transmission, and periodic data (such as live broadcast data and cloud conference data).

[0151] In this application, a wireless mesh node may be a UE, which may also be referred to as a terminal device, user equipment, access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user equipment.

[0152] UE may include, but is not limited to: mobile phones, tablet computers, computers with wireless transceiver functions, virtual reality (VR) devices, augmented reality (AR) devices, mixed reality (MR) devices, extended reality (XR) devices, wireless terminals in industrial control, vehicle-mounted devices, wireless terminals in unmanned driving, wireless terminals in remote medical, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, wearable devices, video players, full-range projectors, etc. This application does not limit the specific form of UE.

[0153] 18. Non-networking node: In this application, when a wireless mesh node only transmits service data supported by EM, the wireless mesh node can be referred to as a non-networking node.

[0154] 19. Networking Node: In this application, when a wireless mesh node transmits service data supported by MM, or transmits both service data supported by MM and service data supported by EM, the wireless mesh node may be referred to as a networking node. It is understood that a networking node is a node that supports resource allocation using the resource allocation method provided in this application.

[0155] For ease of description, unless otherwise specified below, "node" refers to a networking node.

[0156] It should be noted that in this application, the above-mentioned technical terms are introduced for the convenience of understanding and explanation. The names of these technical terms are only used to distinguish different functions and should not constitute any limitation to this application. They can also be defined as other names, such as the allocation domain can also be called an allocation group or group, etc. This application does not limit this.

[0157] It should also be noted that the resources involved in the resource allocation method provided in this application are time-frequency resources. For the convenience of description, unless otherwise specified below, time-frequency resources are referred to as resources.

[0158] FIG5 is a schematic flowchart of a resource allocation method provided in an embodiment of the present application.

[0159] As shown in Figure 5, method 500 can be applied to any node in the sideways multi-hop network shown in Figure 4. For ease of description, this node is referred to as the first node in method 500. Method 500 may include steps 510 and 520. The steps of method 500 may be performed by the first node, or the method 500 may be performed by a component (such as a chip, chip system, etc.) in the first node, or may be implemented by a logic module or software that can implement all or part of the functions of the first node, which is not limited in this embodiment of the present application. The steps in Figure 5 are described in detail below.

[0160] In step 510, the first node is determined to be an allocation node.

[0161] As mentioned in the technical terminology section above, in this application, the role types of nodes include allocating nodes, allocated nodes and completing allocation nodes. For detailed descriptions of allocating nodes, allocated nodes and completing allocation nodes, please refer to the relevant descriptions in the technical terminology section above. For the sake of brevity, they will not be repeated here.

[0162] It is understandable that the first node needs to first determine whether it is an allocation node. That is, before each round of resource allocation begins, the first node needs to first determine its role type. The following describes how a node determines its role type with reference to the accompanying figures.

[0163] It can be understood that in the side-by-side multi-hop network shown in Figure 4, each node knows in what time period the round of resource allocation is performed, in what time period the round of data transmission is performed, etc., as well as in what time period and based on what to determine its own role type, all of which can be pre-configured.

[0164] FIG6 is a time diagram of the resource allocation process and the data transmission process provided in an embodiment of the present application.

[0165] As shown in Figure 6, the resource allocation process and the data transmission process can be carried out in parallel. The duration of each round of resource allocation is Ta, and the duration of each round of node data transmission is Tc. Wherein, Ta and Tc are both positive numbers, and Tc>Ta.

[0166] In one possible implementation, determining a first node as an allocation node includes: determining the first node as an allocation node based on the effective degree of the first node and the effective degrees of neighbor nodes of the first node, where the effective degree of the node is the number of links to be allocated with the node as the sending node and / or receiving node of the target data flow, and the link to be allocated is a link that will carry at least one target data flow, and the target data flow satisfies: a load exceeds a preset load threshold, or a QFI exceeds a preset QFI threshold.

[0167] The load threshold and the QFI threshold are both pre-set, and this application does not impose any limitation on the specific values ​​of the load threshold and the QFI threshold in actual application scenarios.

[0168] That is, the first node needs to know its own effective degree and the effective degrees of its neighboring nodes, so that the first node can determine its own role type based on its own effective degree and the effective degrees of its neighboring nodes.

[0169] In one possible implementation, before determining that the first node is an allocation node based on the effective degree of the first node and the effective degree of the neighboring node of the first node, the method 500 also includes: determining the effective degree of the first node based on the to-be-sent data flow of the first node on the link between the first node and the neighboring node of the first node, and the EDA signaling received from the neighboring node of the first node, the to-be-sent data flow being the data flow to be sent by the first node; determining the effective degree of the neighboring node of the first node based on the EDA signaling received from the neighboring node of the first node; wherein the EDA signaling includes at least one of the following: the effective degree of the sending node of the EDA signaling, the current to-be-assigned link of the sending node of the EDA signaling, and the outflow priority of the current to-be-assigned link; the outflow priority is determined based on the QFI of the target data flow in the to-be-sent data flow.

[0170] For detailed descriptions of the links to be allocated and the outbound priority levels, please refer to the relevant descriptions in the technical terms above. For the sake of brevity, they will not be repeated here.

[0171] That is, in this implementation, the effective degree of a first node is determined based on the first node's to-be-sent data stream and EDA signaling from the first node's neighbor nodes. The effective degrees of the first node's neighbor nodes are determined based on EDA signaling from the first node's neighbor nodes. In this implementation, method 500 may further include receiving EDA signaling from the first node's neighbor nodes.

[0172] It should be understood that the effective degree of a first node isn't determined all at once. Specifically, if the effective degree of a neighboring node of the first node changes, the neighboring node will send EDA signaling to the neighboring node of the first node's neighboring node. Accordingly, the first node can receive EDA signaling from the neighboring node of the first node and update its own effective degree based on the EDA signaling from the neighboring node of the first node. If the effective degree of the first node changes, the first node will also send EDA signaling to the neighboring node of the first node. Accordingly, the neighboring node of the first node will also receive EDA signaling from the first node. Thus, the neighboring node of the first node can update its own effective degree based on the EDA signaling from the first node. If its effective degree changes, the neighboring node of the first node will again send EDA signaling to its neighboring node. This cycle repeats. If its effective degree does not change, there is no need to send EDA signaling to its neighboring node again. Thus, the first node and its neighboring nodes can both determine their own effective degrees.

[0173] In combination with the above description, it can be understood that the method 500 may further include: sending EDA signaling to the neighboring nodes of the first node.

[0174] In one possible implementation, the allocating node satisfies: its own effective degree is non-zero, and no neighbor node has an effective degree exceeding its own effective degree; the allocated node satisfies: its own effective degree is non-zero, and a neighbor node has an effective degree exceeding its own effective degree; the node that completes the allocation satisfies: its own effective degree is zero.

[0175] In order to facilitate a better understanding of the resource allocation method provided in this application, the process of a node self-determining its role type is further explained below with reference to FIG7 .

[0176] FIG7 is a schematic diagram of a node determining a role type through load-driven effective degree broadcast and uncovered link-driven effective degree broadcast provided by an embodiment of the present application.

[0177] As shown in Figure 7, before each round of resource allocation, nodes must first determine their role type. This process is called the payload-driven effective degree broadcast phase, and the payload-driven effective degree broadcast period can be Tc-Ta. It should be noted that the payload-driven effective degree broadcast phase does not necessarily cover all links to be allocated. Therefore, after the first batch of allocated nodes in the sideways multi-hop network perform resource allocation, the effective degrees of many nodes in the sideways multi-hop network will also change. Therefore, some nodes need to re-determine their role type to complete resource allocation for links to be allocated that were not covered by the payload-driven effective degree broadcast phase.

[0178] For a detailed description of uncovered links, please refer to the relevant description in the technical terms above. For the sake of brevity, it will not be repeated here.

[0179] For example, in the load-driven effective degree broadcast phase as shown in FIG7 , that is, before each round of resource allocation, the first node needs to determine the role type of the first node based on the first node's to-be-sent data stream on the link between the first node and its neighboring nodes, and the EDA signaling received from the first node's neighboring nodes. If the effective degree of the first node is non-zero and no neighboring node has an effective degree exceeding the effective degree of the first node, the first node can determine its role type as an allocating node; if the effective degree of the first node is non-zero and there is a neighboring node with an effective degree exceeding the effective degree of the first node, the first node can determine its role type as an allocated node; if the effective degree of the first node is zero, the first node can determine its role type as an allocating node.

[0180] In one possible implementation, the first node is determined to be an allocation node based on the to-be-sent data flow of the first node on the link between the first node and the neighboring node of the first node, and the EDA signaling received from the neighboring node of the first node, including: determining the effective degree of the first node based on the to-be-sent data flow of the first node on the link between the first node and the neighboring node of the first node, and the EDA signaling received from the neighboring node of the first node; and determining that the first node is an allocation node based on the effective degree of the first node.

[0181] That is to say, the first node needs to first determine the effective degree of the first node based on the first node's to-be-sent data flow on the link between the first node and the neighboring node of the first node, and the EDA signaling received from the neighboring node of the first node, and then determine the role type of the first node according to the effective degree of the first node.

[0182] In one possible implementation, the effective degree of the first node is determined based on the to-be-sent data flow of the first node on the link between the first node and the neighboring node of the first node, and the EDA signaling received from the neighboring node of the first node, including: recording the current link to be allocated and the outflow priority of the link to be allocated, as well as the current effective degree of the first node based on the to-be-sent data flow of the first node on the link between the first node and the neighboring node of the first node; receiving the EDA signaling from the neighboring node of the first node; recording the effective degree of the neighboring node of the first node and the inflow priority of the link to be allocated related to the first node based on the EDA signaling of the neighboring node of the first node, the inflow priority being equal to the outflow priority of the target link to be allocated in the current link to be allocated of the neighboring node of the first node, the target link to be allocated being the link to be allocated related to the first node; updating the effective degree of the first node based on the inflow priority of the link to be allocated related to the first node.

[0183] Illustratively, the first node may first record the current link to be allocated of the first node, the outflow priority of the link to be allocated, and the current effective degree based on the data flow to be sent by the first node on the link between the first node and its neighboring node.

[0184] As an example but not limitation, the first node may record the current link to be allocated of the first node, the outflow priority of the link to be allocated, and the current effective degree of the first node in a table.

[0185] For example, Table 1 is a neighborhood table for a first node, and Table 2 is a state table for the first node. Taking node N2 in Figure 4 as an example of the first node, nodes N1, N3, and N4 are neighboring nodes of node N2. Node N2 can record its current link to be assigned and its outbound priority in the neighborhood table shown in Table 1, and record its current effective degree in the state table shown in Table 2.

[0186] Table 1 Neighborhood table

[0187] Table 2 Status table

[0188] In Table 1, the “Neighbor Nodes” in the first column represent the neighbor nodes of the owner of Table 1 (e.g., the first node); the “Effective Degree” in the second column represents the effective degree of the neighbor nodes of the owner of Table 1; the “Link Type” in the third column represents the link type of the link between the owner of Table 1 and its neighbor nodes; the “Outflow Priority” in the fourth column represents the outflow priority of the link between the owner of Table 1 and its neighbor nodes, which is obtained based on the QFI of the target data flow to be sent by the owner of Table 1 to the corresponding neighbor node. For example, if the owner of Table 1 is node N2, the flow between node N2 and node N1 is The outflow priority is 0, the outflow priority between node N2 and node N3 is 100, and the outflow priority between node N2 and node N4 is 300; the "inflow priority" in the fifth column represents the inflow priority of the owner of table 1 on the link with its neighboring nodes, and the inflow priority is equal to the outflow priority of the neighboring node of the owner of table 1 on the link with the owner of table 1; the "priority" in the sixth column represents the priority of the link between the owner of table 1 and its neighboring nodes, and the priority is obtained based on the "outflow priority" in the fourth column and the "inflow priority" in the fifth column.

[0189] In Table 2, the "Role Type" in the first column indicates the role type of the owner of Table 2; the "Valid Degree" in the second column indicates the valid degree of the owner of Table 2. For example, the owner of Table 2 is also node N2. Based on the two links to be allocated in Table 1, node N2 can determine that the current valid degree of node N2 is 2. These two links to be allocated are the link to be allocated between node N2 and node N3, and the link to be allocated between node N2 and node N4.

[0190] It should be noted that the initial values ​​of the second column "Effective Degree", the fourth column "Outflow Priority", the fifth column "Inflow Priority", and the sixth column "Priority" in Table 1, as well as the second column "Effective Degree" in Table 2, can be 0 or null; the initial value of the third column "Link Type" in Table 1 can be "Not Participating in Allocation Link" or null; and the initial value of the first column "Role Type" in Table 2 can be "Complete Allocation Node" or null. This application does not impose any restrictions on this.

[0191] After recording the current link to be allocated of the first node, the outflow priority of the link to be allocated, and the current effective degree, the first node can send EDA signaling to the neighbor node of the first node. The EDA signaling can include the current effective degree of the first node, the current link to be allocated, and the outflow priority of the current link to be allocated. Correspondingly, the first node can also receive EDA signaling from the neighbor node of the first node. The EDA signaling of the neighbor node of the first node can include the current effective degree of the neighbor node of the first node, the current link to be allocated, and the outflow priority of the current link to be allocated.

[0192] After receiving EDA signaling from a neighboring node of the first node, the first node may, based on the EDA signaling from the neighboring node, record or update the effective degrees of the first node's neighboring nodes and the inbound priorities of the links to be allocated associated with the first node in Table 1. The first node may also calculate a corresponding priority level based on the recorded outbound and inbound priorities, and also record or update the priority level in Table 1. The first node may also calculate a corresponding priority level based on the recorded outbound and inbound priorities, and update the link type of the corresponding link. It will be understood that if either the outbound priority level or the inbound priority level is non-zero, the link type of the corresponding link is a link to be allocated. Furthermore, the first node may count the links to be allocated recorded in Table 1 to determine the effective degree of the first node, and update the effective degree value recorded in Table 2. Thus, after the load-driven effective degree broadcast phase ends, i.e., when entering the resource allocation process, the first node may determine the role type of the first node based on the effective degree of the first node, and record or update the role type of the first node in Table 2.

[0193] In step 520, resources are allocated to nodes in the group where the first node belongs.

[0194] The group to which the first node belongs includes: the first node (the first node is the allocation node) and the first node's neighbor nodes. The group to which the first node belongs may also include: links to be allocated between the first node and its neighbor nodes, and links to be allocated between the first node's neighbor nodes and their neighbor nodes. For a detailed description of the links to be allocated, please refer to the relevant description in the technical terms above. For the sake of brevity, it is not repeated here.

[0195] The first node acts as an allocation node and can uniformly allocate resources to the links to be allocated within its group. Specifically, when the first node acts as an allocation node, it can act as the resource coordinator for its group and allocate orthogonal resources (i.e., non-overlapping resources) to the links to be allocated within its group. This ensures that resources allocated to the links to be allocated within the first node's group do not conflict with each other.

[0196] In one possible implementation, allocating resources to nodes within the group to which the first node belongs includes: sending RTA signaling to neighboring nodes within the group of the first node, where the RTA signaling is used to request resource allocation for other nodes; and upon receiving CTA signaling from all neighboring nodes within the group of the first node, allocating resources to to-be-allocated links between nodes within the group, where the CTA signaling is used to indicate: data transmission requirements of the node sending the CTA signaling and / or resources already allocated by other allocation nodes other than the first node.

[0197] FIG8 is a schematic diagram of the signaling interaction for the allocation node to complete a resource allocation provided by an embodiment of the present application.

[0198] As shown in Figure 8, after a first node determines that its role type is an allocating node, the first node can send RTA signaling to its neighboring nodes to request resource allocation for the first node's neighboring nodes, that is, to request resource allocation for data transmission of the first node's neighboring nodes. In other words, the RTA signaling can be used to request resource allocation for other nodes.

[0199] After receiving the RTA signaling of the first node, the neighboring node of the first node may send a CTA signaling to the first node to allow the first node to allocate resources to it.

[0200] It should be understood that if a neighboring node of the first node receives the RTA signaling of the first section and subsequently receives RTA signaling from a distribution node other than the first node, it will not reply with a CTA signaling to the distribution nodes other than the first node. If a neighboring node of the first node simultaneously receives RTA signaling from multiple distribution nodes, including the first node, the neighboring node of the first node can determine a target distribution node from the multiple distribution nodes and allow the target distribution node to allocate resources to it. In other words, if the neighboring node of the first node confirms that the first node is the target distribution node, it can send a CTA signaling to the first node to allow the first node to allocate resources to it.

[0201] In one possible implementation, the RTA signaling may also carry the contention value of the node sending the RTA signaling. This allows neighboring nodes of the first node to determine a target allocation node from among the multiple allocation nodes when simultaneously receiving RTA signaling from multiple allocation nodes, including the first node. The purpose of carrying the contention value of the allocation node in the RTA signaling will be explained in detail later; this is briefly described here.

[0202] In the case of receiving CTA signaling from all neighboring nodes in the group where the first node is located, the first node may run a resource allocation algorithm to allocate resources to each link to be allocated in the group where the first node is located.

[0203] In an actual application scenario, all neighbor nodes in the group where the first node is located may include the assigned nodes and / or the assigning nodes that have not yet sent RTA signaling among the neighbor nodes of the first node.

[0204] It is understandable that the effective degree of the allocation node that has not yet issued RTA signaling is the same as the effective degree of the first node. The first node and the allocation node that has not yet issued RTA signaling both satisfy the requirement that their effective degrees are non-zero and that no neighbor node has an effective degree exceeding their own effective degree. Therefore, when determining the role type, the first node and the allocation node that has not yet issued RTA signaling can both determine their role type as allocation node. After receiving the RTA signaling sent by the first node, the allocation node that has not yet issued RTA signaling can also accept the resources allocated to it by the first node.

[0205] It should be noted that during the signaling exchange process for resource allocation completed by the allocation node as shown in Figure 8 , the allocation node's neighboring nodes cannot receive RTA signaling from nodes other than the allocation node. However, after the allocation node completes the signaling exchange process for resource allocation as shown in Figure 8 , the allocation node's neighboring nodes can receive RTA signaling from nodes other than the allocation node to proceed with subsequent resource allocation. After the allocation node's neighboring nodes receive RTA signaling from nodes other than the allocation node, the neighboring nodes can reply with CTA signaling from the node. This CTA signaling can not only indicate the data transmission requirements of the node sending the CTA signaling, but also indicate the resources allocated to other allocation nodes.

[0206] In a possible implementation, before allocating resources to the to-be-allocated links between nodes in the group to which the first node belongs, the method 500 further includes: determining the group to which the first node belongs.

[0207] That is to say, the first node needs to first determine the group to which it belongs, that is, the first node needs to first determine to which links to be allocated resources, so as to perform subsequent resource allocation.

[0208] It can be understood that, in the present application, the group where the first node is located is also the allocation domain where the first node is located.

[0209] FIG9 is a schematic diagram of an allocation domain provided in an embodiment of the present application.

[0210] As an example but not a limitation, as shown in FIG9 , two allocation domains are enclosed by a dotted line. One is an allocation domain with node N5 as the allocation node, which includes the allocation node N5, the neighboring nodes of the allocation node N5: node N4, node N6, node N7 and node N8, and the links to be allocated within the one-hop neighborhood of the allocation node N5: the link to be allocated between node N5 and node N4, the link to be allocated between node N5 and node N6, the link to be allocated between node N5 and node N7, the link to be allocated between node N5 and node N8, and the link to be allocated between node N5 and node N8. The link to be allocated, and the link to be allocated between node N6 and node N8; another allocation domain is an allocation domain with node N10 as the allocation node, which includes the allocation node N10, the neighboring nodes of the allocation node N10: node N9, node N11 and node N12, and the links to be allocated within the one-hop neighborhood of the allocation node N10: the link to be allocated between node N10 and node N9, the link to be allocated between node N10 and node N11, and the link to be allocated between node N10 and node N12.

[0211] In one possible implementation, after allocating resources to the links to be allocated between the nodes in the group where the first node is located, the method 500 also includes: sending FTA signaling to the neighboring nodes in the group of the first node, and the FTA signaling is used to indicate: the resource allocation results on the links to be allocated between the nodes in the group where the sending node of the FTA signaling is located.

[0212] That is, as shown in Figure 8, after allocating resources to the links to be allocated within the group where the first node is located, the first node can inform all neighboring nodes of the first node in the group where the first node is located of the resource allocation results on each link to be allocated within the group where the first node is located through FTA signaling (for example, FTA-I in Figure 8).

[0213] In one possible implementation, before sending FTA signaling to neighbor nodes in the group of the first node, the method 500 further includes: updating the effective degree of the first node based on resource allocation results on the to-be-allocated links between nodes in the group of the first node.

[0214] After allocating resources to the to-be-allocated links between the nodes in the group to which the first node belongs, the first node may also update the effective degree of the first node, for example, update the effective degree recorded in Table 2 above.

[0215] In a possible implementation manner, the FTA signaling carries the updated effective degree of the first node.

[0216] In this implementation, after updating its own effective degree based on the resource allocation results on each to-be-allocated link within the first node's group, the first node may send FTA signaling to neighboring nodes within the first node's group. This FTA signaling may be, for example, FTA-I shown in FIG8 or FIG9 . This FTA signaling may not only indicate the resource allocation results on each to-be-allocated link within the first node's group, but may also indicate the updated effective degree of the first node. For example, the number within "()" following FTA-I in FIG9 represents the effective degree of the second node.

[0217] In addition, in some possible implementations, the FTA signaling may also carry the contention value of the first node. For example, the number in the "{}" following FTA-I in Figure 9 represents the contention value of the first node. The contention value of the first node is determined based on the priority level of the first node; wherein, the priority level is determined based on the outgoing priority level and the incoming priority level on the link to be allocated of the first node, the outgoing priority level is determined based on the QFI of the target data flow in the data flow to be sent by the first node, and the incoming priority level is determined based on the QFI of the target data flow in the data flow to be received by the first node from the neighboring node, and the data flow to be sent is the data flow to be sent by the first node. For a detailed description of the target data flow, please refer to the relevant description in the technical terminology section above. For the sake of brevity, it will not be repeated here.

[0218] That is, in one possible implementation, FTA signaling may also carry the contention value of the assigned node within the group to which the sending node of the FTA signaling belongs. The purpose of carrying the contention value of the assigned node in the FTA signaling will be described in detail later in the steps performed by the assigned node and will not be explained here.

[0219] It should be understood that the use of different brackets to indicate the contention value and effective degree carried by the FTA in Figure 9 is intended only to facilitate the distinction. In actual application scenarios, the contention value and effective degree may not be indicated in brackets. Figure 9 should not limit the present application in any way.

[0220] Based on the above technical solution, the nodes in the side-by-side multi-hop network need to determine their own role type before each round of resource allocation. When the role type of the node is an allocation node, the allocation node can allocate non-overlapping resources to the nodes in its group, thereby ensuring that there will be no resource collision in the group of each allocation node, thereby reducing the probability of resource collision in the entire side-by-side multi-hop network.

[0221] In addition, when requesting to allocate resources to its neighboring nodes, the allocating node informs its neighboring nodes of its own contention value through RTA signaling, so that its neighboring nodes can determine whether to allow the allocating node to allocate resources to themselves based on its contention value, thereby avoiding the problem of resource collision caused by multiple allocating nodes allocating reserved resources to the allocated node at the same time.

[0222] In addition, through the effective degree broadcast phase driven by the load and the effective degree broadcast phase driven by the uncovered link, the network is divided into multiple allocation domains. Resource allocation only needs to be performed in the local area, and there is no need for network-wide coordination. This not only realizes the allocation of resources for multi-hop data, but also improves the efficiency of resource allocation.

[0223] Furthermore, when allocating resources, time-frequency resources are allocated to the links to be allocated, not just time-domain resources, thereby reducing the problem of wasting frequency-domain resources.

[0224] FIG10 is another schematic flowchart of the resource allocation method provided in an embodiment of the present application.

[0225] As shown in Figure 10, method 1000 can be applied to any node in the side-by-side multi-hop network shown in Figure 4. For ease of description, this node is referred to as the second node in method 1000. Method 1000 may include steps 1010 to 1030. The steps of method 1000 may be performed by the second node, or the method 1000 may be performed by a component (such as a chip, chip system, etc.) in the second node, or may be implemented by a logic module or software that can implement all or part of the functions of the second node, which is not limited in this embodiment of the present application. The steps in Figure 10 are described in detail below.

[0226] In step 1010, the second node is determined to be an assigned node.

[0227] The allocated node is a node that requires other nodes to allocate resources to it.

[0228] As mentioned in the technical terminology section above, in this application, the role types of nodes include allocating nodes, allocated nodes and completing allocation nodes. For detailed descriptions of allocating nodes, allocated nodes and completing allocation nodes, please refer to the relevant descriptions in the technical terminology section above. For the sake of brevity, they will not be repeated here.

[0229] It is understandable that the second node needs to first determine whether it is an assigned node. That is, before each round of resource allocation process begins, the second node needs to first determine its role type.

[0230] In one possible implementation, determining the second node as the assigned node includes: determining the second node as the assigned node based on the effective degree of the second node and the effective degree of the second node's neighboring nodes, where the effective degree of the node is the number of links to be assigned with the node as the sending node and / or receiving node of the target data flow, and the link to be assigned is a link that will carry at least one target data flow, and the target data flow satisfies: the load exceeds a preset load threshold, or the QFI exceeds a preset QFI threshold.

[0231] The load threshold and the QFI threshold are both pre-set, and this application does not impose any limitation on the specific values ​​of the load threshold and the QFI threshold in actual application scenarios.

[0232] That is, the second node needs to know its own effective degree and the effective degrees of its neighboring nodes, so that the second node can determine its own role type based on its own effective degree and the effective degrees of its neighboring nodes.

[0233] In one possible implementation, before determining that the second node is the assigned node based on the effective degree of the second node and the effective degree of the neighboring node of the second node, the method 1000 also includes: determining the effective degree of the second node based on the to-be-sent data flow of the second node on the link between the second node and the neighboring node of the second node, and the EDA signaling received from the neighboring node of the second node, the to-be-sent data flow being the data flow to be sent by the second node; determining the effective degree of the neighboring node of the second node based on the EDA signaling received from the neighboring node of the second node; wherein the EDA signaling includes at least one of the following: the effective degree of the sending node of the EDA signaling, the current to-be-assigned link of the sending node of the EDA signaling, and the outflow priority of the current to-be-assigned link; the outflow priority is determined based on the QFI of the target data flow in the to-be-sent data flow.

[0234] For detailed descriptions of the links to be allocated and the outbound priority levels, please refer to the relevant descriptions in the technical terms above. For the sake of brevity, they will not be repeated here.

[0235] That is, in this implementation, the effective degree of the second node is determined based on the data flow to be sent by the second node and the EDA signaling from the neighboring nodes of the second node. The effective degree of the neighboring nodes of the second node is determined based on the EDA signaling from the neighboring nodes of the second node.

[0236] In this implementation, the method 1000 may further include: receiving EDA signaling from a neighboring node of the second node.

[0237] It should be understood that the effective degree of the second node is not determined all at once. More specifically, if the effective degree of a neighboring node of the second node changes, the neighboring node will send EDA signaling to the neighboring node of the second node's neighboring node. Accordingly, the second node can receive EDA signaling from the neighboring node of the second node and update its own effective degree based on the EDA signaling of the neighboring node of the second node. If the effective degree of the second node changes, the second node will also send EDA signaling to the neighboring node of the second node. Accordingly, the neighboring node of the second node will also receive EDA signaling from the second node. Thus, the neighboring node of the second node can update its own effective degree based on the EDA signaling from the second node. If its effective degree changes, the neighboring node of the second node will again send EDA signaling to its neighboring node. This cycle repeats. If its effective degree does not change, there is no need to send EDA signaling to its neighboring node again. Thus, the second node and its neighboring nodes can both determine their own effective degrees.

[0238] In combination with the above description, it can be understood that the method 1000 may further include: sending EDA signaling to a neighboring node of the second node.

[0239] In one possible implementation, the allocating node satisfies: its own effective degree is non-zero, and no neighbor node has an effective degree exceeding its own effective degree; the allocated node satisfies: its own effective degree is non-zero, and a neighbor node has an effective degree exceeding its own effective degree; the node that completes the allocation satisfies: its own effective degree is zero.

[0240] In one possible implementation, the effective degree of the second node is determined based on the to-be-sent data flow of the second node on the link between the second node and the neighboring node of the second node, and the EDA signaling received from the neighboring node of the second node, including: recording the current link to be allocated and the outflow priority of the link to be allocated, as well as the current effective degree of the second node based on the to-be-sent data flow of the second node on the link between the second node and the neighboring node of the second node; receiving the EDA signaling from the neighboring node of the second node; recording the effective degree of the neighboring node of the second node and the inflow priority of the link to be allocated related to the second node based on the EDA signaling of the neighboring node of the second node, the inflow priority being equal to the outflow priority of the target link to be allocated in the current link to be allocated of the neighboring node of the second node, the target link to be allocated being the link to be allocated related to the second node; updating the effective degree of the second node based on the inflow priority of the link to be allocated related to the second node.

[0241] For the detailed process of the second node self-determining the role type, please refer to the process of the first node self-determining the role type in the above method 500. For the sake of brevity, it will not be repeated here.

[0242] In step 1020, RTA signaling is received from the first node.

[0243] The first node is an allocation node, and the first node is a neighbor node of the second node. For example, taking node N2 in FIG4 as an example of the first node, node N1 can be an example of the second node, or node N3 can also be an example of the second node, or node N4 can also be an example of the second node.

[0244] For example, as shown in Figure 8, after a first node determines that its role type is an allocating node, the second node can send RTA signaling to a neighboring node of the first node to request resource allocation for the neighboring node of the first node, that is, to request resource allocation for data transmission of the neighboring node of the first node. Correspondingly, the second node, as a neighboring node of the first node, can receive RTA signaling from the first node if it determines that its role type is an allocated node.

[0245] For a detailed description of RTA signaling, please refer to the relevant description in the technical terms above. For the sake of brevity, it will not be repeated here.

[0246] In step 1030, a CTA signaling is sent to the first node.

[0247] The CTA signaling is used to indicate: the data transmission requirement of the second node, and / or the resources allocated by other allocation nodes except the first node.

[0248] It is understandable that, when the second node has a data transmission demand, the CTA signaling can be used to inform the first node so that the first node can allocate resources to the second node.

[0249] In addition, when the second node has learned about the resources allocated by other allocation nodes except the first node, the second node can also inform the first node through the CTA signaling to avoid resource collision when the first node allocates resources.

[0250] It should be understood that, if the second node first receives the RTA signaling of the first section and then receives RTA signaling from other distribution nodes other than the first node, it will no longer reply CTA signaling to other distribution nodes other than the first node.

[0251] As described above in method 500, in actual application scenarios, the second node may simultaneously receive RTA signaling from multiple distribution nodes. The following describes in detail the situation in which the second node simultaneously receives RTA signaling from multiple distribution nodes in conjunction with FIG11.

[0252] In a possible implementation, the method 1000 further includes: upon receiving RTA signaling from multiple distribution nodes simultaneously, determining a target distribution node from the multiple distribution nodes; and sending the CTA signaling to the target distribution node.

[0253] FIG11 is a schematic diagram of a second node receiving RTA signaling from multiple distribution nodes simultaneously according to an embodiment of the present application.

[0254] For example, as shown in a) and b) of Figure 11, taking node N2 as an example of the second node, node N1, node N3 and node N4 are neighbor nodes of node N1, and node N1, node N3 and node N4 are allocation nodes, then any one of node N1, node N3 and node N4 can be an example of the first node.

[0255] As shown in Figure 11(a), when node N2 is the assigned node and simultaneously receives RTA signaling from multiple allocating nodes (nodes N1, N3, and N4), node N2 can identify one of these nodes as the target allocating node and allow that target allocating node to allocate resources to it. This avoids resource conflicts caused by multiple allocating nodes allocating resources to the same assigned node.

[0256] In a possible implementation, determining the target allocation node from the multiple allocation nodes includes: determining the target allocation node from the multiple allocation nodes based on multiple contention values ​​corresponding to the multiple allocation nodes.

[0257] In one possible implementation, the contention value of a node is determined based on the priority level of the node; wherein the priority level is determined based on the outgoing priority level and the incoming priority level on the link to be allocated of the node, the outgoing priority level is determined based on the QFI of the target data flow in the data flow to be sent by the node, and the incoming priority level is determined based on the QFI of the target data flow in the data flow to be received by the node from a neighboring node, and the data flow to be sent is the data flow to be sent by the node.

[0258] That is, in this implementation, the contention value of an allocation node (e.g., node N1, node N3, and node N4 shown in FIG11 ) is determined based on the priority level of the allocation node. For a detailed description of the priority level and contention value, please refer to the relevant descriptions in the technical terms above. For the sake of brevity, they are not repeated here.

[0259] In a possible implementation manner, the RTA signaling carries a contention value of a sending node of the RTA signaling.

[0260] That is, in this implementation, the allocating node may carry the contention value of the allocating node in the RTA signaling sent to the allocated node, so that the allocating node may determine whether the allocating node is the target allocating node according to the contention value of the allocating node.

[0261] As shown in FIG11 b), when node N2 simultaneously receives RTA signaling from node N1, node N3 and node N4, node N2 may determine one node from the multiple nodes as the target allocation node based on the contention values ​​of the multiple nodes.

[0262] In one possible implementation, based on the multiple competition values ​​corresponding to the multiple distribution nodes, a target distribution node is determined from the multiple distribution nodes, including: determining the node with the largest competition value among the multiple distribution nodes as the target distribution node; or, when the competition values ​​of the multiple distribution nodes are the same, determining the target distribution node from the multiple distribution nodes based on the MAC IDs of the multiple distribution nodes.

[0263] In a possible implementation, the RTA signaling carries a contention value of a sending node of the RTA signaling.

[0264] As shown in b) of Figure 11, the competition value of node N1 is 811, the competition value of node N3 is 660, and the competition value of node N4 is 610. The RTA signaling sent by node N1 to node N2 carries the competition value 811 of node N1, the RTA signaling sent by node N3 to node N2 carries the competition value 660 of node N3, and the RTA signaling sent by node N4 to node N2 carries the competition value 620 of node N4. 811>660>620, so node N2 can determine node N1 as the target allocation node.

[0265] It can be understood that the header of the RTA signaling carries the MAC ID of the node, so in one possible implementation, when the contention values ​​of the multiple allocation nodes are the same, node N2 can determine the target allocation node from the multiple allocation nodes based on the MAC IDs of the multiple allocation nodes.

[0266] As an example and not a limitation, for example, when the contention values ​​of the multiple allocation nodes are the same, node N2 may determine the allocation node with the largest MAC ID among the multiple allocation nodes as the target allocation node; or, when the contention values ​​of the multiple allocation nodes are the same, node N2 may determine the allocation node with the smallest MAC ID among the multiple allocation nodes as the target allocation node. This application is not limited to this.

[0267] After determining a target allocation node from a plurality of allocation nodes, the second node may send a CTA signaling to the target allocation node.

[0268] It should be noted that after determining the target allocation node, the first node (i.e., the allocated node) may only respond to the target allocation node's RTA. As shown in Figure 11, when node N1 is determined as the target allocation node by node N2, node N2 may only respond to node N1's RTA. That is, node N2 may only send CTA signaling to node N1 to allow node N1 to allocate resources to node N2. Furthermore, node N2 may not respond to the RTAs of nodes N3 and N4. That is, node N2 may not send CTA signaling to nodes N3 and N4.

[0269] It is understood that the second node can directly reply to the CTA signaling of the allocation node from which it first receives RTA signaling, allowing the allocation node to allocate resources to it. In other words, if the second node does not receive RTA signaling from multiple allocation nodes simultaneously, the second node does not need to perform the step of determining the target allocation node from the multiple allocation nodes. Instead, upon receiving RTA signaling from a neighboring node, the second node can simply send CTA signaling to the neighboring node.

[0270] In one possible implementation, the method 1000 further includes: receiving FTA signaling from a neighboring node of the second node, the FTA signaling being used to indicate: a result of resource allocation on the link to be allocated between nodes in a group where the sending node of the FTA signaling is located; the group includes: an allocating node and a neighboring node of the allocating node.

[0271] In this application, the group in which a node resides (i.e., the allocation domain in which the node resides) includes: the allocation node and its neighbor nodes. The group in which a node resides may also include links to be allocated between the allocation node and its neighbor nodes, and links to be allocated between the allocation node's neighbor nodes and their neighbor nodes.

[0272] For a detailed description of the allocation domain and the link to be allocated, please refer to the relevant description in the technical terms above. For the sake of brevity, it will not be repeated here.

[0273] It should be understood that the neighbor nodes of the second node herein may include the first node or target allocation node described above, or may include neighbor nodes of the second node other than the first node or target allocation node. The neighbor nodes of the second node other than the first node or target allocation node may include neighbor nodes in the same group as the second node, or may include neighbor nodes not in the same group as the second node. This is described in detail below with reference to Figures 8 and 9.

[0274] As shown in Figure 8, after allocating resources to each link to be allocated in the allocation domain where the first node is located, the first node may also update the effective degree of the first node, for example, update the effective degree recorded in Table 2 above. Furthermore, the first node may also send FTA signaling to the neighboring nodes of the first node (including the second node). The FTA signaling may be, for example, the FTA-I shown in Figure 8 or Figure 9. The FTA signaling may be used to indicate the resource allocation results on each link to be allocated in the group where the first node is located, and the FTA signaling is also used to indicate the updated effective degree of the first node. For example, the number in the "()" after FTA-I in Figure 9 represents the effective degree of the second node. In addition, the FTA signaling may also carry the contention value of the first node. For example, the number in the "{}" after FTA-I in Figure 9 represents the contention value of the first node.

[0275] After the neighboring nodes of the first node receive the FTA signaling from the first node, the neighboring nodes of the first node may send FTA signaling to the neighboring nodes of the neighboring nodes of the first node. The FTA signaling may be, for example, FTA-II shown in FIG8 or FIG9. The FTA signaling may be used to indicate the resource allocation results on each link to be allocated within the group where the neighboring nodes of the first node are located, and the FTA signaling is also used to indicate the updated effective degree of the neighboring nodes of the first node (for example, the second node). For example, the number in "()" after FTA-II in FIG9 indicates the effective degree of the neighboring nodes of the first node. In addition, the FTA signaling may also carry the contention value of the allocation node (that is, the first node) within the group where the neighboring nodes of the first node are located. For example, the number in "{}" after FTA-II in FIG9 indicates the contention value of the first node.

[0276] From this, it can be seen that the second node, as the assigned node, can not only receive FTA signaling from the allocation node in its group, but also, when the second node has other neighbor nodes other than the allocation node (that is, the first node or the target allocation node), the second node will also receive FTA signaling from other neighbor nodes other than the allocation node. The other neighbor nodes other than the allocation node may include neighbor nodes in the same group as the second node, and may also include neighbor nodes that are not in the same group as the second node.

[0277] For example, in combination with Figure 9, taking node N8 as an example of the second node and N5 as an example of the first node or the target allocation node, after node N5 allocates resources for the links to be allocated in its group, node N5 can inform the neighboring nodes of node N5 (including node N4, node N6, node N7 and node N8) of the resource allocation result through FTA signaling.

[0278] Furthermore, node N4, node N6, node N7 and node N8 can respectively inform their neighbor nodes of the resource allocation results within the group through FTA signaling. For example, in Figure 9, node N8 informs node N9 of the resource allocation results within the allocation domain where node N8 is located through FTA-II. Node N9 and node N8 are not in the same group.

[0279] Node N6 can also inform node N8 of the resource allocation result within the group to which node N6 belongs through FTA-II. Node N6 and node N8 are in the same group, and the resource allocation result within the group obtained by node N8 from node N5 and node N6 is the same. The difference is that node N8 can obtain the effective degree of node N5 updated based on the resource allocation result based on the FTA signaling from node N5, and node N8 can obtain the effective degree of node N6 updated based on the resource allocation result based on the FTA signaling from node N6.

[0280] Without loss of generality, in a group with node N10 as the allocation node, after node N10 allocates resources for the links to be allocated in its group, node N10 can inform the neighboring nodes of node N10 (including node N9, node N11 and node N12) of the resource allocation result through FTA signaling.

[0281] Furthermore, node N9, node N11, and node N12 may respectively inform their neighboring nodes of the resource allocation results within the group through FTA signaling. For example, in FIG9 , node N9 informs node N8 of the resource allocation results within the group to which node N9 belongs through FTA-II, but node N8 and node N9 are not in the same group.

[0282] As can be seen from the above descriptions of FIG8 and FIG9 , in a possible implementation, the method 1000 may further include: the second node sending FTA signaling to a neighboring node of the second node. Detailed description is omitted for brevity.

[0283] As can be seen from the descriptions of FIG. 8 and FIG. 9 , in one possible implementation, before the second node sends FTA signaling to its neighboring nodes, method 1000 may further include: updating the effective degree of the second node based on resource allocation results for each to-be-allocated link within the group to which the second node belongs. For the sake of brevity, this description is omitted here.

[0284] As can be seen from the descriptions of Figures 8 and 9 above, in one possible implementation, FTA signaling carries the updated effective degree of the second node. That is, FTA signaling carries the updated effective degree of the sending node, which is updated based on the resource allocation results within the group to which it belongs. For the sake of brevity, this will not be further described here.

[0285] In a possible implementation, the FTA signaling carries the contention value and / or MAC ID of the distribution node in the distribution domain where the sending node of the FTA signaling is located.

[0286] That is, the FTA signaling may not only indicate the resource allocation result and the effective degree of the sending node of the FTA signaling, but may also carry the contention value and / or MAC ID of the allocation node in the allocation domain where the sending node of the FTA signaling is located.

[0287] It can be seen from the above descriptions of FIG. 8 and FIG. 9 that the first node may receive FTA signaling from multiple neighboring nodes.

[0288] The following describes in detail the purpose of carrying the contention value of the allocation node in the FTA signaling.

[0289] In one possible implementation, the method 1000 also includes: when the second node receives FTA signaling from multiple neighboring nodes, based on the resources allocated to the links to be allocated between the nodes in the groups where the multiple neighboring nodes are respectively located, and the resources allocated to the links to be allocated between the nodes in the group where the first node is located, determining that there is overlap in the resources allocated to the interference links of the second node in different groups, the interference links of the second node include the links to be allocated with the second node as the endpoint and the links to be allocated with the neighboring nodes of the second node as the end nodes; and determining whether to use or not use the overlapping resources based on the contention value of the allocation nodes in each group where each interference link with overlapping resources is located.

[0290] Exemplarily, as shown in Figure 9, taking node N9 as an example of the second node, node N9 can receive FTA signaling from node N10, and can also receive FTA signaling from node N8. In this case, node N9 can determine whether there is overlap in the resources allocated to the interfering link of node N9 in different groups based on the resources allocated to each to-be-allocated link in the groups where node N10 and node N8 are respectively located, and the resources allocated to each to-be-allocated link in the group where node N9 is located.

[0291] As shown in Figure 9, the interfering links of node N9 include the link to be allocated between node N9 and node N10, the link to be allocated between node N9 and node N8, the link to be allocated between node N8 and node N5, and the link to be allocated between node N8 and node N6. In the case of overlap in the allocated resources, node N9 can determine whether to use the overlapping resources based on the contention value of the allocation nodes in each group where the interfering links of the overlapping resources are located. It can be understood that overlapping resources are also resources where resource collision occurs.

[0292] In one possible implementation, determining whether to use or not use the overlapping resources is based on the contention value of the allocation nodes in each group where each interfering link with overlapping resources is located, including: when the contention value of the allocation nodes in the group where the first link to be allocated is located is greater than the contention value of the allocation nodes in the group where the second link to be allocated is located, using the resources that overlap with the resources allocated on the second link to be allocated; or, when the contention value of the allocation nodes in the group where the first link to be allocated is located is less than the contention value of the allocation nodes in the group where the second link to be allocated is located, not using the resources that overlap with the resources allocated on the second link to be allocated; or, when the contention value of the allocation nodes in the group where the first link to be allocated is equal to the contention value of the allocation nodes in the group where the second link to be allocated is located, determining whether to use or not use the resources that overlap with the resources allocated on the second link to be allocated based on the first MAC ID and the second MAC ID.

[0293] Among them, the first link to be allocated and the second link to be allocated are links in which the allocated resources in the interference link of the second node overlap, the first link to be allocated and the second node are in the same group, and the second link to be allocated and the second node are not in the same group; the first MAC ID is the MAC ID of the allocation node in the group where the first link to be allocated is located, and the second MAC ID is the MAC ID of the allocation node in the group where the second link to be allocated is located.

[0294] Exemplarily, as shown in Figure 9, taking node N9 as an example of the second node, assuming that the resources allocated by node N10 to the link to be allocated between node N9 and node N10 (that is, the first link to be allocated) overlap with the resources allocated by node N5 to the link to be allocated between node N8 and node N5 (that is, the second link to be allocated), node N9 can know that the contention value of node N10 is 620 based on the FTA signaling sent by node N10, and node N9 can know that the contention value of node N5 is 811 based on the FTA signaling sent by node N8, 811>620, therefore, node N9 does not use the overlapping resources for data transmission, that is, node N9 needs to give up the overlapping resources, and node N8 can use the overlapping resources for data transmission.

[0295] If, in an actual application scenario, the contention value of the node N10 is the same as that of the node N5, the node N9 may determine whether to use the overlapping resource based on the MAC IDs of the node N10 and the node N5.

[0296] Optionally, when overlapping resources exist and the contention values ​​of allocation nodes of multiple groups involved in the overlapping resources are the same, the nodes in the group with the larger MAC ID of the allocation node can use the overlapping resources for data transmission.

[0297] As an example but not limitation, for example, if the MAC ID of node N10 (ie, the first MAC ID) is greater than the MAC ID of node N5 (ie, the second MAC ID), node N9 may use the overlapping resources for data transmission.

[0298] Optionally, when overlapping resources exist and the contention values ​​of allocation nodes of multiple groups involved in the overlapping resources are the same, the nodes in the group with the smaller MAC ID of the allocation node can use the overlapping resources for data transmission.

[0299] As an example but not limitation, for example, if the MAC ID of node N5 (ie, the second MAC ID) is less than the MAC ID of node N10 (ie, the first MAC ID), node N8 may use the overlapping resources for data transmission.

[0300] In one possible implementation, before a node (including an allocating node and an allocated node) sends FTA signaling to its neighboring node, it has already updated the relevant information involved in its own neighborhood table shown in Table 1 and the status table shown in Table 2 according to the resource allocation results that have been learned. For example, the link type of some links can be updated from a link to be allocated to an allocated link, and its own effective degree can be updated to 0, and then its own role type can be updated to a node that has completed allocation.

[0301] After entering the resource allocation process, that is, when the effective degree broadcast phase driven by the load enters the effective degree broadcast phase driven by the uncovered link, as long as the effective degree recorded in the node's state table or the effective degree of the neighbor node recorded in the neighborhood table changes, the node needs to re-determine its role type.

[0302] In one possible implementation, when resources that overlap with the resources allocated on the second link to be allocated are not used, the method 1000 further includes: updating the allocated link of the second node that does not use the overlapping resources to a link to be allocated, and updating the effective degree of the second node, where the effective degree of the second node is the number of links to be allocated of the second node; when the effective degree is non-zero, sending EDA signaling to the neighboring nodes of the second node, where the EDA signaling includes the effective degree of the second node and / or the current link to be allocated of the second node.

[0303] FIG12 is a schematic diagram of the adjustment process after the second node stops using overlapping resources provided in an embodiment of the present application.

[0304] For example, before node N9 sends FTA signaling to node N8, node N9 has modified the link type of the link to be allocated between node N9 and node N10 from a link to be allocated to a link already allocated based on the resources allocated by node N10 for the link to be allocated between node N9 and node N10. Therefore, as shown in FIG12 , when node N9 does not use the overlapping resources for data transmission, node N9 can update the type of the link between node N9 and node N10 from an allocated link to a link to be allocated, and more. The effective degree of the new node N9 is determined, and the node N9 can send EDA signaling to the neighboring nodes of the node N9 when the effective degree of the node N9 is non-zero. As shown in Figure 12, the node N9 sends EDA signaling to the node N8 and the node N10, thereby interacting with the node N8 and the node N10 about their respective effective degrees (for example, the effective degree of the node N9 carried in the EDA signaling sent by the node N9 to the node N8 and the node N10 is 2) to redetermine their respective role types and further allocate resources to the link to be allocated to which the node N9 is connected.

[0305] The adjustment process after the second node does not use the overlapping resources shown in Figure 12 may include the process of broadcasting the effective degree driven by the uncovered link in the nth (n is an integer greater than or equal to 2) round allocation phase shown in Figure 7, which is explained below in conjunction with Figures 9 and 12.

[0306] In Figure 9, when nodes N5 and N10 are each allocating resources to the unallocated links within their respective groups, the link between nodes N8 and N9 does not belong to any group. Therefore, the link between nodes N8 and N9 is an uncovered link. In other words, during the payload-driven effective degree broadcast phase shown in Figure 7, the link between nodes N8 and N9 is an uncovered link. As shown in Figure 12, after node N9 re-determines its role type, the link between nodes N8 and N9 belongs to the group to which node N9 belongs, and thus the link is covered. With resources allocated to the unallocated link between nodes N8 and N9 and other uncovered links, this round of resource allocation concludes.

[0307] It is understood that, when the second node receives FTA signaling from only one neighboring node, the first node may determine whether the resources allocated to the second node's interfering link in different groups overlap. Alternatively, the first node may directly use the resources allocated to the second node by the allocation node in its group for data transmission without determining whether the resources allocated to the second node's interfering link in different allocation domains overlap. This application does not impose any limitations on this.

[0308] Based on the above technical solution, the nodes in the side-by-side multi-hop network need to determine their own role type before each round of resource allocation. When the role type of the node is an assigned node, the assigned node can accept the non-overlapping resources allocated to it by the allocating node to ensure that there will be no resource collision in the group where each assigned node is located, thereby reducing the probability of resource collision in the entire side-by-side multi-hop network.

[0309] In addition, when the assigned node receives RTA signaling from multiple allocation nodes at the same time, the assigned node can determine one allocation node from these multiple allocation nodes as the target allocation node and reply to the RTA signaling of the target allocation node, thereby avoiding the resource collision problem caused by multiple allocation nodes initiating the allocation of reserved resources to the assigned node.

[0310] In addition, when the assigned node receives FTA signaling from multiple neighboring nodes, the assigned node can actively determine whether there are overlapping resources. If there are overlapping resources, the assigned node can independently determine whether to use the overlapping resources to adjust the use of the overlapping resources, which can further reduce the problem of resource collision.

[0311] Furthermore, through the payload-driven effective degree broadcast phase and the uncovered link-driven effective degree broadcast phase, the network is divided into multiple allocation domains. Resource allocation only needs to be performed in local areas, and there is no need for network-wide coordination. This not only realizes the allocation of resources for multi-hop data, but also improves the efficiency of resource allocation.

[0312] Furthermore, when allocating resources, time-frequency resources are allocated to the links to be allocated, not just time-domain resources, thereby reducing the problem of wasting frequency-domain resources.

[0313] In one possible implementation, in the above-mentioned method 500 and method 1000, the above-mentioned FTA signaling includes a first resource allocation result encapsulated in the MAC layer and a second resource allocation result encapsulated in the physical layer, the first resource allocation result indicates the correspondence between the link to be allocated and the resource, and the second resource allocation result includes a bit map, which includes multiple bits, and the multiple bits correspond to multiple resource units, and each bit indicates whether the corresponding resource unit has been allocated.

[0314] The resource unit used for allocation may be a time-frequency resource with a time slot as the time unit and a subchannel as the frequency unit. In actual application scenarios, the resource unit may also be a time-frequency resource with a larger or smaller granularity, which is not limited in this application.

[0315] It can be understood that the granularity of the first resource allocation result is different from that of the second resource allocation result, wherein the first resource allocation result can indicate which link to be allocated is allocated which resource; the second resource allocation result can indicate which resources have been allocated without indicating the correspondence between the resource unit and the link to be allocated.

[0316] In one possible implementation, the second resource allocation result is indicated by two-order sidelink control information SCI, which includes first-order SCI and second-order SCI. The first-order SCI indicates the type of the second-order SCI, and the second-order SCI contains the second resource allocation result.

[0317] The second-order SCI includes the second resource allocation result, which may mean that the second-order SCI includes indication information of the second resource allocation result, or in other words, the second-order SCI indicates the second resource allocation result.

[0318] FIG13 is a schematic diagram of the structure of FTA signaling provided in an embodiment of the present application.

[0319] Exemplarily, as shown in FIG13 , the first resource allocation result may be directly indicated by a MAC control element (CE), and the second resource allocation result may be jointly indicated by a first-order SCI and a second-order SCI.

[0320] As an example and not a limitation, for example, the second-order SCI format value field of the first-order SCI of the physical layer can be set to 11 to indicate a new second-order SCI type (for example, SCI format 2-D). The main content of the second-order SCI is the second resource allocation result, that is, the above-mentioned bit map, which includes multiple bits, each of which corresponds to a plurality of resource units, and each bit indicates whether the corresponding resource unit has been allocated.

[0321] As shown in Figure 8, after the allocation node completes resource allocation, it sends FTA signaling to the neighboring nodes of the allocation node. After the neighboring nodes of the allocation node receive the FTA signaling from the allocation node, they send FTA signaling to the neighboring nodes of the neighboring nodes of the allocation node. In this way, the two-hop broadcast notification of the resource allocation results is completed.

[0322] It should be noted that the FTA signaling designed in conjunction with the MAC layer and the physical layer allows both networking nodes and non-networking nodes to obtain resource allocation results.

[0323] In more detail, after receiving the FTA signaling, the networking node can obtain the first resource allocation result encapsulated in the MAC layer through MAC layer analysis, and then update its previous allocation list (PAL) based on the first resource allocation result to record the links and corresponding resources that have been allocated, and perform resource authorization (using or not using the corresponding resources to transmit data).

[0324] The non-networking node can obtain the FTA signaling by intercepting, and decode the first-order SCI and the second-order SCI of the FTA signaling through the physical layer to obtain the second resource allocation result, and perform resource grant.

[0325] It should be understood that, in addition to excluding the reserved resources indicated by the first-order SCI in the listening window according to the Mode 2 mechanism, non-networking nodes also need to exclude the second resource allocation result indicated by the first-order SCI and second-order SCI of the FTA signaling provided in this application. This achieves both compatibility with the standard Mode 2 and an enhancement to the standard Mode 2.

[0326] In a possible implementation, in the above method 500 and method 1000, the above RTA signaling carries location information of a first resource, and the first resource is used to transmit the CTA signaling.

[0327] It should be understood that the "first resource" here is different from the above-mentioned "first resource allocation result". The "first resource" is the resource used to transmit CTA signaling, and the above-mentioned "first resource allocation result" is the resource allocation status of the resource used to transmit data.

[0328] It is understood that in this implementation, the resources used to transmit CTA signaling can be indicated by RTA signaling. In other words, when the allocating node requests its neighbor node to allocate resources for its neighbor node, it also indicates which resources the neighbor node can use to respond to the allocating node.

[0329] As an example and not a limitation, the allocating node can broadcast RTA signaling to the allocated node, and the allocated node can unicast CTA signaling to the allocating node. Therefore, the allocating node can select orthogonal resources (i.e., there are no overlapping resources) for receiving CTAs from different allocated nodes. The resources used to receive CTA signaling can be carried in the RTA signaling sent by the allocating node to the allocated node. After receiving the RTA signaling, the allocated node can send CTA signaling on the designated resources, thereby ensuring that the allocating node can successfully receive the CTA signaling from each allocated node.

[0330] In one possible implementation, in the above-mentioned method 500 and method 1000, the resources used to transmit control signaling are randomly determined by the sending node of the control signaling based on historical listening information and / or historical allocation information, excluding resources used to transmit data. The historical listening information includes: reserved resources of non-networking nodes detected before the control signaling is sent this time; the historical allocation information includes: resource allocation results recorded by the sending node of the control signaling by parsing the received FTA signaling before the control signaling is sent this time; wherein, the control signaling is RTA signaling, EDA signaling or FTA signaling.

[0331] It can be understood that in the resource allocation method provided in the present application, the node can use a random transmission method based on time series prediction to send control signaling such as EDA signaling, RTA signaling or FTA signaling (including FTA-I and FTA-II).

[0332] When a node is preparing to send control signaling such as EDA signaling, RTA signaling or FTA signaling, the node can first exclude resources used for transmitting data based on historical listening information and historical allocation information, and then obtain an available resource pool for sending the above control signaling.

[0333] FIG14 is a schematic diagram of random transmission of control signaling based on sliding window time series prediction provided in an embodiment of the present application.

[0334] As shown in Figure 14, within the available resource pool for sending the above control information, the node can predict the collision probability of each sub-channel in the current time slot based on the time series statistical information in the sliding window. The node can first randomly select multiple blind retransmission time slots based on the signaling delay budget (SDB). The sliding window is updated in real time and rolled forward. When the time slot arrives, the node will retransmit the sub-channel according to the probability (such as the probability p1, p2, ..., p in Figure 14) based on the latest sliding window. F , where F is an integer greater than or equal to 1) randomly selects subchannels to improve signaling transmission reliability.

[0335] In one possible implementation, the node may send the above-mentioned control signaling such as EDA signaling, RTA signaling, or FTA signaling (including FTA-I and FTA-II) in the form of broadcast, and may send CTA signaling in the form of unicast, which is not limited in this application.

[0336] It is understandable that the above-mentioned EDA signaling, RTA signaling, CTA signaling and FTA signaling represent different signalings. In actual application scenarios, the above-mentioned signalings may appear with other names, and this application does not limit this.

[0337] In order to better understand the resource allocation method provided in the present application, the resource allocation method provided in the present application is briefly described again below in conjunction with FIG15 .

[0338] FIG15 is another schematic diagram of the resource allocation method provided in an embodiment of the present application.

[0339] As shown in Figure 15, the resource allocation method provided in this application includes four mechanisms, namely: Mechanism 1, determination of the role type of the node; Mechanism 2, allocation process and conflict elimination; Mechanism 3, resource notification and permission; Mechanism 4, transmission of control signaling.

[0340] The following is a brief description of these four mechanisms.

[0341] Mechanism 1: Determination of the role type of the node.

[0342] The mechanism includes payload-driven effective degree broadcast and uncovered link-driven effective degree broadcast as shown in FIG7 .

[0343] Among them, the load-driven effective degree broadcast is before the resource allocation process starts. More specifically, before the allocation process starts, each node can determine which links are to be allocated based on the load of the data flow of each link connected to it, and determine its own current effective degree based on the number of links to be allocated. It can also broadcast its own effective degree to its neighboring nodes through EDA signaling, so that its neighboring nodes can determine its own role type. Correspondingly, it can also receive EDA signaling from neighboring nodes, and update its own effective degree according to the EDA signaling of neighboring nodes, so as to determine its own role type based on its own effective degree and the effective degree of neighboring nodes.

[0344] The effective degree broadcast driven by uncovered links is in the resource allocation process. More specifically, during the resource allocation process, each node can recalculate its own effective degree based on whether the links to which it is connected are allocated resources, and can notify neighboring nodes of the resource allocation results of its allocation domain through FTA signaling. The FTA signaling can carry its own effective degree and the contention value of the allocation node in its allocation domain, so that it and its neighboring nodes can redefine their respective role types.

[0345] For a detailed description of how a node determines its role type, please refer to the relevant descriptions in the above method 500 and method 1000. For the sake of brevity, it will not be repeated here.

[0346] It can be understood that the effective degree broadcast is performed alternately in two stages: load-driven effective degree broadcast and uncovered link-driven effective degree broadcast. This allows the node with the largest effective degree in the local area to automatically become the allocation node without the need for network-wide coordination. The allocation node is dynamically updated, thereby quickly covering all links to be allocated in the entire network.

[0347] Mechanism 2: Allocation process and conflict resolution.

[0348] The allocation process can be shown in Figure 8. The allocation node, the neighbor nodes of the allocation node, and the neighbor nodes of the neighbor nodes of the allocation node can interact through control signaling such as RTA signaling, CTA signaling, FTA signaling (including FTA-I and FTA-II) to complete a resource allocation.

[0349] Conflict elimination can mainly include startup conflict elimination of allocation nodes and resource conflict elimination of allocation nodes.

[0350] Among them, the startup conflict elimination of the allocation node is mainly reflected in:

[0351] If a node does not receive RTA signaling from multiple allocation nodes at the same time, the node only needs to reply CTA signaling to the allocation node that first received its RTA signaling to eliminate conflicts caused by multiple allocation nodes all initiating resource allocation to the node; if a node receives RTA signaling from multiple allocation nodes at the same time, the node only needs to reply CTA signaling to the allocation node with the largest contention value among the multiple allocation nodes to eliminate conflicts caused by multiple allocation nodes all initiating resource allocation to the node; in addition, if a node receives RTA signaling from multiple allocation nodes at the same time and the contention values ​​of the multiple nodes are the same, the node only needs to reply CTA signaling to the allocation node with the largest or smallest MAC ID among the multiple allocation nodes to eliminate conflicts caused by multiple allocation nodes all initiating resource allocation to the node.

[0352] The resource conflict elimination of the allocation node is mainly reflected in:

[0353] When a node receives FTA signaling from multiple nodes at the same time, the node needs to determine whether there are overlapping resources on its own interference link. If there are overlapping resources, the node needs to determine whether to use the overlapping resources or give up using the overlapping resources to eliminate resource conflicts.

[0354] For a detailed description of how a node determines whether to use overlapping resources, please refer to the relevant descriptions in the above method 500 and method 1000. For the sake of brevity, it will not be repeated here.

[0355] The interactive process of control signaling between the allocation node, its neighboring nodes, and the neighboring nodes of its neighboring nodes, as well as the startup conflict elimination and resource conflict elimination of the allocation node based on contention values, enable the orderly coordination of multiple links within and between allocation domains, and thus efficiently complete the resource allocation of all links to be allocated with little or even no conflict.

[0356] Mechanism 3: Resource notification and permission.

[0357] As mentioned in the above methods 500 and 1000 , nodes communicate and grant resources through FTA signaling.

[0358] In the present application, the above-mentioned FTA signaling may include a first resource allocation result encapsulated in the MAC layer and a second resource allocation result encapsulated in the physical layer. The second resource allocation result may be indicated by two-order sidelink control information (SCI), which includes first-order SCI and second-order SCI. The first-order SCI indicates the type of the second-order SCI, and the second-order SCI includes the second resource allocation result. Networked nodes can obtain the first resource allocation result by parsing the FTA signaling at the MAC layer; non-networked nodes can obtain the second resource allocation result by parsing the first-order SCI and second-order SCI of the FTA signaling at the physical layer.

[0359] For a detailed description of the first resource allocation result and the second resource allocation node, please refer to the relevant descriptions in the above method 500 and method 1000. For the sake of brevity, they are not repeated here.

[0360] The design of FTA signaling combining first-order SCI and second-order SCI enables non-networking nodes to quickly detect through the physical layer and then report to the MAC layer, thereby eliminating the reserved resources in this solution and achieving compatibility and enhancement with standard Mode2.

[0361] Mechanism 4: Transmission of control signaling.

[0362] It can be understood that the control signaling in this application includes EDA signaling, RTA signaling, CTA signaling, FTA signaling, etc.

[0363] In one possible implementation, before transmitting EDA signaling, RTA signaling, or FTA signaling, a node may first randomly select a time slot, and then randomly select a subchannel to transmit EDA signaling, RTA signaling, or FTA signaling based on time series statistical information in a real-time sliding window. That is, the subchannel used to transmit EDA signaling, RTA signaling, and FTA signaling is randomly determined after excluding resources used to transmit data.

[0364] In a possible implementation, resources used to transmit CTA signaling are indicated by RTA signaling. That is, when transmitting CTA signaling, a node may transmit the CTA signaling according to the time-frequency resources indicated in the RTA received from the allocation node.

[0365] The random transmission method based on time series prediction utilizes historical statistical information (including but not limited to historical listening information and / or historical allocation information) to improve the success rate of signaling transmission; the determined transmission method based on allocation node indication does not require additional protection signaling to achieve collision-free signaling reception at the allocation node.

[0366] To sum up, in the resource allocation method provided in the embodiment of the present application, the allocation process and the data transmission process are carried out in parallel (as shown in Figures 6 and 7). In the current round of allocation process, each node determines its own role type by comparing the effective degree in the local area (within the one-hop neighborhood of the node centered on itself). The allocation node completes the resource allocation of the link to be allocated in the one-hop neighborhood by random startup and coordination sequence, and announces the resource allocation results to avoid resource conflicts on the interference link, so that no link interference occurs when the node uses the reserved resources during the current round of data transmission, which can achieve the effect of reducing resource collisions.

[0367] It can also be understood that the resource allocation method provided in the embodiment of the present application achieves optimal throughput while achieving lower average latency, significantly improving scheduling efficiency and reducing signaling overhead, compared to the currently known link-based distributed scheduling method. Therefore, it is more suitable for actual deployment.

[0368] In addition, for the distributed resource management of 6G side-by-side multi-hop networks, based on the design of the above four key mechanisms, this application can achieve high reservation efficiency, low collision probability, adaptability to traffic changes, and compatibility with cellular network standards.

[0369] Furthermore, compared with the standard Mode 2, this application has the advantages of high coordination efficiency, high reservation success rate, applicability to multi-hop data flows, and suitability for periodic data and long burst data.

[0370] FIG16 is a schematic block diagram of a communication device provided in an embodiment of the present application.

[0371] As shown in Figure 16, the communication device 1600 may include a processing module 1610. The communication device 1600 may be used to execute the execution steps of the first node in the method 500 or the second node in the method 1000 proposed in the embodiment of the present application.

[0372] Exemplarily, when the communication device 1600 is used to execute the execution steps of the first node in method 500, the processing module 1610 can be used to determine that the first node is an allocation node; allocate resources to nodes in the group where the first node is located; the group includes: the allocation node and the neighbor nodes of the allocation node.

[0373] Optionally, the processing module 1610 can be specifically used to: determine that the first node is an allocation node based on the effective degree of the first node and the effective degree of the neighboring nodes of the first node, and the allocation node satisfies: its own effective degree is non-zero, and no neighboring node has an effective degree exceeding its own effective degree; the effective degree of the node is the number of links to be allocated with the node as the sending node and / or receiving node of the target data flow, and the link to be allocated is a link that will carry at least one target data flow, and the target data flow satisfies: the load exceeds a preset load threshold, or the QFI exceeds a preset QFI threshold.

[0374] Optionally, the processing module 1610 can be specifically used to: determine the effective degree of the first node based on the to-be-sent data flow of the first node on the link between the first node and the neighboring node of the first node, and the EDA signaling received from the neighboring node of the first node, where the to-be-sent data flow is the data flow to be sent by the first node; determine the effective degree of the neighboring node of the first node based on the EDA signaling received from the neighboring node of the first node; wherein the EDA signaling includes at least one of the following: the effective degree of the sending node of the EDA signaling, the current link to be allocated of the sending node of the EDA signaling, and the outflow priority of the current link to be allocated; the outflow priority is determined based on the QFI of the target data flow in the to-be-sent data flow.

[0375] Optionally, the communication device 1600 may further include a transceiver module 1620. The transceiver module 1620 may be configured to send EDA signaling to a neighboring node of the first node; and / or receive EDA signaling from a neighboring node of the first node.

[0376] Optionally, the processing module 1610 can be specifically configured to: send RTA signaling to neighboring nodes in the group of the first node, where the RTA signaling is used to request resource allocation for other nodes; and upon receiving CTA signaling from all neighboring nodes in the group of the first node, allocate resources to the links to be allocated between the nodes in the group, where the CTA signaling is used to indicate: the data transmission requirements of the node sending the CTA signaling, and / or resources allocated by other allocation nodes other than the first node.

[0377] Optionally, the processing module 1610 may be further specifically configured to: determine the group to which the first node belongs.

[0378] Optionally, the transceiver module 1620 may also be used to send FTA signaling to neighboring nodes in the group where the first node is located, where the FTA signaling is used to indicate resource allocation results on the links to be allocated between nodes in the group where the node sending the FTA signaling is located.

[0379] Optionally, the processing module 1610 may be further configured to update the effective degree of the first node based on a resource allocation result on a to-be-allocated link between nodes in the group to which the first node belongs.

[0380] Optionally, the FTA signaling carries the updated effective degree of the first node.

[0381] Optionally, the FTA signaling carries a contention value and / or MAC ID of a distribution node in the distribution domain where the sending node of the FTA signaling is located.

[0382] Optionally, the FTA signaling includes a first resource allocation result encapsulated in the MAC layer and a second resource allocation result encapsulated in the physical layer, the first resource allocation result indicates the correspondence between the link to be allocated and the resource, the second resource allocation result includes a bit map, the bit map includes multiple bits, the multiple bits correspond to multiple resource units, and each bit indicates whether the corresponding resource unit has been allocated.

[0383] Optionally, the second resource allocation result is indicated by two-order sidelink control information SCI, the two-order SCI includes first-order SCI and second-order SCI, the first-order SCI indicates the type of the second-order SCI, and the second-order SCI contains the second resource allocation result.

[0384] Optionally, the RTA signaling carries a contention value of a sending node of the RTA signaling.

[0385] Optionally, the RTA signaling carries location information of a first resource, and the first resource is used to transmit the CTA signaling.

[0386] Exemplarily, when the communication device 1600 is used to execute the execution steps of the second node in method 1000, the processing module 1610 can be used to determine that the second node is an allocated node, and the allocated node is a node that needs other nodes to allocate resources to itself; the transceiver module 1620 can be used to receive RTA signaling from the first node, the first node is an allocating node, and the first node is a neighbor node of the second node, the RTA signaling is used to request allocation of resources for other nodes, and the allocating node is a node that needs to allocate resources to other nodes; the transceiver module 1620 can also be used to send CTA signaling to the first node, and the CTA signaling is used to indicate: the data transmission requirements of the second node, and / or, the resources allocated by other allocating nodes other than the first node.

[0387] Optionally, the processing module 1610 can be specifically used to: determine that the second node is an assigned node based on the effective degree of the second node and the effective degree of the neighboring nodes of the second node, and the assigned node satisfies: its own effective degree is non-zero, and there are neighboring nodes with effective degrees exceeding its own effective degree; the effective degree of the node is the number of links to be assigned with the node as the sending node and / or receiving node of the target data flow, and the link to be assigned is a link that will carry at least one target data flow, and the target data flow satisfies: the load exceeds a preset load threshold, or the QFI exceeds a preset QFI threshold.

[0388] Optionally, the processing module 1610 can be specifically used to: determine the effective degree of the second node based on the to-be-sent data flow of the second node on the link between the second node and the neighboring node of the second node, and the EDA signaling received from the neighboring node of the second node, the to-be-sent data flow being the data flow to be sent by the second node; determine the effective degree of the neighboring node of the second node based on the EDA signaling received from the neighboring node of the second node; wherein the EDA signaling includes at least one of the following: the effective degree of the sending node of the EDA signaling, the current link to be allocated of the sending node of the EDA signaling, and the outflow priority of the current link to be allocated; the outflow priority is determined based on the QFI of the target data flow in the to-be-sent data flow.

[0389] Optionally, the transceiver module 1620 may also be configured to: send EDA signaling to a neighboring node of the second node; and / or receive EDA signaling from a neighboring node of the second node.

[0390] Optionally, the transceiver module 1620 can also be used to: receive FTA signaling from the neighbor node of the second node, and the FTA signaling is used to indicate: the resource allocation result on the link to be allocated between the nodes in the group where the sending node of the FTA signaling is located, and the group includes: the allocation node and the neighbor node of the allocation node.

[0391] Optionally, the transceiver module 1620 may also be configured to send FTA signaling to a neighboring node of the second node.

[0392] Optionally, the processing module 1610 may also be configured to update the effective degree of the second node based on resource allocation results on each to-be-allocated link in the group where the second node is located.

[0393] Optionally, the FTA signaling carries the updated effective degree of the second node.

[0394] Optionally, the processing module 1610 can be specifically used to: when the second node receives the FTA signaling from multiple neighboring nodes, determine that there is overlap in the resources allocated to the interference links of the second node in different groups based on the resources allocated to the links to be allocated between each node in the groups where the multiple neighboring nodes are respectively located, and the resources allocated to the links to be allocated between each node in the group where the second node is located, and the interference links of the second node include the links to be allocated with the second node as the endpoint and the links to be allocated with the neighboring nodes of the second node as the end nodes; determine whether to use or not use the overlapping resources based on the contention value of the allocation nodes in each group where each interference link with overlapping resources is located.

[0395] Optionally, the processing module 1610 may be specifically configured to: when the contention value of the allocation node in the group where the first link to be allocated is located is greater than the contention value of the allocation node in the group where the second link to be allocated is located, use resources that overlap with the resources allocated to the second link to be allocated; or, when the contention value of the allocation node in the group where the first link to be allocated is less than the contention value of the allocation node in the group where the second link to be allocated is located, not use resources that overlap with the resources allocated to the second link to be allocated; or, when the contention value of the allocation node in the group where the first link to be allocated is equal to the contention value of the allocation node in the group where the second link to be allocated is located, determine whether to use or not to use resources that overlap with the resources allocated to the second link to be allocated based on the first MAC ID and the second MAC ID; wherein the first link to be allocated and the second link to be allocated are links in which resources allocated in the interfering link of the second node overlap, the first link to be allocated and the second node are in the same group, and the second link to be allocated and the first node are not in the same group; the first MAC The ID is the MAC ID of the allocation node in the allocation domain where the first link to be allocated is located, and the second MAC ID is the MAC ID of the allocation node in the allocation domain where the second link to be allocated is located.

[0396] Optionally, the processing module 1610 can also be used to: update the allocated link of the second node that does not use the overlapping resources to a link to be allocated, and update the effective degree of the second node; and the transceiver module 1620 can also be used to: when the effective degree is non-zero, send EDA signaling to the neighbor node of the second node, and the EDA signaling includes the effective degree of the second node and / or the current link to be allocated of the second node.

[0397] Optionally, the processing module 1610 may be further configured to: determine a target allocation node from multiple allocation nodes when RTA signaling is received from the multiple allocation nodes simultaneously; and the transceiver module 1620 may be further configured to: send CTA signaling to the target allocation node.

[0398] Optionally, the processing module 1610 may be specifically configured to determine a target allocation node from the multiple allocation nodes based on multiple contention values ​​corresponding to the multiple allocation nodes.

[0399] Optionally, the processing module 1610 can be specifically used to: determine the node with the largest competition value among the multiple allocation nodes as the target allocation node; or, when the competition values ​​of the multiple allocation nodes are the same, determine the target allocation node from the multiple allocation nodes based on the MAC IDs of the multiple allocation nodes.

[0400] Optionally, the contention value of a node is determined based on the priority level of the node; wherein the priority level is determined based on the outgoing priority level and the incoming priority level on the link to be allocated of the node, the outgoing priority level is determined based on the QFI of the target data flow in the data flow to be sent by the node, and the incoming priority level is determined based on the QFI of the target data flow in the data flow to be received by the node from the neighboring node, and the data flow to be sent is the data flow to be sent by the node.

[0401] Optionally, the FTA signaling carries a contention value and / or MAC ID of an allocation node in the group to which the sending node of the FTA signaling belongs.

[0402] Optionally, the FTA signaling includes a first resource allocation result encapsulated in the MAC layer and a second resource allocation result encapsulated in the physical layer, the first resource allocation result indicates the correspondence between the link to be allocated and the resource, the second resource allocation result includes a bit map, the bit map includes multiple bits, the multiple bits correspond to multiple resource units, and each bit indicates whether the corresponding resource unit has been allocated.

[0403] Optionally, the second resource allocation result is indicated by two-order sidelink control information SCI, the two-order SCI includes first-order SCI and second-order SCI, the first-order SCI indicates the type of the second-order SCI, and the second-order SCI contains the second resource allocation result.

[0404] Optionally, the RTA signaling carries a contention value of a sending node of the RTA signaling.

[0405] Optionally, the RTA signaling carries location information of a first resource, and the first resource is used to transmit the CTA signaling.

[0406] FIG17 is another schematic block diagram of a communication device provided in an embodiment of the present application.

[0407] The communication device 1700 can be used to implement the functions of the first node in the above method 500 or the second node in the method 1000. The communication device 1700 can be a chip system. In the embodiment of the present application, the chip system can be composed of a chip or include a chip and other discrete devices.

[0408] As shown in FIG. 17 , the communication device 1700 may include at least one processor 1710 for implementing the functions of the first node in the method 500 or the second node in the method 1000 provided in an embodiment of the present application.

[0409] For example, when the communication device 1700 is used to implement the functionality of the first node in the method 500 provided in an embodiment of the present application, the processor 1710 may be configured to determine that the first node is an allocation node and allocate resources to each node in a group to which the first node belongs; the group includes the allocation node and its neighboring nodes. For details, please refer to the detailed description in the example method and are not further described here.

[0410] For another example, when the communication device 1700 is used to implement the function of the second node in the method 1000 provided in an embodiment of the present application, the processor 1710 may be used to determine that the second node is an allocated node, where the allocated node is a node that requires other nodes to allocate resources to it; receive RTA signaling from a first node, where the first node is an allocating node and is a neighbor node of the second node, where the RTA signaling is used to request allocation of resources to other nodes, where the allocating node is a node that requires allocation of resources to other nodes; and send CTA signaling to the first node, where the CTA signaling is used to indicate: the data transmission requirements of the second node and / or the resources allocated by other allocating nodes other than the first node. For details, please refer to the detailed description in the method example, which is not repeated here.

[0411] The communication device 1700 may also include at least one memory 1720 for storing program instructions and / or data. The memory 1720 is coupled to the processor 1710. The coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, units, or modules, which can be electrical, mechanical, or other forms, and is used for information exchange between devices, units, or modules. The processor 1710 may operate in conjunction with the memory 1720. The processor 1710 may execute program instructions stored in the memory 1720. At least one of the at least one memory may be included in the processor.

[0412] The communication device 1700 may also include a communication interface 1730 for communicating with other devices through a transmission medium, so that the device in the communication device 1700 can communicate with other devices. For example, when the communication device 1700 is used to implement the function of the first node in the method 500 provided in the embodiment of the present application, the other device may be a neighbor node of the first node; when the communication device 1700 is used to implement the function of the second node in the method 1000 provided in the embodiment of the present application, the other device may be a neighbor node of the second node. The communication interface 1730 may be, for example, a transceiver, an interface, a bus, a circuit, or a device capable of implementing transceiver functions. The processor 1710 may use the communication interface 1730 to send and receive data and / or information, and be used to implement the method performed by the first node described in the corresponding embodiment in Figure 5 or the second node described in the corresponding embodiment in Figure 10.

[0413] The specific connection medium between the processor 1710, memory 1720, and communication interface 1730 is not limited in the embodiments of the present application. In Figure 17, the processor 1710, memory 1720, and communication interface 1730 are connected via a bus 1740. Bus 1740 is represented by a bold line in Figure 17, and the connection methods between other components are only for schematic illustration and are not limiting. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one bold line is used in Figure 17, but this does not mean that there is only one bus or one type of bus.

[0414] FIG18 is a schematic structural diagram of a terminal device provided in an embodiment of the present application.

[0415] The terminal device 900 has the function of the first node shown in Figure 5 or the function of the second node shown in Figure 10. The terminal device 1800 can be applied to the sidewalk multi-hop network shown in Figure 4. As shown in Figure 18, the terminal device 1800 includes a processor 1801 and a transceiver 1802.

[0416] Optionally, the terminal device 1800 further includes a memory 1803. The processor 1801, the transceiver 1802, and the memory 1803 can communicate with each other through an internal connection path to transmit control and / or data signals. The memory 1803 is used to store a computer program, and the processor 1801 is used to call and execute the computer program from the memory 1803 to control the transceiver 1802 to send and receive signals.

[0417] Optionally, the terminal device 1800 may further include an antenna 1804 for transmitting the uplink data or uplink control signaling output by the transceiver 1802 via a wireless signal.

[0418] Optionally, the terminal device 1800 further includes a wireless fidelity (Wi-Fi) module 1811 for accessing a wireless network.

[0419] The processor 1801 and the memory 1803 may be combined into a processing device, and the processor 1801 is configured to execute program code stored in the memory 1803 to implement the aforementioned functions. In a specific implementation, the memory 1803 may also be integrated into the processor 1801 or independent of the processor 1801. The processor 1801 may correspond to the processing module 1610 in FIG. 16 or the processor 1710 in FIG. 17 .

[0420] The transceiver 1802 may correspond to the transceiver module 1620 in FIG. 16 or the communication interface 1730 in FIG. The transceiver 1802 may include a receiver (or receiver, receiving circuit) and a transmitter (or transmitter, transmitting circuit). The receiver is used to receive signals, and the transmitter is used to transmit signals.

[0421] Optionally, the terminal device 1800 may further include a power supply 1805 for providing power to various devices or circuits in the terminal device 1800 .

[0422] In addition, in order to make the functions of the terminal device more complete, the terminal device 1800 may also include one or more of an input unit 1806, a display unit 1807, an audio circuit 1808, a camera 1809 and a sensor 1810, and the audio circuit may also include a speaker 1808a, a microphone 1808b, etc.

[0423] It should be understood that terminal device 1800 shown in Figure 18 is capable of implementing the various processes involving the first node in the method embodiment shown in Figure 5 or the second node in the method embodiment shown in Figure 10 . The operations and / or functions of the various modules in terminal device 1800 are respectively for implementing the corresponding processes in the aforementioned method embodiments. For details, please refer to the description of the aforementioned method embodiments; to avoid repetition, detailed descriptions are omitted here.

[0424] When the terminal device 1800 is used to execute the first node operation process involved in the above method embodiment, the processor 1801 can be used to execute the action implemented by the first node in the above method embodiment, and the transceiver 1802 can be used to execute the action described in the above method embodiment of the first node sending to the first node's neighbor node or receiving from the first node's neighbor node. When the terminal device 1800 is used to execute the second node operation process involved in the above method embodiment, the processor 1801 can be used to execute the action implemented by the second node in the above method embodiment, and the transceiver 1802 can be used to execute the action described in the above method embodiment of the second node sending to the second node's neighbor node or receiving from the second node's neighbor node. Please refer to the description in the above method embodiment for details, which will not be repeated here.

[0425] The present application provides a communication system, which includes at least one first node and at least one second node, wherein the first node is used to perform the function of the first node in the method embodiment shown in Figure 5, and the second node is used to perform the function of the second node in the method embodiment shown in Figure 10.

[0426] The present application also provides a chip system, which includes at least one processor for implementing the functions involved in the method executed by the first node in the embodiment shown in Figure 5 or the second node in the embodiment shown in Figure 10, for example, receiving or processing the data and / or information involved in the above method.

[0427] In one possible design, the chip system further includes a memory, which is used to store program instructions and data, and the memory is located inside or outside the processor.

[0428] The chip system can be composed of chips, or can include chips and other discrete devices.

[0429] An embodiment of the present application also provides a readable storage medium having a program stored thereon. When the program is run, the method executed by the first node in the embodiment shown in FIG5 is executed, or the method executed by the second node in the embodiment shown in FIG10 is executed.

[0430] An embodiment of the present application also provides a program product, including a program. When the program is run, the method executed by the first node in the embodiment shown in Figure 5 is executed, or the method executed by the second node in the embodiment shown in Figure 10 is executed.

[0431] It should be understood that the processor in the embodiments of the present application can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above-mentioned method embodiment can be completed by hardware integrated logic circuits in the processor or by software instructions. The above-mentioned processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The various methods, steps, and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in the embodiments of the present application can be directly implemented and executed by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium well-known in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in the memory, and the processor reads the information in the memory and, in conjunction with its hardware, completes the steps of the above-mentioned method.

[0432] It should also be understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), and direct RAM bus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0433] The terms "unit", "module", etc. used in this specification may be used to represent an entity related to a device or apparatus, hardware, firmware, a combination of hardware and software, software, or software in execution.

[0434] Those skilled in the art will appreciate that the various illustrative logical blocks and steps described in conjunction with the embodiments disclosed herein can be implemented using electronic hardware, or a combination of software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professionals and technicians may use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application. In the several embodiments provided in this application, it should be understood that the disclosed devices, equipment, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the module division is only a logical function division. In actual implementation, there may be other division methods, such as multiple modules or components can be combined or integrated into another system, or some features can be ignored or not implemented. In addition, the coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or modules, and can be electrical, mechanical, or other forms.

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

[0436] In addition, the functional modules in the various embodiments of the present application may be integrated into one processing module, or each module may exist physically separately, or two or more units may be integrated into one module.

[0437] In the above embodiments, the functions of each functional module can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When software is used for implementation, it can be implemented in whole or in part in the form of a program product. The program product includes one or more instructions (programs). When the program instructions (program) are loaded and executed on a device or apparatus, the process or function described in the embodiment of the present application is generated in whole or in part. The instructions can be stored in a readable storage medium or transmitted from one readable storage medium to another readable storage medium. For example, the instructions can be transmitted from one website, computer, server or data center to another website, computer, server or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) method. The readable storage medium can be any available medium that can be accessed by a device or apparatus or a data storage device such as a server or data center that includes one or more available media integrations. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a digital versatile disc (DVD)), or a semiconductor medium (e.g., a solid state drive (SSD)).

[0438] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the 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 or apparatus (which can be a personal computer, server, or network equipment, etc.) to execute all or part of the steps of the methods described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as USB flash drives, mobile hard drives, ROM, RAM, magnetic disks, or optical disks.

[0439] The above description 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 this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A resource allocation method, characterized in that, Applied to a first node, the method includes: Determine that the first node is an allocation node; Allocate resources to the nodes within the group where the first node is located, where the group includes: the allocation node and the neighbor nodes of the allocation node.

2. The method according to claim 1, characterized in that, The determining that the first node is an allocation node includes: Based on the effective degree of the first node and the effective degrees of the neighbor nodes of the first node, determine that the first node is an allocation node, where the allocation node satisfies: its own effective degree is non-zero, and the effective degree of no neighbor node exceeds its own effective degree; the effective degree of a node is the number of to-be-allocated links with the node as the source node and / or the receiving node of the target data flow, and the to-be-allocated link is a link that will carry at least one of the target data flows, and the target data flow satisfies: the payload exceeds a preset threshold, or the Quality of Service Flow Identifier (QFI) exceeds a preset QFI threshold.

3. The method according to claim 2, wherein Before determining that the first node is an allocation node based on the effective degree of the first node and the effective degrees of the neighbor nodes of the first node, the method further includes: Based on the data flows to be sent from the first node on the links with the neighbor nodes of the first node and the Effective Degree Advertisement (EDA) signaling received from the neighbor nodes of the first node, determine the effective degree of the first node, where the data flows to be sent are the data flows that the first node is to send out; Based on the EDA signaling received from the neighbor nodes of the first node, determine the effective degrees of the neighbor nodes of the first node; Wherein, the EDA signaling includes at least one of the following: the effective degree of the sending node of the EDA signaling, the current to-be-allocated link of the sending node of the EDA signaling, and the outflow priority level of the current to-be-allocated link; the outflow priority level is determined based on the QFI of the target data flow in the data flows to be sent.

4. The method according to claim 3, characterized in that The method further includes: Send the EDA signaling to the neighbor nodes of the first node; and / or Receive the EDA signaling from the neighbor nodes of the first node.

5. The method according to any one of claims 1 to 4, characterized in that, The allocating resources to the nodes within the group where the first node is located includes: Send a Request for Allocation (RTA) signaling to the neighbor nodes within the group of the first node, where the RTA signaling is used to request resource allocation for other nodes; In the case of receiving the Clear to Allocate (CTA) signaling from all the neighbor nodes within the group of the first node, allocate resources to the to-be-allocated links among the nodes within the group, where the CTA signaling is used to indicate: the data transmission requirements of the sending node of the CTA signaling, and / or the resources allocated by other allocation nodes except the first node.

6. The method according to any one of claims 1 to 5, characterized in that Before allocating resources to the to-be-allocated links among the nodes within the group where the first node is located, the method further includes: Determine the group where the first node is located.

7. The method according to any one of claims 1 to 5, characterized in that, After allocating resources to the to-be-allocated links among the nodes within the group where the first node is located, the method further includes: Send a completed allocation FTA signaling to neighbor nodes within the group where the first node is located, where the FTA signaling is used to indicate: the resource allocation result on the to-be-allocated link among nodes within the group where the sending node of the FTA signaling is located.

8. The method according to claim 7, wherein Before sending the FTA signaling to neighbor nodes within the group of the first node, the method further includes: Update the effective degree of the first node based on the resource allocation result on the to-be-allocated link among nodes within the group of the first node.

9. The method according to claim 8, characterized in that, The FTA signaling carries the updated effective degree of the first node.

10. A resource allocation method, characterized in that, Applied to a second node, the method includes: Determine that the second node is an allocated node, where the allocated node is a node for which other nodes allocate resources for themselves; Receive a request allocation RTA signaling from a first node, where the first node is an allocating node and the first node is a neighbor node of the second node, and the RTA signaling is used to request resource allocation for other nodes, and the allocating node is a node that needs to allocate resources for other nodes; Send an allow allocation CTA signaling to the first node, where the CTA signaling is used to indicate: the data transmission requirement of the second node, and / or, the resources allocated by other allocating nodes except the first node.

11. The method according to claim 10, wherein The determining that the second node is an allocated node includes: Based on the effective degree of the second node and the effective degrees of neighbor nodes of the second node, determine that the second node is an allocated node, where the allocated node satisfies: its own effective degree is non-zero, and there is a neighbor node whose effective degree exceeds its own effective degree; the effective degree of a node is the number of to-be-allocated links with the node as the sending node and / or receiving node of the target data stream, and the to-be-allocated link is a link that will carry at least one target data stream, and the target data stream satisfies: the payload exceeds a preset payload threshold, or, the quality of service flow identifier QFI exceeds a preset QFI threshold.

12. The method according to claim 11, wherein Before determining that the second node is an allocating node based on the effective degree of the second node and the effective degrees of neighbor nodes of the second node, the method further includes: Determine the effective degree of the second node based on the to-be-sent data stream of the second node on the link with the neighbor node of the second node and the effective degree notification EDA signaling received from the neighbor node of the second node, where the to-be-sent data stream is the data stream that the second node is to send out; Determine the effective degree of the neighbor node of the second node based on the EDA signaling received from the neighbor node of the second node; Wherein, the EDA signaling includes at least one of the following: the effective degree of the sending node of the EDA signaling, the current to-be-allocated link of the sending node of the EDA signaling, and the outflow priority level of the current to-be-allocated link; the outflow priority level is determined based on the QFI of the target data stream in the to-be-sent data stream.

13. The method according to claim 12, characterized in that, The method further includes: Send the EDA signaling to the neighbor node of the second node; and / or Receive the EDA signaling from the neighbor nodes of the second node.

14. The method according to any one of claims 11 to 13, characterized in that, The method further includes: Receive a Finish Assignment (FTA) signaling from the neighbor nodes of the second node, where the FTA signaling is used to indicate the resource allocation result on the to-be-allocated link among the nodes within the group where the sending node of the FTA signaling is located, and the group includes an allocation node and the neighbor nodes of the allocation node.

15. The method according to claim 14, wherein The method further includes: Send the FTA signaling to the neighbor nodes of the second node.

16. The method according to claim 15, characterized in that, Before sending the FTA signaling to the neighbor nodes of the second node, the method further includes: Update the effective degree of the second node based on the resource allocation results on each of the to-be-allocated links within the group of the second node.

17. The method according to claim 16, wherein The FTA signaling carries the updated effective degree of the second node.

18. The method according to any one of claims 14 to 17, characterized in that The method further includes: In the case where the second node receives the FTA signaling from multiple neighbor nodes, determine that there is an overlap in the resources allocated to the interfering links of the second node in different groups according to the resources allocated to the to-be-allocated links among the nodes within the groups where the multiple neighbor nodes are respectively located, and the resources allocated to the to-be-allocated links among the nodes within the group where the second node is located. The interfering links of the second node include the to-be-allocated links with the second node as an endpoint and the to-be-allocated links with the neighbor nodes of the second node as end nodes. Determine whether to use or not use the overlapping resources according to the competition values of the allocation nodes within the respective groups where the interfering links with the overlapping resources are located.

19. The method according to claim 18, wherein The determining whether to use or not use the overlapping resources according to the competition values of the allocation nodes within the respective groups where the interfering links with the overlapping resources are located includes: In the case where the competition value of the allocation node within the group where the first to-be-allocated link is located is greater than the competition value of the allocation node within the group where the second to-be-allocated link is located, use the resources overlapping with the resources allocated to the second to-be-allocated link; or, In the case where the competition value of the allocation node within the group where the first to-be-allocated link is located is less than the competition value of the allocation node within the group where the second to-be-allocated link is located, do not use the resources overlapping with the resources allocated to the second to-be-allocated link; or, In the case where the competition value of the allocation node within the group where the first to-be-allocated link is located is equal to the competition value of the allocation node within the group where the second to-be-allocated link is located, determine whether to use or not use the resources overlapping with the resources allocated to the second to-be-allocated link based on the first Media Access Control Identifier (MAC ID) and the second MAC ID. Wherein, the first link to be allocated and the second link to be allocated are links in the interfering links of the second node where the allocated resources overlap, the first link to be allocated and the second node are in the same group, and the second link to be allocated and the first node are not in the same group; the first MAC ID is the MAC ID of the allocation node in the allocation domain where the first link to be allocated is located, and the second MAC ID is the MAC ID of the allocation node in the allocation domain where the second link to be allocated is located.

20. The method according to claim 19, characterized in that, In the case of not using the resources that overlap with the resources allocated on the second link to be allocated, the method further includes: Updating the allocated link on which the second node does not use the overlapping resources to a link to be allocated, and updating the effective degree of the second node; When the effective degree is non-zero, sending an EDA signaling to the neighbor nodes of the second node, where the EDA signaling includes the effective degree of the second node and / or the current link to be allocated of the second node.

21. The method according to any one of claims 10 to 20, characterized in that, The method further includes: When receiving RTA signals from multiple allocation nodes simultaneously, determining a target allocation node from the multiple allocation nodes; Sending the CTA signaling to the target allocation node.

22. The method according to claim 21, wherein The determining a target allocation node from the multiple allocation nodes includes: Determining a target allocation node from the multiple allocation nodes based on the multiple competition values corresponding to the multiple allocation nodes.

23. The method according to claim 22, wherein The determining a target allocation node from the multiple allocation nodes based on the multiple competition values corresponding to the multiple allocation nodes includes: Determining the node with the largest competition value among the multiple allocation nodes as the target allocation node; or, When the competition values of the multiple allocation nodes are the same, determining a target allocation node from the multiple allocation nodes based on the MAC IDs of the multiple allocation nodes.

24. The method according to any one of claims 18 to 20, 22, and 23, characterized in that The competition value of a node is determined based on the priority level of the node; wherein, the priority level is determined based on the outflow priority level and the inflow priority level on the link to be allocated of the node, the outflow priority level is determined based on the QFI of the target data stream in the data stream to be sent by the node, the inflow priority level is determined based on the QFI of the target data stream in the data stream that the node is to receive from neighbor nodes, and the data stream to be sent is the data stream that the node is to send out.

25. A communication device, characterized in that, The communication device includes a module for executing the method according to any one of claims 1 to 9, or a module for executing the method according to any one of claims 10 to 24.

26. A communication device, characterized in that, Including a processor and a memory, wherein, The memory is used for storing programs; The processor is used for calling the program to enable the communication device to execute the method according to any one of claims 1 to 9, or to enable the communication device to execute the method according to any one of claims 10 to 24.

27. A communication system, characterized in that, Including at least one first node and at least one second node, wherein, Each of the first nodes is used to execute the method according to any one of claims 1 to 9, and each of the second nodes is used to execute the method according to any one of claims 10 to 24.

28. A readable storage medium having a program stored thereon, characterized in that, When the program is executed, the method according to any one of claims 1 to 24 is executed.

29. A program product, characterized in that, It includes a program which, when the program is run, causes the method according to any one of claims 1 to 24 to be executed.

Images