CN116711379A - Wireless communication method, communication device and communication system - Google Patents

Abstract

The embodiment of the application provides a wireless communication method, a communication device and a communication system. The method comprises the following steps: the first node obtains first information including at least one of: load information of at least one next-hop node of the first node, interference information of the at least one next-hop node, channel quality between the first node and the at least one next-hop node, and link hop count information of the first node reaching the target node through the at least one next-hop node; the first node determines to transmit the data packet through the second node according to the first information, and the at least one next-hop node comprises the second node. In this scheme, a first node selects a node for transmission of a data packet (such as data or signaling) from among the next-hop nodes of the first node based on information of one or more next-hop nodes of the first node. The method can be used for selecting a proper next-hop node for the first node, and can improve the information transmission efficiency in the routing path.

Description

Wireless communication method, communication device and communication system technical field

The embodiments of the present application relate to the field of communication technologies, and in particular, to a wireless communication method, a communication device, and a communication system.

Background technique

In wireless communication, during communication between user equipments (user equipment, UE), information sent by one UE needs to be routed and forwarded by one or more nodes in the wireless network to reach another UE.

The nodes through which the information sent by the UE constitutes a routing path, how to improve the efficiency of information transmission in the routing path is currently to be solved.

Contents of the invention

Embodiments of the present application provide a wireless communication method, a communication device, and a communication system, so as to improve information transmission efficiency in a routing path.

In the first aspect, the embodiment of the present application provides a wireless communication method, including: the first node obtains first information, and the first information includes at least one of the following: the load of at least one next-hop node of the first node information, the interference information of the at least one next-hop node, the channel quality between the first node and the at least one next-hop node, the first node reaching the target through the at least one next-hop node Link hop information of the node; the first node determines to transmit the data packet through the second node according to the first information, wherein the at least one next-hop node includes the second node.

Based on the above solution, the first node selects one of the next-hop nodes of the first node based on the information of one or more next-hop nodes of the first node to transmit the data packet (such as data or signaling) node. The method can realize selecting a suitable next-hop node for the first node, and can improve the information transmission efficiency in the routing path.

In a possible implementation method, the first node receives load information of the at least one next-hop node and/or interference information of the at least one next-hop node from an access network node; or, the The first node receives the load information of the first next hop node and/or the interference information of the first next hop node from the first next hop node, and the first next hop node is the Any node in at least one next-hop node.

In a possible implementation method, the first node receives the channel quality between the first node and the at least one next-hop node from the access network node; or, the first node Determining the channel quality between the first node and the at least one next-hop node by itself.

In a possible implementation method, the first node receives the link hop information from the access network node, wherein the link hop information and the routing identifier and the next hop node Corresponding to the identification information of the target node, the routing identification includes the identification information of the target node and the path identification.

In a possible implementation method, the first node receives the link hop count information from the access network node, where the link hop count indicated by the link hop count information is the first A minimum link hop count for a node to reach the target node through the next hop node, the link hop count information corresponding to the identification information of the next hop node and the identification information of the target node.

In a possible implementation method, the first node receives identification information of the first next-hop node from a first next-hop node, and the first next-hop node is the at least one next-hop node Jump to any one of the nodes.

In a possible implementation method, receiving the identification information of the first next-hop node from the first next-hop node by the first node includes:

The first node receives identification information of the first next-hop node from the first next-hop node through a side link between the first node and the first next-hop node.

In a possible implementation method, the first node receives, from the first next-hop node, identification information of a target node reachable by the first next-hop node.

In a possible implementation method, the first node receives from the first next-hop node information about the minimum link hop count from the first next-hop node to the reachable target node.

In a possible implementation method, the first node receives first indication information from the access network node, where the first indication information instructs the first node to receive the first bearer and A mapping relationship between the second bearer of the data packet sent by the first node, the first bearer is a backhaul radio link control channel, and the second bearer is the relationship between the first node and the at least one A radio bearer or radio link control channel on the sidelink between next-hop nodes.

In a possible implementation method, the first node sends second indication information to the access network node, where the second indication information indicates that the first node supports the sidelink.

In a possible implementation method, the first node receives third indication information from the access network node, where the third indication information indicates enabling the sidelink of the first node.

In a possible implementation method, both the first node and the second node are IAB nodes, and the target node is an IAB host node or an access IAB node; or, the first node is an IAB host node , the second node is an IAB node, and the target node is an access IAB node.

In a second aspect, an embodiment of the present application provides a wireless communication method, including: the first node receives second indication information from an access network node, and the second indication information indicates enabling the sidelink of the first node The first node enables the side link of the first node according to the second indication information.

Based on the above solution, the side link of the first node can be enabled, so that the first node can communicate with other nodes through the side link interface with other nodes, and the efficiency of information transmission in the routing path can be improved.

In a possible implementation method, before the first node receives the second indication information from the access network node, the first node sends the first indication information to the access network node, and the first A piece of indication information indicates that the first node supports a sidelink.

In a possible implementation method, the first node is an IAB node, and the access network node is an IAB host node.

In a third aspect, the embodiment of the present application provides a wireless communication method, including: the first node receives indication information from an access network node, the indication information indicates the first bearer and the first bearer used for the first node to receive the data packet A mapping relationship between the second bearer used for the first node to send the data packet, the first bearer is a backhaul radio link control channel, and the second bearer is the The radio bearer or radio link control channel on the sidelink between the next hop nodes of the first node; the first node transmits the data received from the first bearer according to the indication information The packet is sent to the next-hop node through the second bearer.

Based on the above solution, the first node can quickly determine the bearer for sending the data packet, thereby improving the efficiency of information transmission in the routing path.

In a fourth aspect, an embodiment of the present application provides a wireless communication method, including: a first node receiving identification information of a second node from an access network node, where the first node is a node accessed by a first user equipment UE, The second node is a node accessed by the second UE; the first node sends a first data packet to the second UE through the second node, and the first data packet carries the first information and the second information, the first information includes data or signaling from the first UE, and the second information includes one or more of the following: the access layer identifier of the second UE, the identifier of the first transmission channel information, the first transmission channel is a channel for transmitting the first information between the second UE and the second node.

Based on the above solution, the first node may obtain the identification information of the node connected to the second UE from the access network node, and then the first node may send a data packet to the second UE through the second node. Compared with the prior art, the routing path of the data packet can be shortened, and the transmission delay of the data packet can be reduced, thereby improving the information transmission efficiency in the routing path.

In a possible implementation method, the first node sending the first data packet to the second UE through the second node includes: sending the first data packet to the second node by the first node a data packet, the second node is used to send the first data packet to the second UE; or, the first node sends the first data packet to a third node, and the third node uses For sending the first data packet to the second UE through the second node, the third node is an intermediate node between the first node and the second node.

In a possible implementation method, before the first node receives the identification information of the second node from the access network node, the first node receives the first message from the first UE through the second transmission channel. Two data packets, the second data packet carries the first information and the application layer identifier of the second UE, and the second transmission channel is for transmitting the first UE and the first node A channel for the first information: the first node acquires the access layer identifier of the second UE according to the application layer identifier of the second UE.

In a possible implementation method, the first node obtains the access stratum identifier of the second UE according to the application identifier of the second UE, including: the first node sending the access network node sending the application layer identifier of the second UE;

The first node receives the access stratum identifier of the second UE from the access network node.

In a possible implementation method, the application layer identifier of the second UE is carried in a medium access control MAC layer header field or a radio link control RLC layer header field of the second data packet.

In a possible implementation method, the first node receives identification information of the first transmission channel from the access network node.

In a possible implementation method, the second information is carried in the Backhaul Adaptation Protocol BAP layer header field of the first data packet.

In a possible implementation method, the first node receives first indication information from the access network node, where the first indication information instructs the first node to enable the local transfer function.

In a possible implementation method, before the first node receives the first indication information from the access network node, the first node sends the second indication information to the access network node, and the first The second indication information indicates that the first node supports the local transfer function.

In a possible implementation method, both the first node and the second node are IAB nodes, and the access network node is an IAB host node.

In a fifth aspect, an embodiment of the present application provides a wireless communication method, including: an access network node receiving an application layer identifier of a second UE from a first node, where the first node is a node accessed by the first UE; The access network node determines the access layer identifier of the second UE according to the application layer identifier of the second UE; the access network node sends the access layer identifier of the second UE to the first node An identification and identification information of a second node, where the second node is a node accessed by the second UE.

Based on the above solution, the first node may obtain the identification information of the node connected to the second UE from the access network node, and then the first node may send a data packet to the second UE through the second node. Compared with the prior art, the routing path of the data packet can be shortened, and the transmission delay of the data packet can be reduced, thereby improving the information transmission efficiency in the routing path.

In a possible implementation method, the access network node sends identification information of a first transmission channel to the first node, where the first transmission channel is a connection between the second UE and the second node A channel for transmitting data packets from the first UE.

In a possible implementation method, the access network node sends first indication information to the first node, where the first indication information instructs the first node to enable the local transfer function.

In a possible implementation method, before the access network node sends the first indication information to the first node, the access network node receives the second indication information from the first node, and the The second indication information indicates that the first node supports the local transfer function.

In a possible implementation method, both the first node and the second node are IAB nodes, and the access network node is an IAB host node.

In a sixth aspect, the embodiment of the present application provides a communication device, and the device may be a first node, or may be a chip used for the first node. The device has the function of realizing any possible realization method of the above-mentioned first aspect to the fourth aspect. This function may be implemented by hardware, or may be implemented by executing corresponding software on the hardware. The hardware or software includes one or more modules corresponding to the above functions.

In a seventh aspect, the embodiment of the present application provides a communication device, and the device may be an access network node, or may be a chip used for the access network node. The device has the function of implementing any possible implementation method of the fifth aspect above. This function may be implemented by hardware, or may be implemented by executing corresponding software on the hardware. The hardware or software includes one or more modules corresponding to the above functions.

In the eighth aspect, the embodiment of the present application provides a communication device, including a processor, the processor is coupled with a memory, and the memory is used to store programs or instructions, and when the programs or instructions are executed by the processor, the device realizes the above first aspect to any possible implementation method of the fifth aspect. The memory may be located within the device or external to the device. And the processor includes one or more.

In a ninth aspect, the embodiment of the present application provides a communication device, including a unit or means (means) for performing each step of any possible implementation method of the first aspect to the fifth aspect.

In the tenth aspect, the embodiment of the present application provides a communication device, including a processor and an interface circuit, the processor is used to control the interface circuit to communicate with other devices, and execute any possible implementation method of the first aspect to the fifth aspect above . The processor includes one or more.

In the eleventh aspect, the embodiment of the present application further provides a computer-readable storage medium, including instructions, which, when run on a computer, cause the computer to execute any possible implementation method of the above-mentioned first aspect to the fifth aspect.

In a twelfth aspect, the embodiment of the present application further provides a computer program product, which, when running on a computer, causes the computer to execute any possible implementation method of the first aspect to the fifth aspect.

In the thirteenth aspect, the embodiment of the present application also provides a chip system, including a processor, the processor is coupled with a memory, and the memory is used to store programs or instructions, and when the programs or instructions are executed by the processor, the chip system realizes the above-mentioned Any possible implementation method of the first aspect to the fifth aspect. The memory can be located inside the system-on-a-chip, or outside the system-on-a-chip. And the processor includes one or more.

In the fourteenth aspect, the embodiment of the present application also provides a communication system, including a first node for performing any possible realization method of the fourth aspect above and an interface for performing any possible realization method of the fifth aspect above access node.

Description of drawings

FIG. 1 is a schematic diagram of a wireless communication method provided by an embodiment of the present application;

Fig. 2 is a schematic diagram of a routing path;

FIG. 3 is a schematic diagram of a wireless communication method provided by an embodiment of the present application;

FIG. 4 is a schematic diagram of a wireless communication method provided by an embodiment of the present application;

FIG. 5 is a schematic diagram of a wireless communication method provided by an embodiment of the present application;

Fig. 6 is a schematic diagram of a routing path;

Fig. 7 is a schematic diagram of a routing path;

Figure 8 is a diagram of the separation architecture of gNB-CU and gNB-DU in NR;

Figure 9 is a schematic diagram of the control plane protocol stack under the gNB adopting the CU-DU separation architecture;

Figure 10 is a schematic diagram of the user plane protocol stack under the gNB adopting the CU-DU separation architecture;

Figure 11 is a schematic diagram of a two-hop data return scenario;

FIG. 12 is a schematic diagram of a control plane protocol stack for two-hop data return;

FIG. 13 is a schematic diagram of a user plane protocol stack for two-hop data return;

Fig. 14 is a schematic diagram of data transmission in two-hop data return;

Figure 15 is a schematic diagram of a networking method;

Figure 16 is an example diagram of a networking mode;

Figure 17 is an example diagram of node relationships;

Figure 18 is an example diagram of wireless link failure;

Figure 19 is a schematic diagram of node communication;

Figure 20 is a schematic diagram of node communication;

Figure 21 is a schematic diagram of the IAB mesh networking scenario;

Figure 22 is a schematic diagram of the IAB mesh networking scenario;

Figure 23 is a DL data transmission protocol stack;

Figure 24 is a schematic diagram of data transmission in the local switch mode;

Figure 25 is a flow chart of the local switch in the IAB mesh networking scenario;

FIG. 26 is a schematic diagram of a communication device provided by an embodiment of the present application;

FIG. 27 is a schematic diagram of a communication device provided by an embodiment of the present application.

Detailed ways

As introduced in the background technology, the nodes through which the information sent by the UE constitutes a routing path, how to improve the efficiency of information transmission in the routing path is currently to be solved. Among them, in some cases, such as the link abnormality between nodes or the failure of the node itself, a node in the routing path cannot normally route information to the next-hop node or UE of the node. Nodes need to select rerouting nodes. How to select a suitable rerouting node for a node so as to improve the information transmission efficiency in the routing path is the first problem to be solved in the embodiment of the present application. Or, in the distributed routing scenario, each node decides the next hop node of the data packet by itself, how to select a suitable next hop node for the node is also the problem to be solved in the embodiment of this application, that is to say, whether it is a data packet Routing or rerouting, how to select a suitable next-hop node for the node is the problem to be solved in the embodiment of this application. For the convenience of description, the embodiment of the present application takes data packet rerouting as an example for illustration, and the solution in the embodiment of the present application is also applicable to the scenario of data packet routing, so details will not be repeated here.

In order to solve the above problems, an embodiment of the present application provides a wireless communication method, as shown in FIG. 1, the method includes the following steps:

Step 101, the first node acquires first information.

The first node is any node in the routing path except the target node. The target node refers to a node accessed by the UE at the receiving end.

Wherein, the first information includes at least one of the following:

1) load information of at least one next-hop node of the first node;

The load information of a node can be used to reflect the resource occupation of the node. Generally, the heavier the load of a node is, the more resources the node occupies, so the routing efficiency of the node is lower. Therefore, nodes with relatively light loads are generally selected for routing. The so-called routing refers to selecting an appropriate transmission path for data packets to transmit.

2) interference information of at least one next-hop node of the first node;

The interference information of a node can be used to reflect the link quality status of the node. Generally, the greater the interference of a node, the worse the link quality of the node is, which may easily lead to packet loss. Therefore, nodes with relatively light interference are generally selected for routing.

3) channel quality between the first node and at least one next-hop node;

The channel quality between the first node and the next-hop node of the first node may be used to reflect the information transmission quality between the first node and the next-hop node of the first node. Generally, the better the channel quality, the better the information transmission quality. Therefore, nodes with relatively good channel quality are generally selected for routing.

4) Information about the number of link hops from the first node to the target node through at least one next-hop node.

The link hop count information is used to indicate the number of nodes passed in the routing path, and each node is a hop. Generally, the fewer the number of hops, the smaller the transmission delay, and the faster the information can reach the destination node. Therefore, nodes with relatively few link hops are generally selected for routing.

Step 102, the first node determines to transmit the data packet through the second node according to the first information, where the at least one next-hop node includes the second node.

Optionally, the transmission of the data packet includes the routing of the data packet, or, the rerouting of the data packet. Taking rerouting as an example for illustration, based on the above scheme, the first node selects one of the next-hop nodes of the first node based on the information of one or more next-hop nodes of the first node to carry out a data packet (such as data or signaling) rerouting nodes. The method can realize selecting a suitable next-hop node for the first node, and can improve the information transmission efficiency in the routing path.

For example, refer to FIG. 2 , which is a schematic diagram of a routing path. If a link failure occurs between node 1 (also referred to as the first node) and the next hop node of node 1 in the routing path (namely, node 4), node 1 needs to select a next hop node for rerouting. That is to say, the original path of the data packet is from node 1 to the target node 1 through node 4. Once the link between node 1 and node 4 fails and the original path of the data packet cannot continue data transmission, node 1 needs to Select a new path for the data packet for transmission (ie, rerouting). In this example, node 1 contains three next-hop nodes, namely node 2, node 3 and node 5, that is, node 1 can reach the target node 1 through node 2, node 3 or node 5 respectively. According to the first information, node 1 selects node 3 (also referred to as the second node) as the next-hop node for rerouting the data packet.

Different implementation methods for the first node to obtain the first information are introduced below.

It should be noted that, in the following description of the embodiments of the present application, the access network node is a node used to manage and control the nodes in the routing path. The identification information of a node may be address information of the node (such as a backhaul adaptation protocol (BAP) address or an Internet Protocol (Internet Protocol, IP) address, etc.) or an identification (ID) of the node.

As an implementation method, the first node receives load information of at least one next-hop node and/or interference information of at least one next-hop node of the first node from the access network node.

As another implementation method, the first node receives load information of the next-hop node and/or interference information of the next-hop node from each next-hop node of the first node respectively. For example, any one of the at least one next-hop node of the first node is called the first next-hop node, then the first node receives the load information and/or information of the first next-hop node from the first next-hop node Or the interference information of the first next-hop node.

As an implementation method, the first node receives the channel quality between the first node and at least one next-hop node of the first node from the access network node.

As another implementation method, the first node determines the channel quality between the first node and at least one next-hop node of the first node by itself. Alternatively, it can be understood that the channel quality between the first node and at least one next-hop node of the first node is obtained by measuring or calculating by the first node.

As an implementation method, the first node receives link hop information from the access network node for the first node to reach the target node through at least one next-hop node, wherein the link hop information and the routing identifier and the next-hop node Corresponding to the identification information of , the routing identification includes the identification information of the target node and the path identification. For example, when the access network node configures the routing table for the first node, the routing table includes the identification information of the next hop node of the first node, the route identification of the first node reaching the target node through the next hop node, and the first node The hop count information of the link to reach the target node through the next hop node.

As another implementation method, the first node receives link hop information from the access network node for the first node to reach the target node through at least one next-hop node, wherein the link hop information indicated by the link hop information is the minimum link hop count for the first node to reach the target node through the next hop node, and the link hop count information corresponds to the identification information of the next hop node and the identification information of the target node. For example, the access network node may use the indication information to indicate to the first node information about the minimum number of link hops for the first node to reach the target node through at least one next-hop node.

As an implementation method, the first node may receive, from each next-hop node of the first node, identification information of the next-hop node. Any one of the at least one next-hop node of the first node is referred to as a first next-hop node, and the first node may receive identification information of the first next-hop node from the first next-hop node. For example, the first next-hop node sends the identification information of the first next-hop node to the first node through an air interface between the first next-hop node and the first node. For another example, the first next-hop node sends the identification information of the first next-hop node to the first node through the sidelink interface between the first next-hop node and the first node.

As an implementation method, the first node may receive, from the first next-hop node, identification information of a target node reachable by the first next-hop node. That is, the first next-hop node sends all the identification information of the target node that the first next-hop node can reach to the first node, so that when the first node needs to select a node for transmission (such as rerouting), it can know Whether the first next-hop node can be used as a candidate next-hop node. Optionally, the first next-hop node does not send the hop count information of all links from the first next-hop node to the target node to the first node, but sends the minimum link hop information of the first next-hop node to the target node The route hop count information is sent to the first node.

As an implementation method, the first node also receives first indication information from the access network node, and the first indication information indicates that there is a difference between the first bearer on which the first node receives the data packet and the second bearer on which the first node sends the data packet mapping relationship, the first bearer is a backhaul radio link control channel (backhaul radio link control channel, BH RLC CH), and the second bearer is the side link between the first node and at least one next-hop node A radio bearer (such as a data radio bearer or a signaling radio bearer) or a radio link control channel (radio link control channel, RLC CH). According to the first indication information, the first node may know that the data packet received from the first bearer should be sent to the next-hop node of the first node from the second bearer. It should be noted that the second bearers between the first node and different next-hop nodes are different respectively.

As an implementation method, if the first node supports sidelinks, the first node may send second indication information to the access network node, where the second indication information indicates that the first node supports sidelinks, or indicates that the first node supports sidelinks. A node supports the function of sidelink communication, or instructs the first node to support the sidelink interface. Optionally, the first node may receive third indication information from the access network node, where the third indication information indicates enabling the side link of the first node, so that the first node may enable The sidelink of the first node.

When the above wireless communication method is applied to an integrated access and backhaul (Integrated Access and Backhaul, IAB) scenario, the above-mentioned first node and the second node are both IAB nodes, or the above-mentioned first node is an IAB host node (ie : the DU of the IAB host node) and the second node are IAB nodes, or the above-mentioned first node is an IAB node and the second node is an IAB host node (ie: the DU of the IAB host node), and the access network node is an IAB host node (ie: the CU of the IAB host node). Moreover, if the above wireless communication method is applied to uplink transmission, the target node is an IAB host node (ie: the DU of the IAB host node). If the above wireless communication method is applied to downlink transmission, the target node is an access IAB node. Wherein, the access node refers to a node accessed by the UE.

In order to solve the technical problems mentioned in the background technology, as shown in FIG. 3 , an embodiment of the present application also provides a wireless communication method, which includes the following steps:

Step 301, the first node receives second indication information from an access network node.

The second indication information indicates enabling the side link of the first node.

Step 302, the first node enables the side link of the first node according to the second indication information.

Based on the above solution, the side link of the first node can be enabled, so that the first node can communicate with other nodes through the side link interface with other nodes, and the efficiency of information transmission in the routing path can be improved.

Optionally, before step 301, the first node sends first indication information to the access network node, the first indication information indicates that the first node supports the side link, or indicates that the first node supports the side link communication function , or indicate that the first node supports the sidelink interface.

When the above wireless communication method is applied to an IAB scenario, the above-mentioned first node is an IAB node, or the above-mentioned first node is an IAB host node (ie: a DU of the IAB host node), and the access network node is an IAB host node (ie: CU of the IAB host node).

In order to solve the technical problems mentioned in the background technology, as shown in FIG. 4 , an embodiment of the present application also provides a wireless communication method, which includes the following steps:

Step 401, the first node receives indication information from an access network node.

The indication information indicates the mapping relationship between the first bearer used for the first node to receive the data packet and the second bearer used for the first node to send the data packet, the first bearer is the backhaul radio link control channel, and the second bearer It is a radio bearer or a radio link control channel on the sidelink between the first node and the next hop node of the first node.

Step 402, the first node sends the data packet received from the first bearer to the next-hop node through the second bearer according to the indication information.

Based on the above solution, the first node can quickly determine the bearer for sending the data packet, thereby improving the efficiency of information transmission in the routing path.

When the above wireless communication method is applied to an IAB scenario, the above-mentioned first node is an IAB node, and the access network node is an IAB host node (that is, a CU of the IAB host node).

As introduced in the background technology, the nodes through which the information sent by the UE constitutes a routing path, how to improve the efficiency of information transmission in the routing path is currently to be solved. At present, when one UE sends a data packet to another UE, the data packet sent from one UE needs to be sent to the user plane node of the core network through the nodes in the routing path, and then the user plane node passes the data packet through Nodes in the routing path send to another UE. That is to say, the transmission of the existing data packets needs to be processed by the core network nodes, and the transmission path of the data packets in this way is relatively long, resulting in a large time delay. How to reduce the transmission delay of the data packet to improve the information transmission efficiency in the routing path is the second problem to be solved in the embodiment of the present application.

To solve this problem, an embodiment of the present application provides a wireless communication method, as shown in FIG. 5, the method includes the following steps:

Step 501, the first node receives identification information of a second node from an access network node.

The first node is a node accessed by the first UE, and the second node is a node accessed by the second UE.

Step 502, the first node sends the first data packet to the second UE through the second node.

The first data packet carries first information and second information, the first information includes data or signaling from the first UE, and the second information includes one or more of the following: the access stratum identifier of the second UE, the first Identification information of a transmission channel, where the first transmission channel is a channel for transmitting the first information between the second UE and the second node.

Optionally, the second information is carried in a backhaul adaptation protocol (backhaul adaptation protocol, BAP) layer header field of the first data packet. Based on the above solution, the first node may obtain the identification information of the node connected to the second UE from the access network node, and then the first node may send a data packet to the second UE through the second node. Compared with the existing technology, the transmission of data packets does not need to be processed by core network nodes, which can shorten the routing path of data packets and reduce the transmission delay of data packets, thereby improving the efficiency of information transmission in routing paths.

As an implementation method, in the above step 502, the first node may send the first data packet to the third node, and then the third node sends the first data packet to the second UE through the second node, and the third node is the first An intermediate node between the node and the second node, for example, the third node may be directly connected to the second node, or there may be other intermediate nodes between the third node and the second node. For example, refer to FIG. 6 , which is a schematic diagram of a routing path corresponding to this manner.

As another implementation method, in the above step 502, the first node may send the first data packet to the second node through an interface (such as a Uu port or a sidelink interface) between the first node and the second node, and then The second node sends the first data packet to the second UE. For example, refer to FIG. 7 , which is a schematic diagram of a routing path corresponding to this manner.

As an implementation method, before the above step 501, the first node receives the second data packet from the first UE through the second transmission channel, the second data packet carries the first information and the application layer identifier of the second UE, and the second transmission The channel is a channel for transmitting the first information between the first UE and the first node, and then the first node obtains the access layer identifier of the second UE according to the application layer identifier of the second UE, and then generates the first data according to the second data packet Bag. Optionally, the application layer identifier of the second UE is carried in a medium access control (medium access control, MAC) layer header field or an RLC layer header field of the second data packet.

Wherein, the first node obtains the access layer identifier of the second UE according to the application identifier of the second UE. For example, the first node sends the application layer identifier of the second UE to the access network node, and then the first node receives the access layer identifier from the access network node. The access layer identifier of the second UE at the network access node, that is, the access network node determines the access layer identifier of the second UE according to the application layer identifier of the second UE.

As an implementation method, before step 502 above, the first node obtains the identification information of the first transmission channel from the access network node. For example, the first node sends quality of service (quality of service, QoS) information corresponding to the second transmission channel to the access network device, and the access network node determines the first transmission channel according to the QoS information corresponding to the second transmission channel. Wherein, the second transmission channel is a channel for transmitting the first information between the first UE and the first node.

As an implementation method, before the above step 502, the first node receives first indication information from the access network node, the first indication information instructs the first node to enable the local transfer function, and the first node uses the first indication information to enable Capable of passing functions locally. Optionally, before receiving the first indication information from the access network node, the first node further sends second indication information to the access network node, where the second indication information indicates that the first node supports the local transfer function.

When the above wireless communication method is applied to an IAB scenario, the first node and the second node are both IAB nodes, and the access network node is an IAB host node (that is, the CU of the IAB host node).

Taking the solutions corresponding to Fig. 1 , Fig. 3 , Fig. 4 and Fig. 5 all being applied to the IAB scenario as an example, detailed implementation manners of the above-mentioned various solutions are introduced below.

In the 3rd generation partnership project (3rd generation partnership project, 3GPP) Rel-15NR, the gNB can adopt the centralized unit (Central Unit, CU)-distributed unit (Distributed Unit, DU) separation architecture, that is: the gNB consists of a gNB -CU and one or more gNB-DUs. Among them, the gNB-CU is connected to the gNB-DU through the F1 interface, and the gNB-CU is connected to the fifth generation (5th generation, 5G) core network through the NG interface. As shown in Figure 8, it is a diagram of the separation architecture of gNB-CU and gNB-DU in NR.

The gNB is a node that provides NR user plane and control plane transmission for a user equipment (User Equipment, UE), and the gNB includes one or more cells. The gNB is connected to the 5G core network (5G core, 5GC) through the NG interface, and is connected to other gNBs through the Xn interface. Among them, the Xn-C interface is used for transmission of control plane signaling between two gNBs, and the Xn-U interface is used for transmission of user plane data between two gNBs. The interface between gNB and UE is called Uu interface. Wherein, the communication interface between the UE and the base station (such as gNB, eNB) or the DU accessing the IAB node may be called an air interface.

The gNB-CU is a logical node. The gNB-CU includes the radio resource control (Radio Resource Control, RRC) layer, the service data adaptation protocol (Service Data Adaptation Protocol, SDAP) layer and the packet data convergence protocol (Packet Data Convergence Protocol) layer of the gNB. , PDCP) layer, used to control one or more gNB-DUs.

The gNB-DU is a logical node, and the gNB-DU includes the radio link control (Radio Link Control, RLC) layer, the medium access control (medium access control, MAC) layer and the physical layer (Physical layer, PHY) layer of the gNB. One gNB-DU supports one or more cells, but one cell can only belong to one gNB-DU.

The UE accesses the gNB-CU through the gNB-DU, that is, the PHY/MAC/RLC layer functions equivalent to the UE are located on the gNB-DU, and the PDCP/SDAP/RRC layer functions equivalent to the UE are located on the gNB-CU.

As shown in FIG. 9 , it is a schematic diagram of the control plane protocol stack under the gNB adopting the CU-DU separation architecture. For the control plane, in the uplink (uplink, UL) direction, the gNB-DU encapsulates the RRC message generated by the UE in an F1 interface application protocol (F1Application Protocol, F1AP) message and sends it to the gNB-CU. In the downlink (downlink, DL) direction, the gNB-CU encapsulates the RRC message in the F1AP message and sends it to the gNB-DU, and the gNB-DU extracts the RRC message from the F1AP message and maps it to the signaling radio bearer (signalling radio) corresponding to the Uu interface bearer, SRB) (SRB0/SRB1/SRB2) to the UE.

As shown in Figure 10, it is a schematic diagram of the user plane protocol stack under the CU-DU separation architecture adopted by the gNB. For the user plane, in the UL direction, the gNB-DU maps UE data packets received from the Uu interface Data Radio Bearer (DRB) to the corresponding General Packet Radio Service (GPRS) Tunneling Protocol (GPRSTunnelingProtocol, GTP) tunnel to send to gNB-CU. In the DL direction, the gNB-CU maps the UE data packet to the corresponding GTP tunnel and sends it to the gNB-DU, and the gNB-DU extracts the UE data packet from the GTP tunnel, and maps the UE data packet to the DRB corresponding to the Uu interface sent to the UE.

In 3GPP Rel-15 IAB, two nodes, IAB node (called IAB node) and IAB donor (called IAB host node, or host IAB node), are introduced. Wherein, the IAB donor may be a gNB, or an upgraded gNB.

As shown in Figure 11, it is a schematic diagram of a two-hop data return scenario. Wherein, the backhaul is referred to as BH. The IAB network adopts CU-DU separation architecture, namely: IAB donor is composed of IAB donor-CU (abbreviated as donor-CU) and IAB donor-DU (abbreviated as donor-DU), and IAB node is composed of IAB node-MT (abbreviated as IAB-DU). MT) and IAB node-DU (referred to as IAB-DU) two parts. Wherein, the IAB node-MT may also be called the IAB node-UE (IAB-UE for short).

For IAB donors, the functions of donor-DU and gNB-DU are similar, and the functions of donor-CU and gNB-CU are similar.

For the IAB node, the IAB-DU has a similar function to the gNB-DU and is used to provide access services for its child nodes, where the child nodes of the IAB-DU can be UEs or other IAB nodes. IAB-MT has the function of UE and is used to provide data backhaul for its child nodes.

The IAB node can be further divided into an access IAB node and an intermediate IAB node, that is, the IAB node accessed by the UE is called the access IAB node, and the IAB node on the path between the access IAB node and the IAB donor is called the intermediate IAB node .

As shown in Figure 11, if the UE accesses IAB node2, then IAB node2 is called the UE's access IAB node (or the UE's parent node), the UE is called the child node of IAB node2, and the link between the UE and IAB node2 is called for the access link. IAB node1 is called an intermediate IAB node. The parent node of IAB node1 is IAB donor (the child node of IAB donor is IAB node1), and the child node of IAB node1 is IAB node2 (the parent node of IAB node2 is IAB node1). The link between IAB node1 and IAB node2, and the link between IAB node1 and IAB donor are called backhaul links. Among them, the PHY layer, MAC layer and RLC layer equivalent to the UE are located on the access IAB node (ie: IAB2-DU), while the PDCP layer, SDAP layer and RRC layer equivalent to the UE are located on the donor-CU. IAB nodes all adopt the architecture of L2 data forwarding.

As shown in FIG. 12 , it is a schematic diagram of a control plane protocol stack for two-hop data return. The F1 interface is established between the access IAB node (ie: IAB2-DU) and the IAB donor (ie: donor-CU). Specifically, if the IAB donor adopts the CP-UP separation architecture, an F1-C interface is established between the IAB2-DU and the donor CU-CP. The RRC message of the UE is encapsulated in the F1AP message of the F1-C interface for transmission.

As shown in FIG. 13 , it is a schematic diagram of a user plane protocol stack for two-hop data return. If the IAB donor adopts the CP-UP separation architecture, an F1-U interface is established between the IAB2-DU and the donor CU-UP, and a GTP tunnel per UE bearer is established on the F1-U interface. That is to say, each UE DRB established on the interface between UE and IAB2-DU corresponds to a separate GTP tunnel on the interface between IAB2-DU and donor CU-UP.

As shown in FIG. 14 , it is a schematic diagram of data transmission in two-hop data return. Multiple UE DRBs are established on the interface link between the UE and the IAB node2 to transmit different services of the UE. Multiple backhaul RLC channels (BH RLC CHs) are established on the backhaul link between IAB node2 and IAB node1 to transmit backhaul of different services of the UE. Similarly, multiple BH RLC CHs are also established on the backhaul link between IAB node1 and IAB donor. A per UE bearer GTP tunnel is established between the IAB node2 and the IAB donor CU, and each GTP tunnel corresponds to the UE DRB on the interface between the UE and the IAB node2.

In the downstream direction:

1), the donor-CU maps the UE PDCP protocol data unit (protocol data unit, PDU) to the corresponding GTP tunnel, and determines the target Internet protocol (internet protocol, IP) address of the UE data packet (that is, the IP address of IAB node2 ), further encapsulate the UE data packet into an IP packet, and mark the corresponding Differentiated Services Code Point (Differentiated Services Code Point, DSCP) or flow label (flow label) in the IP header field, and fill in the target IP of the IP packet After the address, it is sent to the donor-DU through IP routing. Wherein, the DSCP is used to identify the type of service in Internet Protocol version 4 (Internet Protocol version 4, IPv4), and the flow label is used to identify the type of service in Internet Protocol version 6 (Internet Protocol version 6, IPv6).

2), according to the DSCP or flow label carried in the IP header and the target IP address, and according to the mapping relationship 1 configured by the donor-CU, the donor-DU maps the received UE IP packet to the corresponding BH RLC CH and sends it to the IAB node1. Wherein, the mapping relationship 1 configured by the donor-CU for the donor-DU includes: a mapping relationship between a parameter and a BH RLC CH, and the parameter is composed of one or more of the following combinations, including: DSCP, flow label, and target IP address.

3) According to the mapping relationship 2 configured by the donor-CU, the IAB node1 maps the received UE IP packet to the corresponding BH RLC CH and sends it to the IAB node2. Wherein, the mapping relationship 2 configured by the donor-CU for the IAB node1 includes: the mapping relationship between the ingress BH RLC CH (ingress BH RLC CH) and the egress BH RLC CH (egress BH RLC CH). The ingress BH RLC CH is the BH RLC CH between IAB node1 and IAB donor DU, and the egress BH RLC CH is the BH RLC CH between IAB node1 and IAB node2.

4), IAB node2 sends the received UE IP packet to the GTP layer for analysis, extracts the UE PDCP PDU from the GTP tunnel, and maps the UE PDCP PDU to the The corresponding UE DRB is sent to the UE.

In the upstream direction:

1) The UE maps the UE PDCP PDU to the corresponding UE DRB and sends it to the IAB node2.

2), IAB node2 maps the UE PDCP PDU to the corresponding GTP tunnel according to the mapping relationship between the GTP tunnel configured by the donor-CU and the UE DRB. Then, according to the mapping relationship 3 configured by the donor-CU, the IAB node2 further encapsulates the UE data packet into an IP packet, maps it to the corresponding BH RLC CH, and sends it to the IAB node1. Wherein, the mapping relationship 3 configured by the donor-CU includes: the mapping relationship between the GTP tunnel (namely: GTP TEID and IP address) and the BH RLC CH, and the IP address is the IP address of the donor-CU.

3) According to the mapping relationship 4 configured by the donor-CU, the IAB node1 maps the received UE IP packet to the corresponding BH RLC CH and sends it to the donor-DU. Wherein, the mapping relationship 4 configured by the donor-CU for the IAB node1 includes: the mapping relationship between the ingress BH RLC CH (ingress BH RLC CH) and the egress BH RLC CH (egress BH RLC CH). The ingress BH RLC CH is the BH RLC CH between IAB node2 and IAB node1, and the egress BH RLC CH is the BH RLC CH between IAB node1 and IAB donor DU.

4). The donor-DU further routes the UE IP packet to the donor-CU according to the target IP address in the UE IP packet header (that is, the IP address of the donor-CU). After the donor-CU sends the IP packet to the GTP layer for analysis, it extracts the UE PDCP PDU from the GTP tunnel.

In R16, IAB node supports two networking modes, including: spanning tree (spanning tree, ST) networking mode (refer to Figure 15 (a)) and directed acyclic graph (directed acyclic graph, DAG) networking mode (Refer to (b) of FIG. 15).

Among them, the ST networking mode supports multi-hop, and each IAB node has only one parent node. The DAG networking mode supports multi-hop and multi-connection. Each IAB node can have one or two parent nodes (as shown in (a), (b) and (c) in Figure 16), but it can only be connected to one IAB donor (as shown in (b) and (c) of Figure 16, subject to the constraint that one IAB-DU can only be connected to one donor-CU).

Based on the above networking method, each IAB node includes two roles: child node and parent node. As shown in Figure 17, IAB node1 is the child node of IAB donor and the parent node of IAB node2; IAB node2 is the child node of IAB node1 and the parent node of IAB node3; IAB node3 is the child node of IAB node2 and also the UE's parent node.

For the same IAB node, regardless of the transmission of data or signaling, one side receives it and sends it to the other side for transmission. For example: IAB-MT receives data or signaling and hands it to the co-site IAB-DU for transmission. , or, after receiving data or signaling, the IAB-DU hands it over to the co-site IAB-MT for transmission. Specifically, taking IAB-node2 as an example, for downlink (DL) transmission, after IAB-MT2 receives DL data/signaling from IAB-DU1, IAB-MT2 sends it to the co-site IAB-DU2 through the internal interface, and the IAB-DU2 is sent to IAB-MT3; for uplink (UL) transmission, after IAB-DU2 receives UL data/signaling from IAB-MT3, IAB-DU2 is sent to co-site IAB-MT2 through the internal interface, and IAB - MT2 sends to IAB-DU1.

R16 IAB adopts the centralized routing and bearer mapping mode controlled by the IAB donor. On the basis of the existing protocol stack, a new protocol layer is introduced, namely: backhaul adaptation protocol (BAP) layer, as shown in Figure 12 and Figure 13 above, the role of the BAP layer is mainly for Routing and bearer mapping for data/signaling transport on the backhaul link.

1. Routing

Routing refers to the need to determine the transmission path before data/signaling is transmitted, that is, which next-hop node is used to transmit data/signaling to the target node.

In R16 IAB, regardless of DL routing or UL routing, donor-CU needs to configure routing tables for donor-DU, intermediate IAB node and access IAB node respectively, that is: routing ID (Routing ID)<->BAP of the next hop node A mapping relationship of addresses, wherein the Routing ID includes the BAP address of the target node and a path identifier (path ID).

1. Downlink (DL) routing

donor-DU: The donor-CU configures the mapping relationship of DSCP/flow label+IP address of the access IAB node<->Routing ID for the donor-DU. That is: after the donor-DU receives the DL IP packet from the donor-CU, it determines the DL IP packet corresponding to Routing ID, and then check the routing table according to the Routing ID to determine the next hop node for data/signaling transmission, and carry the determined Routing ID in the BAP layer, and send it to the next hop along with the data/signaling node.

Intermediate IAB node: The intermediate IAB node receives DL IP packets from the previous hop node, checks the routing table according to the Routing ID carried in the BAP layer, and determines the next hop node for data/signaling transmission.

2. Uplink (UL) routing

Access to the IAB node: For data transmission, the donor-CU configures the mapping relationship of GTP FTEID<->Routing ID for the access to the IAB node; for signaling transmission, the donor-CU configures the signaling type for the access to the IAB node Indicates the mapping relationship of <->Routing ID, wherein the signaling type indication is used to indicate Non-UE associated F1AP and UE-associated F1AP. That is: after the access IAB node receives the UL IP packet from the UE, it determines the Routing ID corresponding to the data/signaling transmission according to the above mapping relationship configured by the donor-CU, and then checks the routing table according to the Routing ID to determine the data/signaling transmission The next hop node, and carry the determined Routing ID in the BAP layer, and send it to the next hop node together with data/signaling.

Intermediate IAB node: The intermediate IAB node receives DL IP packets from the previous hop node, checks the routing table according to the Routing ID carried in the BAP layer, and determines the next hop node for data/signaling transmission.

2. Bearer mapping

Bearer mapping means that data/signaling is mapped to the corresponding transmission channel and sent to the next hop node, that is, before data/signaling is sent to the next hop node, it is necessary to determine which transmission the data/signaling is mapped to channel (for example: BH RLC CH).

In R16 IAB, regardless of DL mapping or UL mapping, the donor-CU needs to configure bearer mapping for the donor-DU, intermediate IAB node, and access IAB node respectively. As shown in Figure 12 and Figure 13, specifically include:

1. DL mapping:

donor-DU: The donor-CU configures the mapping relationship of DSCP/flow label + IP address of the access IAB node <-> egress BH RLC CH ID for the donor-DU. That is: after the donor-DU receives the DL IP packet from the donor-CU, it determines that the DL IP packet needs to be used according to the DSCP/flow label value and the target IP address carried in the IP packet header field, and according to the above mapping relationship configured by the donor-CU. Which corresponding egress BH RLC CH the packet is mapped to and sent to the next hop node.

Intermediate IAB node: The donor-CU configures the mapping relationship of ingress BH RLC CH ID<->egress BH RLC CH ID for the intermediate IAB node. That is: after the intermediate IAB node receives the DL IP packet sent by the previous hop node from the ingress BH RLC CH, it determines which corresponding egress BH RLC CH the DL IP packet needs to be mapped to according to the above mapping relationship configured by the donor-CU sent to the next hop node.

2. UL mapping

Access to IAB node: For data transmission, Donor-CU configures the mapping relationship of GTE FTEID<->egress BH RLC CH ID for access to IAB node; for signaling transmission, Donor-CU configures for access to IAB node F1AP type indication <-> egress BH RLC CH mapping relationship, wherein the F1AP type indication is used to indicate Non-UE associated F1AP message and UE-associated F1AP message. That is: after the access IAB node receives the UL IP packet from the Donor-CU, according to the above mapping relationship configured by the Donor-CU, determine which corresponding egress BH RLC CH the UL IP packet needs to be mapped to and send to the next-hop node .

Intermediate IAB node: The donor-CU configures the mapping relationship of ingress BH RLC CH ID<->egress BH RLC CH ID for the intermediate IAB node. That is: after the intermediate IAB node receives the DL IP packet sent by the previous hop node from the ingress BH RLC CH, it determines which corresponding egress BH RLC CH the DL IP packet needs to be mapped to according to the above mapping relationship configured by the donor-CU sent to the next hop node.

Since R16 IAB only supports two networking modes of ST and DAG, the rerouting mechanism is only limited to radio link failure (radio link failure, RLF) scenarios. As shown in Figure 18, when IAB-node2 detects that RLF occurs on the link with IAB-node4, and the link cannot be restored, then IAB-node2 sends an RLF indication message to its child node IAB-node1. After receiving the RLF indication information, if the IAB-node1 is working in dual connection mode, the IAB-node1 will trigger the re-routing mechanism to reroute the UL data originally sent to the IAB-donor through the IAB-node2 to the IAB -send on node3, that is: send these UL data to IAB-donor through IAB-node3.

The existing technology only considers the two simple networking forms of spanning tree and directed acyclic graph, two peer nodes cannot communicate directly, and since an IAB node has at most two parent nodes, the rerouting mechanism is simple , that is, at most there is only one candidate path that can be used for rerouting, and there is no problem of selecting a candidate path.

With the development of the network, mesh networking is a multipoint-to-multipoint peer-to-peer network, which adds direct communication between two peer nodes, ensuring that any two adjacent nodes can directly communicate with each other. Communication has the advantages of self-organizing network, self-healing, and flexible routing, which can greatly reduce the cost and complexity of network deployment, and is a trend in future network deployment. In a mesh network, two adjacent nodes can communicate directly. As a result, once the IAB node discovers the link RLF, there may be multiple candidate paths for rerouting. However, according to the existing technology, the IAB node cannot know these The link quality and load conditions of the candidate paths make it impossible to select a suitable path for rerouting.

Furthermore, the prior art does not support local switch. However, in mesh networking, two adjacent nodes can communicate directly, which increases the possibility of data/signaling to realize local switch, and greatly reduces the delay of data/signaling transmission. The embodiment of this application aims at the IAB mesh networking scenario and mainly solves two problems:

Question 1: Taking rerouting as an example, how does the IAB node select an appropriate path to reroute data/signaling to ensure the QoS requirements for data/signaling transmission?

Question 2: How to implement the local switch in the IAB mesh scenario to reduce the data transmission delay and ensure normal data transmission between two communicating UEs?

The embodiment of this application mainly considers the IAB mesh networking scenario.

scene one:

In the existing R16 IAB networking scenario, as shown in Figure 19, peer nodes cannot communicate directly, for example: IAB node1 and IAB node2, IAB node3 and IAB node4, IAB node4 and IAB node5, IAB node6 and IAB node7 .

In the IAB mesh networking scenario, as shown in Figure 20, it is necessary to add a connection between two peer nodes to ensure direct communication between two adjacent nodes. For example, add a connection between IAB node1 and IAB node2, add a connection between IAB node3 and IAB node4, add a connection between IAB node4 and IAB node5, and add a connection between IAB node6 and IAB node7.

Once RLF occurs on the link between IAB node4 and IAB node2, IAB node2 can further route DL data to IAB node6 through multiple candidate paths, and IAB node6 will further send it to UE, or, IAB node4 can pass through multiple candidate paths Route UL data further to Donor-CU.

Scene two:

In the IAB mesh networking scenario, as shown in Figure 20, UE1 connected to IAB node6 communicates with UE2 connected to IAB node7 through a local switch. That is, the local switch path between UE1 and UE2 is: UE1<->IAB node6<->IAB node7<->UE2.

It should be noted that Figure 19 and Figure 20 involved in the above-mentioned scenario 1 and scenario 2 of the embodiment of the present application are only to illustrate a specific example of the solution of the embodiment of the present application, and this specific example does not constitute a reference to the application scenario of the embodiment of the present application. limited. In practical applications, it can also be applied to other scenarios with the same problem.

Embodiment one

The first embodiment corresponds to the above-mentioned embodiment corresponding to FIG. 1 , and is used to select an appropriate rerouting node for a node on a routing path.

In the IAB mesh networking scenario, a connection between two peer nodes is introduced to ensure direct communication between two adjacent nodes. Among them, there are two schemes for communication between two peer nodes. In this embodiment, Donor-CU is referred to as donor-CU, IAB node1 is referred to as IAB1, and IAB node2 is referred to as IAB2. repeat.

Solution 1: Communication between peer IAB nodes through the Uu interface

In this solution, the peer IAB nodes communicate through the Uu interface, which means that the DU of one IAB node communicates with the MT of another IAB node through the Uu interface. As shown in Fig. 21, the communication between peer nodes IAB1 and IAB2 can be realized through communication between IAB1-MT and IAB2-DU, or through communication between IAB1-DU and IAB2-MT.

This solution is described by taking DL transmission as an example. The above-mentioned solution is also applicable to the scenario of UL transmission, so details will not be repeated here.

Taking downlink data transmission as an example, if RLF occurs on the link between IAB2-DU and IAB4-MT, IAB2 can also send the DL data of UE1 to IAB6 through other candidate paths, and IAB6 will further send it to UE1. Among them, candidate paths include but are not limited to:

Candidate path 1: IAB2-DU->IAB1-MT->IAB1-DU->IAB3-MT->IAB3-DU->IAB6-MT;

Candidate path 2: IAB2-DU->IAB1-MT->IAB1-DU->IAB3-MT->IAB3-DU->IAB4-MT->IAB4-DU->IAB6-MT;

Candidate path 3: IAB2-DU->IAB5-MT->IAB5-DU->IAB4-MT->IAB4-DU->IAB7-MT->IAB7-DU->IAB6-MT;

Candidate path 4: IAB2-DU->IAB5-MT->IAB5-DU->IAB7-MT->IAB7-DU->IAB6-MT;

...

Since IAB2 does not know the situation of each candidate path, such as: the quality of each link on the candidate path, the load of each IAB node on the candidate path, etc., how does IAB2 select a suitable path from multiple candidate paths Rerouting downlink data?

In order to solve the above problem, IAB2 can know the hop count information of each candidate path and the load condition of adjacent IAB nodes, so that it can select an appropriate path for rerouting.

Among them, the methods for the IAB node to obtain the hop count information of each candidate path include but are not limited to the following methods 1 to 2:

Method 1: When Donor-CU configures the routing table for the IAB node, add the number of hops passed through the next hop node to the target node for different routing paths, namely: Routing ID<->BAP address of the next hop node <->Number of hops, where the Routing ID consists of the BAP address of the target node + the path identifier path ID.

That is, the Donor-CU sends the BAP address, Routing ID and hop count information of the next-hop node to the IAB node. Among them, the hop number information has a corresponding relationship with the BAP address of the next hop node and the Routing ID, and is used to indicate the next hop node indicated by the BAP address, and the hops passed through the path indicated by the Routing ID to reach the target node indicated by the Routing ID. number. Optionally, configure the BAP address, Routing ID, and hop count information of the next-hop node through the routing table.

In the prior art, when the Donor-CU configures the routing table for the IAB node, the Donor-CU sends the Routing ID and the BAP address of the next-hop node to the IAB node, and the Routing ID and the BAP address of the next-hop node have a corresponding relationship, using In order to indicate that the IAB node can reach the target node indicated by the Routing ID through the next-hop node indicated by the BAP address and the path indicated by the Routing ID. In order for the IAB node to know the hop count information of each candidate path, the next hop node indicated by the BAP address can be added on the basis of the existing routing table, and the route indicated by the Routing ID can reach the target node indicated by the Routing ID. The number of hops passed.

Taking IAB2 in Figure 21 as an example, Donor-CU can add hop count information in the routing table configured for IAB2 (where the target node is IAB6):

Candidate route 1: Routing ID1<->BAP address of the next hop node IAB1<->2 hops;

Candidate route 2: Routing ID2<->BAP address of the next hop node IAB1<->3 hops;

Candidate route 3: Routing ID3<->BAP address of the next hop node IAB5<->3 hops;

Candidate route 3: Routing ID4<->BAP address of the next hop node IAB5<->2 hops.

That is: the Donor-CU configures to the IAB node the information on the number of hops passed through the next hop node, the path indicated by the Routing ID, and the target node indicated by the Routing ID.

Method 2: Donor-CU sends information on the shortest hops to the target node through the next hop node to the IAB node (this method does not need to change the configuration of the routing table)

That is, in this method, the Donor-CU sends the BAP address of the next-hop node, the BAP address of the target node and the shortest hop information to the IAB node, wherein the shortest hop information is related to the BAP address of the next-hop node and the target node's The BAP address has a corresponding relationship and is used to indicate the shortest number of hops passed through the next hop node to reach the target node.

Taking IAB2 in Figure 21 as an example, Donor-CU sends the following information to IAB2:

BAP address of the next hop node IAB1 <-> BAP address of the target node IAB6 <-> 2 hops;

The BAP address of the next-hop node IAB5 <-> the BAP address of the target node IAB6 <-> 2 hops.

It is worth noting that the above method is applied to the IAB node, that is, the IAB node obtains the hop count information of each candidate path from the Donor-CU. Optionally, the above method can also be applied to the Donor-DU, that is, the Donor-DU obtains the hop count information of each candidate path from the Donor-CU, so that the Donor-DU can select an appropriate next-hop node for rerouting.

Among them, the method for an IAB node to know the load condition of the adjacent IAB node ((the following uses IAB2 to know the load condition (load/interference information) of the adjacent IAB1 as an example)) includes but is not limited to the following methods 1 to 5:

Method 1: IAB1-MT reports the load/interference information to the donor-CU through the RRC message, and the donor-CU sends the load/interference information to the IAB2-DU through the F1AP message.

This method can be understood as: the IAB node reports the load/interference information to the donor-CU through the RRC message, and the donor-CU sends the load/interference information to the parent node or child node of the IAB node through the F1AP message.

Method 2: IAB1-DU reports the load/interference information to the donor-CU through the F1AP message, and the donor-CU sends the load/interference information to the IAB2-MT through the RRC message.

This method can be understood as: the IAB node reports the load/interference information to the donor-CU through the F1AP message, and the donor-CU sends the load/interference information to the parent node or child node of the IAB node through the RRC message.

Method 3: The IAB1-MT reports the load/interference information to the donor-CU through the RRC message, and the donor-CU sends the load/interference information to the IAB2-MT through the RRC message.

This method can be understood as: the IAB node reports the load/interference information to the donor-CU through the RRC message, and the donor-CU sends the load/interference information to the parent node or child node of the IAB node through the RRC message.

Method 4: IAB1-DU reports the load/interference information to the donor-CU through the F1AP message, and the donor-CU sends the load/interference information to the IAB2-DU through the F1AP message.

This method can be understood as: the IAB node reports the load/interference information to the donor-CU through the F1AP message, and the donor-CU sends the load/interference information to the parent node or child node of the IAB node through the F1AP message.

Method 5: IAB1-DU and IAB2-MT, or IAB1-MT and IAB2-DU are transmitted through BAP control PDU.

This method can be understood as: the IAB node sends the load/interference information to the parent node or child node of the IAB node through a BAP control PDU message.

In addition, in the IAB mesh networking scenario, if RLF occurs on the link between IAB2-DU and IAB4-MT, IAB2 can also send the DL data of UE1 to IAB6 through other candidate paths, and IAB6 will further send it to UE1. In addition to the candidate paths listed above, another path may exist:

Candidate path a: IAB2-DU->IAB1-MT->IAB1-DU->IAB3-MT->IAB4-DU->IAB6-MT.

Candidate path b: IAB2-DU->IAB5-MT->IAB5-DU->IAB7-MT->IAB6-DU.

This candidate path is a change to the existing mechanism. According to the description in the prior art, for DL, after receiving data from the DU of the parent node, the IAB-MT sends the data to the co-sited IAB-DU through the internal interface. In candidate path a and candidate path b, IAB-MT (IAB3-MT in path a or IAB7-MT in path b) does not send data to the co-site IAB-DU after receiving data from the DU of the parent node, but Send DUs of other IAB nodes. Therefore, there is a change in the data transmission implementation of the IAB node, that is, after the IAB-MT receives DL data from the parent node, it needs to look at the routing information carried in the data first. If the routing information can be found in the routing table, the corresponding If configured, the routing is performed according to the routing table configuration; otherwise, the data is sent to the co-sited IAB-DU through the internal interface.

Therefore, after IAB-MT receives DL data from the parent node, it needs to look at the routing information carried in the data. If the routing information can find the corresponding configuration in the routing table, it will route according to the routing table configuration; otherwise, it will This data is sent to the co-sited IAB-DU via the internal interface.

It is worth noting that the above method is applied to the IAB node, that is, the IAB node knows the load situation of the adjacent IAB node. Optionally, the above method can also be applied to the Donor-DU, that is, the Donor-DU knows the load condition of the adjacent IAB node, so that the Donor-DU can select an appropriate next-hop node for rerouting.

Solution 2: Communication between peer IAB nodes through the sidelink interface

In this solution, the peer IAB nodes communicate through the sidelink interface, which means that the MT of one IAB node communicates with the MT of another IAB node through the sidelink interface, or the DU of one IAB node communicates with the DU of another IAB node Communicate through the sidelink interface. As shown in Fig. 22, the communication between peers IAB1 and IAB2 can be realized through communication between IAB1-MT and IAB1-MT, or through communication between IAB1-DU and IAB2-DU.

This solution is described by taking DL transmission as an example. The above-mentioned solution is also applicable to the scenario of UL transmission, so details will not be repeated here. In addition, in this solution, the communication between the IAB-MT and the IAB-MT through the sidelink interface is taken as an example for illustration, and this solution is also applicable to the scenario where the IAB-DU and the IAB-DU communicate through the sidelink interface.

Taking downlink data transmission as an example, if RLF occurs on the link between IAB2-DU and IAB4-MT, IAB2 can also send the DL data of UE1 to IAB6 through other candidate paths, and IAB6 will further send it to UE1. Wherein, one candidate path is: IAB2-MT->IAB1-MT->IAB1-DU->IAB3-MT->IAB3-DU->IAB6-MT. That is: IAB2 and IAB1 communicate through the sidelink interface.

The specific DL data transmission protocol stack is shown in Figure 23:

The upper half of Fig. 23 is the protocol stack of IAB2 routing DL data through IAB4 before RLF occurs on the link between IAB2 and IAB4.

The lower half of Figure 23 is the protocol stack of IAB2 routing DL data through IAB1 after RLF occurs on the link between IAB2 and IAB4, that is, a peer-to-peer sidelink interface protocol layer is added between IAB2-MT and IAB1-MT, where SL PDCP is optional.

Once IAB2 communicates with IAB1 through the sidelink interface, the following key technologies need to be resolved.

Key technology 1: In order to ensure the normal routing of data, how do the IAB nodes at both ends of the sidelink interface know the BAP address information of the other party?

Method 1: Two IAB-MTs can obtain the BAP address information of the peer end through a discovery process.

That is to say, two IAB-MTs can learn the BAP address information of the opposite end through sidelink interface messages. As an implementation manner, the sidelink interface message may be a discover message, or an RRC establishment-related message (such as an RRC establishment message, an RRC establishment request message, or an RRC establishment completion message) and the like.

Method 2: After the Donor-CU learns that the sidelink interface is established between IAB1 and IAB2, it notifies the BAP address of the opposite end through the RRC message or the F1AP message respectively.

That is, the IAB node receives the BAP address information of the peer end from the Donor-CU through the RRC message or the F1AP message.

Since the BAP address of the IAB node is uniformly allocated by the Donor-CU, once the Donor-CU learns that the sidelink interface is established between IAB1 and IAB2, it can notify IAB1 of the BAP address of IAB1 and IAB1 of the BAP address of IAB2.

It should be noted that the BAP address is at the IAB node granularity, and the IAB-MT and IAB-DU in an IAB node share the same BAP address.

It is worth noting that the above method is also applicable between donor-DU and IAB node. That is: the communication between the donor-DU and the IAB node through the sidelink interface.

Key technology 2: In order to ensure the normal routing of data, how to configure the routing information of the sidelink link of IAB-MT?

After the sidelink interface is established between the IAB1-MT and the IAB2-MT, mutual routing information is exchanged through the sidelink interface (for example: RRC messages of the sidelink interface).

Specifically, following the existing R16 IAB mechanism, Donor-CU will configure a routing table for each IAB node in the network, namely: Routing ID<->BAP address of the next-hop node, where Routing ID is determined by the BAP address of the target node +Path identification path id composition. By configuring the routing table, each IAB node can know which target node can be reached through which next-hop node.

Once the sidelink interface is established between IAB1-MT and IAB2-MT, IAB1-MT and IAB2-MT exchange their respective routing information through the sidelink interface. For example: IAB1-MT sends the BAP address of the target node to IAB2-MT, and the BAP address of the target node includes the BAP address of IAB6. After IAB2-MT receives it, it can know that IAB6 can be reached through IAB1, and saves the corresponding relationship between the BAP address of the next-hop node IAB1 and the BAP address of the target node IAB6. That is to say, the IAB node can send the BAP address list information (including one or more BAP addresses of the target nodes) of the target nodes reachable by the IAB node to the corresponding IAB node through the sidelink interface.

Optionally, in order to help IAB2 to select the best candidate path, IAB1-MT may also send information about the shortest hops to the target node to IAB2-MT. That is to say, the IAB node can send the following information to the corresponding IAB node through the sidelink interface, including: the BAP address of the target node reachable by the IAB node, and the information on the shortest hops to the target node.

It is worth noting that the above method is also applicable between donor-DU and IAB node. That is: the communication between the donor-DU and the IAB node through the sidelink interface.

Key technology 3: How to configure the bearer mapping of the sidelink link of IAB-MT in order to realize the QoS guarantee of data transmission?

Take downlink data transmission as an example. After the sidelink interface is established between IAB1-MT and IAB2-MT, after IAB2 receives the DL data packet from Donor-DU2 through the BH RLC CH, it needs to send it to IAB1 through the sidelink interface according to the determined route. In order to realize the QoS guarantee of the DL data transmission, the DL data packet needs to be mapped to the corresponding DRB or BH RLC CH on the sidelink interface for transmission.

Specifically, the Donor-CU sends the mapping relationship between the ingress BH RLC CH and the egress sidelink DRB/RLC CH to the IAB2.

That is, the Donor-CU sends the mapping relationship between the BH RLC CH on the Uu interface and the DRB or RLC CH on the sidelink interface to the IAB node.

Key technology 4: How does the Donor-CU know that the IAB node supports the sidelink interface? Is it necessary to configure the routing and bearer mapping of the sidelink interface for the IAB node?

The IAB node may send indication information to the Donor-CU, where the indication information is used to indicate that the IAB node supports the sidelink interface. The Donor-CU sends an indication message to the IAB node according to the indication information of the IAB node, and the indication information is used to instruct the IAB node to enable (enable) or disable (disable) the sidelink interface/transmission function.

It is worth noting that the above method is also applicable to the donor-DU, that is: the donor-DU reports to the donor-CU whether it supports the capability of the sidelink interface, and receives indication information from the donor-CU whether to enable the sidelink interface of the donor-DU .

The above embodiments mainly solve how the IAB node selects an appropriate path for data/signaling rerouting, so that the IAB node can select the optimal path for rerouting in the scenario of multiple candidate paths, ensuring the QoS requirements for data/signaling transmission.

Embodiment two

The second embodiment corresponds to the above-mentioned embodiment corresponding to FIG. 5 , and is used to implement local transfer between nodes.

Referring to Figure 24, in an IAB mesh networking scenario, UE1 and UE2 can transmit data through a local switch. Taking UE1 accessing IAB6 and UE2 accessing IAB7 as an example, UE1 and UE2 perform data transmission through a local switch. What is more important is that the data communicated between UE1 and UE2 is directly implemented through the communication between IAB6 and IAB7, without forwarding through Donor-CU or core network UPF.

The local switch process in the IAB mesh networking scenario is shown in Figure 25, including the following steps:

Step 2501, UE1 sends a UL data packet to IAB6, and the UL data packet carries the application layer identifier of UE2.

Wherein, the application layer refers to the IP layer and layers above the IP layer.

This UL data packet needs to be sent to UE2.

For example, after the application layer of UE1 generates a data packet to be sent to UE2, and sends the data packet to the access stratum (AS) of UE1 (that is, SDAP layer, PDCP layer, RLC layer, MAC layer, PHY layer ), sent by the AS layer of UE1 to IAB6 through the air interface. The data packet carries the application layer identifier of UE2.

Optionally, the application layer identifier of the UE2 may be carried in the MAC layer header field or the RLC layer header field.

It should be noted that UE1 can perceive the application layer identifier of UE2, but not the AS layer identifier of UE2.

Step 2502, IAB6 sends an RRC message or F1AP message to the Donor-CU, and the message carries at least one of the following information: AS layer identifier of UE1, application layer identifier of UE2, and QoS information corresponding to the data.

Wherein, the QoS information corresponding to the data may be, for example, a DRB ID of UE1, or a QoS Flow ID (QoS Flow ID, QFI). The AS layer identifier of UE1 is the identifier of the cell accessed by UE1 (such as the physical cell identifier (Physical cell Identifier, PCI)) + the unique identifier of UE1 in the access cell (such as the Cell Radio Network Temporary Identifier (Cell Radio Network Temporary Identifier, C -RNTI)), or composed of a cell global identification (Cell Global Identification, CGI) + the unique identification of UE1 in the access cell (such as C-RNTI).

Step 2503, the Donor-CU obtains the AS layer identity of UE2 according to the application layer identity of UE2, and obtains the access node identity of UE2 (for example: the BAP address of IAB7), and obtains the corresponding DRB ID of UE2 according to the QoS information corresponding to the data . Then send an RRC message or F1AP message to IAB6, the message carrying at least one of the following information: UE2's AS layer identifier, IAB7's BAP address, UE2's DRB ID, and enable local switch indication information.

Optionally, the Donor-CU sends the indication information of enable local switch to the access IAB node, the indication information has a corresponding relationship with the DRB ID (the DRB indicated by the DRB ID is used to transmit the data of UE1), and the indication information is used to indicate Start the local switch operation for the data transmitted on the DRB. For example: after receiving the instruction of enable local switch, IAB6 can know that the data packet needs to perform local switch operation, so when it receives UL data from UE1 through the same DRB, it will perform local switch operation.

Optionally, the Donor-CU also sends at least one of the following information to the access IAB node: UE2's AS layer identifier, UE2's access node BAP address information, and the DRB identifier corresponding to the data packet transmitted on the UE2 air interface. The realization of this step has a prerequisite, that is, the application layer identifier of the UE and the AS layer identifier of the UE (for example: physical cell identifier (Physical cell Identifier, PCI) or cell global identification (Cell Global Identification, CGI) need to be saved on the Donor-CU. )+Cell Radio Network Temporary Identifier (C-RNTI)) mapping relationship. For example, after the UE randomly accesses the network, the Donor-CU can learn and save the application layer identifier of the UE and the AS layer of the UE when the UE initiates a service or when the UE establishes a protocol data unit (protocol data unit, PDU) session logo.

Step 2504, IAB6 sends UL data to IAB7 according to the BAP address of IAB7, and the UL data packet carries the AS layer identifier of UE2 and the DRB ID of UE2.

For example: IAB6 determines to route the UL data locally according to the instruction information of the enable local switch, that is, the UL data is routed to the IAB7, and the IAB7 further sends it to the UE2. After IAB7 receives the UL data packet from IAB6, in order to let IAB7 know which UE the UL data packet is sent to and which DRB is used to send it to the UE, therefore, when IAB6 sends the UL data packet to IAB7, IAB6 carries in the BAP layer The AS layer identifier of UE2 and the DRB ID of UE2, wherein the DRB ID of UE2 refers to the DRB identifier corresponding to the transmission of the data packet between UE2 and IAB7. That is to say, the access IAB node of UE1 sends at least one of the following information to the access IAB node of UE2: the AS layer identifier of UE2, and the DRB identifier corresponding to the data packet transmitted on the air interface of UE2. Optionally, the information can be sent in the BAP layer.

In step 2505, the IAB7 sends a UL data packet to UE2 according to the AS layer identifier of UE2 and the DRB ID of UE2.

Based on this solution, the UE sends the application layer identifier of the communication peer UE to the access IAB node. Optionally, the application layer identifier of the communication peer UE may be carried in the MAC layer header field or the RLC layer header field. The access IAB node sends at least one of the following information to the Donor-CU: the AS layer identifier of the local UE, the application layer identifier of the peer UE, and QoS information corresponding to the data. Wherein, the AS layer identifier of the local UE is composed of the cell identifier PCI or CGI accessed by the local UE + the unique identifier C-RNTI of the local UE in the access cell. The QoS information corresponding to the data is the air interface DRB identifier mapped to the data transmission or the QFI corresponding to the data. The Donor-CU sends the indication information of enable local switch to the access IAB node, the indication information corresponds to the DRB corresponding to the data sent by the local UE, and is used to instruct the data transmitted on the DRB to start the local switch operation. Optionally, the Donor-CU also sends at least one of the following information to the access IAB node: the AS layer identifier of the peer UE, the BAP address information of the peer UE's access node, and the data packet corresponding to the air interface transmission of the peer UE. DRB identifier. The access IAB node carries the following information at the BAP layer: the AS layer identifier of the peer UE, and the corresponding DRB identifier for the data packet transmitted on the air interface of the peer UE.

This embodiment mainly solves the local switch in the IAB mesh scenario, reduces the time delay of data transmission, and ensures normal data transmission between two communicating UEs.

Referring to FIG. 26 , it is a schematic diagram of a communication device provided by an embodiment of the present application. The communication device is used to implement the steps corresponding to the first node or the access network node in the above embodiments. As shown in FIG. 26 , the communication device 2600 includes a sending unit 2610 , a receiving unit 2620 and a processing unit 2630 .

In the first embodiment, the communication device is used to implement the steps corresponding to the first node in the above embodiments:

The receiving unit 2620 is configured to acquire first information, where the first information includes at least one of the following: load information of at least one next-hop node of the first node, interference information of the at least one next-hop node, the The channel quality between the first node and the at least one next-hop node, and the link hop number information for the first node to reach the target node through the at least one next-hop node; the processing unit 2630 is configured to, according to the The first information is used to determine to transmit the data packet through the second node, wherein the at least one next-hop node includes the second node.

In a possible implementation method, the receiving unit 2620 is further configured to receive load information of the at least one next-hop node and/or interference information of the at least one next-hop node from the access network node or, receiving the load information of the first next hop node from the first next hop node and/or the interference information of the first next hop node, the first next hop node being the at least Any node in a next-hop node.

In a possible implementation method, the receiving unit 2620 is further configured to receive the channel quality between the first node and the at least one next-hop node from an access network node; or, the processing The unit 2630 is further configured to determine the channel quality between the first node and the at least one next-hop node by itself.

In a possible implementation method, the receiving unit 2620 is further configured to receive the link hop information from the access network node, where the link hop information is associated with the routing identifier and the next corresponding to the identification information of the hop node, and the route identification includes the identification information of the target node and the path identification.

In a possible implementation method, the receiving unit 2620 is further configured to receive the link hop count information from the access network node, where the link hop count information indicated by the link hop count information is the The minimum number of link hops for the first node to reach the target node through the next-hop node, and the link hop number information corresponds to the identification information of the next-hop node and the identification information of the target node.

In a possible implementation method, the receiving unit 2620 is further configured to receive identification information of the first next-hop node from a first next-hop node, where the first next-hop node is the Any node in at least one next-hop node.

In a possible implementation method, the receiving unit 2620 is configured to receive the identification information of the first next-hop node from the first next-hop node, specifically including: communicating with the first node through the first next-hop node The sidelink between the first next-hop nodes receives identification information of the first next-hop node from the first next-hop nodes.

In a possible implementation method, the receiving unit 2620 is further configured to receive, from the first next-hop node, identification information of a target node reachable by the first next-hop node.

In a possible implementation method, the receiving unit 2620 is further configured to receive from the first next-hop node the minimum link hop from the first next-hop node to the reachable target node number information.

In a possible implementation method, the receiving unit 2620 is further configured to receive first indication information from an access network node, where the first indication information instructs the first node to receive the first A mapping relationship between a bearer and a second bearer for sending the data packet by the first node, the first bearer is a backhaul radio link control channel, and the second bearer is a link between the first node and the A radio bearer or radio link control channel on the sidelink between at least one next-hop node.

In a possible implementation method, the sending unit 2610 is configured to send second indication information to the access network node, where the second indication information indicates that the first node supports the sidelink.

In a possible implementation method, the receiving unit 2620 is further configured to receive third indication information from the access network node, where the third indication information indicates enabling the sidelink of the first node road.

In a possible implementation method, both the first node and the second node are IAB nodes, and the target node is an IAB host node or an access IAB node; or, the first node is an IAB host node , the second node is an IAB node, and the target node is an access IAB node.

In the second embodiment, the communication device is used to implement the steps corresponding to the first node in the above embodiments:

The receiving unit 2620 is configured to receive second indication information from the access network node, the second indication information indicating enabling the side link of the first node; the processing unit 2630 is configured to, according to the second indication information to enable the sidelink of the first node.

In a possible implementation method, the sending unit 2610 is configured to send the first indication information to the access network node before the receiving unit 2620 receives the second indication information from the access network node, the The first indication information indicates that the first node supports the side link.

In a possible implementation method, the first node is an IAB node, and the access network node is an IAB host node.

In the third embodiment, the communication device is used to implement the steps corresponding to the first node in the above embodiments:

The receiving unit 2620 is configured to receive indication information from an access network node, where the indication information indicates a first bearer used for the first node to receive the data packet and a second bearer used for the first node to send the data packet The mapping relationship between the first bearer is the backhaul radio link control channel, and the second bearer is on the sidelink link between the first node and the next hop node of the first node The radio bearer or the radio link control channel; the processing unit 2630 is configured to send the data packet received from the first bearer to the next hop through the second bearer according to the indication information node.

In the fourth embodiment, the communication device is used to implement the steps corresponding to the first node in the above embodiments:

The receiving unit 2620 is configured to receive identification information of a second node from an access network node, the first node is a node accessed by the first user equipment UE, and the second node is a node accessed by the second UE; A sending unit 2610, configured to send a first data packet to the second UE through the second node, the first data packet carries first information and second information, and the first information includes information from the first UE data or signaling, the second information includes one or more of the following: the access stratum identifier of the second UE, the identifier information of the first transmission channel, and the first transmission channel is the second A channel for transmitting the first information between the UE and the second node.

In a possible implementation method, the sending unit 2610 is specifically configured to: send the first data packet to the second node, and the second node is configured to send the first data packet to the the second UE; or, sending the first data packet to a third node, where the third node is configured to send the first data packet to the second UE through the second node, the first The third node is an intermediate node between the first node and the second node.

In a possible implementation method, the receiving unit 2620 is further configured to receive the second data from the first UE through the second transmission channel before receiving the identification information of the second node from the access network node packet, the second data packet carries the first information and the application layer identifier of the second UE, and the second transmission channel is used to transmit the first Information channel; the processing unit 2630 is configured to acquire the access layer identifier of the second UE according to the application layer identifier of the second UE.

In a possible implementation method, the processing unit 2630 is specifically configured to: send the application layer identifier of the second UE to the access network node through the sending unit 2610; receive the application layer identifier of the second UE through the receiving unit 2620 An access stratum identifier of the second UE from the access network node.

In a possible implementation method, the application layer identifier of the second UE is carried in a medium access control MAC layer header field or a radio link control RLC layer header field of the second data packet.

In a possible implementation method, the receiving unit 2620 is further configured to receive identification information of the first transmission channel from the access network node.

In a possible implementation method, the second information is carried in the Backhaul Adaptation Protocol BAP layer header field of the first data packet.

In a possible implementation method, the receiving unit 2620 is further configured to receive first indication information from the access network node, where the first indication information instructs the first node to enable the local transfer function.

In a possible implementation method, the sending unit 2610 is further configured to send a second indication to the access network node before the receiving unit 2620 receives the first indication information from the access network node information, the second indication information indicates that the first node supports the local transfer function.

In a possible implementation method, both the first node and the second node are IAB nodes, and the access network node is an IAB host node.

In the fifth embodiment, the communication device is used to implement each step corresponding to the access network node in each of the above embodiments:

The receiving unit 2620 is configured to receive the application layer identifier of the second UE from the first node, the first node is a node accessed by the first UE; the processing unit 2630 is configured to , to determine the access stratum identifier of the second UE; a sending unit 2610, configured to send the access stratum identifier of the second UE and the identifier information of the second node to the first node, wherein the second The node is a node accessed by the second UE.

In a possible implementation method, the sending unit 2610 is further configured to send identification information of a first transmission channel to the first node, where the first transmission channel is the connection between the second UE and the A channel for transmitting data packets from the first UE between the second nodes.

In a possible implementation method, the sending unit 2610 is further configured to send first indication information to the first node, where the first indication information instructs the first node to enable the local transfer function.

In a possible implementation method, the receiving unit 2620 is further configured to receive a second indication from the first node before the sending unit 2610 sends the first indication information to the first node information, the second indication information indicates that the first node supports the local transfer function.

In a possible implementation method, both the first node and the second node are IAB nodes.

Optionally, the above-mentioned communication device may also include a storage unit, which is used to store data or instructions (also referred to as codes or programs), and each of the above-mentioned units may interact or be coupled with the storage unit to implement corresponding methods or functions . For example, the processing unit 2630 may read data or instructions in the storage unit, so that the communication device implements the methods in the foregoing embodiments.

It should be understood that the above division of units in the communication device is only a division of logical functions, and may be fully or partially integrated into a physical entity or physically separated during actual implementation. In addition, the units in the communication device can be implemented in the form of software calling through the processing elements; they can also be implemented in the form of hardware; some units can also be implemented in the form of software calling through the processing elements, and some units can be implemented in the form of hardware. For example, each unit can be an independently established processing element, or can be integrated into a certain chip of the communication device. In addition, it can also be stored in the memory in the form of a program, which is called and executed by a certain processing element of the communication device. function of the unit. In addition, all or part of these units can be integrated together, or implemented independently. The processing element mentioned here may also be a processor, which may be an integrated circuit with signal processing capabilities. In the process of implementation, each step of the above method or each unit above may be implemented by an integrated logic circuit of hardware in the processor element or implemented in the form of software called by the processing element.

In one example, the units in any of the above communication devices may be one or more integrated circuits configured to implement the above method, for example: one or more specific integrated circuits (application specific integrated circuit, ASIC), or, one or multiple microprocessors (digital signal processor, DSP), or, one or more field programmable gate arrays (field programmable gate array, FPGA), or a combination of at least two of these integrated circuit forms. For another example, when the units in the communication device can be implemented in the form of a processing element scheduler, the processing element can be a general processor, such as a central processing unit (central processing unit, CPU) or other processors that can call programs. For another example, these units can be integrated together and implemented in the form of a system-on-a-chip (SOC).

Referring to FIG. 27 , it is a schematic diagram of a communication device provided by an embodiment of the present application, which is used to implement the operations of the first node or the access network node in the above embodiments. As shown in FIG. 27 , the communication device includes: a processor 2710 and an interface 2730 , and optionally, the communication device further includes a memory 2720 . The interface 2730 is used to communicate with other devices.

The method performed by the first node or the access network node in the above embodiments may be implemented by calling the program stored in the memory (which may be the memory 2720 in the first node or the access network node, or an external memory) by the processor 2710 . That is, the first node or the access network node may include a processor 2710, and the processor 2710 executes the method performed by the first node or the access network node in the above method embodiments by invoking a program in the memory. The processor here may be an integrated circuit with signal processing capabilities, such as a CPU. The first node or access network node may be realized by one or more integrated circuits configured to implement the above method. For example: one or more ASICs, or one or more microprocessors DSP, or one or more FPGAs, etc., or a combination of at least two of these integrated circuit forms. Alternatively, the above implementation manners may be combined.

Specifically, the functions/implementation process of the sending unit 2610, the receiving unit 2620, and the processing unit 2630 in FIG. 26 can be implemented by the processor 2710 in the communication device 2700 shown in FIG. . Or, the function/implementation process of the processing unit 2630 in FIG. 26 can be realized by the processor 2710 in the communication device 2700 shown in FIG. The function/implementation process of the unit 2620 can be realized through the interface 2730 in the communication device 2700 shown in FIG. The instructions are implemented in the driver interface 2730 .

Those of ordinary skill in the art can understand that: the first, second and other numbers involved in this application are only for the convenience of description, and are not used to limit the scope of the embodiments of the application, and also indicate the sequence. "And/or" describes the association relationship of associated objects, indicating that there may be three types of relationships, for example, A and/or B may indicate: A exists alone, A and B exist simultaneously, and B exists independently. The character "/" generally indicates that the contextual objects are an "or" relationship. "At least one" means one or more. At least two means two or more. "At least one", "any one" or similar expressions refer to any combination of these items, including any combination of single item(s) or plural item(s). For example, at least one item (one, species) of a, b, or c can represent: a, b, c, a-b, a-c, b-c, or a-b-c, where a, b, c can be single or Multiple. "Multiple" refers to two or more than two, and other quantifiers are similar.

It should be understood that in various embodiments of the present application, the sequence numbers of the above-mentioned processes do not mean the order of execution, and the order of execution of the processes should be determined by their functions and internal logic, rather than by the embodiments of the present invention. The implementation process constitutes any limitation.

Those skilled in the art can clearly understand that for the convenience and brevity of the description, the specific working process of the above-described system, device and unit can refer to the corresponding process in the foregoing method embodiment, which will not be repeated here.

In the above embodiments, all or part of them may be implemented by software, hardware, firmware or any combination thereof. When implemented using software, it may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on the computer, the processes or functions according to the embodiments of the present application will be generated in whole or in part. The computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website, computer, server or data center Transmission to another website site, computer, server, or data center by wired (eg, coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (eg, infrared, wireless, microwave, etc.). The computer-readable storage medium may be any available medium that can be accessed by a computer, or a data storage device including a server, a data center, and the like integrated with one or more available media. The available medium may be a magnetic medium (such as a floppy disk, a hard disk, or a magnetic tape), an optical medium (such as a DVD), or a semiconductor medium (such as a solid state disk (solid state disk, SSD)) and the like.

The various illustrative logic units and circuits described in the embodiments of the present application can be implemented by a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, Discrete gate or transistor logic, discrete hardware components, or any combination of the above designed to implement or operate the described functions. The general-purpose processor may be a microprocessor, and optionally, the general-purpose processor may also be any conventional processor, controller, microcontroller or state machine. A processor may also be implemented by a combination of computing devices, such as a digital signal processor and a microprocessor, multiple microprocessors, one or more microprocessors combined with a digital signal processor core, or any other similar configuration to accomplish.

The steps of the method or algorithm described in the embodiments of the present application may be directly embedded in hardware, a software unit executed by a processor, or a combination of both. The software unit can be stored in random access memory (Random Access Memory, RAM), flash memory, read-only memory (Read-Only Memory, ROM), EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM or this In any other form of storage media in the field. Exemplarily, the storage medium can be connected to the processor, so that the processor can read information from the storage medium, and can write information to the storage medium. Optionally, the storage medium can also be integrated into the processor. The processor and storage medium can be provided in an ASIC.

These computer program instructions can also be loaded onto a computer or other programmable data processing device, causing a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby The instructions provide steps for implementing the functions specified in the flow chart or blocks of the flowchart and/or the block or blocks of the block diagrams.

In one or more exemplary designs, the above functions described in this application may be implemented in hardware, software, firmware or any combination of the three. If implemented in software, the functions can be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes computer storage media and communication media that facilitate transfer of a computer program from one place to another. Storage media may be any available media that can be accessed by a general purpose or special computer. For example, such computer-readable media may include, but are not limited to, RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other device that can be used to carry or store instructions or data structures and Other medium of program code in a form readable by a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. Also, any connection is properly defined as a computer-readable medium, for example, if the software is transmitted from a web site, server, or other remote source via a coaxial cable, fiber optic computer, twisted pair, digital subscriber line (DSL) Or transmitted by wireless means such as infrared, wireless and microwave are also included in the definition of computer readable media. The disk (disk) and disk (disc) include compact disk, laser disk, optical disk, digital versatile disk (English: Digital Versatile Disc, referred to as: DVD), floppy disk and Blu-ray disc. Disks usually reproduce data magnetically, while Data is optically reproduced on discs, usually with lasers. Combinations of the above can also be contained on a computer readable medium.

Those skilled in the art should be aware that, in the above one or more examples, the functions described in this application may be implemented by hardware, software, firmware or any combination thereof. When implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.

The specific implementation described above has further described the purpose, technical solutions and beneficial effects of the application in detail. It should be understood that the above description is only a specific implementation of the application, and is not intended to limit the scope of the application. Scope of protection: All modifications, equivalent replacements, improvements, etc. made on the basis of the technical solutions of this application shall be included within the scope of protection of this application. The above description of the specification of this application can make any technology in the art can use or realize the content of this application, and any modification based on the disclosed content should be considered obvious in the field, and the basic principles described in this application can be applied to other modifications without departing from the spirit and scope of the invention of this application. Thus, the disclosure of this application is not intended to be limited to the described embodiments and designs, but extends to the widest scope consistent with the principles of this application and the novel features disclosed.

Although the application has been described in conjunction with specific features and embodiments thereof, it will be apparent that various modifications and combinations can be made thereto without departing from the spirit and scope of the application. Accordingly, the specification and drawings are merely illustrative of the application as defined by the appended claims and are deemed to cover any and all modifications, variations, combinations or equivalents within the scope of this application. Apparently, those skilled in the art can make various changes and modifications to the present application without departing from the scope of the present application. In this way, if these modifications and variations of the application fall within the scope of the claims of the application and their equivalent technologies, the application also intends to include these modifications and variations.

Claims (71)

1. A method of wireless communication, comprising:

   the first node obtains first information, the first information comprising at least one of: load information of at least one next-hop node of the first node, interference information of the at least one next-hop node, channel quality between the first node and the at least one next-hop node, and link hop count information of the first node reaching a target node through the at least one next-hop node;

   And the first node determines to transmit the data packet through a second node according to the first information, wherein the at least one next-hop node comprises the second node.
2. The method as recited in claim 1, further comprising:

   the first node receives load information of the at least one next-hop node and/or interference information of the at least one next-hop node from an access network node; or,

   the first node receives load information of a first next-hop node from the first next-hop node and/or interference information of the first next-hop node, wherein the first next-hop node is any one node in the at least one next-hop node.
3. The method of claim 1 or 2, further comprising:

   the first node receiving channel quality between the first node and the at least one next hop node from an access network node; or,

   the first node autonomously determines a channel quality between the first node and the at least one next-hop node.
4. A method as claimed in any one of claims 1 to 3, further comprising:

   The first node receives the link hop count information from an access network node, wherein the link hop count information corresponds to a route identifier and the identification information of the next hop node, and the route identifier comprises the identification information of the target node and a route identifier.
5. A method as claimed in any one of claims 1 to 3, further comprising:

   the first node receives the link hop count information from an access network node, wherein the link hop count indicated by the link hop count information is the minimum link hop count of the first node reaching the target node through the next hop node, and the link hop count information corresponds to the identification information of the next hop node and the identification information of the target node.
6. The method as recited in claim 1, further comprising:

   the first node receives identification information of a first next-hop node from the first next-hop node, wherein the first next-hop node is any one node in the at least one next-hop node.
7. The method of claim 6, wherein the first node receiving the identification information of the first next-hop node from a first next-hop node comprises:

   The first node receives identification information of the first next-hop node from the first next-hop node through a side downlink between the first node and the first next-hop node.
8. The method of claim 6 or 7, further comprising:

   the first node receives identification information of a target node which can be reached by the first next-hop node from the first next-hop node.
9. The method as recited in claim 8, further comprising:

   the first node receives minimum link hop count information from the first next-hop node of the first next-hop node to reach the reachable target node.
10. The method of any one of claims 6 to 9, further comprising:

    the first node receives first indication information from an access network node, wherein the first indication information indicates that the first node receives a mapping relation between a first bearer of the data packet and a second bearer of the data packet sent by the first node, the first bearer is a backhaul radio link control channel, and the second bearer is a radio bearer or a radio link control channel on a side link between the first node and the at least one next hop node.
11. The method of any one of claims 6 to 10, further comprising:

    the first node sends second indication information to an access network node, the second indication information indicating that the first node supports side uplink.
12. The method as recited in claim 11, further comprising:

    the first node receives third indication information from an access network node, the third indication information indicating that a side uplink of the first node is enabled.
13. The method of any of claims 1 to 12, wherein the first node and the second node are both IAB nodes, and the target node is an IAB host node or an access IAB node; or,

    the first node is an IAB host node, the second node is an IAB node, and the target node is an access IAB node.
14. A method of wireless communication, comprising:

    a first node receives second indication information from an access network node, wherein the second indication information indicates that a side uplink of the first node is enabled;

    the first node enables a side uplink of the first node according to the second indication information.
15. The method of claim 14, wherein prior to the first node receiving the second indication information from the access network node, the method further comprises:

    The first node sends first indication information to the access network node, wherein the first indication information indicates that the first node supports side uplink.
16. The method of claim 14 or 15, wherein the first node is an IAB node and the access network node is an IAB host node.
17. A method of wireless communication, comprising:

    a first node receives indication information from an access network node, wherein the indication information indicates a mapping relation between a first bearer for the first node to receive a data packet and a second bearer for the first node to send the data packet, the first bearer is a backhaul radio link control channel, and the second bearer is a radio bearer or a radio link control channel on a side link between the first node and a next hop node of the first node;

    and the first node sends the data packet received from the first bearer to the next hop node through the second bearer according to the indication information.
18. A method of wireless communication, comprising:

    the method comprises the steps that a first node receives identification information of a second node from an access network node, wherein the first node is a node accessed by first User Equipment (UE), and the second node is a node accessed by second UE;

    The first node sends a first data packet to the second UE through the second node, the first data packet carrying first information and second information, the first information including data or signaling from the first UE, the second information including one or more of: the access layer identification of the second UE and the identification information of a first transmission channel, wherein the first transmission channel is a channel for transmitting the first information between the second UE and the second node.
19. The method of claim 18, wherein the first node sending a first data packet to the second UE through the second node comprises:

    the first node sends the first data packet to the second node, and the second node is used for sending the first data packet to the second UE; or,

    the first node sends the first data packet to a third node, the third node is used for sending the first data packet to the second UE through the second node, and the third node is an intermediate node between the first node and the second node.
20. The method of claim 18 or 19, wherein before the first node receives the identification information from the second node of the access network node, further comprising:

    The first node receives a second data packet from the first UE through a second transmission channel, wherein the second data packet carries the first information and an application layer identifier of the second UE, and the second transmission channel is a channel for transmitting the first information between the first UE and the first node;

    and the first node acquires the access layer identifier of the second UE according to the application layer identifier of the second UE.
21. The method of claim 20, wherein the first node obtaining the access layer identity of the second UE from the application identity of the second UE comprises:

    the first node sends an application layer identification of the second UE to the access network node;

    the first node receives an access stratum identification of the second UE from the access network node.
22. The method of claim 20 or 21, wherein the application layer identification of the second UE is carried in a medium access control, MAC, layer header field or a radio link control, RLC, layer header field of the second data packet.
23. The method of any one of claims 18 to 22, further comprising:

    the first node receives identification information of the first transmission channel from the access network node.
24. A method according to any of claims 18 to 23, wherein the second information is carried in a backhaul adaptation protocol BAP layer header field of the first data packet.
25. The method of any one of claims 18 to 24, further comprising:

    the first node receives first indication information from the access network node, wherein the first indication information indicates that the first node enables a local transfer function.
26. The method of claim 25, wherein prior to the first node receiving the first indication information from the access network node, further comprising:

    the first node sends second indication information to the access network node, wherein the second indication information indicates that the first node supports a local transfer function.
27. The method of any of claims 18 to 26, wherein the first node and the second node are both IAB nodes and the access network node is an IAB hosting node.
28. A method of wireless communication, comprising:

    the access network node receives an application layer identification of a second UE from a first node, wherein the first node is a node to which the first UE is accessed;

    the access network node determines the access layer identification of the second UE according to the application layer identification of the second UE;

    And the access network node sends the access layer identification of the second UE and the identification information of a second node to the first node, wherein the second node is the node accessed by the second UE.
29. The method as recited in claim 28, further comprising:

    the access network node transmits identification information of a first transmission channel to the first node, wherein the first transmission channel is a channel for transmitting data packets from the first UE between the second UE and the second node.
30. The method of claim 28 or 29, further comprising:

    the access network node transmits first indication information to the first node, wherein the first indication information indicates that the first node enables a local transfer function.
31. The method of claim 30, wherein before the access network node sends the first indication information to the first node, further comprising:

    the access network node receives second indication information from the first node, wherein the second indication information indicates that the first node supports a local transfer function.
32. The method of any of claims 28 to 31, wherein the first node and the second node are both IAB nodes and the access network node is an IAB hosting node.
33. A communication device, comprising:

    a receiving unit, configured to obtain first information, where the first information includes at least one of: load information of at least one next-hop node of a first node, interference information of the at least one next-hop node, channel quality between the first node and the at least one next-hop node, and link hop count information of the first node reaching a target node through the at least one next-hop node;

    and the processing unit is used for determining to transmit the data packet through a second node according to the first information, wherein the at least one next-hop node comprises the second node.
34. The apparatus of claim 33, wherein the receiving unit is further for:

    receiving load information of the at least one next-hop node and/or interference information of the at least one next-hop node from an access network node; or,

    and receiving load information of a first next-hop node and/or interference information of the first next-hop node from the first next-hop node, wherein the first next-hop node is any one node in the at least one next-hop node.
35. The apparatus of claim 33 or 34, wherein the receiving unit is further configured to receive a channel quality between the first node and the at least one next hop node from an access network node; or,

    the processing unit is further configured to determine a channel quality between the first node and the at least one next-hop node by itself.
36. The apparatus according to any of claims 33 to 35, wherein the receiving unit is further configured to receive the link hop count information from an access network node, where the link hop count information corresponds to a route identification and identification information of the next hop node, the route identification including identification information of the target node and a path identification.
37. The apparatus according to any one of claims 33 to 35, wherein the receiving unit is further configured to receive the link hop count information from an access network node, where the link hop count indicated by the link hop count information is a minimum link hop count for the first node to reach the target node through the next hop node, and the link hop count information corresponds to identification information of the next hop node and identification information of the target node.
38. The apparatus of claim 33, wherein the receiving unit is further configured to receive identification information of a first next-hop node from the first next-hop node, the first next-hop node being any one of the at least one next-hop node.
39. The apparatus of claim 38, wherein the receiving means for receiving the identification information of the first next-hop node from the first next-hop node specifically comprises:

    for receiving identification information of the first next-hop node from the first next-hop node over a side-downlink between the first node and the first next-hop node.
40. The apparatus according to claim 38 or 39, wherein the receiving unit is further configured to receive identification information of a target node that can be reached by the first next-hop node from the first next-hop node.
41. The apparatus of claim 40, wherein the receiving unit is further configured to receive minimum link hop count information for the first next-hop node from the first next-hop node to reach the reachable target node.
42. The apparatus of any one of claims 38 to 41, wherein the receiving unit is further configured to receive first indication information from an access network node, the first indication information indicating a mapping relationship between a first bearer of the data packet received by the first node and a second bearer of the data packet transmitted by the first node, the first bearer being a backhaul radio link control channel, and the second bearer being a radio bearer or a radio link control channel on a side link between the first node and the at least one next-hop node.
43. The apparatus according to any of claims 38 to 42, wherein the apparatus further comprises a sending unit configured to send second indication information to an access network node, the second indication information indicating that the first node supports side-uplink.
44. The apparatus of claim 43, wherein the receiving unit is further configured to receive third indication information from the access network node, the third indication information indicating that side-links of the first node are enabled.
45. The apparatus of any one of claims 33 to 44, wherein the first node and the second node are both IAB nodes, and the target node is an IAB host node or an access IAB node; or,

    The first node is an IAB host node, the second node is an IAB node, and the target node is an access IAB node.
46. A communication device, comprising:

    a receiving unit, configured to receive second indication information from an access network node, where the second indication information indicates that a side uplink of the first node is enabled;

    and the processing unit is used for enabling the side uplink of the first node according to the second indication information.
47. The apparatus of claim 46, further comprising a transmitting unit configured to transmit first indication information to the access network node before the receiving unit receives second indication information from the access network node, the first indication information indicating that the first node supports side-uplink.
48. The apparatus of claim 46 or 47, wherein the first node is an IAB node and the access network node is an IAB-hosting node.
49. A communication device, comprising:

    a receiving unit, configured to receive indication information from an access network node, where the indication information indicates a mapping relationship between a first bearer for a first node to receive a data packet and a second bearer for the first node to send the data packet, where the first bearer is a backhaul radio link control channel, and the second bearer is a radio bearer or a radio link control channel on a side link between the first node and a next hop node of the first node;

    And the processing unit is used for sending the data packet received from the first bearer to the next hop node through the second bearer according to the indication information.
50. A communications apparatus for a first node, comprising:

    the receiving unit is used for receiving identification information of a second node from the access network node, wherein the first node is a node accessed by first User Equipment (UE), and the second node is a node accessed by second UE;

    a sending unit, configured to send, by the second node, a first data packet to the second UE, where the first data packet carries first information and second information, the first information includes data or signaling from the first UE, and the second information includes one or more of the following: the access layer identification of the second UE and the identification information of a first transmission channel, wherein the first transmission channel is a channel for transmitting the first information between the second UE and the second node.
51. The apparatus of claim 50, wherein the transmitting unit is specifically configured to:

    transmitting the first data packet to the second node, wherein the second node is used for transmitting the first data packet to the second UE; or,

    And sending the first data packet to a third node, wherein the third node is used for sending the first data packet to the second UE through the second node, and the third node is an intermediate node between the first node and the second node.
52. The apparatus of claim 50 or 51, wherein the receiving unit is further configured to receive a second data packet from the first UE through a second transmission channel before receiving identification information of a second node from an access network node, the second data packet carrying the first information and an application layer identification of the second UE, the second transmission channel being a channel for transmitting the first information between the first UE and the first node;

    the device also comprises a processing unit, which is used for acquiring the access layer identifier of the second UE according to the application layer identifier of the second UE.
53. The apparatus of claim 52, wherein the processing unit is specifically configured to:

    transmitting an application layer identifier of the second UE to the access network node through the transmitting unit;

    and receiving an access layer identifier of the second UE from the access network node through the receiving unit.
54. The apparatus of claim 52 or 53, wherein an application layer identification of the second UE is carried in a medium access control, MAC, layer header field or a radio link control, RLC, layer header field of the second data packet.
55. The apparatus according to any of claims 50 to 54, wherein the receiving unit is further configured to receive identification information of the first transmission channel from the access network node.
56. The apparatus of any one of claims 50 to 55, wherein the second information is carried in a backhaul adaptation protocol, BAP, layer header field of the first data packet.
57. The apparatus according to any of claims 50 to 56, wherein the receiving unit is further configured to receive first indication information from the access network node, the first indication information indicating that the first node enables a local delivery function.
58. The apparatus of claim 57, wherein the sending unit is further configured to send second indication information to the access network node before the receiving unit receives the first indication information from the access network node, the second indication information indicating that the first node supports a local delivery function.
59. The apparatus of any of claims 50-58, wherein the first node and the second node are both IAB nodes and the access network node is an IAB hosting node.
60. A communication device, comprising:

    the receiving unit is used for receiving an application layer identifier of a second UE from a first node, wherein the first node is a node accessed by the first UE;

    the processing unit is used for determining an access layer identifier of the second UE according to the application layer identifier of the second UE;

    and the sending unit is used for sending the access layer identification of the second UE and the identification information of a second node to the first node, wherein the second node is the node accessed by the second UE.
61. The apparatus of claim 60, wherein the sending unit is further configured to send identification information of a first transmission channel to the first node, wherein the first transmission channel is a channel between the second UE and the second node for transmitting data packets from the first UE.
62. The apparatus of claim 60 or 61, wherein the sending unit is further configured to send first indication information to the first node, the first indication information indicating that the first node enables a local delivery function.
63. The apparatus of claim 62, wherein the receiving unit is further configured to receive second indication information from the first node before the sending unit sends the first indication information to the first node, the second indication information indicating that the first node supports a local delivery function.
64. The apparatus of any one of claims 60 to 63, wherein the first node and the second node are both IAB nodes.
65. A communication device, comprising: a processor coupled to a memory for storing a program or instructions that, when executed by the processor, cause the apparatus to perform the method of any one of claims 1 to 27.
66. A communication device, comprising: a processor coupled to a memory for storing a program or instructions that, when executed by the processor, cause the apparatus to perform the method of any of claims 28 to 32.
67. A communication device for performing the method of any of claims 1 to 27.
68. A communication device for performing the method of any of claims 28 to 32.
69. A communication system comprising a communication device as claimed in any one of claims 50 to 59 and a communication device as claimed in any one of claims 60 to 64.
70. A computer readable storage medium comprising instructions which, when run on a computer, cause the computer to perform the method of any one of claims 1 to 32.
71. A computer program product comprising instructions which, when executed, implement the method of any one of claims 1 to 32.