Bh rlc ch remapping method and apparatus

Abstract

The application discloses a BH RLC CH remapping method and device, the BH RLC CH remapping method comprises the following steps: a first backhaul node receives a first message sent by a second backhaul node, the first message comprises target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, and the target information at least comprises the ID of the BH RLC CH; the first backhaul node determines that a first BH RLC CH in the at least one BH RLC CH needs to be remapped according to the target information; the first backhaul node determines a second BH RLC CH, the second BH RLC CH is a BH RLC CH on the first backhaul link; and the first backhaul node remaps data needing to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission.

Description

Technical Field

[0001] This application belongs to the field of wireless communication technology, specifically relating to a BH RLC CH remapping method and apparatus. Background Technology

[0002] Integrated access and backhaul (IAB) systems are a technology that was first standardized with New Radio (NR) Rel-16. Figure 1 A schematic diagram of the structure of an IAB system is shown. Figure 2 This diagram illustrates a Centralized Unit-Distributed Unit (CU-DU) architecture of an IAB system. An IAB node comprises a Distributed Unit (DU) functional portion and a Mobile Termination (MT) functional portion. Using the MT, an access IAB node can find an upstream IAB node (parent IAB node) and establish a radio connection with its DU. This radio connection is called a backhaul (BH) link. After establishing a complete backhaul link, the IAB node activates its DU function, which provides cell services, i.e., the DU can provide access services to the User Equipment (UE). A backhaul link contains a donor IAB node (or IAB donor), which has a directly connected cable transport network. In a backhaul link, all IAB nodes' DUs are connected to a Centralized Unit (CU) node, which configures the DUs via the F1-AP protocol. The CU configures the MT via the RRC protocol. The Donor IAB node does not have the MT functionality.

[0003] The IAB system was introduced to address the issue of inadequate wired transmission network deployment when access points are densely deployed. In other words, access points can rely on wireless backhaul when a wired transmission network is unavailable.

[0004] The wireless link between IAB nodes is called the backhaul link. The backhaul link is configured with a backhaul radio link control channel (BH RLC CH) for wireless backhaul.

[0005] In related technologies, if a backhaul link fails, another backhaul link can be used to offload the data transmission. This method is also known as re-routing.

[0006] Currently, related technologies allow for data rerouting at the per-BAP routing ID granularity. Please refer to [link / reference]. Figure 3 , Figure 3 This is a schematic diagram of the IAB system's method of rerouting data at the per BAP routing ID level. If there is a problem with the BAP routing ID1 link between IAB node 2 (IAB2) and the downstream IAB node (IAB4), the data transmitted according to BAP routing ID1 can be rerouted to the route of BAP routing ID2.

[0007] The rerouting scheme for BH RLC CH is similar to that of BAP routing ID, which involves transferring (rerouting) data from one backhaul link to another to alleviate data transmission congestion. However, the above rerouting scheme cannot be used in the following situations:

[0008] 1) When the IAB node has only one egress link;

[0009] 2) When there are multiple egress links on an IAB node, but a replacement BAProuting ID cannot be found on other egress links;

[0010] 3) When no alternative BH RLC CH is configured on other egress links of the IAB node.

[0011] Therefore, the normal transmission of BH RLC CH data cannot be guaranteed. Summary of the Invention

[0012] This application provides a BH RLC CH remapping method and apparatus, which can solve the problem that the normal transmission of BH RLC CH data cannot be guaranteed when rerouting data at the per BH RLC CH granularity.

[0013] Firstly, a BH RLC CH remapping method is provided, including:

[0014] The first backhaul node receives a first message sent by the second backhaul node. The first message includes target information of at least one BH RLC CH on the first backhaul link. The first backhaul link is a backhaul link between the first backhaul node and the second backhaul node. The target information includes at least the identity ID of the BH RLC CH.

[0015] The first backhaul node determines, based on the target information, that the first BHRLC CH in the at least one BHRLC CH needs to be remapped;

[0016] The first backhaul node determines the second BH RLC CH, and the second BH RLC CH is the BH RLC CH on the first backhaul link;

[0017] The first backhaul node remaps the data that needs to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission.

[0018] Secondly, a BH RLC CH remapping method is provided, which also includes:

[0019] The second backhaul node sends a first message to the first backhaul node. The first message includes target information of at least one BH RLC CH on the first backhaul link. The first backhaul link is the backhaul link between the first backhaul node and the second backhaul node. The target information includes at least the ID of the BH RLC CH. The first message is used to indicate whether the at least one BH RLC CH needs to be remapped.

[0020] Thirdly, a BH RLC CH remapping device is provided, comprising:

[0021] A first receiving module is configured to receive a first message sent by a second backhaul node. The first message includes target information of at least one BH RLC CH on a first backhaul link. The first backhaul link is a backhaul link between the first backhaul node and the second backhaul node. The target information includes at least the ID of the BH RLC CH.

[0022] The first determining module is used to determine, based on the target information, that the first BHRLC CH in the at least one BHRLC CH needs to be remapped;

[0023] The second determining module is used to determine the second BH RLC CH, wherein the second BH RLC CH is the BH RLC CH on the first backhaul link;

[0024] The remapping module is used to remap the data that needs to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission.

[0025] Fourthly, a BH RLC CH remapping apparatus is provided, comprising:

[0026] A first sending module is configured to send a first message to a first backhaul node. The first message includes target information of at least one BH RLC CH on a first backhaul link. The first backhaul link is a backhaul link between the first backhaul node and the second backhaul node. The target information includes at least the ID of the BH RLC CH. The first message is used to indicate whether the at least one BH RLC CH needs to be remapped.

[0027] Fifthly, a backhaul node is provided, the terminal including a processor, a memory, and a program or instructions stored in the memory and executable on the processor, wherein the program or instructions, when executed by the processor, implement the steps of the method as described in the first or second aspect.

[0028] In a sixth aspect, a backhaul node is provided, including a processor and a communication interface, wherein the communication interface is used to receive a first message sent by a second backhaul node, the first message including target information of at least one BHRLC CH on a first backhaul link, the first backhaul link being a backhaul link between the first backhaul node and the second backhaul node, and the target information including at least the ID of the BHRLC CH; the processor is used to determine, based on the target information, that a first BHRLC CH among the at least one BHRLC CH needs to be remapped; determine a second BHRLC CH, the second BHRLC CH being a BHRLC CH on the first backhaul link; and remap the data to be transmitted through the first BHRLC CH to the second BHRLC CH for transmission.

[0029] In a seventh aspect, a backhaul node is provided, including a processor and a communication interface, wherein the communication interface is used to send a first message to a first backhaul node, the first message including target information of at least one BH RLCCH on a first backhaul link, the first backhaul link being a backhaul link between the first backhaul node and a second backhaul node, the target information including at least the ID of the BH RLCCH, and the first message being used to indicate whether the at least one BH RLCCH needs to be remapped.

[0030] Eighthly, a readable storage medium is provided, on which a program or instructions are stored, which, when executed by a processor, implement the steps of the method described in the first aspect, or implement the steps of the method described in the second aspect.

[0031] In a ninth aspect, a chip is provided, the chip including a processor and a communication interface coupled to the processor, the processor being configured to run programs or instructions to implement the method as described in the first aspect, or to implement the method as described in the second aspect.

[0032] In a tenth aspect, a computer program / program product is provided, the computer program / program product being stored in a non-transient storage medium, the computer program / program product being executed by at least one processor to implement the steps of the method as described in the first aspect, or the program / program product being executed by at least one processor to implement the steps of the method as described in the second aspect.

[0033] In this embodiment of the application, when a BH RLC CH needs to be remapped (e.g., when congestion occurs), the IAB node can remap the data transmitted by the BH RLC CH that needs to be remapped to another BH RLC CH on the same backhaul link for transmission. Even if the IAB node has only one output link (egress link) or multiple egress links but cannot find a replacement BAP routing ID on other egress links or does not have a replacement BH RLC CH configured on other egress links of the IAB node, the normal transmission of BH RLC CH data can be guaranteed. Attached Figure Description

[0034] Figure 1 This is a schematic diagram of the IAB system structure;

[0035] Figure 2 This is a schematic diagram of the CU-DU structure of the IAB system;

[0036] Figure 3 This is a schematic diagram illustrating the IAB system's method of rerouting data at the per-BAP routing ID granularity.

[0037] Figure 4 This is a flowchart illustrating a BH RLC CH remapping method according to an embodiment of this application;

[0038] Figure 5 A schematic diagram of the F1-U protocol stack of the IAB system;

[0039] Figure 6This is a schematic diagram of the flow control message format based on BH RLC CH;

[0040] Figure 7 This is a schematic diagram of the flow control message format based on BAP routing ID.

[0041] Figure 8 This is a schematic diagram illustrating the transmission of flow control messages in the IAB system.

[0042] Figure 9 This is a schematic diagram of the BH RLC CH remapping method according to Embodiment 1 of this application;

[0043] Figure 10 This is a schematic diagram of the BH RLC CH remapping method according to another embodiment of this application;

[0044] Figure 11 This is a schematic diagram of the structure of a BH RLC CH remapping device according to an embodiment of this application;

[0045] Figure 12 This is a schematic diagram of the structure of a BH RLC CH remapping device according to another embodiment of this application;

[0046] Figure 13 This is a schematic diagram of the structure of the return node in an embodiment of this application;

[0047] Figure 14 This is a schematic diagram of the hardware structure of the return node in an embodiment of this application. Detailed Implementation

[0048] The technical solutions of the embodiments of this application will be clearly described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of this application. All other embodiments obtained by those skilled in the art based on the embodiments of this application are within the scope of protection of this application.

[0049] The terms "first," "second," etc., used in the specification and claims of this application are used to distinguish similar objects and not to describe a specific order or sequence. It should be understood that such terms can be used interchangeably where appropriate so that embodiments of this application can be implemented in orders other than those illustrated or described herein, and the objects distinguished by "first" and "second" are generally of the same class, not limited in number; for example, a first object can be one or more. Furthermore, in the specification and claims, "and / or" indicates at least one of the connected objects, and the character " / " generally indicates that the preceding and following objects are in an "or" relationship.

[0050] It is worth noting that the technologies described in this application are not limited to Long Term Evolution (LTE) / LTE-Advanced (LTE-A) systems, but can also be used in other wireless communication systems, such as Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Orthogonal Frequency Division Multiple Access (OFDMA), Single-carrier Frequency-Division Multiple Access (SC-FDMA), and other systems. The terms "system" and "network" in this application are often used interchangeably, and the described technologies can be used with the systems and radio technologies mentioned above, as well as with other systems and radio technologies. The following description describes New Radio (NR) systems for illustrative purposes, and the term NR is used in most of the following description; however, these technologies can also be applied to applications other than NR systems, such as 6th generation (6G) radio systems. th Generation 6G communication system.

[0051] The BH RLC CH remapping method and apparatus provided in this application will be described in detail below with reference to the accompanying drawings and through some embodiments and application scenarios.

[0052] Please refer to Figure 4 This application provides a BH RLC CH remapping method, including:

[0053] Step 41: The first backhaul node receives a first message sent by the second backhaul node. The first message includes target information of at least one BH RLC CH on the first backhaul link. The first backhaul link is the backhaul link between the first backhaul node and the second backhaul node. The target information includes at least the identity document (ID) of the BH RLC CH.

[0054] The first and second backhaul nodes can be IAB nodes and / or IAB-donor-DU nodes. For example, one of the first and second backhaul nodes is an IAB-donor-DU and the other is an IAB node.

[0055] The first backhaul link is configured with at least two BH RLC CHs, and each BH RLC CH has a unique ID to identify it.

[0056] Step 42: The first backhaul node determines, based on the target information, that the first BH RLC CH in the at least one BH RLC CH needs to be remapped;

[0057] Step 43: The first backhaul node determines the second BH RLC CH, which is the BH RLC CH on the first backhaul link;

[0058] Step 44: The first backhaul node remaps the data that needs to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission.

[0059] In this embodiment of the application, when a BH RLC CH needs to be remapped (e.g., when congestion occurs), the IAB node can remap the data transmitted by the BH RLC CH that needs to be remapped to another BH RLC CH on the same backhaul link for transmission. Even if the IAB node has only one output link (egress link) or multiple egress links but cannot find a replacement BAP routing ID on other egress links or does not have a replacement BH RLC CH configured on other egress links of the IAB node, the normal transmission of BH RLC CH data can be guaranteed.

[0060] In this embodiment of the application, optionally, the first message is a flow control (FC) message. Using information from existing flow control messages to determine whether BH RLC CH needs to be remapped requires minimal system modification and has low cost.

[0061] The following is a brief introduction to flow control messages.

[0062] In Rel-16, 3GPP agreed to use flow control mechanisms in IAB networks to address downlink data congestion. Downlink data congestion refers to the accumulation of data received by an IAB node from its parent IAB node before it can be sent to downstream nodes or UEs. When the data accumulation reaches a point where there is a risk of buffer overflow, the IAB node sends a flow control (FC) feedback to its parent IAB node to warn of the congestion. Upon receiving the flow control feedback, the IAB node controls the transmission rate at which it sends downlink data to its child IAB nodes.

[0063] The smallest feedback granularity of flow control information can be based on BH RLC CH or BAP routing ID.

[0064] The Backhaul Adaptation Protocol (BAP) is a newly introduced protocol layer in the IAB system, used for data forwarding, packet routing, flow control, etc. The specific protocol stack is as follows: Figure 5 As shown.

[0065] Please refer to 6 and Figure 7 , Figure 6 This is a schematic diagram of the flow control message format based on BH RLC CH. Figure 7 This is a schematic diagram illustrating the format of flow control messages based on BAProuting ID. From Figure 6 As can be seen, flow control messages can carry at least one BHRLC CH ID and the available buffer size.

[0066] In addition, there are two different types of flow control information in IAB technology: event-triggered flow control information and polling-triggered flow control information. Event-triggered flow control information means that when the data accumulation in an IAB child node reaches a certain threshold, it actively sends flow control information to the IAB parent node. Polling-triggered flow control information means that when the IAB parent node wants to understand the complexity of the child node's caching, it sends a polling message to the IAB child node, triggering the child node to send polling flow control information to its parent node.

[0067] The flow control messages in this application embodiment can be event-triggered flow control information or polling-triggered flow control information.

[0068] If the flow control message in this embodiment is event-triggered flow control information, it may carry only the BH RLC CHs on the first backhaul link where data accumulation reaches a certain threshold, or it may carry all BH RLC CHs on the first backhaul link. If the flow control message in this embodiment is polling-triggered flow control information, it carries all BH RLC CHs on the first backhaul link.

[0069] A specific example of flow control feedback is as follows: Figure 8 As shown, the IAB donor node can send downlink data to the UE through IAB node 1, IAB node 2 and IAB node 3. Once the backhaul link between IAB node 2 and IAB node 3 encounters link congestion, IAB node 2 will send a flow control message to its upstream node, namely IAB node 1. After receiving the flow control message, IAB node 1 will stop or reduce the sending of new downlink data to IAB node 2.

[0070] In this embodiment of the application, optionally, the target information further includes the available cache capacity of the BH RLC CH; the method further includes:

[0071] The first backhaul node determines whether the BH RLC CH needs to be remapped based on whether the available cache capacity of the BH RLC CH is less than or equal to a first threshold.

[0072] If the available cache capacity of the BH RLC CH is less than or equal to the first threshold, the first backhaul node determines that the BH RLC CH needs to be remapped.

[0073] In other words, BH RLC CHs with available cache capacity less than or equal to the first threshold are BH RLC CHs that need to be remapped.

[0074] In this embodiment of the application, optionally, the first threshold is predefined by the protocol or preconfigured by the network (CU).

[0075] In this embodiment of the application, optionally, the first threshold corresponding to each BH RLC CH may be the same or different.

[0076] In this embodiment of the application, optionally, the first message can also be a newly introduced message dedicated to the remapping process. That is, the first message is a message used to carry the target information of the BH RLC CH that needs to be remapped. After the first backhaul node receives the first message, it considers that the BH RLC CH in the first message are all BH RLC CHs that need to be remapped.

[0077] In this embodiment of the application, optionally, determining the second BH RLC CH includes: the first backhaul node selecting a BH RLC CH on the first backhaul link whose transmission priority is lower than or equal to the transmission priority of the first BH RLC CH and which can be remapped, as the second BH RLC CH.

[0078] In this embodiment of the application, optionally, the transmission priority of each BH RLC CH on the first backhaul link is configured by the IAB Host Central Unit (CU). Specifically, this can be configured via F1AP signaling or RRC signaling when establishing each BH RLC CH.

[0079] In this embodiment of the application, optionally, the BH RLC CH that can be remapped is a BH RLC CH with an available cache capacity greater than a first threshold.

[0080] In this embodiment of the application, optionally, determining the second BH RLC CH includes:

[0081] If at least two second BH RLC CHs exist, the first backhaul node performs one of the following operations:

[0082] From the at least two second BH RLC CHs, select the second BH RLC CH with the lowest transmission priority as the second BH RLC CH to be remapped;

[0083] From the at least two second BH RLC CHs, select the second BH RLC CH with the largest available cache capacity as the second BH RLC CH for remapping;

[0084] From the at least two second BH RLC CHs, select the second BH RLC CH with the fewest remapping times as the second BH RLC CH to be remapped;

[0085] From the at least two second BH RLC CHs, arbitrarily select one second BH RLC CH as the second BH RLC CH to be remapped.

[0086] In this embodiment of the application, a remapping count counter can be configured for each second BH RLC CH, that is, each second BH RLC CH corresponds to one remapping count counter. If a second BH RLC CH is selected for remapping, the first backhaul node increments the count of the remapping count counter of the second BH RLC CH used for remapping by one.

[0087] In this embodiment of the application, optionally, the remapping count counter starts counting from 0 and is cleared to zero when the second BHRLC CH cannot be remapped.

[0088] In this embodiment of the application, optionally, after remapping the data to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission, the method further includes:

[0089] The first backhaul node stops remapping the first BH RLC CH if at least one of the following conditions is met:

[0090] All second BH RLC CHs corresponding to the first BH RLC CH become unremainderable;

[0091] The first BH RLC CH becomes one that does not require remapping.

[0092] In this embodiment of the application, optionally, the second BH RLC CH that cannot be remapped is a BH RLC CH whose available cache capacity is less than or equal to the first threshold.

[0093] In this embodiment of the application, optionally, the first BH RLC CH that does not need to be remapped is a BH RLC CH with an available cache capacity greater than a first threshold.

[0094] In this embodiment of the application, optionally, the BH RLC CH remapping method further includes: the first backhaul node determining whether the first BH RLC CH has become one that does not need to be remapped.

[0095] In this embodiment of the application, optionally, the first backhaul node determines whether the first BH RLC CH becomes one that does not require remapping, including:

[0096] The first backhaul node receives a second message sent by the second backhaul node, the second message including the target information of the first BH RLC CH;

[0097] The first backhaul node determines whether the first BH RLC CH no longer needs to be remapped based on the target information of the first BH RLC CH in the second message.

[0098] The second message can be a newly introduced message dedicated to sending the first BH RLC CH, which does not require remapping.

[0099] In this embodiment of the application, optionally, the target information in the second message further includes the available cache capacity of the BH RLC CH; the first backhaul node determines whether the first BH RLC CH becomes unnecessary for remapping based on the target information of the first BH RLC CH in the second message, including:

[0100] The first backhaul node determines whether the first BH RLC CH no longer needs to be remapped based on whether the available buffer capacity of the first BH RLC CH is greater than or equal to the second threshold (this method is passive contact remapping).

[0101] If the available cache capacity of the first BH RLC CH is greater than or equal to the second threshold, the first backhaul node determines that the first BH RLC CH does not need to be remapped (this method is called active remapping).

[0102] In this embodiment of the application, optionally, the second threshold is predefined by the protocol or preconfigured by the network.

[0103] In this embodiment of the application, optionally, the second threshold corresponding to each of the first BH RLC CHs may be the same or different.

[0104] The BH RLC CH remapping method in the above embodiments will be described below in conjunction with specific application scenarios.

[0105] Example 1: Selection of the second BH RLC CH

[0106] In this embodiment, please refer to Figure 9 There are two backhaul links between IAB1 and IAB4, namely BH link1 and BH link2. The IAB nodes on BH link1 include IAB1, IAB2 and IAB4, and the IAB nodes on BH link2 include IAB1, IAB3 and IAB4. There are 5 BH RLC CHs on BH link1, namely BH RLC CH1, BH RLC CH2, BH RLC CH3, BH RLC CH4 and BH RLC CH5.

[0107] IAB1 receives the Downlink Flow Control (DLFC) message from IAB2. Based on the DLFC message, IAB1 can derive Table 1 (the first two columns are the target information carried by the DLFC, and the last two columns are the information that the IAB1 node itself can know):

[0108] Table 1

[0109]

[0110] The IAB1 node can enable remapping transmission for BH RLC CHs that require remapping, that is, on BH link1, the BH RLC CHs that require remapping are remapped to other BH RLC CHs on BH link1 that do not require remapping (a related scheme is to reroute the BH RLC CHs that require remapping on BH link1 to BH link2; in this embodiment, regardless of whether the IAB1 node has one or more egress links, remapping is only performed on the same link):

[0111] BH RLC CH1 can be selectively remapped to a second BH RLC CH, which consists of CH3 and CH5.

[0112] BH RLC CH2 can be selectively remapped to a second BH RLC CH, which consists of CH3 and CH5.

[0113] BH RLC CH4 can be selectively remapped to a second BH RLC CH5.

[0114] In this embodiment of the application, optionally, if a BH RLC CH (first BH RLC CH) that needs to be remapped has at least two second BH RLC CHs, IAB1 performs one of the following operations:

[0115] From the at least two second BH RLC CHs, select the BH RLC CH with the lowest transmission priority as the second BH RLC CH to be remapped;

[0116] From the at least two second BH RLC CHs, select the BH RLC CH with the largest available cache capacity as the second BH RLC CH to be remapped;

[0117] From the at least two second BH RLC CHs, select the BH RLC CH with the fewest remapping times as the second BH RLC CH to be remapped.

[0118] From the at least two second BH RLC CHs, arbitrarily select one BH RLC CH as the second BH RLC CH for remapping.

[0119] In this embodiment of the application, when the number of remappings of the at least two second BH RLC CHs is the same, the selection can be based on arbitrary implementation, transmission priority, or available buffer capacity.

[0120] This method requires maintaining a remapping count counter for each remappingable second BH RLC CH. Whenever a first BH RLC CH selects the second BH RLC CH for remapping transmission, the remapping count counter for the second BH RLC CH is incremented by 1.

[0121] Assuming IAB1 is the BH RLC CH that needs to be remapped, the remapped BH RLC CHs selected are shown in Table 2:

[0122] Table 2

[0123] First BH RLC CH Remappable BH RLC CH BH RLC CH1 BH RLC CH5 BH RLC CH2 BH RLC CH3 BH RLC CH4 BH RLC CH5

[0124] The remapping count counter for BH RLC CH3 is 1; the remapping count counter for BH RLC CH5 is 2.

[0125] Example 2: Stopping the remapping of the first BH RLC CH

[0126] Time 1: IAB1 receives the DL flow control message sent by IAB2, and the information obtained is shown in Table 3:

[0127] Table 3

[0128]

[0129] Assuming IAB1 is the BH RLC CH that needs to be remapped, the remapped BH RLC CHs selected are shown in Table 4:

[0130] Table 4

[0131] First BH RLC CH Remappable BH RLC CH BH RLC CH1 BH RLC CH5 BH RLC CH2 BH RLC CH3 BH RLC CH4 BH RLC CH5

[0132] Time 2: IAB1 receives the DL flow control message sent by IAB2, and the information obtained is shown in Table 5:

[0133] Table 5

[0134]

[0135] It can be seen that BH RLC CH4 was released from the remapping state due to the remapping transmission, but BH RLC CH1 and BH RLC CH2 are still in the remapping state; and BH RLC CH5 became the remapping state due to carrying too much remapping data; after receiving the DL flow control message, the IAB1 node performs the following operations on each BH RLC CH:

[0136] BH RLC CH1: Since BH RLC CH5 used for remapping has become a state that requires remapping to be enabled, and the second BH RLC CH that can be selected now is BH RLC CH3, we switch from BH RLC CH5 to BH RLC CH3 for remapping.

[0137] BH RLC CH2: Since BH RLC CH5 used for remapping has become a state that requires remapping to be enabled, and the second BH RLC CH that can be selected now is BH RLC CH3 and BH RLC CH4, since BH RLC CH4 has a lower priority, the remapping is switched from BH RLC CH5 to BH RLC CH4.

[0138] BH RLC CH3: No remapping is required;

[0139] BH RLC CH4: Assuming 35% is the configured threshold for unmapping (i.e., the second threshold), BH RLCCH4 stops the remapping operation and resumes normal data transmission.

[0140] BH RLC CH5: Remapping is required, but there is no second BH RLC CH to choose from for BH RLC CH5, so no operation is performed.

[0141] In summary, at time 2, IAB1 selects the BH RLC CHs to be remapped for the BH RLC CHs that need to be remapped, as shown in Table 6:

[0142] Table 6

[0143]

[0144] In the above embodiments, the first backhaul node selects a second BH RLCCH for remapping the first BH RLCCH. In other embodiments of this application, optionally, the second BH RLCCH may also be a BH RLCCH that can be remapped in advance for the first BH RLCCH.

[0145] In other words, remappable BH RLC CHs can be pre-configured for at least one BH RLC CH (or all BH RLC CHs) on the first backhaul link. Once it is determined that a BH RLC CH needs to be remapped, the remappable BH RLC CH pre-configured for that first BH RLC CH can be used as the second BH RLC CH. In this way, the first backhaul link does not need to perform the operation of selecting a second BH RLC CH, saving latency and power consumption.

[0146] In this embodiment of the application, optionally, the second BH RLC CH has an IAB host CU configuration.

[0147] In this embodiment of the application, optionally, the second BH RLC CH has the same or similar QoS characteristics and / or transmission priority as the first BH RLC CH.

[0148] In this embodiment of the application, optionally, the second BH RLC CH is only used for data transmission of the remapping of the first BH RLC CH. That is, the second BH RLC CH that can be remapped in advance for the first BH RLC CH is not normally used for data transmission, but is only used to transmit the data that the corresponding first BH RLC CH needs to transmit when the corresponding first BH RLC CH needs to be remapped.

[0149] In the above embodiments of this application, optionally, the first backhaul link is an uplink backhaul link or a downlink backhaul link.

[0150] Please refer to Figure 10 This application also provides a BH RLC CH remapping method, including:

[0151] Step 101: The second backhaul node sends a first message to the first backhaul node. The first message includes target information of at least one BH RLC CH on the first backhaul link. The first backhaul link is the backhaul link between the first backhaul node and the second backhaul node. The target information includes at least the ID of the BH RLC CH. The first message is used to indicate whether the at least one BH RLC CH needs to be remapped.

[0152] The instruction can be an implicit instruction or an explicit instruction.

[0153] In this embodiment of the application, the backhaul node sends a first message to another backhaul node on the same link, so that the other backhaul node can determine whether BH RLC CH needs to be remapped based on the first message.

[0154] Optionally, the BH RLC CH remapping method in this application embodiment further includes:

[0155] The second backhaul node sends a second message to the first backhaul node. The second message includes the target information of the first BHRLC CH and is used to indicate whether the first BHRLC CH no longer requires remapping. The indication can be implicit or explicit.

[0156] Optionally, the first message is a flow control message.

[0157] Optionally, the target information may also include the available cache capacity of the BH RLC CH; the BH RLC CH that needs to be remapped is a BH RLC CH whose available cache capacity is less than or equal to a first threshold.

[0158] Optionally, the target information of the second message may also include the available cache capacity of the BH RLC CH; if the available cache capacity is greater than the first threshold, the first BH RLC CH corresponding to the available cache capacity does not need to be remapped.

[0159] It should be noted that the execution entity of the BH RLC CH remapping method provided in this application embodiment can be a BH RLC CH remapping device, or the control module in the BH RLC CH remapping device for executing the BH RLC CH remapping method. This application embodiment uses the execution of the BH RLC CH remapping method by a virtual device as an example to illustrate the BH RLC CH remapping device provided in this application embodiment.

[0160] Please refer to Figure 11 This application also provides a BH RLC CH remapping device 110, comprising:

[0161] The first receiving module 111 is used to receive a first message sent by the second backhaul node. The first message includes target information of at least one BH RLC CH on the first backhaul link. The first backhaul link is a backhaul link between the first backhaul node and the second backhaul node. The target information includes at least the ID of the BH RLC CH.

[0162] The first determining module 112 is configured to determine, based on the target information, that the first BH RLC CH in the at least one BH RLC CH needs to be remapped;

[0163] The second determining module 113 is used to determine the second BH RLC CH, wherein the second BH RLC CH is the BH RLC CH on the first backhaul link;

[0164] The remapping module 114 is used to remap the data that needs to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission.

[0165] In this embodiment of the application, when a BH RLC CH needs to be remapped (e.g., when congestion occurs), the IAB node can remap the data transmitted by the BH RLC CH that needs to be remapped to another BH RLC CH on the same backhaul link for transmission. Even if the IAB node has only one output link (egress link) or multiple egress links but cannot find a replacement BAP routing ID on other egress links or does not have a replacement BH RLC CH configured on other egress links of the IAB node, the normal transmission of BH RLC CH data can be guaranteed.

[0166] Optionally, the first message is a flow control message.

[0167] Optionally, the target information also includes the available cache capacity of the BH RLC CH; the BH RLC CH remapping device 110 further includes:

[0168] The first judgment module is used to determine whether the BH RLC CH needs to be remapped based on whether the available cache capacity of the BH RLC CH is less than or equal to a first threshold; if the available cache capacity of the BH RLC CH is less than or equal to the first threshold, it is determined that the BH RLC CH needs to be remapped.

[0169] Optionally, the first threshold corresponding to each BH RLC CH may be the same or different.

[0170] Optionally, the first message is a message used to carry target information of the BH RLC CH that needs to be remapped.

[0171] Optionally, the first determining module 112 is used to select a BH RLC CH on the first backhaul link whose transmission priority is lower than or equal to the transmission priority of the first BH RLC CH and which can be remapped, as the second BH RLC CH.

[0172] Optionally, the transmission priority of each BH RLC CH on the first backhaul link is configured by the IAB host central unit CU.

[0173] Optionally, the BHRLC CH that can be remapped is a BHRLC CH with an available cache capacity greater than a first threshold.

[0174] Optionally, the first determining module 112 is further configured to perform one of the following operations if at least two of the second BH RLC CHs exist:

[0175] From the at least two second BH RLC CHs, select the second BH RLC CH with the lowest transmission priority as the second BH RLC CH to be remapped;

[0176] From the at least two second BH RLC CHs, select the second BH RLC CH with the largest available cache capacity as the second BH RLC CH for remapping;

[0177] From the at least two second BH RLC CHs, select the second BH RLC CH with the fewest remapping times as the second BH RLC CH to be remapped;

[0178] From the at least two second BH RLC CHs, arbitrarily select one second BH RLC CH as the second BH RLC CH to be remapped.

[0179] Optionally, the BH RLC CH remapping device 110 further includes:

[0180] The counting module is used to increment the counter for the number of remapping operations of the second BH RLC CH used for remapping.

[0181] Optionally, each of the second BH RLC CHs corresponds to a remapping count counter, which counts from 0 until the second BH RLC CH can no longer be remapped and is then cleared to zero.

[0182] Optionally, the BH RLC CH remapping device 110 further includes:

[0183] A stop module is configured to stop the remapping of the first BH RLC CH if at least one of the following conditions is met:

[0184] All second BH RLC CHs corresponding to the first BH RLC CH become unremainderable;

[0185] The first BH RLC CH becomes one that does not require remapping.

[0186] Optionally, the second BH RLC CH that cannot be remapped is a BH RLC CH whose available cache capacity is less than or equal to the first threshold.

[0187] Optionally, the first BH RLC CH that does not require remapping is a BH RLC CH with an available cache capacity greater than a first threshold.

[0188] Optionally, the BH RLC CH remapping device 110 further includes:

[0189] The second judgment module is used to determine whether the first BH RLC CH has become one that does not require remapping.

[0190] Optionally, the second determination module is configured to receive a second message sent by the second backhaul node, the second message including the target information of the first BH RLC CH; and determine whether the first BH RLC CH becomes unnecessary to remap based on the target information of the first BH RLC CH in the second message.

[0191] Optionally, the target information in the second message also includes the available cache capacity of the BH RLC CH; the second judgment module is used to determine whether the first BH RLC CH does not need to be remapped based on whether the available cache capacity of the first BH RLC CH is greater than or equal to a second threshold; if the available cache capacity of the first BH RLC CH is greater than or equal to the second threshold, it is determined that the first BH RLC CH does not need to be remapped.

[0192] Optionally, the second threshold is predefined by the protocol or preconfigured by the network.

[0193] Optionally, the second threshold corresponding to each of the first BH RLC CHs may be the same or different.

[0194] Optionally, the second BH RLC CH is a BHRLC CH that can be remapped and pre-configured for the first BH RLC CH.

[0195] Optionally, the second BH RLC CH has the same or similar QoS characteristics and / or transmission priority as the first BH RLC CH.

[0196] Optionally, the second BH RLC CH is used only for data transmission of the remapping of the first BH RLC CH.

[0197] The BH RLC CH remapping device provided in this application embodiment can achieve... Figure 4 The various processes implemented in the method embodiments achieve the same technical effect, and will not be described again here to avoid repetition.

[0198] Please refer to Figure 12 This application also provides a BH RLC CH remapping device 120, comprising:

[0199] The first sending module 121 is configured to send a first message to a first backhaul node. The first message includes target information of at least one BH RLC CH on a first backhaul link. The first backhaul link is a backhaul link between the first backhaul node and the second backhaul node. The target information includes at least the ID of the BH RLC CH. The first message is used to indicate whether the at least one BH RLC CH needs to be remapped.

[0200] Optionally, the BH RLC CH remapping device 120 further includes:

[0201] The second sending module is used to send a second message to the first backhaul node. The second message includes the target information of the first BHRLC CH and is used to indicate whether the first BHRLC CH has become one that does not need to be remapped.

[0202] Optionally, the first message is a flow control message.

[0203] Optionally, the target information may also include the available cache capacity of the BH RLC CH; the BH RLC CH that needs to be remapped is a BH RLC CH whose available cache capacity is less than or equal to a first threshold.

[0204] Optionally, the target information of the second message may also include the available cache capacity of the BH RLC CH; if the available cache capacity is greater than the first threshold, the first BH RLC CH corresponding to the available cache capacity does not need to be remapped.

[0205] The BH RLC CH remapping device provided in this application embodiment can achieve... Figure 10 The various processes implemented in the method embodiments achieve the same technical effect, and will not be described again here to avoid repetition.

[0206] like Figure 13 As shown, this application embodiment also provides a backhaul node 130, including a processor 131, a memory 132, and a program or instruction stored in the memory 132 that can run on the processor 131. When the program or instruction is executed by the processor 131, it implements the various processes of the above-described BH RLC CH remapping method embodiment and can achieve the same technical effect. To avoid repetition, it will not be described again here.

[0207] This application embodiment also provides a backhaul node, including a processor and a communication interface. The communication interface is used to receive a first message sent by a second backhaul node. The first message includes target information of at least one BH RLCCH on a first backhaul link. The first backhaul link is a backhaul link between the first backhaul node and the second backhaul node. The target information includes at least the identity ID of the BH RLCCH. The processor is used to determine, based on the target information, that a first BH RLCCH among the at least one BH RLCCH needs to be remapped; determine a second BH RLCCH, which is a BH RLCCH on the first backhaul link; and remap the data to be transmitted through the first BH RLCCH to the second BH RLCCH for transmission.

[0208] This application embodiment also provides a backhaul node, including a processor and a communication interface, wherein the communication interface is used to send a first message to a first backhaul node, the first message including target information of at least one BHRLC CH on a first backhaul link, the first backhaul link being a backhaul link between the first backhaul node and a second backhaul node, the target information including at least the ID of the BHRLC CH, and the first message being used to indicate whether the at least one BHRLC CH needs to be remapped.

[0209] This backhaul node embodiment corresponds to the above-described backhaul node method embodiment. All implementation processes and methods of the above-described method embodiment can be applied to this backhaul node embodiment and can achieve the same technical effect.

[0210] Specifically, embodiments of this application also provide a return node. For example... Figure 14 As shown, the backhaul node 1400 includes an antenna 141, a radio frequency (RF) device 142, and a baseband device 143. The antenna 141 is connected to the RF device 142. In the uplink direction, the RF device 142 receives information through the antenna 141 and transmits the received information to the baseband device 143 for processing. In the downlink direction, the baseband device 143 processes the information to be transmitted and sends it to the RF device 142. The RF device 142 processes the received information and transmits it through the antenna 141.

[0211] The aforementioned frequency band processing device can be located in the baseband device 143. The method executed by the backhaul node in the above embodiments can be implemented in the baseband device 143, which includes a processor 144 and a memory 145.

[0212] Baseband device 143 may include, for example, at least one baseband board on which multiple chips are disposed, such as Figure 14As shown, one of the chips, for example, is a processor 144, which is connected to a memory 145 to call the program in the memory 145 and execute the backhaul node operation shown in the above method embodiment.

[0213] The baseband device 143 may also include a network interface 146 for exchanging information with the radio frequency device 142, such as a common public radio interface (CPRI).

[0214] Specifically, the return node in this embodiment further includes: instructions or programs stored in memory 145 and executable on processor 144, wherein processor 144 calls the instructions or programs in memory 145 to execute. Figure 11 or Figure 12 The methods executed by each module shown achieve the same technical effect, and to avoid repetition, they will not be described in detail here.

[0215] This application also provides a readable storage medium, which can be volatile or non-volatile. The readable storage medium stores a program or instructions. When the program or instructions are executed by a processor, they implement the various processes of the above-described BH RLC CH remapping method embodiments and achieve the same technical effect. To avoid repetition, they will not be described again here.

[0216] The processor mentioned above is the processor in the terminal described in the above embodiments. The readable storage medium includes computer-readable storage media, such as computer read-only memory (ROM), random access memory (RAM), magnetic disk, or optical disk.

[0217] This application embodiment also provides a chip, which includes a processor and a communication interface. The communication interface is coupled to the processor. The processor is used to run programs or instructions to implement the various processes of the above-described BH RLC CH remapping method embodiments and achieve the same technical effect. To avoid repetition, it will not be described again here.

[0218] It should be understood that the chip mentioned in the embodiments of this application may also be referred to as a system-on-a-chip, system chip, chip system, or system-on-a-chip, etc.

[0219] This application also provides a computer program / program product stored in a non-transient storage medium, which is executed by at least one processor to implement the steps of the BH RLC CH remapping method described above.

[0220] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element. Furthermore, it should be noted that the scope of the methods and apparatuses in the embodiments of this application is not limited to performing functions in the order shown or discussed, but may also include performing functions substantially simultaneously or in the reverse order, depending on the functions involved. For example, the described methods may be performed in a different order than described, and various steps may be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.

[0221] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a computer software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a terminal (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0222] The embodiments of this application have been described above with reference to the accompanying drawings. However, this application is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms under the guidance of this application without departing from the spirit and scope of the claims, and all of these forms are within the protection scope of this application.

Claims

1. A method for remapping the backhaul radio link control channel (BH RLC CH), characterized in that, include: The first backhaul node receives a first message sent by the second backhaul node. The first message includes target information of at least two BH RLC CHs on the first backhaul link. The first backhaul link is the backhaul link between the first backhaul node and the second backhaul node. The target information includes at least the identity ID of the BH RLC CH. The first backhaul node determines, based on the target information, that the first BH RLCCH among the at least two BH RLCCHs needs to be remapped; The first backhaul node determines the second BH RLC CH, and the second BH RLC CH is the BH RLC CH on the first backhaul link; The first backhaul node will remap the data that needs to be transmitted through the first BHRLC CH to the second BHRLC CH for transmission; The first backhaul node determines the second BH RLC CH, including: The first backhaul node selects a BH RLC CH on the first backhaul link whose transmission priority is lower than or equal to that of the first BHRLC CH and which can be remapped, as the second BH RLC CH.

2. The method according to claim 1, characterized in that, The first message is a flow control message.

3. The method according to claim 1 or 2, characterized in that, The target information also includes the available cache capacity of the BH RLC CH; The method further includes: The first backhaul node determines whether the BH RLC CH needs to be remapped based on whether the available cache capacity of the BH RLC CH is less than or equal to a first threshold. If the available cache capacity of the BH RLC CH is less than or equal to the first threshold, the first backhaul node determines that the BH RLC CH needs to be remapped.

4. The method according to claim 3, characterized in that, The first thresholds for each BH RLC CH may be the same or different.

5. The method according to claim 1 or 2, characterized in that, The first message is a message used to carry target information of the BH RLC CH that needs to be remapped.

6. The method according to claim 1, characterized in that, The transmission priority of each BH RLC CH on the first backhaul link is configured by the IAB host central unit CU.

7. The method according to claim 1, characterized in that, The BH RLC CH that can be remapped is a BH RLC CH whose available cache capacity is greater than the first threshold.

8. The method according to claim 1, characterized in that, The first backhaul node determines the second BH RLC CH, including: If at least two second BH RLC CHs exist, the first backhaul node performs one of the following operations: From the at least two second BH RLC CHs, select the second BH RLC CH with the lowest transmission priority as the second BH RLC CH to be remapped; From the at least two second BH RLC CHs, select the second BH RLC CH with the largest available cache capacity as the second BH RLC CH for remapping; From the at least two second BH RLC CHs, select the second BH RLC CH with the fewest remapping times as the second BH RLC CH to be remapped; From the at least two second BH RLC CHs, arbitrarily select one second BH RLC CH as the second BH RLC CH to be remapped.

9. The method according to claim 8, characterized in that, Also includes: The first backhaul node increments the counter for the number of remapping operations of the second BH RLC CH used for remapping by one.

10. The method according to claim 9, characterized in that, Each of the second BH RLC CHs corresponds to a remapping count counter, which counts from 0 until the second BH RLC CH can no longer be remapped, at which point it is cleared to zero.

11. The method according to claim 1, characterized in that, After remapping the data that needs to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission, the following steps are also included: The first backhaul node stops remapping the first BH RLC CH if at least one of the following conditions is met: All second BH RLC CHs corresponding to the first BH RLC CH become unremainderable; The first BH RLC CH becomes one that does not require remapping.

12. The method according to claim 11, characterized in that, The second BH RLCCH that cannot be remapped is a BH RLCCH whose available cache capacity is less than or equal to the first threshold.

13. The method according to claim 11, characterized in that, The first BH RLCCH that does not require remapping is a BH RLCCH with an available cache capacity greater than a first threshold.

14. The method according to claim 11, characterized in that, Also includes: The first backhaul node determines whether the first BH RLC CH has become one that does not require remapping.

15. The method according to claim 14, characterized in that, The first backhaul node determines whether the first BHRLC CH becomes one that does not require remapping, including: The first backhaul node receives a second message sent by the second backhaul node, the second message including the target information of the first BH RLC CH; The first backhaul node determines whether the first BH RLC CH no longer needs to be remapped based on the target information of the first BH RLC CH in the second message.

16. The method according to claim 15, characterized in that, The target information in the second message also includes the available cache capacity of the BH RLC CH; The first backhaul node determines, based on the target information of the first BH RLC CH in the second message, whether the first BH RLC CH no longer requires remapping, including: The first backhaul node determines whether the first BH RLC CH no longer needs to be remapped based on whether the available cache capacity of the first BH RLC CH is greater than or equal to the second threshold. If the available cache capacity of the first BH RLC CH is greater than or equal to the second threshold, the first backhaul node determines that the first BH RLC CH no longer needs to be remapped.

17. The method according to claim 16, characterized in that, The second threshold is predefined by the protocol or preconfigured by the network.

18. The method according to claim 16, characterized in that, The second threshold corresponding to each of the first BH RLC CHs may be the same or different.

19. The method according to claim 1, characterized in that, The second BH RLC CH is a BH RLC CH that can be remapped and pre-configured for the first BH RLC CH.

20. The method according to claim 19, characterized in that, The second BH RLC CH has the same or similar QoS characteristics and / or transmission priority as the first BH RLC CH.

21. The method according to claim 19, characterized in that, The second BHRLC CH is used only for data transmission of the remapping of the first BHRLC CH.

22. The method according to claim 1, characterized in that, The first backhaul link is either an uplink backhaul link or a downlink backhaul link.

23. A BH RLC CH remapping method, characterized in that, include: The second backhaul node sends a first message to the first backhaul node. The first message includes target information for at least two BH RLC CHs on the first backhaul link, where the first backhaul link is the backhaul link between the first backhaul node and the second backhaul node. The target information includes at least the ID of the BH RLC CH. The first message is used to indicate whether the at least two BH RLC CHs need to be remapped. The first backhaul node can determine, based on the target information, that the first BH RLC CH among the at least two BH RLC CHs needs to be remapped, and remap the data to be transmitted through the first BH RLC CH to the second BH RLC CH on the first backhaul link for transmission. The second BH RLC CH is a BH RLC CH on the first backhaul link whose transmission priority is lower than or equal to that of the first BH RLC CH and which can be remapped.

24. The method according to claim 23, characterized in that, Also includes: The second backhaul node sends a second message to the first backhaul node. The second message includes the target information of the first BH RLCCH and is used to indicate whether the first BH RLCCH has become one that does not need to be remapped.

25. The method according to claim 23, characterized in that, The first message is a flow control message.

26. The method according to claim 23 or 25, characterized in that, The target information also includes the available cache capacity of the BH RLCCH; the BH RLCCH that needs to be remapped is the BH RLCCH whose available cache capacity is less than or equal to the first threshold.

27. The method according to claim 24, characterized in that, The target information of the second message also includes the available cache capacity of the BH RLC CH; if the available cache capacity is greater than the first threshold, the first BH RLC CH corresponding to the available cache capacity does not need to be remapped.

28. A BH RLC CH remapping device, characterized in that, include: The first receiving module is configured to receive a first message sent by the second backhaul node. The first message includes target information of at least two BH RLC CHs on the first backhaul link. The first backhaul link is a backhaul link between the first backhaul node and the second backhaul node. The target information includes at least the ID of the BH RLC CH. The first determining module is used to determine, based on the target information, that the first BH RLCCH among the at least two BH RLCCHs needs to be remapped; The second determining module is used to determine the second BH RLC CH, wherein the second BH RLC CH is the BH RLC CH on the first backhaul link; The remapping module is used to remap data that needs to be transmitted through the first BHRLC CH to the second BHRLC CH for transmission. The first determining module is used to select a BH RLC CH on the first backhaul link whose transmission priority is lower than or equal to the transmission priority of the first BH RLC CH and which can be remapped, as the second BH RLC CH.

29. A BH RLC CH remapping device, characterized in that, include: A first sending module is configured to send a first message to a first backhaul node. The first message includes target information for at least two BH RLC CHs on a first backhaul link. The first backhaul link is a backhaul link between the first backhaul node and a second backhaul node. The target information includes at least the ID of the BH RLC CH. The first message is used to indicate whether the at least two BH RLC CHs need to be remapped. The first backhaul node can determine, based on the target information, that the first BH RLC CH among the at least two BH RLC CHs needs to be remapped, and remap the data to be transmitted through the first BH RLC CH to a second BH RLC CH on the first backhaul link for transmission. The second BH RLC CH is a BH RLC CH on the first backhaul link whose transmission priority is lower than or equal to that of the first BH RLC CH and which can be remapped.

30. A backhaul node, characterized in that, It includes a processor, a memory, and a program or instructions stored in the memory and executable on the processor, wherein when the program or instructions are executed by the processor, they implement the steps of the BH RLC CH remapping method as described in any one of claims 1-22, or, when the program or instructions are executed by the processor, they implement the steps of the BH RLC CH remapping method as described in any one of claims 23-27.

31. A readable storage medium, characterized in that, The readable storage medium stores a program or instructions, which, when executed by a processor, implement the BH RLC CH remapping method as described in any one of claims 1-22, or implement the steps of the BH RLC CH remapping method as described in any one of claims 23-27.

Images