Cache status report cancelling method and equipment

Abstract

The embodiment of the invention provides a cache state report cancelling method and equipment, relates to the field of communication, and can reduce the time delay of uplink data of user equipment. The method comprises the following steps: when a first media access control protocol data unit (MAC PDU) is sent and the first MAC PDU comprises a cache state until an event of triggering a cache state report (BSR) last time before the first MAC PDU is packed, cancelling all BSRs triggered before the first MAC PDU is packed, and retaining the BSRs triggered after the first MAC PDU is packed.

Description

[0001] This application is a divisional application of the original application with the application number 201810150653.6 and the original filing date of February 13, 2018, and the entire contents of the original application are incorporated herein by reference. TECHNICAL FIELD

[0002] Embodiments of the present application relate to the field of communication technology, and in particular to a buffer status report cancellation method and device. BACKGROUND

[0003] In a tree network topology, a user equipment (UE) can communicate with a donor gNB (DgNB) directly or through a relay node (RN). That is, the path from the UE to the DgNB can consist of multiple RNs. The DgNB and the RNs save routing information, which includes the path information from the local to the UE, and the DgNB and the RNs can send data packets to the correct UE according to the routing information.

[0004] When a certain RN performs handover, such as the RN switching from a currently connected RN to another RN, the network topology changes, and therefore the DgNB and each RN in the network topology needs to update the locally saved routing information according to the changed network topology. When RN1 switches from RN2 to RN3, on the one hand, RN2 discovers that RN1 leaves, and then sends a message to its parent node (RN4) indicating that “RN1 has left RN2”, RN4 updates its routing information according to the message and continues to send a message to its parent node (RN5) indicating that “RN1 has left RN2”, until the message reaches the DgNB, and the DgNB updates its routing information according to the message. The parent node can be the DgNB or a relay node. It should be noted that the parent node of a certain node can be understood as the node directly connected to the certain node in the uplink direction, that is, the directly connected previous hop of the certain node.

[0005] On the other hand, RN3 discovers that RN1 accesses, and then sends a message to its parent node (RN6) indicating that “RN1 has joined RN3”, RN6 updates its routing information according to the message and continues to send a message to its parent node (RN7) indicating that “RN1 has joined RN3”, until the message reaches the DgNB, and the DgNB also updates its routing information according to the message.

[0006] As can be seen, in the prior art, when the network topology changes due to RN switching, each RN on the path to the donor base station before the RN switching updates the routing information, and all RNs on the path to the donor base station after the RN switching also update the routing information. In fact, the change of the network topology does not affect the routing information of some RNs and the donor base station, i.e., the updated routing information is the same as the routing information before the update, and therefore these RNs and the donor base station do not need to update the routing information. In addition, the RNs indicate the change of the network topology through specific messages (e.g., an RN leaves a certain RN or an RN joins a certain RN), which also causes unnecessary signaling overhead.

[0007] When the network topology changes, the donor base station can retransmit data packets from the new path only after the donor base station and all RNs complete the update of the routing information, which causes a long data interruption time. SUMMARY

[0008] Embodiments of the present application provide a routing update method and device, which can save signaling overhead and reduce the data interruption time caused by the change of the network topology.

[0009] To achieve the above object, the embodiments of the present application adopt the following technical solutions: In a first aspect, the embodiments of the present application provide a routing update method, which comprises: a first node receiving a first message sent by a second node. Specifically, the first message is used to indicate that a switching node leaves a source node and / or the switching node accesses a target node. The source node is a node connected by the switching node before the switching, and the target node is a node connected by the switching node after the switching. Further, the first node can also update its own routing information according to the received first message. For example, deleting a next hop to a certain node, or adding a next hop to a certain node.

[0010] In a specific implementation, the first node is any one of the following nodes: the target node, the source node, a core node, a first relay node between the target node and the core node, and a second relay node between the source node and the core node. The core node is the first common node in the uplink direction of the target node and the source node. The second node is any one of the following nodes: the switching node, the target node, the source node, the core node, the first relay node, and the second relay node.

[0011] It can be seen that in the method provided by the embodiment of the application, when the network topology changes due to the switching of the node, only the core node and the node downstream of the core node exchange messages indicating the node switching condition and perform route updating. In the prior art, after one node in the IAB network switches, each node on the path to the donor base station before the switching of the node receives the message indicating the node switching condition and updates the route information, and all nodes on the path to the donor base station after the switching of the node also receive the message indicating the node switching condition and update the route information. In comparison, in the embodiment of the application, the nodes other than the core node and the node downstream of the core node in the IAB network do not need to perform route updating, and these nodes do not need to be signaled, thereby saving signaling overhead, and at the same time, due to the reduction in the number of nodes performing route updating, the entire network can recover communication in a short time, thereby shortening the data interruption time.

[0012] With reference to the first aspect, in a first possible implementation manner of the first aspect, the method further includes: determining, by the first node, a third node receiving the second message according to the first message, and sending the second message to the third node, the second message being used to indicate that the switching node leaves the source node and / or the switching node accesses the target node. The third node is any one of the following nodes: the source node, the core node, the target node, the first relay node, and the second relay node.

[0013] That is, the first node also sends the message to other nodes to indicate the node switching condition, so that the core node related to the switching node and the node downstream of the core node in the IAB network can all receive the message indicating the node switching condition. After the network topology changes, the route information of each node is updated according to the actual change of the network topology, and data is forwarded according to the correct route information, so that the network recovers communication.

[0014] With reference to the first possible implementation manner of the first aspect, in a second possible implementation manner of the first aspect, the second message further includes route information of the switching node.

[0015] In some embodiments, if the switching node has other subordinate nodes connected thereto, and these nodes switch together with the switching node, the route information of the switching node includes the route information related to these subordinate nodes. In order to ensure that the donor base station can continue to communicate with these subordinate nodes, the route information of the switching node needs to be indicated by the second message, so that each node can also update the route information related to these subordinate nodes, to ensure that the data sent by the donor base station in the future can reach these subordinate nodes, or the data sent by these subordinate nodes in the future can reach the donor base station.

[0016] With reference to the first aspect or any possible implementation of the first aspect, in a third possible implementation of the first aspect, the first message further comprises routing information of the switching node.

[0017] In some embodiments, if the switching node has other subordinate nodes connected thereto and these nodes follow the switching node to switch, the switching node includes routing information related to these subordinate nodes in its own routing information, and in order to ensure that the subsequent host base station can continue to communicate with these subordinate nodes, the routing information of the switching node needs to be indicated by the first message, so that each node can also update the routing information related to these subordinate nodes, ensuring that the host base station can reach these subordinate nodes in subsequent data transmission, or these subordinate nodes can reach the host base station in subsequent data transmission.

[0018] With reference to the first possible implementation of the first aspect, in a fourth possible implementation of the first aspect, the determining, by the first node, the third node receiving the second message according to the first message comprises: determining, by the first node, that the routing information of the first node does not include information of the switching node and / or the routing information of the first node does not include information of the source node, and determining that the third node is a parent node of the first node.

[0019] In some embodiments, the nodes that need to add routing information are updated first, and the nodes that need to delete routing information are updated after the routing information of these nodes is added. Therefore, the switching node sends the first message to the target node to indicate the node switching, and then the target node can pass the message to the first relay node in its uplink. Each first relay node needs to send the message to its parent node after receiving the message sent by the child node, so that the nodes below the core node in the path after the switching node switches can complete routing update. For a first node, if the routing information of the first node does not include information of the switching node, or the routing information of the first node does not include information of the switching node and the source node, or the routing information of the first node does not include information of the source node, it means that the node is on the path after the switching node switches, for example, the node can be a first relay node or a target node.

[0020] With reference to the fourth possible implementation of the first aspect, in a fifth possible implementation of the first aspect, the first message is used to indicate that the switching node leaves the source node and accesses the target node, and the second message is used to indicate that the switching node leaves the source node and accesses the target node; or the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node accesses the target node.

[0021] That is, for the first relay node or the target node, the content indicated by the received message needs to be delivered, that is, the first message can be the same as the content indicated by the second message.

[0022] With reference to the first possible implementation manner of the first aspect, in a sixth possible implementation manner of the first aspect, the first node determining the third node receiving the second message according to the first message comprises: the first node determining that the routing information of the first node comprises the information of the switching node and / or the information of the source node in the routing information of the first node, and then determining that the third node is a child node of the first node.

[0023] For a first node, if the routing information of the first node comprises the information of the switching node, or the routing information of the first node comprises the information of the switching node and the source node, or the routing information of the first node comprises the information of the source node, it means that the node is on the path after the switching node switches, or on the path before the switching node switches, for example, the node can be the first common node in the direction close to the UE of the two paths, that is, the core node in the embodiment of the application. In addition, since the nodes other than the core node and the nodes under the core node in the core point IAB network in the embodiment of the application do not need to perform routing update, and the nodes do not need to be signaled, and the nodes on the path after the switching node switches, such as the first relay node and the target node, have completed the routing update, therefore, the core node needs to send a message to its child node to indicate the situation that the switching node leaves.

[0024] With reference to the sixth possible implementation manner of the first aspect, in a seventh possible implementation manner of the first aspect, the first message is used to indicate that the switching node leaves the source node and accesses the target node, and the second message is used to indicate that the switching node leaves the source node; or the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node leaves the source node; or the first message is used to indicate that the switching node leaves the source node and accesses the target node, and the second message is used to indicate that the switching node leaves; or the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node leaves.

[0025] In an implementation, the core node can indicate to its child node (such as the second relay node) that the switching node leaves the source node, or only indicate that the switching node leaves, and after receiving the message indicated by the core node, the child node can perform routing update according to the content indicated by the core node, such as deleting the next hop to the switching node in the routing information. In a possible implementation of the first aspect, the first node determines the third node receiving the second message according to the first message, including: the first node determines that the information of the switching node is included in the routing information of the first node and the switching node is not a child node of the first node before the switching, and then determines that the third node is a child node of the first node.

[0026] If the first node determines that the information of the switching node is included in the routing information of the first node, it means that the node is on the path before the switching node switches. Since the switching node is not a child node of the first node before the switching, it means that the node is not the source node, for example, the node is the second relay node. In the embodiment of the application, the core node and the node under the core node perform routing update, therefore, the second relay node sends the second message to its child node to indicate the switching of the node.

[0027] In a possible implementation of the eighth aspect of the first aspect, the first message is used to indicate that the switching node leaves, and the second message is used to indicate that the switching node leaves.

[0028] That is, the first node is the second relay node, the message received by the second relay node indicates that the switching node leaves, and the message sent by the second relay node to its node indicates that the switching node leaves.

[0029] In a possible implementation of the sixth to ninth aspect of the first aspect, the first node determines the third node receiving the second message according to the first message, including: the first node determines that the next hop to the switching node is the third node according to the routing information of the first node.

[0030] That is, the first node is the second relay node, the message received by the second relay node indicates that the switching node leaves, and the message sent by the second relay node to its node indicates that the switching node leaves.

[0031] In a possible implementation of the first aspect, the first node determines the third node receiving the second message according to the first message, including: the first node determines that the information of the switching node is included in the routing information of the first node and the switching node is not a child node of the first node before the switching, and then determines that the third node is a child node of the first node.

[0032] If the first node determines that the source node's information differs from its own, it indicates that the node is not the source node. Alternatively, if the first node determines that its routing information includes information about the switching node, it indicates that the node was on the path the switching node was on before the switching node switched. Since the switching node was not a child node of the first node before the switching, it indicates that the node is not the source node. For example, this node is a second relay node. In this embodiment of the invention, the core node and the nodes downstream of the core node perform route updates. Therefore, the second relay node sends a second message to its child nodes, indicating the node switching status.

[0033] In conjunction with the eleventh possible implementation of the first aspect, in the twelfth possible implementation of the first aspect, the first message is used to indicate that the switching node leaves the source node, and the second message is used to indicate that the switching node leaves the source node.

[0034] Specifically, the first message can carry information about the switching node and the source node, and the second message can carry information about the switching node and the source node.

[0035] In conjunction with the eleventh or twelfth possible implementation of the first aspect, in the thirteenth possible implementation of the first aspect, determining the third node as a child node of the first node specifically includes: the first node determining the next hop to the source node as the third node based on the routing information of the first node; and / or, the first node determining the next hop to the switching node as the third node based on the routing information of the first node.

[0036] In other words, the first node is the second relay node. The message received by the second relay node indicates that the switching node has left the source node. This message can carry information about the switching node and the source node. Therefore, the second relay node can determine which node to send the message indicating the switching status to based on the information of the switching node or the source node and its own routing information.

[0037] In conjunction with the first possible implementation of the first aspect, in the fourteenth possible implementation of the first aspect, the first node determines the third node receiving the second message based on the first message as follows: if the first node determines that the routing information of the first node does not include the information of the target node, then the third node is determined to be the parent node of the first node.

[0038] In some embodiments, the nodes requiring deletion of routing information first perform routing update, and the nodes requiring addition of routing information perform routing update after the nodes delete the routing information. Therefore, the switching node sends a first message to the source node to indicate the switching condition of the node, and then the source node can pass the message to the second relay node in the uplink of the source node. Each second relay node needs to send a message to the parent node of the second relay node to indicate the switching condition of the node after receiving the message sent by the receiving node, so that the nodes on the path before the switching node is switched and located in the downlink of the core node complete routing update. If the routing information of a node does not include the identifier of the target, it means that the node is on the path before the switching node is switched. For example, the node can be a second relay node or a source node.

[0039] With reference to the fourteenth possible implementation manner of the first aspect, in a fifteenth possible implementation manner of the first aspect, the first message is used to indicate that the switching node leaves the source node and accesses the target node, and the second message is used to indicate that the switching node leaves the source node and accesses the target node; or, the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node accesses the target node.

[0040] That is, for the second relay node or the target node, the content indicated by the received message needs to be passed out, that is, the first message can indicate the same content as the second message.

[0041] With reference to the first possible implementation manner of the first aspect, in a sixteenth possible implementation manner of the first aspect, the first node determining the third node receiving the second message comprises: the first node determining that the routing information of the first node includes the information of the target node, and then determining that the third node is the child node of the first node.

[0042] For a node, if the routing information of the node includes the information of the target node, it means that the node is on the path after the switching node is switched. Since the routing information of the child node of the node does not include the information of the target node, it means that the node is also on the path before the switching node is switched. For example, the node can be the first common node in the direction close to the UE of the two paths, that is, the core node in the embodiment of the application. In addition, since the nodes other than the core node and the nodes in the downlink of the core node in the core point IAB network in the embodiment of the application do not need to perform routing update and do not need to be signaled, and the nodes on the path after the switching node is switched, such as the first relay node and the target node, have completed routing update, the core node needs to send a message to the child node of the core node to indicate the joining condition of the switching node.

[0043] In a seventeenth possible implementation of the first aspect, in combination with the sixteenth possible implementation of the first aspect, the first message is used to indicate that the switching node leaves the source node and the switching node accesses the target node, and the second message is used to indicate that the switching node accesses the target node; or, the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node accesses the target node.

[0044] For the second relay node, the received first message can be different from the second message sent to the child node, and the sent second message is used to indicate that the switching node accesses the target node.

[0045] In an eighteenth possible implementation of the first aspect, in combination with the first possible implementation of the first aspect, the first node determining, according to the first message, the third node receiving the second message comprises: the first node determining that the information of the target node is different from the information of the first node, and determining that the third node is a child node of the first node.

[0046] For the first relay node, if the first relay node is not the target node, the first relay node needs to send the second message to its own node to indicate the joining of the switching node.

[0047] In a nineteenth possible implementation of the first aspect, in combination with the eighteenth possible implementation of the first aspect, the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node accesses the target node.

[0048] In a twentieth possible implementation of the first aspect, in combination with any one of the sixteenth to nineteenth possible implementations of the first aspect, the first node determining that the third node is a child node of the first node comprises: the first node determining, according to routing information of the first node, that a next hop to the target node is the third node.

[0049] When the first node is the first relay node, the first relay node receives the information of the target node in the message, and the second relay node can determine how to send the message to indicate the switching of the node based on the information of the target node.

[0050] In a second aspect, a device is disclosed, which serves as a first node and comprises: a receiving unit configured to receive a first message sent by a second node, the first message being used to indicate that a switching node leaves a source node and / or the switching node accesses a target node; the source node being a node connected before switching of the switching node, and the target node being a node connected after the switching of the switching node; and an updating unit configured to update routing information of the first node according to the first message.

[0051] In specific implementation, the first node is any one of the following nodes: the target node, the source node, the core node, a first relay node between the target node and the core node, a second relay node between the source node and the core node; the core node is the first common node in the uplink direction of the target node and the source node; and the second node is any one of the following nodes: the switching node, the target node, the source node, the core node, the first relay node, and the second relay node.

[0052] It can be seen that when the node switching causes the network topology to change, only the core node and the nodes downstream of the core node exchange messages indicating the node switching, and the routing is updated. In the prior art, after a node in the IAB network is switched, each node on the path to the host base station before the node switching receives a message indicating the node switching, and updates the routing information. Meanwhile, all nodes on the path to the host base station after the node switching also receive a message indicating the node switching and update the routing information. In comparison, in the embodiment of the present application, the nodes other than the core node and the nodes downstream of the core node in the IAB network do not need to update the routing, and these nodes do not need to be signaled, thereby saving signaling overhead. Meanwhile, due to the reduction in the number of nodes that update the routing, the entire network can recover communication in a relatively short time, thereby shortening the data interruption time.

[0053] With reference to the second aspect, in a first possible implementation manner of the second aspect, the device further includes a determination unit. The determination unit is configured to determine a third node receiving the second message according to the first message, and send the second message to the third node, the second message being used to indicate that the switching node leaves the source node and / or the switching node accesses the target node; and the third node is any one of the following nodes: the source node, the core node, the target node, the first relay node, and the second relay node.

[0054] With reference to the first possible implementation manner of the second aspect, in a second possible implementation manner of the second aspect, the second message further includes routing information of the switching node.

[0055] With reference to the second aspect or the first or second possible implementation manner of the second aspect, in a third possible implementation manner of the second aspect, the first message further includes routing information of the switching node.

[0056] With reference to the first possible implementation manner of the second aspect, in a fourth possible implementation manner of the second aspect, the determination unit is specifically configured to determine that the routing information of the first node does not include information of the switching node and / or the routing information of the first node does not include information of the source node, and then determine that the third node is a parent node of the first node.

[0057] With reference to the fourth possible implementation manner of the second aspect, in the fifth possible implementation manner of the second aspect, the first message is used to indicate that the switching node leaves the source node and accesses the target node, and the second message is used to indicate that the switching node leaves the source node and accesses the target node; or the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node accesses the target node.

[0058] With reference to the first possible implementation manner of the second aspect, in the sixth possible implementation manner of the second aspect, the determining unit is specifically configured to: determine that the routing information of the first node includes information of the switching node and / or the routing information of the first node includes information of the source node, and determine that the third node is a child node of the first node.

[0059] With reference to the sixth possible implementation manner of the second aspect, in the seventh possible implementation manner of the second aspect, the first message is used to indicate that the switching node leaves the source node and accesses the target node, and the second message is used to indicate that the switching node leaves the source node; or the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node leaves the source node; or the first message is used to indicate that the switching node leaves the source node and accesses the target node, and the second message is used to indicate that the switching node leaves; or the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node leaves.

[0060] With reference to the first possible implementation manner of the second aspect, in the eighth possible implementation manner of the second aspect, the determining unit is specifically configured to: determine that the routing information of the first node includes information of the switching node and the switching node is not a child node of the first node before switching, and determine that the third node is a child node of the first node.

[0061] With reference to the eighth possible implementation manner of the second aspect, in the ninth possible implementation manner of the second aspect, the first message is used to indicate that the switching node leaves, and the second message is used to indicate that the switching node leaves.

[0062] With reference to the sixth, seventh, eighth or ninth possible implementation manner of the second aspect, in the tenth possible implementation manner of the second aspect, the determining unit is specifically configured to: determine, according to the routing information of the first node, that the next hop to the switching node is the third node.

[0063] In a twelfth possible implementation manner of the second aspect, in the first possible implementation manner of the second aspect, the determining unit is specifically configured to determine that the third node is a child node of the first node when the information of the source node is different from the information of the first node; and / or, the third node is a child node of the first node when the information of the switching node is included in the routing information of the first node and the switching node is not a child node of the first node before switching.

[0064] In the twelfth possible implementation manner of the second aspect, in the eleventh possible implementation manner of the second aspect, the first message is used to indicate that the switching node leaves the source node, and the second message is used to indicate that the switching node leaves the source node.

[0065] In the thirteenth possible implementation manner of the second aspect, in the eleventh or twelfth possible implementation manner of the second aspect, the determining unit is specifically configured to determine that the next hop to the source node is the third node according to the routing information of the first node; and / or, determine that the next hop to the switching node is the third node according to the routing information of the first node.

[0066] In the fourteenth possible implementation manner of the second aspect, in the first possible implementation manner of the second aspect, the determining unit is specifically configured to determine that the third node is a parent node of the first node when the information of the target node is not included in the routing information of the first node.

[0067] In the fifteenth possible implementation manner of the second aspect, in the fourteenth possible implementation manner of the second aspect, the first message is used to indicate that the switching node leaves the source node and the switching node accesses the target node, and the second message is used to indicate that the switching node leaves the source node and the switching node accesses the target node; or, the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node accesses the target node.

[0068] In the sixteenth possible implementation manner of the second aspect, in the first possible implementation manner of the second aspect, the determining unit is specifically configured to determine that the third node is a child node of the first node when the information of the target node is included in the routing information of the first node.

[0069] In the seventeenth possible implementation manner of the second aspect, in the sixteenth possible implementation manner of the second aspect, the first message is used to indicate that the switching node leaves the source node and the switching node accesses the target node, and the second message is used to indicate that the switching node accesses the target node; or, the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node accesses the target node.

[0070] In a twentieth possible implementation manner of the second aspect, in any one of the sixteenth to nineteenth possible implementation manners of the second aspect, the determining unit is specifically configured to determine, according to the routing information of the first node, that the next hop to the target node is the third node.

[0071] In a nineteenth possible implementation manner of the second aspect, in the eighteenth possible implementation manner of the second aspect, the first message is used to instruct the switching node to access the target node, and the second message is used to instruct the switching node to access the target node.

[0072] In a twentieth possible implementation manner of the second aspect, in any one of the sixteenth to nineteenth possible implementation manners of the second aspect, the determining unit is specifically configured to determine, according to the routing information of the first node, that the next hop to the target node is the third node.

[0073] In a twentieth possible implementation manner of the second aspect, in any one of the sixteenth to nineteenth possible implementation manners of the second aspect, the determining unit is specifically configured to determine, according to the routing information of the first node, that the next hop to the target node is the third node.

[0074] In a first possible implementation manner of the third aspect, the processor is further configured to determine, according to the first message, a third node receiving a second message; and the transceiver is further configured to send, to the third node, the second message, the second message being used to instruct the switching node to leave the source node and / or the switching node to access the target node; wherein the third node is any one of the following nodes: the source node, the core node, the target node, the first relay node, and the second relay node.

[0075] In a second possible implementation manner of the third aspect, in combination with the first possible implementation manner of the third aspect, the first node determining the third node receiving the second message according to the first message comprises: the first node determining that the information of the switching node is not included in the routing information of the first node and / or the information of the source node is not included in the routing information of the first node, and determining that the third node is a parent node of the first node.

[0076] In a third possible implementation manner of the third aspect, in combination with the second possible implementation manner of the third aspect, the first message is used to indicate that the switching node leaves the source node and accesses the target node, and the second message is used to indicate that the switching node leaves the source node and accesses the target node; or, the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node accesses the target node.

[0077] In a fourth possible implementation manner of the third aspect, in combination with the first possible implementation manner of the third aspect, the processor is further configured to determine that the routing information of the first node includes the information of the switching node and / or the routing information of the first node includes the information of the source node, and determine that the third node is a child node of the first node.

[0078] In a fifth possible implementation manner of the third aspect, in combination with the fourth possible implementation manner of the third aspect, the first message is used to indicate that the switching node leaves the source node and accesses the target node, and the second message is used to indicate that the switching node leaves the source node; or, the first message is used to indicate that the switching node leaves the source node and accesses the target node, and the second message is used to indicate that the switching node leaves; or, the first message is used to indicate that the switching node accesses the target node, and the second message is used to indicate that the switching node leaves.

[0079] In a sixth possible implementation manner of the third aspect, in combination with the third aspect, the processor is further configured to determine that the routing information of the first node includes the information of the switching node and the switching node is not a child node of the first node before switching, and determine that the third node is a child node of the first node.

[0080] In a seventh possible implementation manner of the third aspect, in combination with the sixth possible implementation manner of the third aspect, the first message is used to indicate that the switching node leaves, and the second message is used to indicate that the switching node leaves.

[0081] In a possible implementation of the third aspect, the first message is used to indicate that the switching node leaves the source node, and the second message is used to indicate that the switching node leaves the source node.

[0082] In a possible implementation of the third aspect, the first message is used to indicate that the switching node leaves the source node, and the second message is used to indicate that the switching node leaves the source node.

[0083] In a fourth aspect, a computer readable storage medium is disclosed, which stores instructions; when the instructions are run on the device of the second aspect and any possible implementation of the second aspect, the device performs the route updating method of the first aspect and any possible implementation of the first aspect.

[0084] In a fifth aspect, a wireless communication device is disclosed, which stores instructions; when the instructions are run on the device of the second aspect and any possible implementation of the second aspect, the device performs the route updating method of the first aspect and any possible implementation of the first aspect. In a specific implementation, the wireless communication device can be a chip.

[0085] The detailed description of the second aspect, the third aspect, the fourth aspect, the fifth aspect and any possible implementation of the second aspect, the third aspect, the fourth aspect and the fifth aspect in the present application can refer to the detailed description of the first aspect and any possible implementation of the first aspect; and the beneficial effects of the second aspect, the third aspect, the fourth aspect, the fifth aspect and any possible implementation of the second aspect, the third aspect, the fourth aspect and the fifth aspect can refer to the beneficial effect analysis of the first aspect and any possible implementation of the first aspect, which will not be repeated here. In a sixth aspect, an application embodiment provides a method for canceling a scheduling request, which includes: a device determining that a first scheduling request is triggered; when a medium access control protocol data unit is sent and the medium access control protocol data unit contains a first buffer status report, the device cancels the first scheduling request.

[0086] In a possible implementation of the sixth aspect, the method further includes: the first buffer status report contains a first buffer status, and the first buffer status is a buffer status until the last time when a buffer status report triggering event occurs.

[0087] With reference to the first possible implementation manner of the sixth aspect, in a second possible implementation manner of the sixth aspect, the method further includes: the first buffer status is a buffer status until an event of triggering a buffer status report before the media access control protocol data unit packet.

[0088] With reference to the sixth aspect or the first or second possible implementation manner of the sixth aspect, in a third possible implementation manner of the sixth aspect, the method further includes: the first scheduling request is a scheduling request triggered before the media access control protocol data unit packet; or, the first scheduling request is a scheduling request triggered by a second buffer status report, wherein the media access control protocol data unit contains a buffer status at an event of triggering the second buffer status report.

[0089] With reference to the sixth aspect, in a fourth possible implementation manner of the sixth aspect, the method further includes: the first buffer status report does not contain a first buffer status, and the first buffer status is a buffer status until an event of triggering a buffer status report.

[0090] With reference to the fourth possible implementation manner of the sixth aspect, in a fifth possible implementation manner of the sixth aspect, the method further includes: the first scheduling request is a scheduling request triggered before the media access control protocol data unit packet; or, the first scheduling request is a scheduling request triggered by a second buffer status report, wherein the media access control protocol data unit contains a buffer status at an event of triggering the second buffer status report.

[0091] With reference to the sixth aspect or any one of the first to fifth possible implementation manners of the sixth aspect, in a sixth possible implementation manner of the sixth aspect, the method further includes: the device stops a scheduling request prohibit timer of the first scheduling request.

[0092] In a seventh aspect, the application provides a buffer status report cancellation method, including: a device determines that a first buffer status report is triggered; when a media access control protocol data unit is sent, and the media access control protocol data unit contains a buffer status report, the device cancels the first buffer status report.

[0093] With reference to the seventh aspect, in a first possible implementation manner of the seventh aspect, the method further includes: the first buffer status report is a buffer status report triggered before the media access control protocol data unit packet.

[0094] With reference to the seventh aspect, in a second possible implementation manner of the seventh aspect, the method further includes: the media access control protocol data unit contains a buffer status at an event of triggering the first buffer status report.

[0095] In an eighth aspect, a device is disclosed, the device comprising: a determining unit configured to determine that a first scheduling request is triggered; and a canceling unit configured to cancel the first scheduling request when a medium access control protocol data unit is transmitted and the medium access control protocol data unit contains a first buffer status report.

[0096] With reference to the eighth aspect, in a first possible implementation form of the eighth aspect, the device further comprises: the first buffer status report contains a first buffer status, the first buffer status being a buffer status until an event of triggering a buffer status report most recently.

[0097] With reference to the first possible implementation form of the eighth aspect, in a second possible implementation form of the eighth aspect, the device further comprises: the first buffer status being a buffer status until an event of triggering a buffer status report most recently before the medium access control protocol data unit is packetized.

[0098] With reference to the eighth aspect or any one of the first or second possible implementation form of the eighth aspect, in a third possible implementation form of the eighth aspect, the device further comprises: the first scheduling request being a scheduling request triggered before the medium access control protocol data unit is packetized; or the first scheduling request being a scheduling request triggered by a second buffer status report, wherein the medium access control protocol data unit contains a buffer status at an event of triggering the second buffer status report.

[0099] With reference to the eighth aspect, in a fourth possible implementation form of the eighth aspect, the device further comprises: the first buffer status report does not contain a first buffer status, the first buffer status being a buffer status until an event of triggering a buffer status report most recently.

[0100] With reference to the fourth possible implementation form of the eighth aspect, in a fifth possible implementation form of the eighth aspect, the device further comprises: the first scheduling request being a scheduling request triggered before the medium access control protocol data unit is packetized; or the first scheduling request being a scheduling request triggered by a second buffer status report, wherein the medium access control protocol data unit contains a buffer status at an event of triggering the second buffer status report.

[0101] With reference to the eighth aspect or any one of the first to fifth possible implementation form of the eighth aspect, in a sixth possible implementation form of the eighth aspect, the device further comprises: a stopping unit configured to stop a scheduling request prohibit timer of the first scheduling request.

[0102] In a ninth aspect, a device is disclosed, the device comprising: a determining unit configured to determine that a first buffer status report is triggered; a canceling unit configured to cancel the first buffer status report when a medium access control protocol data unit is transmitted and the medium access control protocol data unit contains a buffer status report.

[0103] With reference to the ninth aspect, in a first possible implementation form of the ninth aspect, the device further comprises: the first buffer status report is a buffer status report triggered before the medium access control protocol data unit is packed.

[0104] With reference to the ninth aspect, in a second possible implementation form of the ninth aspect, the device further comprises: the medium access control protocol data unit contains a buffer status at an event triggering the first buffer status report.

[0105] In a tenth aspect, a device is disclosed, the device comprising: a processor configured to determine that a first scheduling request is triggered; and the processor configured to cancel the first scheduling request when a medium access control protocol data unit is transmitted and the medium access control protocol data unit contains a first buffer status report.

[0106] With reference to the tenth aspect, in a first possible implementation form of the tenth aspect, the device further comprises: the first buffer status report contains a first buffer status, the first buffer status being a buffer status until an event triggering a buffer status report last time.

[0107] With reference to the first possible implementation form of the tenth aspect, in a second possible implementation form of the tenth aspect, the device further comprises: the first buffer status is a buffer status until an event triggering a buffer status report last time before the medium access control protocol data unit is packed.

[0108] With reference to the tenth aspect or any one of the first or second possible implementation form of the tenth aspect, in a third possible implementation form of the tenth aspect, the device further comprises: the first scheduling request is a scheduling request triggered before the medium access control protocol data unit is packed; or the first scheduling request is a scheduling request triggered by a second buffer status report, wherein the medium access control protocol data unit contains a buffer status at an event triggering the second buffer status report.

[0109] With reference to the tenth aspect, in a fourth possible implementation form of the tenth aspect, the device further comprises: the first buffer status report does not contain a first buffer status, the first buffer status being a buffer status until an event triggering a buffer status report last time.

[0110] In a fourth possible implementation manner of the tenth aspect, in a fifth possible implementation manner of the tenth aspect, the device further includes that the first scheduling request is a scheduling request triggered before the media access control protocol data unit is packaged; or the first scheduling request is a scheduling request triggered by a second buffer status report, wherein the media access control protocol data unit contains buffer status at the time when the second buffer status report is triggered.

[0111] In a sixth possible implementation manner of the tenth aspect, in combination with the tenth aspect or any one of the first to fifth possible implementation manners of the tenth aspect, the device further includes that the processor stops a scheduling request prohibit timer of the first scheduling request.

[0112] In an eleventh aspect, a device is disclosed, which includes a processor configured to determine that a first buffer status report is triggered; and cancel the first buffer status report when a media access control protocol data unit is transmitted and the media access control protocol data unit contains a buffer status report.

[0113] In a first possible implementation manner of the eleventh aspect, in combination with the eleventh aspect, the device further includes that the first buffer status report is a buffer status report triggered before the media access control protocol data unit is packaged.

[0114] In a second possible implementation manner of the eleventh aspect, in combination with the eleventh aspect, the device further includes that the media access control protocol data unit contains buffer status at the time when the first buffer status report is triggered.

[0115] In a twelfth aspect, a computer readable storage medium is disclosed, which stores instructions; when the instructions are run on the device of the eighth aspect and any one of the possible implementation manners thereof, the device executes the method for canceling a request as described in the sixth aspect and various possible implementation manners thereof.

[0116] In a thirteenth aspect, a computer readable storage medium is disclosed, which stores instructions; when the instructions are run on the device of the ninth aspect and any one of the possible implementation manners thereof, the device executes the method for canceling a buffer status report as described in the seventh aspect and various possible implementation manners thereof.

[0117] In a fourteenth aspect, a wireless communication apparatus is disclosed, wherein the wireless communication apparatus stores instructions that, when executed by a device as discussed in the eighth aspect and any of its possible implementation forms, cause the device to perform the method for canceling a request as discussed in the sixth aspect and its possible implementation forms. In particular implementations, the wireless communication apparatus can be a chip.

[0118] In a fifteenth aspect, a wireless communication apparatus is disclosed, wherein the wireless communication apparatus stores instructions that, when executed by a device as discussed in the ninth aspect and any of its possible implementation forms, cause the device to perform the method for canceling a buffer status report as discussed in the seventh aspect and its possible implementation forms. In particular implementations, the wireless communication apparatus can be a chip.

[0119] The detailed description of the eighth aspect, the tenth aspect, the twelfth aspect, the fourteenth aspect and their possible implementation forms in the present application can refer to the detailed description of the sixth aspect and its possible implementation forms, and the beneficial effects of the eighth aspect, the tenth aspect, the twelfth aspect, the fourteenth aspect and their possible implementation forms can refer to the beneficial effect analysis of the sixth aspect and its possible implementation forms, which will not be repeated here.

[0120] The detailed description of the ninth aspect, the eleventh aspect, the thirteenth aspect, the fifteenth aspect and their possible implementation forms in the present application can refer to the detailed description of the seventh aspect and its possible implementation forms, and the beneficial effects of the ninth aspect, the eleventh aspect, the thirteenth aspect, the fifteenth aspect and their possible implementation forms can refer to the beneficial effect analysis of the seventh aspect and its possible implementation forms, which will not be repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0121] Figure 1 An IAB network structure diagram provided by an embodiment of the present application; Figure 2 A routing update schematic diagram in the prior art; Figure 3 A structure block diagram of a network device provided by an embodiment of the present application; Figure 4 A flowchart of a routing update method provided by an embodiment of the present application; Figure 5 A schematic diagram of a routing update method provided by an embodiment of the present application; Figure 6 Another schematic diagram of a routing update method provided by an embodiment of the present application; Figure 7 Another schematic diagram of a routing update method provided by an embodiment of the present application; Figure 8 Another schematic diagram of a routing update method provided by an embodiment of the present application; Figure 9 Another schematic diagram of the route updating method provided by the embodiment of the present application is provided. Figure 10 Another schematic diagram of the route updating method provided by the embodiment of the present application is provided. Figure 11 Another structural block diagram of the network device provided by the embodiment of the present application is provided. Figure 12 Another structural block diagram of the network device provided by the embodiment of the present application is provided. Figure 13 An application scenario schematic diagram provided by the embodiment of the present application is provided. Figure 14 A flowchart of a scheduling request cancellation method provided by the embodiment of the present application is provided. Figure 15 A flowchart of a buffer status report cancellation method provided by the embodiment of the present application is provided. Figure 16 A schematic diagram of a cancellation method provided by the embodiment of the present application is provided. Figure 17 A structural block diagram of the device provided by the embodiment of the present application is provided. Figure 18 Another structural block diagram of the device provided by the embodiment of the present application is provided. Figure 19 Another structural block diagram of the device provided by the embodiment of the present application is provided. DETAILED DESCRIPTION

[0122] It should be noted that in the present application, “A and / or B” can be understood as any one of “A and B”, or “A”, or “B”. The “first”, “second”, etc. in the specification and claims of the present application and the drawings are used to distinguish similar objects, and do not necessarily describe a specific order or sequence.

[0123] In the fifth generation (5 Generation, 5G) New Radio (New Radio, NR) technology, Integrated Access and Backhaul (Integrated Access and Backhaul, IAB) is supported, Figure 1 is a possible IAB network structure diagram. As Figure 1 shown, RN can be deployed between the host base station and the UE, and data sent by the base station to the UE or data sent by the UE to the base station is forwarded through the RN.

[0124] The host base station is directly connected with the core network, and the host base station can connect multiple RNs. The UE can be indirectly connected with the host base station through one or more RNs, that is, the path between the UE and the host base station is a multi-hop path or multi-connection, and the link between the host base station and the RN and the link between the RNs can be a backhaul link or a front haul link. The UE can also be directly connected with the host base station, that is, the path between the UE and the host base station is a one-hop path, and the link between the host base station and the UE and the link between the RN and the UE can be an access link.

[0125] Since there is a multi-hop or multi-connection in the network, the network topology formed can be a hierarchical topology or a mesh topology. For the scenario in which the UE is not directly connected with the host base station, when the host base station sends a data packet to the UE, it first needs to determine which RN to send the data packet to, and in addition, each RN on the path from the host base station to the UE needs to determine, according to its own routing information, which RN is the next hop on the path to the UE, and forward the received data packet to the next hop RN. When the network topology changes, such as a certain RN being switched from the currently connected RN to another RN, if the data packet is still forwarded according to the original routing information, the data packet will be lost. Therefore, when the RN is switched, the RN needs to update its own routing information.

[0126] In the prior art, when the RN switching causes the network topology to change, each RN on the path to the host base station before the RN switching updates the routing information, and at the same time, all RNs on the path to the host base station after the RN switching also update the routing information. For example, referring to Figure 2 , when RN 9 leaves RN 7 and joins RN 8, when RN 7 discovers that RN 9 leaves, it sends a message to its parent node RN 6 indicating "RN 9 leaves RN 7", RN 6 updates its own routing information according to the message, and continues to send a message to its parent node RN 3 indicating "RN 9 leaves RN 7", and successively sends a message to the upper node indicating "RN 9 leaves RN 7" until reaching the host base station. The host base station and each RN receiving the "RN 9 leaves RN 7" message updates its own routing information according to the "RN 9 leaves RN 7" message. Further, when RN 8 discovers that RN 9 joins, it sends a message to its parent node RN 5 indicating "RN 9 joins RN 8", RN 5 updates its own routing information according to the message, and continues to send a message to its parent node RN 3 indicating "RN 9 joins RN 8", and successively sends a message to the upper node indicating "RN 9 leaves RN 7", until reaching the host base station. The host base station and each RN receiving the "RN 9 joins RN 8" message updates its own routing information according to the "RN 9 joins RN 8" message.

[0127] Generally, the routing information of an RN refers to the next hop on the path of the RN to a certain node (RN or UE). Actually, the change of network topology does not affect the routing information of some RNs. For example: Figure 2 In the case where RN8 switches from RN6 to RN7, the next hop to RN8 for the donor base station is still RN1 and the next hop to RN8 for RN1 is still RN3. Therefore, the donor base station or these RNs actually do not need to update the routing information and do not need to receive the message of "RN9 joins RN8" or the message of "RN9 leaves RN7", resulting in redundant signaling overhead. More importantly, after the change of network topology, only when all the RNs on the path to the donor base station before the switching of the RN and all the RNs on the path to the donor base station after the switching of the RN complete the update of routing information, the donor base station can resend data packets from the new path, resulting in a long data interruption time.

[0128] Embodiments of the present application provide a routing update method. After a node switching, a first node receives a first message sent by a second node. The first message is used to indicate that a switching node leaves a source node and / or the switching node accesses a target node. The source node is a node connected by the switching node before the switching, and the target node is a node connected by the switching node after the switching. The first node can also update its own routing information according to the first message. Specifically, the first node is any one of the following nodes: the target node, the source node, a core node, a first relay node between the target node and the core node, and a second relay node between the source node and the core node. The second node is any one of the following nodes: the switching node, the target node, the source node, the core node, the first relay node, and the second relay node. The core node is the first common node in the uplink direction of the target node and the source node. In the prior art, after a node in an IAB network switches, each node on the path to the donor base station before the switching of the node updates the routing information, and all the nodes on the path to the donor base station after the switching of the node also update the routing information. In comparison, in the embodiments of the present application, only the core node and the nodes below the core node update the routing information, and the other nodes in the IAB network do not need to update the routing information and do not need to be signaled, thereby saving the signaling overhead, and the number of nodes that update the routing information is greatly reduced. The entire network can recover communication in a short time, and the data interruption time is shortened.

[0129] It should be noted that the naming of the nodes (such as: the first node, the core node, the relay node, etc.) in the embodiments of the present application is only for the convenience of description, and the naming of the nodes is not limited to these examples provided in the embodiments of the present application. As long as the devices conforming to the corresponding functions can be included in the scope of the embodiments of the present application, such as: base station, access point (AP) and the like. In addition, the nodes below a certain node or the nodes below a certain node in the embodiments of the present application refer to the nodes in the direction close to the UE of the node; the nodes above a certain node or the nodes above a certain node refer to the nodes in the direction close to the core network device (such as: host base station) of the node.

[0130] In the present application, the device can be a network device, and in the following embodiments, the network device is taken as an example for description. In addition, user equipment and the like can also be included in the scope of the present application.

[0131] The routing update method provided by the embodiments of the present application can be applied to Figure 3 The network device shown in the figure can be the node described in the embodiments of the present application, and the node can be any one of the following nodes: a switching node, a target node, a source node, a first relay node, a second relay node, and a core node.

[0132] As Figure 3 The network device can include at least one processor 11, a memory 12, a transceiver 13, and a communication bus 14.

[0133] The specific introduction of each component of the network device will be described below. Figure 3 The processor 11 is the control center of the network device, which can be one processor or a plurality of processing elements. For example, the processor 11 is a central processing unit (CPU), which can also be an application specific integrated circuit (ASIC), or an integrated circuit configured to implement one or more embodiments of the present application, such as: one or more microprocessors (digital signal processor, DSP), or one or more field programmable gate arrays (FPGA).

[0134] The processor 11 can execute various functions of the network device by running or executing the software program stored in the memory 12 and calling the data stored in the memory 12.

[0135] ​In particular implementations, as one example, the processor 11 can include one or more CPUs, such as the CPU0 and CPU1 shown in FIG. 1. Figure 3 In particular implementations, as one example, the processor 11 can include one or more CPUs, such as the CPU0 and CPU1 shown in FIG. 1.

[0136] In particular implementations, as one example, the network device can include multiple processors, such as the processor 11 and processor 15 shown in FIG. 1. Figure 3 In particular implementations, as one example, the network device can include multiple processors, such as the processor 11 and processor 15 shown in FIG. 1.

[0137] The memory 12 can be read-only memory (ROM) or other type of static storage devices that can store static information and instructions, random access memory (RAM) or other type of dynamic storage device that can store information and instructions, Electrically Erasable Programmable Read-Only Memory (EEPROM), Compact Disc Read-Only Memory (CD-ROM) or other optical disk storage, magneto-optical storage, semiconductor storage or other storage devices or memory that can be used for carrying or storing desired program code in the form of instructions or data structures that can be accessed by a computer, but not limited to. The memory 12 can exist independently, and connected to the processor 11 through the communication bus 14. The memory 12 can also be integrated with the processor 11.

[0138] The memory 12 is configured to store software programs for implementing the solutions of the present application, and the processor 11 is configured to control the execution of the software programs.

[0139] The transceiver 13 is configured to communicate with other nodes in the system shown in FIG. 1, such as other relay nodes, core nodes, target nodes, source nodes, etc., using any transceiver or similar device. Or the transceiver 13 is configured to communicate between the network device and the base station in FIG. 1. The transceiver 13 can also be configured to communicate with a communication network, such as an Ethernet, a radio access network (RAN), a Wireless Local Area Networks (WLAN), etc. The transceiver 13 can include a receiving unit to implement the receiving function, and a transmitting unit to implement the transmitting function. Figure 1 The transceiver 13 is configured to communicate with other nodes in the system shown in FIG. 1, such as other relay nodes, core nodes, target nodes, source nodes, etc., using any transceiver or similar device. Or the transceiver 13 is configured to communicate between the network device and the base station in FIG. 1. The transceiver 13 can also be configured to communicate with a communication network, such as an Ethernet, a radio access network (RAN), a Wireless Local Area Networks (WLAN), etc. The transceiver 13 can include a receiving unit to implement the receiving function, and a transmitting unit to implement the transmitting function. Figure 1 The transceiver 13 is configured to communicate with other nodes in the system shown in FIG. 1, such as other relay nodes, core nodes, target nodes, source nodes, etc., using any transceiver or similar device. Or the transceiver 13 is configured to communicate between the network device and the base station in FIG. 1. The transceiver 13 can also be configured to communicate with a communication network, such as an Ethernet, a radio access network (RAN), a Wireless Local Area Networks (WLAN), etc. The transceiver 13 can include a receiving unit to implement the receiving function, and a transmitting unit to implement the transmitting function.

[0140] The communication bus 14 can be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, Figure 3 In the drawings, only one thick line is used to represent the bus, but it does not mean that there is only one bus or only one type of bus.

[0141] Figure 3 The device structure shown in the drawings does not constitute a limitation on the network device, and can include more or fewer components than shown, or combine certain components, or different component arrangements.

[0142] The embodiment of the present application provides a routing update method, such as Figure 4 As shown in the figure, the method comprises the following steps: 401、The first node receives the first message sent by the second node, and the first message is used to indicate that the switching node leaves the source node and / or the switching node accesses the target node.

[0143] It should be noted that the source node in the embodiment of the present application is a node connected before the switching of the switching node, and the target node is a node connected after the switching of the switching node. In addition, the switching node is an RN switched from the source node to the target node, and the switching node accesses the target node, which can be considered that the switching node joins the target node, that is, the switching node establishes a connection with the target node. The source node can be a host base station or an RN, and the target node can be a host base station or an RN. As shown in the figure, Figure 2 The switching node is RN9, the target node can be RN8, and the source node can be RN7.

[0144] In a specific implementation, the first node is any one of the following nodes: the target node, the source node, the core node, the first relay node, and the second relay node.

[0145] The second node is any one of the following nodes: the switching node, the target node, the source node, the core node, the first relay node, and the second relay node.

[0146] In a specific implementation, the first node and the second node can be different nodes, and further, the first node can be directly connected with the second node.

[0147] In addition, the core node can be the first common node in the uplink direction of the target node and the source node.Figure 2 As shown in the network, RN9 leaves RN7 and joins RN8, that is, RN7 is a source node, RN8 is a target node, and RN7 and RN8 are the first common node in the uplink direction, which can be considered as the first convergence point in the direction of the path of RN7 and RN8 close to the host base station, such as Figure 2 RN3 in FIG. 1.

[0148] In a specific implementation, the core node can also be a target node or a source node.

[0149] The first relay node is a relay node between the target node and the core node. That is, the target node and the core node can not be directly connected, but indirectly connected through one or more relay nodes. In an embodiment of the application, one or more relay nodes between the target node and the core node can be referred to as a first relay node, such as Figure 2 RN5 in FIG. 1. Of course, the target node and the core node can also be directly connected, that is, there is no first relay node.

[0150] The second relay node is a relay node between the source node and the core node. That is, the source node and the core node can not be directly connected, but indirectly connected through one or more relay nodes. In an embodiment of the application, one or more relay nodes between the source node and the core node can be referred to as a second relay node, such as Figure 2 RN6 in FIG. 1. Of course, the source node and the core node can also be directly connected, that is, there is no second relay node.

[0151] In an embodiment of the application, the core node and the nodes below the core node can receive a message indicating the node switching condition, such as the first message described above. Referring to Figure 2 the network shown in FIG. 1, the first node can be any one of RN3, RN5, RN6, RN7, and RN8, and the second node can be any one of RN3, RN5, RN6, RN7, RN8, and RN9, and of course the first node and the second node are different nodes. For example, RN9 (second node) sends the first message to RN8 (first node), and RN5 (second node) sends the first message to RN3 (first node).

[0152] It should be noted that the first message can be used to indicate that the switching node leaves the source node and accesses the target node. For example, the first message is used to indicate that a node leaves node A and accesses node B. In this implementation, the first message can carry the information of the switching node, the information of the target node, and the information of the source node. In the embodiment of the application, the information of a node can be understood as an information capable of indicating the node, or an information capable of indicating the routing mode of the node in the routing information, or the identifier of the node. For example, the information of the switching node can be the identifier of the switching node, the information of the target node can be the identifier of the target node, and the information of the source node can be the identifier of the source node. The embodiment of the application does not limit this. Further, the arrangement order of the identifiers of the switching node, the target node, and the source node in the first message can be used to identify whether a certain identifier indicates the source node, the target node, or the switching node. For example, the first message includes “RN7, RN8, RN9”, in which the identifier of the source node is arranged at the front, the identifier of the target node is arranged in the middle, and the identifier of the switching node is arranged at the end. Of course, the scheme of identifying the nodes by the arrangement order of the node identifiers in the first message is not limited to the above possible implementation, and other possible implementations can also be used. The embodiment of the application does not limit this.

[0153] In another implementation, the node identifiers in the first message can also be distinguished by bit positions. For example, the first message includes “00RN7, 01RN8, 10RN9”, in which “00” is used to indicate the source node, i.e., RN7 is the identifier of the source node; “01” is used to indicate the target node, i.e., RN8 is the identifier of the target node; and “10” is used to indicate the switching node, i.e., RN9 is the identifier of the switching node.

[0154] Of course, other ways can also be used to distinguish the nodes corresponding to the node identifiers in the first message, or other ways (non-node identifiers) can be used to represent the corresponding nodes. The embodiment of the application does not limit this.

[0155] In some embodiments, the first message can be used to indicate that the switching node leaves the source node. For example, the first message is used to indicate that a node leaves node A. The first message can carry the identifier of the switching node and the identifier of the source node. How to distinguish the node corresponding to the node identifier in the first message can refer to the above several implementations, and the embodiment of the application does not repeat this here.

[0156] In some embodiments, the first message can be used to indicate that the switching node leaves. In this implementation, the first message can carry the identifier of the switching node.

[0157] In some embodiments, the first message is used to indicate that the switching node accesses the target node. For example, the first message is used to indicate that a certain node joins the Node B. The first message can carry the identity of the switching node and the identity of the target node. How to distinguish the node identity in the first message corresponds to the switching node or the target node can refer to the above-mentioned several implementation manners, and the embodiments of the present application will not be described here.

[0158] In some embodiments, the switching node can not be the end of the path, i.e. other RNs can be connected after the switching node. Referring to Figure 2 , the child node of the switching node RN9 is RN10, and the RN9 saves the routing information related to the RN10, such as "directly connected with RN10". Based on this, when the switching node switches, the first message sent by the first node can also carry the routing information of the switching node, such as the first message sent by the RN9 also carries the routing information of the RN9 "directly connected with RN10". It should be noted that the child node of a certain node can be understood as the node directly connected with the certain node in the downlink direction, i.e. it can be understood as the next hop directly connected with the certain node. The "directly connected with node B" in the routing information of node A can be understood as that node B is the child node of node A, and can also be understood as that node B is the next hop directly connected with node A, and the embodiments of the present application do not limit the specific content of the routing information.

[0159] 402、The first node updates the routing information of the first node according to the first message.

[0160] Specifically, in the IAB network structure, the host base station has a certain path to each UE, and the path from the host base station to the UE can be determined through the routing information saved by each node (RN). Each node can record the routing information in the form of a routing table.

[0161] Further, the routing table includes the next hop corresponding to each path, which can also be considered as the next hop to a certain node.

[0162] For example, referring to Figure 2In the shown IAB network structure, before the handover of RN9, the path where RN3 is located is: donor base station-RN1-RN3-RN6-RN8-RN9-RN10, donor base station-RN1-RN3-RN5-RN7. The routing table of RN3 can be: directly connected with RN5, directly connected with RN6, RN8->RN6, RN7->RN5, RN9->RN6, RN10->RN6. Among them, RN8->RN6 represents that the next hop from RN3 to RN8 is RN6, RN7->RN5 represents that the next hop from RN3 to RN7 is RN5, RN9->RN6 represents that the next hop from RN3 to RN9 is RN6, and RN10->RN6 represents that the next hop from RN3 to RN10 is RN6.

[0163] In specific implementations, the path can be indicated by a path identifier, and the next hop can be indicated by a node identifier. The path identifier can be the identifier of a node, i.e., representing the path between the donor base station and the node. For example, RN4 can represent the path "donor base station-RN1-RN2-RN4", or there can be a special path identifier representing the path, e.g., "path 4" represents the path "donor base station-RN1-RN2-RN4". The next hop can be represented by a node identifier, e.g., "RN5" in the routing information "RN7->RN5" included in the routing table of RN3 represents that the next hop from RN3 to RN7 is RN5. In specific implementations, each data packet carries a path identifier and a UE identifier, and the donor base station and the RNs can send the data packet to the correct UE through the routing information table.

[0164] In some embodiments, the handover node can not be the end of the path, i.e., there can be other RNs connected after the handover node. Then the handover node itself stores the routing information related to the subordinate nodes, and the first message sent by the first node can also carry the routing information of the handover node. Further, the second message sent by the first node can also include the routing information of the handover node.

[0165] In some embodiments, the first node can also notify other nodes of the node handover situation according to the received first message. Specifically, the first node can determine a third node receiving the second message according to the first message, and send the second message to the third node. Among them, the second message is used to notify other nodes of the node handover situation, and in some embodiments, the second message is used to indicate that the handover node leaves the source node and / or the handover node accesses the target node. In addition, the third node is any one of the following nodes: source node, core node, target node, first relay node, second relay node.

[0166] For example, with reference to Figure 2The third node can be any one of RN3, RN5, RN6, RN7, and RN8. For example, the first message sent by RN9 (the second node) to RN7 (the first node), and then RN7 can send the second message to RN5 (the third node).

[0167] In the embodiments of the present application, the core node and the downlink node of the core node update the routing in the following two cases: First, in some embodiments, the switching node informs the target node of the node switching, and the nodes on the new path (the path after the switching node switches) under the core node can update their routing information according to the joining of the switching node. Then, the core node triggers the nodes on the original path (the path before the switching node switches) under the core node to update their routing information according to the leaving of the switching node. Specifically, the processing process of each node can be divided into the following cases: (1a) When the first node is the target node, the target node receives the first message sent by the switching node, wherein the switching node is the second node.

[0168] In a specific implementation, the first message sent by the switching node can be used to indicate that the switching node leaves the source node and accesses the target node, for example, the first message can carry the identity of the target node, the identity of the source node, and the identity of the switching node. The target node can determine whether the identity of the switching node is included in its routing information, if the target node determines that the identity of the switching node is not included in its routing information, it is determined that the third node is the parent node of the target node. Alternatively, the target node can determine whether the identity of the switching node and the identity of the source node are included in its routing information, if the target node determines that the identity of the switching node and the identity of the source node are not included in its routing information, it is determined that the third node is the parent node of the target node. Alternatively, the target node can determine whether the identity of the source node is included in its routing information, if the target node determines that the identity of the source node is not included in its routing information, it is determined that the third node is the parent node of the target node.

[0169] Further, the target node sends the second message to its parent node, wherein the second message is used to indicate that the switching node leaves the source node and accesses the target node, specifically, the second message can carry the identity of the target node, the identity of the source node, and the identity of the switching node.

[0170] In some embodiments, the first message sent by the switching node is used to indicate that the switching node accesses the target node. In a specific implementation, after the switching is completed, the switching node reports its own identity to the target node, and it can be considered that the switching node indicates to the target node that the switching node accesses the target node. Further, the first message can carry the identity of the switching node. Alternatively, the switching node first obtains the identity of the target node, and after the switching is completed, the switching node sends the first message to the target node to indicate that the switching node accesses the target node. Specifically, the first message can carry the identity of the switching node and the identity of the target node.

[0171] In the scenario where the first message indicates that the switching node accesses the target node, the target node can also determine whether the identity of the switching node is included in its own routing information. If the target node determines that the identity of the switching node is not included in its own routing information, it determines that the third node is the parent node of the target node. The target node then sends a second message to its parent node, wherein the second message is used to indicate that the switching node accesses the target node, and further, the second message carries the identity of the target node and the identity of the switching node.

[0172] In some embodiments, if the first message received by the target node carries the identity of the target node, the target node can also determine whether the identity of the target node in the first message is the same as its own identity before sending the second message to its parent node. If the target node determines that the identity of the target node in the first message is the same as its own identity, the target node sends the second message to its parent node.

[0173] It should be noted that the parent node of a certain node in the embodiments of the present application refers to a node directly connected to the node in an uplink direction. The parent node of the target node is the first relay node directly connected to the target node. In addition, the target node can also update its own routing information according to the joining of the switching node, such as adding the routing information "directly connected to the switching node". Wherein, the switching node is the second node, the target node is the first node, and the first relay node or the core node connected to the target node is the third node.

[0174] (1b) When the first node is the first relay node, the first relay node receives the first message sent by its child node (the second node).

[0175] In a specific implementation, the first message received by the first relay node can be used to indicate that the switching node leaves the source node and accesses the target node, for example, the first message can carry the identity of the target node, the identity of the source node and the identity of the switching node. The first relay node can determine whether the identity of the switching node is included in its own routing information. If the identity of the switching node is not included in the routing information of the first relay node, the third node is determined to be the parent node of the first relay node. Alternatively, the first relay node can determine whether the identity of the switching node and the identity of the source node are included in its own routing information. If the identity of the switching node and the identity of the source node are not included in the routing information of the first relay node, the third node is determined to be the parent node of the first relay node. Alternatively, the first relay node can determine whether the identity of the source node is included in its own routing information. If the identity of the source node is not included in the routing information of the first relay node, the third node is determined to be the parent node of the first relay node.

[0176] Further, the first relay node sends a second message to its parent node, wherein the second message is used to indicate that the switching node leaves the source node and accesses the target node. Specifically, the second message can carry the identity of the target node, the identity of the source node and the identity of the switching node.

[0177] In other embodiments, the first message received by the first relay node is used to indicate that the switching node accesses the target node, for example, the first message can carry the identity of the switching node and the identity of the target node. The first relay node determines that the identity of the switching node is not included in its own routing information, and then determines that the third node is the parent node of the first relay node. The first relay node then sends a second message to its parent node, wherein the second message is used to indicate that the switching node accesses the target node. Specifically, the second message carries the identity of the target node and the identity of the switching node.

[0178] That is, each first relay node between the target node and the core node can receive the first message sent by its child node (the first relay node or the target node). After determining that the identity of the switching node is not included in its own routing information and / or the identity of the source node is not included in its own routing information, the second message is sent to its parent node, and the routing information of the first relay node is updated according to the joining of the switching node.

[0179] In some embodiments, before the first relay node sends the second message to its parent node, it can also determine that the identity of the target node is included in its own routing information.

[0180] It should be noted that the child node of a certain node in the embodiment of the present application refers to a node directly connected to the node in the downlink, and the child node of the first relay node can be the target node or other first relay node. The first relay node can be the first node, the child node of the first relay node can be the second node, and the parent node of the first relay node can be the third node.

[0181] In the example, the first relay node connected to the target node receives the message indicating that the switching node leaves the source node and joins the target node sent by the target node, judges whether the switching node in the message is included in the routing information of the first relay node, that is, judges whether the switching node is a newly added node on the path of the first relay node, if the routing information of the first relay node does not include the switching node carried in the message, the first relay node connected to the target node determines that the switching node is a newly added node on the path of the first relay node, and further sends the message indicating that the switching node leaves the source node and joins the target node to the parent node of the first relay node. The parent node of the first relay node can be the core node or other first relay node. Further, the first relay node further updates the routing information according to the joining of the switching node, such as adding the routing information of the next hop to the switching node.

[0182] (1c) When the first node is the core node, the core node receives the first message sent by the first relay node (the second node) directly connected to the core node.

[0183] Specifically, the first message received by the core node can be used to indicate that the switching node leaves the source node and the switching node accesses the target node, for example, the first message can carry the identification of the switching node, the identification of the source node and the identification of the target node. The core node can judge whether the identification of the switching node is included in the routing information of the core node and / or whether the identification of the source node is included in the routing information of the core node. If the routing information of the core node includes the identification of the switching node and / or the identification of the source node, it indicates that the core node is a node on the path before the switching node switches. Since the core node is also a node on the path after the switching node switches, the routing information of the node uplink of the core node will not change because of the switching of the switching node, so the core node does not need to notify the parent node of the node switching, but sends the second message to the child node of the core node. At this time, the child node of the core node is the third node. The second message sent by the core node can indicate that the switching node leaves, and specifically, the second message can include the identification of the switching node.

[0184] In other embodiments, the second message sent by the core node can also be used to indicate that the switching node leaves the source node, and specifically, the second message can carry the identification of the source node and the identification of the switching node.

[0185] In some embodiments, the first message received by the core node can further indicate that the switching node accesses the target node. For example, the first message can carry the identity of the switching node and the identity of the target node. The core node can determine whether the identity of the switching node is included in its routing information. If the identity of the switching node is included in the routing information of the core node, the core node does not need to inform its parent node of the switching of the node, but sends a second message to its child node, which is the third node. The second message sent by the core node is used to indicate that the switching node leaves.

[0186] If the first message received by the core node includes the identity of the target node, the core node can further determine whether the identity of the target node is included in its routing information. If the core node determines that the identity of the target node is included in its routing information, the core node sends a second message to its child node. In addition, the core node can update its routing information according to the first message, such as adding routing information "next hop to the switching node" and deleting routing information related to the next hop corresponding to the path before the switching of the switching node. The core node can be the first node, the first relay node or the target node, and the third node can be the second node. In a special case, the core node can be the source node. For example, node A is connected to node B before the switching of node A, and node A is connected to node C, the child node of node B, after the switching of node A. In this scenario, node B is the source node and the core node. Further, the core node does not need to send the second message.

[0187] (1d) When the first node is the second relay node, the second relay node receives the first message sent by its parent node (the second node).

[0188] In a specific implementation, the first message received by the second relay node is used to indicate that the switching node leaves. Specifically, the first message can carry the identity of the switching node. The second relay node determines whether the identity of the switching node is included in its routing information and whether the switching node was not a child node of the first node before the switching. If the second relay node determines that the identity of the switching node is included in its routing information and that the switching node was not a child node of the first node before the switching, the switching node was not a child node of the first node before the switching can also be understood as the routing information is not "directly connected to the switching node". The third node is determined to be a child node of the second relay node, and the second relay node sends a second message to the third node. The second message is used to indicate that the switching node leaves. Specifically, the second message can carry the identity of the switching node. It should be noted that the child node determined by the second relay node is the next hop on the path from the second relay node to the switching node.

[0189] In some embodiments, the first message received by the second relay node indicates that the switching node leaves the source node. Specifically, the first message can carry the identity of the source node and the identity of the switching node. The second relay node can further determine whether the identity of the source node in the first message is the same as its own identity. If the second relay node determines that the identity of the source node in the first message is different from its own identity, it determines that the third node is its child node, i.e., it sends the second message to its child node. The second message is used to indicate that the switching node leaves the source node, and specifically, the second message can carry the identity of the source node and the identity of the switching node. It should be noted that the child node determined by the second relay node is the next hop on the path from the second relay node to the switching node. Of course, in this scenario, the second relay node can further determine whether its routing information includes the identity of the switching node and the switching node was not a child node of the first node before the switching. If it is determined that the routing information of the second relay node includes the identity of the switching node and the switching node was not a child node of the first node before the switching, it can be understood that the switching node was not directly connected to the first node before the switching, and the third node is determined to be a child node of the second relay node.

[0190] That is, each second relay node between the source node and the core node can receive the first message sent by its parent node (the core node or another second relay node), determine that its routing information includes the identity of the switching node and the switching node was not a child node of the first node before the switching, or determine that its own identity is different from the identity of the source node, i.e., it is not the source node, and then send the second message to its child node. In addition, each second relay node can update its routing information according to the first message after receiving the first message sent by its parent node, such as deleting the routing information related to the next hop on the original path of the switching node. In this way, the nodes on the path below the core node before the switching of the switching node can update their routing information according to the switching of the node.

[0191] It should be noted that the second relay node can receive the first message sent by its parent node (the second node). If it is determined that its routing information includes the identity of the switching node and the switching node is directly connected to it, or if it is determined that its own identity is the same as the identity of the source node, i.e., it is the source node, it does not need to send the second message to its child node, but only needs to update its routing information according to the first message, such as deleting the routing information of the next hop of the switching node on the original path.

[0192] In addition, the child node of a certain node in the embodiment of the present application refers to a node directly connected to the node in the downlink. In a specific implementation, the first node (such as the core node or the second relay node) queries its own routing information, and determines that the next hop to the source node in the routing information is the third node, or determines that the next hop to the switching node is the third node.

[0193] In some embodiments, if the node that switches also connects other nodes (denoted as downlink nodes) in the downlink, the node may carry the downlink nodes to switch together when switching. If the node carries the downlink nodes to switch together when switching, the first message sent by the switching node to the target node also needs to include the routing information of the switching node, which records the routing information related to the downlink nodes. Further, the messages (such as the first message and the second message) sent between the target node, the first relay node, the core node, the second relay node, and the source node also need to carry the routing information of the switching node. Of course, the target node, the first relay node, the core node, the second relay node, and the source node can also update their own routing information according to the routing information of the switching node in the received message, such as adding the next hop to the downlink node or deleting the next hop to the downlink node.

[0194] Secondly, in some embodiments, the switching node notifies the source node of the node switching condition, which can first trigger the nodes in the downlink of the core node on the original path (the path before the switching node switches) to update their own routing information according to the departure of the switching node. Subsequently, the core node triggers the nodes in the downlink of the core node on the new path (the path after the switching node switches) to update their own routing information according to the addition of the switching node. The processing process of each node can be divided into the following types: (2a) When the first node is the source node, the source node receives the first message sent by the switching node, wherein the switching node is the second node.

[0195] Specifically, the first message received by the source node is used to indicate that the switching node leaves the source node and the switching node accesses the target node, for example, the first message can carry the identification of the target node, the identification of the source node, and the identification of the switching node. The second relay node determines whether the routing information of the second relay node includes the identification of the target node. If the source node determines that the routing information of the source node does not include the identification of the target node, the source node determines that the third node is the parent node of the source node, that is, the source node sends the second message to the parent node of the source node, wherein the second message is used to indicate that the switching node leaves the source node and the switching node accesses the target node, for example, the second message carries the identification of the target node, the identification of the source node, and the identification of the switching node.

[0196] In some embodiments, the first message received by the source node is used to indicate that the switching node accesses the target node, for example, the first message can carry the identity of the switching node and the identity of the target node. The source node determines that the identity of the switching node is not included in the routing information of the source node, and then determines that the third node is the parent node of the source node. The source node then sends a second message to the parent node of the source node, wherein the second message is used to indicate that the switching node accesses the target node, for example, the second message carries the identity of the target node and the identity of the switching node.

[0197] In some embodiments, the first message received by the source node is used to indicate that the switching node accesses the target node, for example, the first message can carry the identity of the switching node and the identity of the target node. The source node determines that the identity of the switching node is not included in the routing information of the source node, and then determines that the third node is the parent node of the source node. The source node then sends a second message to the parent node of the source node, wherein the second message is used to indicate that the switching node accesses the target node, for example, the second message carries the identity of the target node and the identity of the switching node.

[0198] In some embodiments, the first message received by the source node is used to indicate that the switching node accesses the target node, for example, the first message can carry the identity of the switching node and the identity of the target node. The source node determines that the identity of the switching node is not included in the routing information of the source node, and then determines that the third node is the parent node of the source node. The source node then sends a second message to the parent node of the source node, wherein the second message is used to indicate that the switching node accesses the target node, for example, the second message carries the identity of the target node and the identity of the switching node.

[0199] (2b) When the first node is the second relay node, the second relay node receives the first message sent by the second node which is the child node of the second relay node.

[0200] In some embodiments, the first message received by the source node is used to indicate that the switching node accesses the target node, for example, the first message can carry the identity of the switching node and the identity of the target node. The source node determines that the identity of the switching node is not included in the routing information of the source node, and then determines that the third node is the parent node of the source node. The source node then sends a second message to the parent node of the source node, wherein the second message is used to indicate that the switching node accesses the target node, for example, the second message carries the identity of the target node and the identity of the switching node.

[0201] In some embodiments, the first message is used to indicate that the switching node accesses the target node, for example, the first message can carry the identity of the switching node and the identity of the target node. The second relay node determines that the identity of the switching node is not included in its routing information, and then determines that the third node is the parent node of the second relay node. The second relay node then sends a second message to its parent node, wherein the second message is used to indicate that the switching node accesses the target node, for example, the second message carries the identity of the target node and the identity of the switching node.

[0202] In some embodiments, the first message received by the second relay node is used to indicate that the switching node leaves and accesses the target node, for example, the first message can carry the identity of the switching node and the identity of the target node. The second relay node determines that the identity of the switching node is not included in its routing information, and then determines that the third node is the parent node of the second relay node. The second relay node then sends a second message to its parent node, wherein the second message is used to indicate that the switching node leaves and accesses the target node, for example, the second message carries the identity of the target node and the identity of the switching node.

[0203] That is, each second relay node between the source node and the core node can receive the first message sent by its child node (which can be a second relay node or a source node), and after determining that the identity of the target node is not included in its routing information, send a second message to its parent node and update its routing information according to the leaving of the switching node. The second relay node can be the first node, the child node of the second relay node can be the second node, and the parent node of the second relay node can be the third node.

[0204] In some embodiments, the second relay node connected to the source node receives the message sent by the source node indicating that the switching node leaves the source node and joins the target node, and determines whether the identity of the target node in the message is included in its routing information. If the identity of the target node in the message is not included in the routing information of the second relay node, i.e., the second relay node determines that the target node is not on the path where the second relay node is located, and it can also be considered that the switching node is not on the path where the second relay node is located after switching, the second relay node sends the message indicating that the switching node leaves the source node and joins the target node to its parent node, instructing the parent node to update the routing information. The parent node of the second relay node can be the core node or another second relay node. Further, the second relay node can also update its routing information according to the leaving of the switching node, such as deleting the routing information "next hop to the switching node".

[0205] In some embodiments, the second relay node can also determine that the identity of the switching node is included in its own routing information and / or the identity of the source node is included in its own routing information before sending the second message to its parent node.

[0206] (2c) When the first node is the core node, the core node receives the first message sent by the second relay node (the second node) directly connected to the core node.

[0207] Specifically, the first message received by the core node is used to indicate that the switching node leaves the source node and the switching node accesses the target node. For example, the first message can carry the identity of the switching node, the identity of the source node and the identity of the target node. The core node can determine whether the identity of the target node is included in its own routing information. If the identity of the target node is included in the routing information of the core node, it indicates that the core node is a common node on the path before and after the switching of the switching node. In the embodiments of the present application, only the core node and the nodes under the core node perform routing update. Therefore, the core node does not need to notify the switching of the node to its parent node, but sends a second message to its child node. At this time, the child node of the core node is the third node. In addition, the second message is used to indicate that the switching node accesses the target node. For example, the second message can carry the identity of the target node and the identity of the switching node.

[0208] In other embodiments, the first message is used to indicate that the switching node accesses the target node. For example, the first message can carry the identity of the switching node and the identity of the target node. The core node can determine whether the identity of the target node is included in its own routing information. If the identity of the target node is included in the routing information of the core node, the core node does not need to notify the switching of the node to its parent node, but sends a second message to its child node. At this time, the child node of the core node is the third node. The second message is used to indicate that the switching node accesses the target node. For example, the second message can carry the identity of the target node and the identity of the switching node.

[0209] For example, the core node can also determine that the identity of the source node is included in its own routing information and / or the identity of the switching node is included in its own routing information before sending the second message to its child node. In addition, the core node can update its own routing information according to the first message, such as adding the routing information "next hop to the switching node" and deleting the routing information of the original next hop of the switching node on the old path.

[0210] The core node can be the first node, the second relay node or the source node can be the second node, and the child node receiving the second message is the third node. The child node is the next hop on the path of the core node to the target node.

[0211] (2d) When the first node is a first relay node, the first relay node receives a first message sent by its parent node, wherein the parent node of the first relay node is the second node.

[0212] Specifically, the first message received by the first relay node indicates that the switching node accesses the target node, for example, the first message can carry the identification of the switching node and the identification of the switching node. The first relay node determines that the identification of the target node in the first message is different from its own identification, and determines that the third node is its child node, i.e., sends a second message to its child node. Wherein, the second message is used to indicate that the switching node accesses the target node.

[0213] That is, each first relay node between the target node and the core node can receive a first message sent by its parent node (core node or other first relay node), determine that its own identification is different from the identification of the target node in the first message, i.e., it is not the target node, and then send a second message to its child node. In some embodiments, the first relay node can also determine that its routing information includes the identification of the target node before sending the second message to its child node. In addition, each first relay node can update its routing information according to the first message after receiving the first message sent by its parent node, such as adding the routing information "next hop to the switching node". In this way, the nodes under the core node on the path after the switching node switches can update their routing information according to the situation of the node switching.

[0214] In a specific implementation, the first node (such as a core node or a first relay node) queries its routing information and determines that the next hop to the target node in the routing information is the third node.

[0215] In some embodiments, if the node that switches also connects other nodes (referred to as downstream nodes) downstream, the node that switches may carry the downstream nodes together when switching. If the node that switches carries the downstream nodes together when switching, the first message sent by the switching node to the source node also needs to include the routing information of the switching node, which records the routing information related to the above-mentioned downstream nodes. Further, the messages (such as the first message and the second message) sent between the target node, the first relay node, the core node, the second relay node and the source node also need to carry the routing information of the switching node. Of course, the target node, the first relay node, the core node, the second relay node and the source node can also update their routing information according to the routing information of the switching node in the received message, such as adding the next hop to the downstream node or deleting the next hop to the downstream node.

[0216] The routing update method provided by the embodiment of the present application, after the switching of the node, the first node receives the first message sent by the second node, and the first message is used to indicate that the switching node leaves the source node and / or the switching node accesses the target node. The first node can also update its own routing information according to the first message. Specifically, the first node is any one of the following nodes: the target node, the source node, the core node, the first relay node between the target node and the core node, and the second relay node between the source node and the core node. The second node is any one of the following nodes: the switching node, the target node, the source node, the core node, the first relay node, and the second relay node. That is, in the embodiment of the present application, after the network topology changes, only the core node and the nodes below the core node perform routing update, and other nodes in the IAB network do not need to perform routing update, and there is no need to signal these nodes, thereby saving the signaling overhead. At the same time, due to the reduction in the number of nodes performing routing update, the communication of the entire network can be restored in a short time, thereby shortening the data interruption time.

[0217] The following describes a routing update method provided by an embodiment of the present application with reference to the accompanying drawings. Specifically, the nodes that need to add routing information are first updated, and after the routing information of these nodes is added, the nodes that need to delete routing information are updated. For example, refer to Figure 5 When the RN 9 leaves the RN 8 and joins the RN 7, the RN 9 sends a message “RN 9 leaves RN 8 and joins RN 7” to the target node RN 7. The message “RN 9 leaves RN 8 and joins RN 7” can carry the identities of the RN 9, the RN 8, and the RN 7.

[0218] Each node (RN) determines how to send a message to indicate the switching of the node according to the received message and its own routing information. Specifically: if the node determines that the identity of the target node RN 7 in the received message is the same as its own identity, that is, the node is the target node RN 7, the RN 7 sends a message to its parent node RN 5 to indicate “RN 9 leaves RN 8 and joins RN 7”.

[0219] If the node determines that its own routing information only includes the identity of the target node, and does not include the identity of the switching node and / or the identity of the source node, it indicates that the node is the first relay node, such as the RN 5. The RN 5 needs to continue to send “RN 9 leaves RN 8 and joins RN 7” to its parent node RN 3. The RN 5 can also update its own routing information table according to the message. Specifically, the information “RN 9->RN 7” is added, that is, the next hop on the path from the RN 5 to the RN 9 is the RN 7.

[0220] If the node judges that its routing information includes not only the identification of the target node RN7, but also the identifications of the source node RN8 and the switching node RN9, it indicates that the node is a core node, such as RN3. RN3 does not need to continue sending "RN9 leaves RN8 to join RN7" to its parent node RN1, but sends a message indicating "RN9 leaves" to its child node (the child node connected with the core node on the path before the switching of RN9) RN6. The message of "RN9 leaves" can carry the identification of the switching node RN9. Further, RN3 updates its routing information according to "RN9 leaves RN8 to join RN7". Specifically, RN3 adds routing information "RN9->RN5", i.e. the next hop on the new path from RN3 to RN9 is RN5. RN3 deletes routing information "RN9->RN6", i.e. the next hop on the old path from RN3 to RN9 is RN6. "RN9->RN5" is the routing information of the new path to RN9, and "RN9->RN6" is the routing information of the old path to RN9.

[0221] At this time, the nodes that need to add routing information have completed routing update, and the next step is for the nodes that need to delete routing information to perform routing update. RN3 indicates "RN9 leaves" to the corresponding child node, wherein the "corresponding child node" is the child node on the path before the switching of RN9, which can be considered as the next hop from RN3 to RN9 before the switching of RN9, such as RN6.

[0222] When RN6 receives the message of "RN9 leaves" sent by RN3, RN6 judges whether its routing information includes the identification of the switching node RN9 and whether its routing information includes "directly connected with RN9". If the routing information of RN6 includes the identification of the switching node and does not include "directly connected with RN9", it sends a message indicating "RN9 leaves" to its child node, such as RN8. Each node receiving the message sent by its parent node judges whether its routing information includes the identification of the switching node RN9 and whether its routing information includes "directly connected with RN9". If it includes the identification of the switching node RN9 and "directly connected with RN9", it sends a message indicating "RN9 leaves" to its child node, and if it includes the identification of the switching node RN9 but does not include "directly connected with RN9", it stops sending. For example, RN6 and RN8 can update their routing information according to the received message ("RN9 leaves"). For example, RN6 deletes information RN9->RN8, i.e. the next hop from RN6 to RN9 is RN8. RN8 deletes information "directly connected with RN9".

[0223] In addition, although Figure 5The message sent by RN3 to RN6 can also be "RN9 leaves RN8", which can carry the identities of RN9 and RN8. RN6 can determine whether the identity of the source node RN8 in the received message is the same as its own identity. If not, it sends a message to its child nodes indicating "RN9 leaves RN8". Each node receiving the "RN9 leaves RN8" message sent by its parent node, such as RN6 and RN8, can determine whether the identity of the source node RN8 is the same as its own identity. If not, it sends a message to its child nodes indicating "RN9 leaves RN8". If the same, it stops sending the message indicating "RN9 leaves RN8".

[0224] In some embodiments, if the node switching has other nodes connected to it, the node switching can carry the other nodes connected to it. If the node switching carries the other nodes connected to it, the node can send its routing information to the target node in addition to indicating to the target node that the node has left the source node and accessed the target node. For example, referring to Figure 6 , RN9 has left RN8 and accessed RN7. RN9 sends a message to RN7 indicating "RN9 has left RN8 and accessed RN7", and the message also needs to include the routing information of RN9. For example, the routing information of RN9 is "directly connected to RN10". Of course, the routing information of the switching node also needs to be included in the messages transmitted between the target node, the first relay node, the core node, the second relay node and the source node. As shown in Figure 6 , the message sent by RN7 to RN5 includes the routing information of RN9 "directly connected to RN10", the message sent by RN5 to RN3 includes the routing information of RN9 "directly connected to RN10", the message sent by RN3 to RN6 includes the routing information of RN9 "directly connected to RN10", and the message sent by RN6 to RN8 includes the routing information of RN9 "directly connected to RN10".

[0225] Although Figure 6 not shown in the figure, the message sent by RN3 to RN6 can also be "RN9 leaves RN8", which can carry the identities of RN9 and RN8. RN6 can determine whether the identity of the source node RN8 in the received message is the same as its own identity. If not, it sends a message to its child nodes indicating "RN9 leaves RN8". Each node receiving the "RN9 leaves RN8" message sent by its parent node, such as RN6 and RN8, can determine whether the identity of the source node RN8 is the same as its own identity. If not, it sends a message to its child nodes indicating "RN9 leaves RN8". If the same, it stops sending the message indicating "RN9 leaves RN8".

[0226] In some embodiments, the message sent by the switching node to the target node can be different from the example given in Figure 5 the message can only indicate that the switching node accesses the target node, and specifically, the message includes the identity of the switching node and the identity of the target node.

[0227] Specifically, referring to Figure 7 When RN9 leaves RN8 and joins RN7, RN9 sends a message to the target node RN7 indicating "RN9 joins RN7", which can carry the identity of RN9 and RN7.

[0228] Each node (RN) determines how to send a message indicating the switching of the node according to the received message and its own routing information table. Specifically: if the node determines that the identity of the target node RN7 in the received message is the same as its own identity, i.e. the node is the target node RN7, RN7 sends a message to its parent node RN5 indicating "RN9 joins RN7". Alternatively, the target node RN7 itself knows that the switching node accesses itself, and according to the received message, the target node RN7 knows the identity of the switching node RN9, and the target node RN7 sends a message "RN9 joins RN7" to its parent node RN5.

[0229] If the node determines that its routing information only includes the identity of the target node, and does not include the identity of the switching node and the identity of the source node, it indicates that the node is the first relay node, such as RN5. RN5 needs to continue to send "RN9 joins RN7" to its parent node RN3. RN5 can also update its routing information table according to the message, specifically, add the information "RN9->RN7", i.e. the next hop on the path from RN5 to RN9 is RN7.

[0230] If the node judges that its routing information includes not only the identification of the target node RN7 but also the identification of the switching node RN9, it indicates that the node is a core node, such as RN3. RN3 does not need to continue sending "RN9 joins RN7" to its parent node RN1, but sends a message indicating "RN9 leaves" to its child node (the child node connected with the core node on the path before the switching of RN9) RN6, and the message carries the identification of the switching node RN9. It should be noted that RN3 needs to find the next hop from RN3 to the switching node RN9 according to its routing information, and send the message indicating "RN9 leaves" to the next hop. For example, the routing information of RN3 includes "RN9->RN6", that is, the next hop from RN3 to the switching node RN9 is RN6, and RN3 sends the message indicating "RN9 leaves" to RN6. In addition, RN3 updates its routing information according to the message, specifically, RN3 adds the information "RN9->RN5", that is, the next hop on the path from RN3 to RN9 is RN5. RN3 deletes the information "RN9->RN6", that is, the next hop on the path from RN3 to RN9 is RN6.

[0231] At this time, the nodes that need to increase the routing information have completed the routing update, and the next step is to delete the routing information of the nodes that need to update the routing. RN3 indicates "RN9 leaves" to the corresponding child node, wherein the "corresponding child node" is the child node on the path before the switching of RN9, which can be considered as the next hop from RN3 to RN9 before the switching of RN9, such as RN6.

[0232] When RN6 receives the message indicating "RN9 leaves" sent by RN3, RN6 judges whether its routing information includes the identification of the switching node RN9 and whether it includes "directly connected with the switching node RN9". If it includes the identification of the switching node RN9 but does not include "directly connected with the switching node RN9", it will send a message indicating "RN9 leaves" to its child node, such as RN8. Each node receiving the message sent by its parent node, such as RN6 and RN8, will judge whether its routing information includes the identification of the switching node RN9 and "directly connected with the switching node RN9". If it includes the identification of the switching node RN9 but does not include "directly connected with the switching node RN9", it will send a message indicating "RN9 leaves" to its child node; if it includes the identification of the switching node RN9 and "directly connected with the switching node RN9", it will stop sending the message indicating "RN9 leaves". Further, it can also update its routing information according to the received message (indicating "RN9 leaves"), such as RN6 deleting the information RN9->RN8, that is, the next hop from RN6 to RN9 is RN8. RN8 deletes the information "directly connected with RN9".

[0233] In some embodiments, if the switching node is connected with other nodes, the switching node can carry the other nodes to switch when switching. If the switching node carries the other nodes to switch when switching, the switching node can send its routing information to the target node in addition to indicating that the target node switches the node away from the source node and accesses the target node. Figure 6 The similar method is shown in the reference

[0234] The following describes a routing update method according to an embodiment of the present application with reference to the accompanying drawings. Specifically, the nodes that need to delete routing information first perform routing update, and the nodes that need to add routing information update their routing information after the nodes delete the routing information. For example, refer to the reference Figure 8 When RN9 accesses RN7 from RN8, RN9 sends a message to the source node RN8 to indicate that "RN9 accesses RN7", and the message can carry the identification of RN9 and RN7.

[0235] Each node (RN) determines how to send a message to indicate the node switching according to the received message and its routing information table. Specifically, the source node knows that the switching node switches and accesses the target node. If the source node RN8 receives a message indicating that "RN9 accesses RN7", RN8 sends a message to its parent node RN6 to indicate that "RN9 accesses RN7". Alternatively, RN9 can send a message to the source node RN8 to indicate that "RN9 accesses RN7", and the source node determines that the identification of the source node RN8 in the received message is the same as its own identification, and RN8 sends a message to its parent node RN6 to indicate that "RN9 accesses RN7". If the node determines that its routing information does not include the identification of the target node RN7, it indicates that the node is the second relay node, for example, RN6. RN6 needs to continue to send "RN9 accesses RN7" to its parent node RN3. RN6 can also update its routing information table according to the message. Specifically, it deletes the information "RN9->RN8", that is, the next hop of the path from RN6 to RN9 is RN8.

[0236] If the node judges that the identity of the target node RN7 is included in its routing information, it indicates that the node is a core node, such as RN3. RN3 does not need to continue to send "RN9 leaves RN8 and joins RN7" to its parent node RN1, but sends a message indicating "RN9 joins RN7" to its child node (the child node connected with the core node on the path after RN9 switches) RN5. The message can carry the identities of RN9 and RN7. RN3 updates its routing information according to "RN9 leaves RN8 and joins RN7". Specifically, RN3 adds information "RN9->RN5", i.e., the next hop on the path from RN3 to RN9 is RN5. RN3 deletes information "RN9->RN6", i.e., the next hop on the path from RN3 to RN9 is RN6.

[0237] At this time, the nodes that need to delete routing information have completed routing update, and the next step is to add routing information for the nodes to perform routing update. RN3 indicates "RN9 joins RN7" to the corresponding child node, where the "corresponding child node" is the child node on the path after RN9 switches, which can be considered as the next hop from RN3 to RN9 after RN9 switches, such as RN5.

[0238] When RN5 receives the message indicating "RN9 joins RN7" sent by RN3, RN5 judges whether the identity of the target node RN7 in the received message is the same as its own identity. If not, it sends a message indicating "RN9 joins RN7" to its child node, such as RN7. Each node (such as RN5 and RN7) that receives the message sent by its parent node judges whether the identity of the target node RN7 in the received message is the same as its own identity. If not, it sends a message indicating "RN9 joins RN7" to its child node. If the same, it stops sending. RN5 and RN7 can update their routing information according to the received message ("RN9 joins RN7"). For example, RN5 adds information "RN9->RN7", i.e., the next hop from RN5 to RN9 is RN7. RN7 adds information "directly connected with RN9".

[0239] In some embodiments, if the node that switches down is also connected with other nodes, the node that switches can carry the other nodes connected with it to switch together when it switches. If the node that switches carries the other nodes connected with it to switch together when it switches, the switching node can send its routing information to the target node in addition to indicating the source node "the switching node accesses the target node". For example, refer to Figure 9RN9 leaves RN8 and accesses RN7, RN9 sends a message to RN8 indicating "RN9 leaves RN8 and joins RN7", and the message also includes the routing information of RN9. For example, the routing information of RN9 is "directly connected with RN10". Of course, the routing information of RN9 also needs to be included in the messages transmitted between the target node, the first relay node, the core node, the second relay node and the source node. As shown in Figure 9 Fig. 6B, the message sent by RN8 to RN6 includes the routing information of RN9 "directly connected with RN10", the message sent by RN6 to RN3 includes the routing information of RN9 "directly connected with RN10", the message sent by RN3 to RN5 includes the routing information of RN9 "directly connected with RN10", and the message sent by RN5 to RN7 includes the routing information of RN9 "directly connected with RN10".

[0240] In some embodiments, the message sent by the switching node RN9 to the source node RN8 can be different from the example given in Figure 8 . Specifically, referring to Figure 10 , when RN9 leaves RN8 and joins RN7, RN9 sends "RN9 joins RN7" to the source node RN8, and the message can carry the identities of RN9 and RN7.

[0241] Each node (RN) determines how to send a message indicating the switching of the node according to the received message and its own routing information table. Specifically: the source node knows that the switching node has switched and left the source node, if the source node RN8 receives a message indicating "RN9 joins RN7", RN8 then sends a message indicating "RN9 joins RN7" to its parent node RN6.

[0242] If a node determines that its routing information does not include the identity of the target node RN7, it means that the node is the second relay node, for example, RN6. RN6 needs to continue to send "RN9 joins RN7" to its parent node RN3. RN6 can also update its routing information table according to the message, specifically, delete the information "RN9->RN8", that is, the next hop on the path from RN6 to RN9 is RN8.

[0243] If the node judges that the identity of the target node RN7 is included in its routing information, it indicates that the node is a core node, such as RN3. RN3 does not need to continue sending "RN9 joins RN7" to its parent node RN1, but sends a message indicating "RN9 joins RN7" to its child node (the child node connected with the core node RN3 on the path after RN9 switches) RN5. RN3 updates its routing information according to the message. Specifically, RN3 adds information "RN9->RN5", i.e. the next hop on the path from RN3 to RN9 is RN5. RN3 deletes information "RN9->RN6", i.e. the next hop on the path from RN3 to RN9 is RN6.

[0244] At this time, the nodes that need to delete routing information have completed routing update, and the next step is to add routing information for the nodes to perform routing update. RN3 indicates "RN9 joins RN7" to the corresponding child node, wherein the "corresponding child node" is the child node on the path after RN9 switches, which can be considered as the next hop from RN3 to RN9 after RN9 switches, such as RN5.

[0245] When RN5 receives the message indicating "RN9 joins RN7" sent by RN3, RN5 judges whether the identity of the target node RN7 in the received message is the same as its own identity. If not, it sends a message indicating "RN9 joins RN7" to its child node, such as RN7. Each node (such as RN5 and RN7) that receives the message sent by its parent node judges whether the identity of the target node RN7 is the same as its own identity. If not, it sends a message indicating "RN9 joins RN7" to its child node. If the same, it stops sending. RN5 and RN7 can update their routing information according to the received message ("RN9 joins RN7"). For example, RN5 adds information "RN9->RN7", i.e. the next hop from RN5 to RN9 is RN7. RN7 adds information "directly connected with RN9".

[0246] Although Figure 8~Figure 10As not shown, the message sent by the switching node RN9 to the source node RN8 can also be "RN9 leaves, RN9 joins RN7". This message can carry the identifiers of RN9 and RN7. RN8 can determine whether its routing information includes the identifier of the target node RN7. If RN8's routing information does not include the identifier of the target node RN7, RN8 sends a message to its parent node RN6 indicating "RN9 leaves, RN9 joins RN7". RN6 can determine whether its routing information includes the identifier of the target node RN7. If RN6's routing information does not include the identifier of the target node RN7, RN8 sends a message to its parent node RN3 indicating "RN9 leaves, RN9 joins RN7". RN3 determines that its routing information includes the identifier of the target node RN7, and then sends a message to its child node RN5 indicating "RN9 joins RN7". This message can carry the identifiers of RN9 and RN7. RN5 receives the message sent by RN3, determines that its identifier is different from the identifier of the target node RN7, and then sends a message to its child node RN7 indicating "RN9 joins RN7". When RN7 receives a message from RN5 and determines that its own identifier is the same as that of the target node RN7, it stops sending messages indicating "RN9 accesses RN7".

[0247] In some embodiments, if the node undergoing switching has other downstream connections, the node switching may include these other connected nodes. If a node switches along with its connected nodes, the switching node, in addition to informing the source node that "the switching node has connected to the target node," can also send its own routing information to the target node. For example, see reference [reference needed]. Figure 9 Similar methods will not be elaborated here.

[0248] The above primarily describes the solutions provided in this application from the perspective of interactions between various nodes. It is understood that the routing update apparatus, in order to achieve the above functions, includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, based on the algorithm steps of the examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0249] The embodiments of the present application can divide the functional modules of the network device according to the above method examples. For example, each functional module can be divided according to each function, or two or more functions can be integrated in one processing module. The integrated module can be realized in the form of hardware or in the form of a software functional module. It should be noted that the division of the modules in the embodiments of the present application is illustrative, and is only a logical function division. In actual implementation, another division manner can be used.

[0250] In the case of dividing each functional module according to each function, the embodiments of the present application provide a communication device. The communication device can be the first node, the second node or the third node related by the embodiments of the present application. In the case of dividing each functional module according to each function, Figure 11 A possible structural schematic diagram of the above communication device is shown. As Figure 11 shown, the network device includes a receiving unit 1101, an updating unit 1102 and a sending unit 1103.

[0251] The receiving unit 1101 is configured to support the network device to perform step 401 in the above embodiments, and / or other processes of the technology described herein. The updating unit 1102 is configured to support the network device to perform step 402 in the above embodiments, and / or other processes of the technology described herein. The sending unit 1103 is configured to support the network device to send a message to another node, for example, when the network device is the first node, the sending unit 1103 is configured to support the first node to send the second message to the third node, and / or other processes of the technology described herein.

[0252] It should be noted that all related contents of each step involved in the above method embodiments can be cited to the function description of the corresponding functional module, which will not be repeated here.

[0253] For example, in the case of using an integrated unit, the structural schematic diagram of the network device provided by the embodiments of the present application is shown in Figure 12 As shown in the figure. In Figure 12 the network device includes a processing module 1201 and a communication module 1202. The processing module 1201 is configured to control and manage the actions of the network device, for example, to perform the steps performed by the updating unit 1102 described above, and / or to perform other processes of the technology described herein. The communication module 1202 is configured to support the interaction between the network device and other devices, for example, to perform the steps performed by the receiving unit 1101 and the sending unit 1103 described above. As Figure 12 shown, the network device can further include a storage module 1203, and the storage module 1203 is configured to store the program code and data of the network device.

[0254] When the processing module 1201 is a processor, the communication module 1202 is a transceiver, and the storage module 1203 is a memory, the network device can be the network device shown in FIG. 1. Figure 3 If the transceiver is a receiver and a transmitter, the receiver performs the steps performed by the receiving unit 1101, and the transmitter performs the steps performed by the sending unit 1103.

[0255] The embodiments of the present application are applied to a 5G communication system or other systems that may appear in the future. The following explains some terms in the present application to facilitate understanding by those skilled in the art. It should be noted that when the scheme of the embodiments of the present application is applied to a 5G system or other systems that may appear in the future, the names of network devices and user devices may change, but this does not affect the implementation of the scheme of the embodiments of the present application.

[0256] 1) User Equipment (UE), also known as user, user equipment, is a device that provides voice and / or data connectivity to users, such as handheld devices with wireless connection functions, vehicle-mounted devices, etc. Common user equipment includes, for example, mobile phones, tablet computers, notebook computers, palm computers, mobile Internet devices (MID), wearable devices, etc., and wearable devices include, for example, smart watches, smart bracelets, pedometers, etc.

[0257] 2) Network device, also known as Radio Access Network (RAN) device, is a device that connects user equipment to a wireless network, which includes network devices in various communication systems, such as, but not limited to, base stations, evolved Node Bs (eNBs), radio network controllers (RNCs), Node Bs (NBs), network device controllers (BSCs), network device transceivers (BTSs), home network devices (such as Home evolved NodeB or Home Node B, HNB), baseband units (BBUs), etc. In addition, network devices include network devices of various frequency systems, such as, but not limited to, low-frequency network devices and high-frequency network devices.

[0258] In the prior art, a user equipment (UE) informs a network equipment (e.g. a base station) how much data in its uplink buffer needs to be transmitted by sending a buffer status report (BSR) so that the network equipment can decide how much uplink resource to allocate to the UE. When a regular BSR is triggered and there is no uplink resource available for use, the UE triggers a scheduling request (SR) to inform the network equipment that it has data to transmit. The network equipment allocates an uplink resource to the UE which is at least enough for the UE to send a BSR. The UE uses the uplink resource to send the BSR to the network equipment. For the cancellation condition of SR, when any one of the following two conditions is met, a pending SR is cancelled: condition 1, when a medium access control (MAC) protocol data unit (PDU) is assembled and contains a BSR, and the BSR contains the buffer status up to the most recent event that triggered the BSR; condition 2, when a transmitted MAC PDU contains all the data available for transmission. For the cancellation condition of BSR, when any one of the following two conditions is met, a triggered BSR can be cancelled: condition 1, when a transmitted MAC PDU is assembled and contains a BSR, the triggered BSR is cancelled; condition 2, when a transmitted MAC PDU contains all the data available for transmission but cannot contain a BSR MAC control element (CE) plus its header any more, the triggered BSR can be cancelled.

[0259] In a fifth generation (5G) new radio (NR) system, when a user equipment receives a downlink scheduling information (DCI) sent by a network equipment on a physical downlink control channel (PDCCH) resource, the downlink scheduling information indicates an uplink grant and also indicates how long a time after the current reception of the downlink scheduling information the indicated uplink grant can be used to send uplink data, for example, the downlink control information indicates a K value, indicating that K time after the reception of the downlink control information the indicated uplink grant can be used to send uplink data. The uplink data is sent on a physical uplink shared channel (PUSCH) resource. The user equipment can start packetizing, i.e., assembling a medium access control (MAC) protocol data unit (PDU), after the reception of the downlink scheduling information, and needs to complete the packetizing before the arrival of the uplink grant, so as to successfully send the assembled MAC PDU using the indicated uplink grant. The user equipment can packetize at any time in the K time period, which depends on the implementation of the user equipment. After the user equipment assembles the MAC PDU, it is very likely that the time to use the uplink grant has not arrived, i.e., the time for the physical uplink shared channel resource to appear has not arrived, at this time the assembled MAC PDU needs to wait for a period of time before it can be sent using the indicated uplink grant, for example, the MAC PDU needs to wait for a period of R time before it can be sent using the indicated uplink grant. That is, in the period of R time, since the SR has been cancelled, even if a physical uplink control channel (PUCCH) resource that can send the SR appears, the SR cannot be sent, and the MAC PDU can only be sent after the period of R time, so that the base station knows that the user equipment has buffered data to send, i.e., the base station cannot know through an earlier SR that the user equipment has buffered data to send, thereby possibly affecting the base station to schedule the uplink data of the user equipment earlier, resulting in an increase in the latency of the uplink data of the user equipment.

[0260] Figure 13 An application scenario provided by an embodiment of the present application is shown in the following figure. Figure 13The networking architecture shown mainly includes a network device 1301 and a user device 1302. The user device 1302 can communicate with the network device 1301. The data sent by the user device 1302 to the network device 1301 is uplink data, and the data sent by the network device 1301 to the user device 1302 is downlink data. The uplink resource (for example, time-frequency resource) used by the user device 1302 to send the uplink data is configured by the network device 1301 through static scheduling, semi-static scheduling, dynamic scheduling, etc. In the embodiment of the application, the user device 1302 informs the network device 1301 (such as a base station) of how much uplink data it needs to send through a BSR, so that the network device 1301 decides how much uplink resource to allocate to the user device 1302. Before sending the BSR, the user device 1302 can have sent an SR to the network device 1301 to inform the network device 1301 that it has data to send, so that the network device 1301 allocates an uplink resource at least sufficient to send the BSR, and the user device 1302 sends the BSR to the network device 1301 using the uplink resource.

[0261] Figure 14 A flowchart of a scheduling request cancellation method provided in the embodiment of the application is shown. The method includes but is not limited to the following steps: Step 1401: The device determines that a first scheduling request is triggered.

[0262] Specifically, the device can be a terminal device. When the trigger condition of triggering the scheduling request is met, the scheduling request will be triggered. The device determining that the first scheduling request is triggered can be understood as the device knowing that the first scheduling request is triggered. At this time, the first scheduling request is a pending scheduling request, which can also be understood as a triggered and uncanceled scheduling request.

[0263] Step 1402: When a medium access control protocol data unit is sent, and the medium access control protocol data unit contains a first buffer status report, the device cancels the first scheduling request.

[0264] Specifically, when the device receives the uplink resource allocated by the network device, the device forms a MAC PDU with the data to be transmitted, and the MAC PDU can contain a buffer status report. When the formed MAC PDU is sent and the MAC PDU contains the first buffer status report, it is considered that the condition for canceling the first scheduling request is met, and the device cancels the first scheduling request to be processed. The first buffer status report contains the first buffer status, which is the buffer status until the last time the buffer status report triggering event is triggered. For example, before the MAC PDU is sent, event 1 triggers the buffer status report at time 1, corresponding to buffer status 1; after time 1 and before the MAC PDU is sent, event 2 triggers the buffer status report at time 2, corresponding to buffer status 2; and there is no new event triggering the buffer status report after the MAC PDU is sent and event 2. At this time, the first buffer status can be considered to be the buffer status of the last event 2 at time 2, that is, the first buffer status can be considered to be buffer status 2.

[0265] It should be noted that the first scheduling request can be one or more, and the device canceling the first scheduling request can be understood as the device canceling all the first scheduling requests. The MAC PDU being sent can be considered as at least one MAC PDU being sent, and the MAC PDU containing the first buffer status report can be considered as the MAC PDU containing at least one first buffer status report, and the present application is not limited thereto. The MAC PDU being sent can be the MAC PDU starting to be sent, or can be the MAC PDU being sent after being sent completely, and the present application is not limited thereto.

[0266] In some embodiments, the first buffer status is the buffer status at the time of the last event triggering a buffer status report before the MAC PDU is assembled. That is, when the MAC PDU is transmitted and the MAC PDU contains a first buffer status report, the first buffer status report contains a first buffer status, the first buffer status is the buffer status at the time of the last event triggering a buffer status report before the MAC PDU is assembled, it is considered that the condition for canceling the first scheduling request is met, and the device cancels the first scheduling request to be processed. For example, before the MAC PDU is assembled, event 1 triggers a buffer status report at time 1, corresponding to buffer status 1, after time 1 and before the MAC PDU is transmitted, event 2 triggers a buffer status report at time 2, corresponding to buffer status 2, after the MAC PDU is assembled and before the MAC PDU is transmitted, event 3 triggers a buffer status report at time 3, corresponding to buffer status 3, at this time, the first buffer status can be considered to be the buffer status of the last event 2 at time 2 before the MAC PDU is assembled, that is, the first buffer status can be considered to be buffer status 2. Alternatively, the first buffer status is the buffer status at the time of the event triggering the first buffer status report.

[0267] In some embodiments, further, the first scheduling request is a scheduling request triggered before the MAC PDU is assembled. For example, before the MAC PDU is assembled, a scheduling request 1 is triggered, after the MAC PDU is assembled and before the MAC PDU is transmitted, a scheduling request 2 is triggered, at this time, the first scheduling request can be considered to be the scheduling request triggered before the MAC PDU is assembled, that is, the scheduling request 1. Alternatively, the first scheduling request is a scheduling request triggered by a second buffer status report, wherein the MAC PDU contains a buffer status at the time of the event triggering the second buffer status report. If there is a triggered buffer status report or scheduling request at present, the MAC PDU will contain a buffer status report when it is assembled, the buffer status report will contain the latest buffer status at the time of the assembly, that is, the buffer status at the time of the last event triggering a buffer status report before the MAC PDU is assembled, that is, the buffer status at the time of the event triggering the second buffer status report, therefore, it can be considered that the second buffer status report is the buffer status report triggered before the MAC PDU is assembled, and the first scheduling request is the scheduling request triggered by the second buffer status report, it can be considered that the first scheduling request is the scheduling request triggered before the MAC PDU is assembled. It should be noted that the first scheduling request can be one or more, that is, the scheduling request triggered before the MAC PDU is assembled is the first scheduling request, and the device canceling the first scheduling request can be understood as the device canceling all the first scheduling requests.

[0268] In some embodiments, the first buffer status report does not contain the first buffer status, which is the buffer status until the event of triggering the last buffer status report. It can also be understood that the first buffer status report contains the second buffer status, which is not the buffer status until the event of triggering the last buffer status report.

[0269] Specifically, further, the first scheduling request is the scheduling request triggered before the MAC PDU is packaged. For example, the scheduling request 1 is triggered before the MAC PDU is packaged, the scheduling request 2 is triggered after the MAC PDU is packaged and before the MAC PDU is sent, at this time, the first scheduling request can be considered as the scheduling request triggered before the MAC PDU is packaged, i.e. the scheduling request 1. Alternatively, the first scheduling request is the scheduling request triggered by the second buffer status report, wherein the MAC PDU contains the buffer status at the event of triggering the second buffer status report. If there is a triggered buffer status report or scheduling request at present, the MAC PDU will contain a buffer status report when it is packaged, the buffer status report will contain the latest buffer status at the time of packaging at present, i.e. the buffer status at the event of triggering the last buffer status report before the MAC PDU is packaged, i.e. the buffer status at the event of triggering the second buffer status report, therefore, the second buffer status report can be considered as the buffer status report triggered before the MAC PDU is packaged, and the first scheduling request is the scheduling request triggered by the second buffer status report, which can be considered as the scheduling request triggered before the MAC PDU is packaged. It should be noted that the first scheduling request can be one or more, i.e. all the scheduling requests triggered before the MAC PDU is packaged are the first scheduling requests, and the cancellation of the first scheduling request by the device can be understood as the cancellation of all the first scheduling requests.

[0270] In some embodiments, the device can also stop the scheduling request prohibit timer of the first scheduling request. Each scheduling request can correspond to a scheduling request configuration, and each scheduling request configuration has a respective associated scheduling request prohibit timer, so when the scheduling request of a scheduling request configuration is cancelled, i.e. no scheduling request corresponding to the scheduling request configuration is triggered, the scheduling request prohibit timer of the scheduling request needs to be stopped. Therefore, when the device cancels the first scheduling request, the scheduling request prohibit timer of the first scheduling request also needs to be stopped. It should be noted that the first scheduling request can be one or more, and multiple scheduling requests can correspond to one or more scheduling request configurations. The device cancelling the first scheduling request can be understood as the device cancelling all the first scheduling requests, and stopping the scheduling request prohibit timer of the first scheduling request can be understood as stopping the respective scheduling request prohibit timers of the first scheduling requests. If multiple scheduling requests correspond to one scheduling request configuration, the corresponding scheduling request prohibit timer is stopped. If multiple scheduling requests correspond to multiple scheduling request configurations, the respective corresponding scheduling request prohibit timers are stopped.

[0271] Figure 15 A flowchart of a buffer status report cancellation method provided by an embodiment of the present application is shown. The method includes, but is not limited to, the following steps: Step 1501: The device determines that a first buffer status report is triggered.

[0272] Specifically, the device can be a terminal device. When the triggering condition of triggering a buffer status report is met, the buffer status report is triggered, and the device determining that a first buffer status report is triggered can be understood as the device knowing that there is a triggered first buffer status report.

[0273] Step 1502: When a medium access control protocol data unit is sent and the medium access control protocol data unit contains a buffer status report, the device cancels the first buffer status report.

[0274] Specifically, when the device receives the uplink resource allocated by the network device, the device assembles data for transmission into a MAC PDU, and the MAC PDU can contain at least one buffer status report. When the assembled MAC PDU is sent and the MAC PDU contains at least one buffer status report, it is considered that the condition for cancelling the first buffer status report is met, and the device cancels the first buffer status report to be triggered.

[0275] It should be noted that the first buffer status report can be one or more, and the device cancelling the first buffer status report can be understood as the device cancelling all the first buffer status reports. The media access control protocol data unit being sent can be considered as at least one media access control protocol data unit being sent, and the media access control protocol data unit containing the buffer status report can be considered as the media access control protocol data unit containing at least one buffer status report, which is not limited in the application. The media access control protocol data unit being sent can be the media access control protocol data unit starting to be sent, or can be the media access control protocol data unit being sent after being sent completely, which is not limited in the application.

[0276] In some embodiments, the first buffer status report is a buffer status report triggered before the media access control protocol data unit is packaged. That is, when the packaged MAC PDU is sent, and the MAC PDU contains at least one buffer status report, it is considered that the condition for cancelling the first buffer status report is met, the first buffer status report is a buffer status report triggered before the MAC PDU is packaged, and the device cancels the triggered first scheduling request at this time. For example, before the MAC PDU is packaged, buffer status report 1 is triggered, after the MAC PDU is packaged and before the MAC PDU is sent, buffer status report 2 is triggered, at this time, the first buffer status report can be considered as the buffer status report triggered before the MAC PDU is packaged, that is, buffer status report 1. It should be noted that the first buffer status report can be one or more, that is, the buffer status report triggered before the MAC PDU is packaged is the first buffer status report, and the device cancelling the first buffer status report can be understood as the device cancelling all the first buffer status reports.

[0277] In some embodiments, the MAC PDU contains the buffer status at the time when the event triggering the first BSR is sent. That is, when a MAC PDU is sent, and the MAC PDU contains at least one BSR, if the MAC PDU contains the buffer status at the time when the event triggering the first BSR is sent, it is considered that the condition for cancelling the first BSR is met, and the device cancels the triggered first SR. If there is a triggered BSR or SR at present, the MAC PDU contains a BSR when it is packaged, and the BSR contains the latest buffer status at the time when the MAC PDU is packaged, that is, the buffer status at the time when the event triggering the last BSR is sent, which is the buffer status at the time when the event triggering the first BSR is sent. Therefore, it can be considered that the first BSR is the BSR triggered before the MAC PDU is packaged. It should be noted that the first BSR can be one or more, that is, the device cancels all the first BSRs when the MAC PDU contains the buffer status at the time when the event triggering the first BSR is sent.

[0278] The following describes a method for cancelling SR provided by an embodiment of the present application with reference to the accompanying drawings. For example, referring to FIG. 1, a method for cancelling SR provided by an embodiment of the present application is described. Figure 16 Before the MAC PDU is packaged, event 1 triggers a BSR BSR1 corresponding to buffer status 1 and an SR SR1 at time 1. After time 1 and before the MAC PDU is packaged, event 2 triggers a BSR BSR2 corresponding to buffer status 2 and an SR SR2 at time 2. When the MAC PDU is packaged, since there is a triggered BSR at present, the MAC PDU contains a BSR, and the BSR contains the buffer status at the time when the last BSR is triggered, that is, buffer status 2. At this time, SR1 and SR2 are not cancelled, but are cancelled after the MAC PDU is sent.

[0279] In addition, after the MAC PDU is packaged and before the MAC PDU is sent, event 3 triggers a trigger buffer status report BSR3 at time 3, corresponding to buffer status 3, and triggers a scheduling request SR3. At this time, when the MAC PDU is packaged, the MAC PDU can contain a buffer status report, and the buffer status report contains the buffer status at the time of the last event triggering the buffer status report before the MAC PDU is packaged, i.e., buffer status 2, not buffer status 3 at the time of the last event triggering the buffer status report, which meets the above condition, the scheduling request triggered before the MAC PDU is packaged is cancelled, i.e., scheduling request SR1 and scheduling request SR2 are cancelled, and scheduling request SR3 triggered after the MAC PDU is packaged is not cancelled. Alternatively, if the MAC PDU contains the buffer status at the time of triggering some buffer status reports, the scheduling request triggered by these buffer status reports is cancelled, for example, the MAC PDU contains buffer status 1 and buffer status 2 at event 1 and event 2, so the scheduling request SR1 triggered by the buffer status report BSR1 and the scheduling request SR2 triggered by the buffer status report BSR2 are cancelled, and the MAC PDU does not contain the buffer status 3 of event 3, so the scheduling request SR3 triggered by the buffer status report BSR3 is not cancelled.

[0280] A buffer status report cancellation method provided by an embodiment of the present application is described below with reference to the accompanying drawings. For example, refer to Figure 16 Before the MAC PDU is packaged, event 1 triggers a trigger buffer status report BSR1 at time 1, corresponding to buffer status 1, and triggers a scheduling request SR1. After time 1 and before the MAC PDU is packaged, event 2 triggers a trigger buffer status report BSR2 at time 2, corresponding to buffer status 2, and triggers a scheduling request SR2. When the MAC PDU is packaged, because there is a triggered buffer status report, the MAC PDU can contain a buffer status report, at this time, BSR1 and BSR2 are not cancelled, but after the MAC PDU is sent, BSR1 and BSR2 are cancelled.

[0281] In addition, after the MAC PDU is packaged and before the MAC PDU is sent, event 3 triggers a trigger buffer status report BSR3 at time 3, corresponding to buffer status 3, and triggers a scheduling request SR3. At this time, when the MAC PDU is packaged, the MAC PDU can contain one buffer status report, at this time, instead of canceling all triggered buffer status reports, the buffer status reports BSR1 and BSR2 triggered before the MAC PDU is packaged are canceled, and the buffer status report BSR3 triggered after the MAC PDU is packaged is not canceled. Alternatively, if the MAC PDU contains the buffer status triggered at some time, the buffer status report is canceled, for example, the MAC PDU contains the buffer status 1 and buffer status 2 at event 1 and event 2, so the buffer status reports BSR1 and BSR2 are canceled, and the MAC PDU does not contain the buffer status 3 at event 3, so the buffer status report BSR3 is not canceled.

[0282] The method of the embodiment of the application can ensure that the scheduling request is sent to the base station earlier, that is, the base station knows earlier that the user equipment has data to be transmitted, so that the base station can allocate uplink resources for the user equipment to transmit uplink data earlier, thereby reducing the delay of the uplink data of the user equipment.

[0283] The above describes the method of the embodiment of the application in detail. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed in the present application, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is realized in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0284] The embodiment of the present application can divide the functional modules of the device according to the above method examples, for example, each functional module can be divided according to each function, or two or more functions can be integrated in one processing module. The above integrated module can be realized in the form of hardware or in the form of a software functional module. It should be noted that the division of the modules in the embodiment of the present application is illustrative, and is only a logical functional division. Actual implementation can have another division manner.

[0285] In the case of dividing each functional module according to each function, the embodiment of the present application provides a communication device, which can be the device related by the embodiment of the present application. In the case of dividing each functional module according to each function, Figure 17A possible structural diagram of the communication device is shown. As Figure 17 shown, the device includes a determining unit 1701 and a canceling unit 1702.

[0286] The determining unit 1701 is configured to support the device to perform step 1401 in the above embodiments, and / or to support the device to perform step 1501 in the above embodiments, and / or other processes of the technology described herein.

[0287] The canceling unit 1702 is configured to support the device to perform step 1402 in the above embodiments, and / or to support the device to perform step 1502 in the above embodiments, and / or other processes of the technology described herein.

[0288] It should be noted that all relevant content of each step involved in the above method embodiments can be cited to the function description of the corresponding functional module, which will not be repeated here.

[0289] For example, in the case of integrated units, the structural diagram of the device provided by the embodiments of the present application is as shown in Figure 18 In Figure 18 particular, the device includes a processing module 1801. The processing module 1801 is configured to control and manage the actions of the device, for example, to perform the steps performed by the determining unit 1701 described above, and / or to perform the steps performed by the determining unit 1702 described above, and / or to perform other processes of the technology described herein. As Figure 18 shown, the device can also include a storage module 1802, which is configured to store the program code and data of the device.

[0290] For example, the structural diagram of the device provided by the embodiments of the present application is as shown in Figure 19 In Figure 19 particular, the device includes a processor 1901 and a memory 1902. The processing module 1801 is the processor 1901, for example, to perform the steps performed by the determining unit 1701 described above, and / or to perform other processes of the technology described herein. The storage module 1802 is the memory 1902, configured to store the program code and data of the device.

[0291] From the above description of the embodiments, those skilled in the art can clearly understand that, for the convenience and brevity of description, only the above division of functional modules is taken as an example, and in actual application, the above functions can be completed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.

[0292] In several embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented by other manners. For example, the apparatus embodiments described above are merely illustrative, for example, the division of the modules or units is merely a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another apparatus, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units or components shown or discussed can be indirect coupling or communication connection through some interfaces, apparatuses or units, and can be electrical, mechanical or other forms.

[0293] The units described as separate components can or can not be physically separated, and the components shown as units can be one physical unit or a plurality of physical units, that is, can be located in one place, or can be distributed to a plurality of different places. Part or all of the units can be selected according to actual needs to achieve the purpose of the embodiment scheme.

[0294] In addition, the functional units in each embodiment of the present application can be integrated in one processing unit, or each unit can be physically present separately, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0295] The integrated unit, if realized in the form of a software functional unit and sold or used as an independent product, can be stored in a readable storage medium. Based on this understanding, the technical solutions of the embodiments of the present application essentially or the parts that contribute to the prior art or the whole or part of the technical solutions can be embodied in the form of a software product, which is stored in a storage medium and includes a plurality of instructions for causing an apparatus (which can be a single chip, a chip, etc.) or a processor to execute all or part of the steps of the method described in the embodiments of the present application. The foregoing storage medium includes: a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk or an optical disk, and various storage program codes.

[0296] The above is merely a specific implementation of the present application, but the protection scope of the present application is not limited thereto, any change or replacement within the technical scope disclosed in the present application should be covered in the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A method for canceling cache status reports, applied to a device, characterized in that, The method comprises: canceling all BSRs triggered before the first MAC PDU is assembled, when the first MAC PDU is transmitted and comprises buffer status up to the time of the last event triggering a buffer status report (BSR) before the first MAC PDU is assembled.

2. The method of claim 1, wherein, canceling all BSRs triggered before the first MAC PDU is assembled, including: canceling all BSRs triggered before the first MAC PDU is assembled, and retaining a BSR triggered after the first MAC PDU is assembled.

3. The method according to claim 1 or 2, characterized in that, the first MAC PDU comprises buffer status up to the time of the last event triggering a buffer status report (BSR) before the first MAC PDU is assembled, including: the first MAC PDU comprises a first BSR, the first BSR comprising buffer status up to the time of the last event triggering a buffer status report (BSR) before the first MAC PDU is assembled, the first BSR being among all BSRs triggered before the first MAC PDU is assembled.

4. The method of claim 2, wherein, retaining a BSR triggered after the first MAC PDU is assembled, including retaining a BSR triggered after the first MAC PDU is assembled and before the first MAC PDU is transmitted.

5. The method of claim 3, wherein, the first MAC PDU is transmitted, including: the first MAC PDU is transmitted by a first uplink (UL) grant received before the first MAC PDU is assembled.

6. The method of claim 5, wherein, the method further comprises, before the first MAC PDU is transmitted by a first uplink (UL) grant received before the first MAC PDU is assembled: receiving a first downlink scheduling information on a first physical downlink control channel (PDCCH) resource before the first MAC PDU is assembled, the first downlink scheduling information indicating the first uplink (UL) grant.

7. The method of claim 6, wherein, the first downlink scheduling information comprises a first downlink control information (DCI).

8. The method of claim 7, wherein, the method further comprises: canceling all BSRs triggered before a second MAC PDU is assembled, when the second MAC PDU is transmitted and comprises buffer status up to the time of the last event triggering a BSR before the second MAC PDU is assembled, the second MAC PDU being the immediately next MAC PDU after the first MAC PDU.

9. The method of claim 8, wherein, canceling all BSRs triggered before the second MAC PDU is assembled, including: canceling all BSRs triggered before the second MAC PDU is assembled, and retaining a BSR triggered after the second MAC PDU is assembled.

10. The method according to claim 8 or 9, characterized in that, the second MAC PDU comprises buffer status up to the time of the last event triggering a BSR before the second MAC PDU is assembled, including: the second MAC PDU comprises a second BSR, the second BSR comprising buffer status up to the time of the last event triggering a BSR before the second MAC PDU is assembled.

11. The method of claim 8, wherein, canceling all BSRs triggered before the second MAC PDU is assembled, including: cancel all SRs triggered before the first MAC PDU is assembled and before the second MAC PDU is assembled.

12. The method of claim 11, wherein, reserve SRs triggered after the first MAC PDU is assembled, including reserving SRs triggered after the first MAC PDU is assembled and before the first MAC PDU is transmitted.

13. The method of claim 12, wherein, the second MAC PDU is transmitted, including: the second MAC PDU is transmitted by a second UL grant received before the second MAC PDU is assembled.

14. The method of claim 13, wherein, the method further comprises, before the second MAC PDU is transmitted by the second UL grant received before the second MAC PDU is assembled: a second downlink scheduling information is received on a second PDCCH resource before the second MAC PDU is assembled, the second downlink scheduling information indicating the second UL grant.

15. The method of claim 14, wherein, the second downlink scheduling information comprises a second downlink control information, DCI.

16. The method of any one of claims 1-2, 4-9, and 11-15, wherein, the method further comprises: cancel all SRs triggered before the first MAC PDU is assembled and before the first MAC PDU is transmitted, when the first MAC PDU is transmitted and includes buffer status up to an event of a last time that a buffer status report, BSR, is triggered before the first MAC PDU is assembled.

17. The method of claim 16, wherein, cancel all SRs triggered before the first MAC PDU is assembled, including: cancel all SRs triggered before the first MAC PDU is assembled, and reserve SRs triggered after the first MAC PDU is assembled.

18. The method of claim 17, wherein, cancel all SRs triggered before the first MAC PDU is assembled, including: cancel all SRs triggered before the first MAC PDU is assembled, and stop a scheduling request prohibit timer of each of the all SRs.

19. The method of claim 18, wherein, reserve SRs triggered after the first MAC PDU is assembled, including reserving SRs triggered after the first MAC PDU is assembled and before the first MAC PDU is transmitted.

20. The method of claim 18 or 19, wherein, the method further comprises: cancel all SRs triggered before the second MAC PDU is assembled, when the second MAC PDU is transmitted and includes buffer status up to an event of a last time that a buffer status report, BSR, is triggered before the second MAC PDU is assembled, the second MAC PDU being an immediately next MAC PDU after the first MAC PDU.

21. The method of claim 20, wherein, cancel all SRs triggered before the second MAC PDU is assembled, including: cancel all SRs triggered before the second MAC PDU is assembled, and reserve SRs triggered after the second MAC PDU is assembled.

22. The method of claim 21, wherein, cancel all SRs triggered before the second MAC PDU is assembled, including: cancel all SRs triggered after the first MAC PDU is assembled and before the second MAC PDU is assembled.

23. The method of claim 22, wherein, reserve SRs triggered after the second MAC PDU is assembled, including reserving SRs triggered after the second MAC PDU is assembled and before the second MAC PDU is transmitted.

24. An apparatus comprising: the device comprises: a processor; a memory; and a transceiver. a memory coupled with the processors, the memory storing computer programs or instructions; The computer program product includes computer programs or instructions, when the computer programs or instructions are run, causing the method as claimed in any one of claims 1-23 to be executed.

25. A computer readable storage medium, characterized in that, The computer readable storage medium stores computer programs or instructions, when the computer programs or instructions are run, causing the method as claimed in any one of claims 1-23 to be executed.

26. A computer program product, characterised in that, The computer program product includes computer programs or instructions, when the computer programs or instructions are run, causing the method as claimed in any one of claims 1-23 to be executed.

Images