WO2019158053A1 - 一种路由更新方法、调度请求取消方法及设备 - Google Patents

一种路由更新方法、调度请求取消方法及设备 Download PDF

Info

Publication number
WO2019158053A1
WO2019158053A1 PCT/CN2019/074864 CN2019074864W WO2019158053A1 WO 2019158053 A1 WO2019158053 A1 WO 2019158053A1 CN 2019074864 W CN2019074864 W CN 2019074864W WO 2019158053 A1 WO2019158053 A1 WO 2019158053A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
message
handover
access control
control protocol
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2019/074864
Other languages
English (en)
French (fr)
Inventor
邝奕如
坦尼纳坦•爱德华
王键
姚楚婷
曹振臻
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to EP19754007.3A priority Critical patent/EP3629658B1/en
Priority to JP2020565010A priority patent/JP7139457B2/ja
Priority to AU2019220020A priority patent/AU2019220020B2/en
Priority to KR1020207023610A priority patent/KR102455331B1/ko
Priority to ES19754007T priority patent/ES2913702T3/es
Priority to CA3088457A priority patent/CA3088457C/en
Priority to CN201980003020.5A priority patent/CN110754132B/zh
Priority to EP22156753.0A priority patent/EP4093133A1/en
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to RU2020129965A priority patent/RU2754427C1/ru
Priority to BR112020015724-4A priority patent/BR112020015724B1/pt
Publication of WO2019158053A1 publication Critical patent/WO2019158053A1/zh
Priority to US16/700,625 priority patent/US11044740B2/en
Anticipated expiration legal-status Critical
Priority to US17/326,025 priority patent/US11671959B2/en
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0278—Traffic management, e.g. flow control or congestion control using buffer status reports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • H04W28/065—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information using assembly or disassembly of packets
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/34—Modification of an existing route
    • H04W40/36—Modification of an existing route due to handover
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W80/00—Wireless network protocols or protocol adaptations to wireless operation
    • H04W80/02—Data link layer protocols

Definitions

  • the embodiments of the present invention relate to the field of communications technologies, and in particular, to a route update method and device.
  • a user equipment can directly communicate with a donor base station (Donor gNB, DgNB), or can communicate with a host base station through a relay node (RN). That is to say, the path of the UE to the donor base station may be composed of multiple RNs.
  • the host base station and the RN both store routing information, and the routing information includes path information from the local to the UE.
  • the host base station and the RN can send the data packet to the correct UE according to the routing information.
  • RN1 switches from RN2 to RN3
  • RN2 finds that RN1 is away, and sends a message to its own parent node (RN4) to indicate that "RN1 has left RN2”.
  • RN4 updates its own routing information according to the message and continues to itself.
  • the parent node RN5 sends a message indicating "RN1 leaves RN2" until the message arrives at the donor base station, and the donor base station updates its own routing information according to the message.
  • the parent node can be a donor base station or a relay node. It should be noted that the parent node of a certain node can be understood as a node directly connected to a certain node in the uplink direction, that is, can be understood as the last hop of the direct connection of a certain node.
  • RN3 finds that RN1 is connected, it sends a message to its own parent node RN6 indicating that "RN1 has joined RN3".
  • RN6 updates its own routing information according to the message and continues to send a message to its own parent node RN7 indicating "RN1 joins. RN3", until the message arrives at the donor base station, the host base station also updates its own routing information according to the message.
  • each RN on the path to the host base station before the RN handover will update the routing information
  • all the RNs on the path to the host base station after the RN handover will also be Update routing information.
  • the change of the network topology does not affect the routing information of some RNs and the base station. That is, the updated routing information is the same as the routing information before the update. Therefore, these RNs and the base station do not need to update the routing information.
  • these RNs indicate a change in the network topology through a specific message (for example, the RN leaves a certain RN, or the RN joins a certain RN), which also causes unnecessary signaling overhead.
  • the host base station can resend the data packet from the new path only after the host base station and all RNs complete the routing information update, resulting in a longer data interruption time.
  • the embodiment of the present invention provides a route update method and device, which can save signaling overhead and reduce data interruption time caused by network topology changes.
  • the embodiment of the present application provides a route update method, including: receiving, by a first node, a first message sent by a second node.
  • the first message is used to indicate that the handover node leaves the source node and/or the handover node accesses the target node.
  • the source node is a node that is connected before the handover node is switched
  • the target node is a node that is connected after the handover node is switched.
  • the first node may further update its own routing information according to the received first message. For example: delete the next hop that arrives at a node, or increase the next hop to a node.
  • the first node is any one of the following nodes: a target node, a source node, a core node, a first relay node between the target node and the core node, and a second relay between the source node and the core node. 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: a handover node, a target node, a source node, a core node, a first relay node, and a second relay node.
  • each node on the path to the host base station before the node handover receives a message indicating the handover status of the node, and also updates the routing information, and at the same time, after the node is switched. All nodes on the path to the donor base station also receive a message indicating the handover status of the node and update the routing information.
  • other nodes except the core node and the downlink node of the core node in the IAB network do not need to perform routing update, and do not need to notify the nodes, thereby saving signaling overhead and simultaneously
  • the number of nodes updated by the route is reduced, and the entire network can resume communication after a short period of time, shortening the data interruption time.
  • the method further includes: determining, by the first node, the third node that receives the second message according to the first message, and sending the second message to the third node
  • the second message is used to indicate that the handover node leaves the source node and/or the handover node accesses the target node.
  • the third node is any one of the following nodes: a source node, a core node, a target node, a first relay node, and a second relay node.
  • the first node also sends a message to other nodes to indicate the node handover, so that the core node related to the handover node and the downlink node of the core node in the IAB network can receive the message indicating the handover status of the node.
  • the routing information is updated according to the actual changes of the network topology, and the data is forwarded according to the correct routing information, so that the network resumes communication.
  • the second message further includes routing information of the switching node.
  • the routing information of the switching node includes the routing information related to the lower-level nodes. To ensure that the subsequent host base station can continue to communicate with the lower-level nodes, the routing information of the switching node needs to be indicated by the second message, so that each node can also The routing information related to the lower-level nodes is updated to ensure that the data transmitted by the host base station can reach the lower-level nodes, or the data sent by the lower-level nodes can reach the host base station.
  • the first message further includes routing information of the switching node.
  • the routing information of the switching node includes routing information related to the lower-level nodes. To ensure that the subsequent host base station can continue to communicate with the lower-level nodes, the routing information of the switching node needs to be indicated by the first message, so that each node can also The routing information related to the lower-level nodes is updated to ensure that the data transmitted by the host base station can reach the lower-level nodes, or the data sent by the lower-level nodes can reach the host base station.
  • the determining, by the first node, the third node that receives the second message according to the first message includes: determining, by the first node If the routing information of a node does not include the information of the switching node and/or the routing information of the first node does not include the information of the source node, it is determined that the third node is the parent node of the first node.
  • the node that needs to add routing information first performs routing update. After the routing information is added to the nodes, the node that needs to delete the routing information updates its routing information. Therefore, the handover node sends a first message to the target node to indicate the handover of the node, and then the target node can deliver the message to the first relay node of the uplink, and each of the first relay nodes needs to be sent at the receiving subnode. After the message is sent to its parent node, in order to switch the node after the node switch, the node at the core node downstream completes the route update.
  • the node is a node on the path after the handover node is switched, for example, the node may be the first relay node or the target node.
  • the first message is used to indicate that the handover node leaves the source node and the handover node accesses the target node, and the second message is used by the second message. And indicating that the handover node leaves the source node and the handover node access target node; or the first message is used to indicate that the handover node accesses the target node, and the second message is used to indicate that the handover node accesses the target node.
  • the content indicated by the received message needs to be delivered, that is, the first message may be the same as the content indicated by the second message.
  • the determining, by the first node, the third node that receives the second message according to the first message includes: determining, by the first node The routing information of a node includes information of the switching node and/or information including the source node in the routing information of the first node, and then determines that the third node is a child node of the first node.
  • the routing information of the first node includes the information of the switching node, or the routing information of the first node includes the information of the switching node and the source node, or the routing information of the first node includes the source node.
  • the information indicates whether the node is a node on the path after the handover node is switched, or is the node on the path before the handover node is switched.
  • the node may be the first common node in the direction of the UE near the two paths. That is, the core node described in the embodiment of the present invention.
  • other nodes except the core node and the downlink node of the core node in the core point IAB network do not need to perform routing update, and do not need to notify these nodes, and the nodes on the path after the switching node is switched.
  • the first relay node and the target node have completed routing update. Therefore, the core node needs to send a message to its own child node to indicate that the handover node is away.
  • the first message is used to indicate that the handover node leaves the source node and the handover node accesses the target node, and the second message is used by the second message. Instructing the handover node to leave the source node; or, the first message is used to indicate that the handover node accesses the target node, the second message is used to indicate that the handover node leaves the source node; or the first message is used to indicate that the handover node leaves the source node and switch The node accesses the target node, and the second message is used to indicate that the handover node is leaving. Alternatively, the first message is used to indicate that the handover node accesses the target node, and the second message is used to indicate that the handover node is to leave.
  • the core node may indicate that the handover node leaves the source node to the own child node (eg, the second relay node), or may only indicate that the handover node leaves, and after receiving the message indicated by the core node, may be indicated according to the core node.
  • the content is updated by routing, for example, deleting the "next hop to the switching node" in the routing information.
  • the determining, by the first node, the third node that receives the second message according to the first message includes: determining, by the first node If the routing information of the node includes the information of the switching node and the switching node is not the child node of the first node before the handover, the third node is determined to be the child node of the first node.
  • the first node determines that the routing information of the first node includes the information of the switching node, indicating that the node is on the path before the handover node is switched, and because the switching node is not the child node of the first node before the handover, indicating that the node is not
  • the source node for example, the node is a second relay node.
  • the core node and the downlink node of the core node perform routing update. Therefore, the second relay node sends a second message to its own child node to indicate the situation of the node handover.
  • the first message is used to indicate that the handover node is to leave
  • the second message is used to indicate that the handover node is to leave.
  • the first node is the second relay node
  • the message received by the second relay node indicates that the handover node leaves
  • the message sent by the second relay node to its own node indicates that the handover node leaves.
  • determining that the third node is a child node of the first node includes: A node determines, according to the routing information of the first node, that the next hop to the switching node is the third node.
  • the first node is the second relay node
  • the message received by the second relay node indicates that the handover node leaves
  • the message may carry information of the handover node, and therefore, the second relay node may be based on the information of the handover node and The own routing information determines which node the message indicating the handover condition is sent to.
  • the determining, by the first node, the third node that receives the second message according to the first message includes: determining, by the first node The information of the source node is different from the information of the first node, determining that the third node is a child node of the first node; and/or, the first node determines that the routing information of the first node includes information of the switching node and before switching the node switching Not being a child of the first node, determining that the third node is a child of the first node.
  • the first node determines that the information of the source node is different from the information of the own node, indicating that the node is not the source node, or if the first node determines that the routing information of the first node includes the information of the switching node, indicating that the node is switched before the switching node
  • the node is not the source node, for example, the node is the second relay node.
  • the core node and the downlink node of the core node perform routing update. Therefore, the second relay node sends a second message to its own child node to indicate the situation of the node handover.
  • the first message is used to indicate that the handover node leaves the source node
  • the second message is used to indicate that the handover node is to leave Source node
  • the first message may carry information of the handover node and information of the source node
  • the second message may carry information of the handover node and information of the source node
  • determining that the third node is the child node of the first node includes: the first node Determining, according to the routing information of the first node, that the next hop to the source node is the third node; and/or, the first node determines, according to the routing information of the first node, that the next hop to the switching node is the third node.
  • the first node is the second relay node
  • the message received by the second relay node indicates that the handover node leaves the source node
  • the message may carry information of the handover node and information of the source node, and therefore, the second relay node It is possible to determine to which node the message indicating the handover situation is sent based on the information of the handover node or the information of the source node and its own routing information.
  • the determining, by the first node, the third node that receives the second message according to the first message includes: determining, by the first node If the routing information of the first node does not include the information of the target node, it is determined that the third node is the parent node of the first node.
  • the node that needs to delete the routing information first performs routing update. After the routing information is deleted by the nodes, the node that needs to add routing information updates its routing information. Therefore, the handover node sends a first message to the source node to indicate the handover of the node, and then the source node can deliver the message to the second relay node of its own uplink, and each of the second relay nodes needs to be sent at the receiving child node. After the message, the message is sent to the parent node to indicate the switching status of the node, so that the node in the downlink of the core node on the path before the node switching is completed to complete the routing update. If a node does not include the identifier of the target in its own routing information, it indicates that the node is a node on the path before the handover node switches. For example, the node may be the second relay node or the source node.
  • the first message is used to indicate that the handover node leaves the source node and the handover node accesses the target node
  • the second The message is used to indicate that the handover node leaves the source node and the handover node accesses the target node
  • the first message is used to indicate that the handover node accesses the target node
  • the second message is used to indicate that the handover node accesses the target node.
  • the content indicated by the received message needs to be delivered, that is, the first message may be the same as the content indicated by the second message.
  • the determining, by the first node, the third node that receives the second message according to the first message includes: determining, by the first node The routing information of the first node includes information of the target node, and then determines that the third node is a child node of the first node.
  • the node For a node, if the routing information of the target node is included in the routing information, the node is the node 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, The node is also the node on the path before the handover of the node.
  • the node may be the first common node of the two paths in the direction of the UE, that is, the core node in the embodiment of the present invention.
  • other nodes except the core node and the downlink node of the core node in the core point IAB network do not need to perform routing update, and do not need to notify these nodes, and the nodes on the path after the switching node is switched.
  • the first relay node and the target node have completed routing update. Therefore, the core node needs to send a message to its own child node to indicate that the switching node joins.
  • the first message is used to indicate that the handover node leaves the source node and the handover node accesses the target node, where The second message is used to indicate that the handover node accesses the target node, and the second message is used to indicate that the handover node accesses the target node, and the second message is used to indicate that the handover node accesses the target node.
  • the received first message may be different from the second message sent to the child node, and the sent second message is used to indicate that the handover node accesses the target node.
  • the determining, by the first node, the third node that receives the second message according to the first message includes: determining, by the first node The information of the target node is different from the information of the first node, and then the third node is determined to be a child node of the first node.
  • the first relay node For the first relay node, if it is not the target node itself, it needs to send a second message to its own node to indicate the joining of the switching node.
  • the first message is used to indicate that the handover node accesses the target node
  • the second message is used to indicate the handover node. Access to the target node.
  • determining that the third node is a child node of the first node includes The first node determines, according to the routing information of the first node, that the next hop to the target node is the third node.
  • the message received by the first relay node includes the information of the target node
  • the second relay node may determine, according to the information of the target node, how to send the message to indicate the handover condition of the node.
  • a device in a second aspect, the device as a first node, comprising: a receiving unit, configured to receive a first message sent by a second node, where the first message is used to indicate that the switching node leaves the source node and/or the switching node
  • the source node is a node that is connected before the handover node is switched
  • the target node is a node that is connected after the handover node is switched
  • the update unit is configured to update the routing information of the first node according to the first message.
  • the first node is any one of the following nodes: a target node, a source node, a core node, a first relay node between the target node and the core node, and a second relay 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: a handover node, a target node, a source node, a core node, a first relay node, and a second node.
  • Relay node Relay node.
  • each node on the path to the host base station before the node handover receives a message indicating the handover status of the node, and also updates the routing information, and at the same time, after the node is switched. All nodes on the path to the donor base station also receive a message indicating the handover status of the node and update the routing information.
  • other nodes except the core node and the downlink node of the core node in the IAB network do not need to perform routing update, and do not need to notify the nodes, thereby saving signaling overhead and simultaneously
  • the number of nodes updated by the route is reduced, and the entire network can resume communication after a short period of time, shortening the data interruption time.
  • the device further includes a determining unit.
  • a determining unit configured to determine, according to the first message, a third node that receives the second message, and send a second message to the third node, where the second message is 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: a source node, a core node, a target node, a first relay node, and a second relay node.
  • the second message further includes routing information of the switching node.
  • the first message further includes routing information of the switching node.
  • the determining unit is specifically configured to: determine that the routing information of the first node does not include the information of the switching node, and/or Or the routing information of the first node does not include the information of the source node, and then determines that the third node is the parent node of the first node.
  • the first message is used to indicate that the handover node leaves the source node and the handover node accesses the target node
  • the second message is used to indicate that the handover node accesses the target node
  • the second message is used to indicate that the handover node accesses the target node.
  • the determining unit is specifically configured to: determine that the routing information of the first node includes information about the switching node, and/or If the routing information of a node includes information of the source node, it is determined that the third node is a child node of the first node.
  • the first message is used to indicate that the handover node leaves the source node and the handover node accesses the target node, and the second message And the first message is used to indicate that the handover node accesses the source node, and the second message is used to indicate that the handover node leaves the source node; or the first message is used to indicate that the handover node leaves the source node and The switching node accesses the target node, and the second message is used to indicate that the handover node is to leave; or the first message is used to indicate that the handover node accesses the target node, and the second message is used to indicate that the handover node is to leave.
  • the determining unit is specifically configured to: determine that the routing information of the first node includes the information of the switching node, and switch the node If the child node of the first node is not before the handover, it is determined that the third node is a child node of the first node.
  • the first message is used to indicate that the handover node is to leave
  • the second message is used to indicate that the handover node is to leave.
  • the determining unit is specifically configured to: according to the routing information of the first node The next hop that arrives at the switching node is determined to be the third node.
  • the determining unit is specifically configured to: determine that the information of the source node is different from the information of the first node, and determine The third node is a child node of the first node; and/or, determining that the routing information of the first node includes the information of the switching node, and before the switching node is not the child node of the first node, determining that the third node is the first node A child node of a node.
  • the first message is used to indicate that the handover node leaves the source node
  • the second message is used to indicate the handover node From the open source node
  • the determining unit is specifically configured to determine the arrival source according to the routing information of the first node The next hop of the node is the third node; and/or, determining, according to the routing information of the first node, the next hop to the switching node is the third node.
  • the determining unit is specifically configured to: determine that the routing information of the first node does not include information of the target node, Then determining that the third node is the parent node of the first node.
  • the first message is used to indicate that the handover node leaves the source node and the handover node accesses the target node, where The second message is used to indicate that the handover node accesses the target node, and the second message is used to indicate that the handover node accesses the target node, and the second message is used to indicate that the handover node accesses the target node.
  • the determining unit is specifically configured to: when determining that the routing information of the first node includes the information of the target node, The third node is determined to be a child node of the first node.
  • the first message is used to indicate that the handover node leaves the source node and the handover node accesses the target node, where The second message is used to indicate that the handover node accesses the target node, and the second message is used to indicate that the handover node accesses the target node, and the second message is used to indicate that the handover node accesses the target node.
  • the determining unit is configured to determine that the information of the target node is different from the information of the first node,
  • the three nodes are child nodes of the first node.
  • the first message is used to indicate that the handover node accesses the target node
  • the second message is used to indicate the handover The node accesses the target node.
  • the determining unit is specifically configured to be used according to the first node
  • the routing information determines that the next hop to the target node is the third node.
  • a device in a third aspect, the device as a first node, comprising: a transceiver and a processor, the transceiver receiving a first message sent by a second node, where the first message is used to indicate a handover node Accessing the target node from the open source node and/or the switching node; the source node is a node connected before the switching node is switched, and the target node is a node connected after the switching node is switched; the processor is according to the Updating, by the first message received by the transceiver, routing information of the first node, where the first node is any one of the following nodes: the target node, the source node, a core node, and the target a first relay node between the node and the core node, a second relay node between the source node and the core node; the core node is an uplink direction of the target node and the source node a first common node; the second node is any one of the first no
  • the processor further determines, according to the first message, a third node that receives the second message; the transceiver further sends the third The node sends the second message, where the second message is used to indicate that the handover node leaves the source node and/or the handover node access 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.
  • the determining, by the first node, the third node that receives the second message according to the first message includes: Determining, by the first node, that the routing information of the first node does not include the information of the handover node and/or the routing information of the first node does not include information of the source node, determining the third node Is the parent node of the first node.
  • the first message is used to indicate that the switching node is removed from the source node and the switching node Entering the target node
  • the second message is used to indicate that the handover node leaves the source node and the handover node as the access target node
  • the first message is used to indicate that the handover node is connected
  • entering the target node where the second message is used to indicate that the handover node accesses the target node.
  • the processor is further configured to: determine that the routing information of the first node includes the switching node The information and/or the routing information of the first node includes the information of the source node, and then the third node is determined to be a child node of the first node.
  • the first message is used to indicate that the switching node is removed from the source node and the switching node Entering the target node
  • the second message is used to indicate that the handover node leaves the source node
  • the first message is used to indicate that the handover node leaves the source node and the handover node to access The target node
  • the second message is used to indicate that the handover node is left
  • the first message is used to indicate that the handover node accesses the target node
  • the second message is used to indicate the The switch node leaves.
  • the processor further determines that the routing information of the first node includes the information of the switching node, and the switching node is not before the switching Determining a child node of the first node, determining that the third node is a child node of the first node.
  • the first message is used to indicate that the handover node is to leave, and the second message is used to indicate The switching node leaves.
  • the processor is further configured to determine information of the source node and information of the first node Differentiating, determining that the third node is a child node of the first node; and/or, the first node determines that routing information of the first node includes information of the switching node, and the switching node Before the handover is not a child node of the first node, determining that the third node is a child node of the first node.
  • the first message is used to indicate that the handover node leaves the source node
  • the second message And is used to indicate that the handover node leaves the source node.
  • a computer readable storage medium having stored therein instructions; when it is run on a device as described in the second aspect and any of its possible implementations, The apparatus performs the routing update method as described in the first aspect above and its various possible implementations.
  • a wireless communication device stores instructions that, when the wireless communication device is operating on the device of the second aspect and any of its possible implementations, The device performs the route update method as described in the first aspect above and its various possible implementations.
  • the wireless communication device can be a chip.
  • the application embodiment provides a scheduling request cancellation method, including: determining, by a device, that a first scheduling request is triggered; when a media access control protocol data unit is sent, and the media access control protocol data unit includes A cache status report, the device cancels the first scheduling request.
  • the method further includes: the first cache state report includes a first cache state, and the first cache state is until a cache is triggered last time The status of the cache when the status is reported.
  • the method further includes: the first buffer state is up to the media access control protocol data unit The cache state at the time of the most recent event that triggered the cache status report before the packet.
  • the method further includes: the first scheduling request is the media The scheduling request triggered by the access control protocol data unit group packet; or the first scheduling request is a scheduling request triggered by the second buffer status report, where the media access control protocol data unit includes triggering the second The cache state when the event is reported by the cache status.
  • the method further includes: the first cache state report does not include a first cache state, and the first cache state is until a latest trigger The cache state when the event is reported by the cache status.
  • the method further includes: the first scheduling request is the media access control protocol data unit a scheduling request triggered before the group packet; or the first scheduling request is a scheduling request triggered by the second buffer status report, where the media access control protocol data unit includes an event that triggers the second buffer status report Cache status.
  • the method further A scheduling request prohibiting timer of a scheduling request.
  • the application embodiment provides a method for canceling a buffer status report, including: determining, by a device, that a first cache status report is triggered; when a media access control protocol data unit is sent, and the medium access control protocol data unit A cache status report is included, and the device cancels the first cache status report.
  • the method further includes: the first buffer status report is a buffer status report triggered before the media access control protocol data unit group packet .
  • the method further includes: the media access control protocol data unit includes a buffer state when an event of the first cache state report is triggered.
  • a device comprising: a determining unit, the determining unit is configured to determine that a first scheduling request is triggered; and a canceling unit, where the media access control protocol data unit is sent, and The media access control protocol data unit includes a first cache status report, and the canceling unit is configured to cancel the first scheduling request.
  • the device further includes: the first cache state report includes a first cache state, and the first cache state is until a cache is triggered last time The status of the cache when the status is reported.
  • the device further includes: the first buffer state is up to the media access control protocol data unit The cache state at the time of the most recent event that triggered the cache status report before the packet.
  • the device further includes: the first scheduling request is the media The scheduling request triggered by the access control protocol data unit group packet; or the first scheduling request is a scheduling request triggered by the second buffer status report, where the media access control protocol data unit includes triggering the second The cache state when the event is reported by the cache status.
  • the device further includes: the first cache state report does not include a first cache state, and the first cache state is until a latest trigger The cache state when the event is reported by the cache status.
  • the device further includes: the first scheduling request is the media access control protocol data unit a scheduling request triggered before the group packet; or the first scheduling request is a scheduling request triggered by the second buffer status report, where the media access control protocol data unit includes an event that triggers the second buffer status report Cache status.
  • the device further includes: stopping the device, the stopping device A scheduling request prohibition timer for stopping the first scheduling request.
  • a device comprising: a determining unit, configured to determine that a first cache status report is triggered; a canceling unit, when the media access control protocol data unit is sent, and The media access control protocol data unit includes a cache status report, and the canceling unit is configured to cancel the first cache status report.
  • the device further includes: the first buffer status report is a buffer status report triggered before the media access control protocol data unit group packet .
  • the device further includes: the media access control protocol data unit includes a buffer status when an event that triggers the first cache status report is triggered.
  • a device comprising: a processor, the processor determining that a first scheduling request is triggered; the media access control protocol data unit being transmitted, and the media access control The protocol data unit includes a first cache status report, and the processor is configured to cancel the first scheduling request.
  • the device further includes: the first cache state report includes a first cache state, and the first cache state is until a cache is triggered last time The status of the cache when the status is reported.
  • the device further includes: the first buffer state is up to the media access control protocol data unit The cache state at the time of the most recent event that triggered the cache status report before the packet.
  • the device further includes: the first scheduling request is the media The scheduling request triggered by the access control protocol data unit group packet; or the first scheduling request is a scheduling request triggered by the second buffer status report, where the media access control protocol data unit includes triggering the second The cache state when the event is reported by the cache status.
  • the device further includes that the first cache state report does not include a first cache state, and the first cache state is triggered until a latest one The cache state when the event is reported by the cache status.
  • the device further includes: the first scheduling request is the media access control protocol data unit a scheduling request triggered before the group packet; or the first scheduling request is a scheduling request triggered by the second buffer status report, where the media access control protocol data unit includes an event that triggers the second buffer status report Cache status.
  • the device further includes: the processor stops the The scheduling request of the first scheduling request prohibits the timer.
  • a device comprising: a processor, the processor determining that a first cache status report is triggered; the media access control protocol data unit being sent, and the media connection
  • the incoming control protocol data unit includes a cache status report, and the processor cancels the first cache status report.
  • the device further includes: the first buffer status report is a buffer triggered before the media access control protocol data unit group packet status report.
  • the device further includes: the media access control protocol data unit includes a buffer when an event that triggers the first cache status report is triggered status.
  • a twelfth aspect a computer readable storage medium having stored therein instructions; when it is run on a device as described in the eighth aspect and any possible implementation thereof, The apparatus is caused to perform the retrieval request cancellation method as described in the sixth aspect above and its various possible implementations.
  • a thirteenth aspect a computer readable storage medium having instructions stored in a device as described in the ninth aspect and any of its possible implementations, The apparatus is caused to perform a cache status report cancellation method as described in the seventh aspect above and its various possible implementations.
  • a wireless communication device in a fourteenth aspect, a wireless communication device is disclosed, the wireless communication device storing instructions for causing the wireless communication device to operate on a device as described in the eighth aspect and any of its possible implementations
  • the apparatus performs a call request cancellation method as described in the sixth aspect above and its various possible implementations.
  • the wireless communication device can be a chip.
  • a wireless communication device wherein the wireless communication device stores an instruction when the wireless communication device is operated on the device described in the ninth aspect and any possible implementation thereof
  • the apparatus performs a cache status report cancellation method as described in the seventh aspect above and its various possible implementations.
  • the wireless communication device can be a chip.
  • the eighth aspect the tenth aspect, the twelfth aspect, the fourteenth aspect, and various implementations thereof, reference may be made to the sixth aspect and its various implementations in detail; and
  • the beneficial effects of the aspects reference may be made to the analysis of the beneficial effects in the sixth aspect and various implementation manners thereof, and details are not described herein again.
  • the ninth aspect the eleventh aspect, the thirteenth aspect, the fifteenth aspect, and various implementation manners thereof, reference may be made to the seventh aspect and the detailed description in various implementation manners thereof;
  • the beneficial effects of the nine aspects, the eleventh aspect, the thirteenth aspect, the fifteenth aspect, and various implementation manners reference may be made to the beneficial effects analysis in the seventh aspect and various implementation manners thereof, and details are not described herein again.
  • FIG. 1 is a structural diagram of an IAB network provided by an embodiment of the present application.
  • FIG. 3 is a structural block diagram of a network device according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a route update method according to an embodiment of the present invention.
  • FIG. 6 is another schematic diagram of a route update method according to an embodiment of the present invention.
  • FIG. 7 is another schematic diagram of a route update method according to an embodiment of the present invention.
  • FIG. 8 is another schematic diagram of a route update method according to an embodiment of the present invention.
  • FIG. 9 is another schematic diagram of a route update method according to an embodiment of the present invention.
  • FIG. 10 is another schematic diagram of a route update method according to an embodiment of the present invention.
  • FIG. 11 is a block diagram showing another structure of a network device according to an embodiment of the present invention.
  • FIG. 12 is a block diagram showing another structure of a network device according to an embodiment of the present invention.
  • FIG. 13 is a schematic diagram of an application scenario provided by an embodiment of the present application.
  • FIG. 14 is a flowchart of a method for canceling a scheduling request according to an embodiment of the present invention.
  • FIG. 15 is a flowchart of a method for canceling a buffer status report according to an embodiment of the present invention.
  • FIG. 16 is a schematic diagram of a cancellation method according to an embodiment of the present invention.
  • FIG. 17 is a structural block diagram of a device according to an embodiment of the present invention.
  • FIG. 18 is another structural block diagram of a device according to an embodiment of the present invention.
  • FIG. 19 is another structural block diagram of a device according to an embodiment of the present invention.
  • a and/or B in the present invention can be understood as either “A and B", or “A” or “B”.
  • the "first”, “second”, and the like in the specification and claims of the present invention are used to distinguish similar objects, and are not necessarily used to describe a particular order or order.
  • FIG. 1 is a possible IAB network structure diagram.
  • an RN may be deployed between the host base station and the UE, and the data sent by the base station to the UE or the data sent by the UE to the base station may be forwarded by the RN.
  • the host base station is directly connected to the core network, and the host base station can connect multiple RNs.
  • the UE may be indirectly connected to the host base station through one or more RNs, that is, the multi-hop path or multiple connections between the UE and the host base station, the link between the host base station and the RN, and the link between the RN and the RN may be a backhaul. (Backhaul) link or pre-transit (Fronthaul) link.
  • the UE may also be directly connected to the host base station, that is, a one-hop path between the UE and the host base station, and the link between the host base station and the UE and the link between the RN and the UE may be an access link.
  • the resulting network topology may be a hierarchical topology or a mesh topology.
  • 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 of the host base station to the UE needs to be based on its own The routing information determines which RN the next hop on the UE path arrives, and forwards the received data packet to the RN of the next hop.
  • each RN on the path to the host base station before the RN handover updates the routing information, and all RNs on the path to the host base station after the RN handover are also updated. Routing information. For example, referring to FIG. 2, the RN9 leaves the RN7 to join the RN8. When the RN7 finds that the RN9 is away, it sends a message to the own parent node RN6 indicating that "RN9 leaves the RN7", and the RN6 updates its own routing information according to the message, and continues to its own parent.
  • the node RN3 sends a message indicating that "RN9 leaves RN7", and then sends a message in the uplink to indicate that "RN9 leaves RN7" until the host base station arrives, the donor base station, and each RN that receives "RN9 leaves RN7" according to "RN9 leaves RN7".
  • the message updates its own routing information.
  • the RN8 finds that the RN9 joins, it sends a message to its own parent node RN5 indicating "RN9 joins the RN8", and the RN5 updates its own routing information according to the message, and continues to send a message to its parent node RN3 indicating "RN9 joins the RN8".
  • the message is sent to the uplink line in turn to indicate that "RN9 leaves RN7" until the host base station is reached, and the eNB that receives the "RN9 join RN8" updates its own routing information according to the message "RN9 joins RN8".
  • the routing information of the RN refers to the next hop on the path of the RN to a certain node (RN or UE).
  • RN8 switches from RN6 to RN7.
  • the next hop to RN8 is still RN1
  • the next hop to RN8 is still RN3. Therefore, the host base station or the RNs do not need to update the routing information, nor do they need to receive the message "RN9 joins the RN8" or the message "RN9 leaves the RN7", resulting in redundant signaling overhead.
  • the host base station can re-data only after all the RNs on the path of the host base station before the RN handover and all the RNs on the path of the host base station after the RN handover complete the routing information update.
  • the packet is sent out from the new path, causing a longer data interruption.
  • An embodiment of the present invention provides a route update method. After a node is handed over, the first node receives a first message sent by the second node, where the first message is used to indicate that the handover node leaves the source node and/or the handover node accesses the target node. .
  • the source node is a node that is connected before the handover node is switched, and the target node is a node that is connected after the handover node is switched.
  • the first node may also update its own routing information according to the first message.
  • the first node is any one of the following nodes: a target node, a 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: a handover node, a target node, a source node, a core node, a first relay node, and a second relay node.
  • the core node is the first common node in the uplink direction of the target node and the source node.
  • each node on the path to the host base station before the node handover will update the routing information, and all nodes on the path to the host base station after the node is switched will also be updated. Routing information.
  • 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, nor need to signal these nodes, thereby saving signaling overhead.
  • the number of nodes that perform routing updates is also greatly reduced, and the entire network can resume communication after a short period of time, shortening the data interruption time.
  • the naming of the nodes (such as the first node, the core node, the relay node, and the like) in the embodiment of the present invention is only for convenience of description, and the naming of the nodes is not limited to the examples provided by the embodiments of the present invention. As long as the device meets the corresponding functions, it can be included in the scope of the embodiment of the present invention, such as a base station, an access point (AP), and the like.
  • AP access point
  • a node below a certain node or a node descending from a node refers to a node that is close to the UE in the direction of the UE; a node above a certain node or a node that is uplinked by the node refers to the node being close to the core.
  • a node in the direction of a network device eg, a donor base station.
  • the device may be a network device.
  • a network device is taken as an example for description.
  • user equipment and the like can also be included as devices, and are included in the scope of the present application.
  • the route update method provided by the embodiment of the present invention is applicable to the network device shown in FIG. 3, and the network device may be a node according to an embodiment of the present invention, and the node may be any one of the following nodes: a switch node and a target. Node, source node, first relay node, second relay node, core node.
  • the network device can include at least one processor 11, memory 12, transceiver 13, and communication bus 14.
  • the processor 11 is a control center of the network device, and may be a processor or a collective name of a plurality of processing elements.
  • the processor 11 is a central processing unit (CPU), may be an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of the present invention.
  • CPU central processing unit
  • ASIC Application Specific Integrated Circuit
  • DSPs digital signal processors
  • FPGAs Field Programmable Gate Arrays
  • the processor 11 can perform various functions of the network device by running or executing a software program stored in the memory 12 and calling data stored in the memory 12.
  • processor 11 may include one or more CPUs, such as CPU0 and CPU1 shown in FIG.
  • the network device can include multiple processors, such as processor 11 and processor 15 shown in FIG.
  • processors can be a single core processor (CPU) or a multi-core processor (multi-CPU).
  • a processor herein may refer to one or more devices, circuits, and/or processing cores for processing data, such as computer program instructions.
  • the memory 12 can be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type that can store information and instructions.
  • the dynamic storage device can also be an Electrically Erasable Programmable Read-Only Memory (EEPROM), a Compact Disc Read-Only Memory (CD-ROM) or other optical disc storage, and a disc storage device. (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or can be used to carry or store desired program code in the form of instructions or data structures and can be Any other media accessed, but not limited to this.
  • the memory 12 can be stand-alone and connected to the processor 11 via a communication bus 14.
  • the memory 12 can also be integrated with the processor 11.
  • the memory 12 is used to store a software program that executes the solution of the present invention, and is controlled by the processor 11.
  • the transceiver 13 uses devices such as any transceiver for communication with other nodes in the system of Figure 1, such as other relay nodes, core nodes, target nodes, or source nodes. Or used to implement communication between the network device and the base station in FIG. It can also be used to communicate with a communication network, such as Ethernet, radio access network (RAN), Wireless Local Area Networks (WLAN), and the like.
  • the transceiver 13 may include a receiving unit to implement a receiving function, and a transmitting unit to implement a transmitting function.
  • the communication bus 14 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus.
  • ISA Industry Standard Architecture
  • PCI Peripheral Component
  • EISA Extended Industry Standard Architecture
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 3, but it does not mean that there is only one bus or one type of bus.
  • the device structure shown in FIG. 3 does not constitute a limitation to the network device, and may include more or less components than those illustrated, or some components may be combined, or different component arrangements.
  • An embodiment of the present invention provides a route update method. As shown in FIG. 4, the method includes the following steps:
  • the first node receives a first message sent by the second node, where the first message is used to indicate that the handover node leaves the source node and/or the handover node accesses the target node.
  • the source node in the embodiment of the present invention is a node that is connected before the handover node is switched, and the target node is a node that is connected after the handover node is switched.
  • the handover node is an RN that switches from the source node to the target node, and the handover node accesses the target node, and the handover node can be considered to join the target node, that is, the handover node establishes a connection with the target node.
  • the source node may be a donor base station or an RN
  • the target node may be a donor base station or an RN.
  • the handover node is RN9
  • the target node may be RN8
  • the source node may be RN7.
  • the first node is any one of the following nodes: a target node, the source node, a core node, a first relay node, and a second relay node.
  • the second node is any one of the following nodes: the handover node, the target node, the source node, the core node, the first relay node, and the second relay node.
  • first node and the second node may be different nodes. Further, the first node may be directly connected to the second node.
  • the core node may be the first common node in the uplink direction of the target node and the source node.
  • the RN9 leaves the RN7 to join the RN8, that is, the RN7 is the source node, and the RN8 target node, the RN7, and the RN8 are the first common node in the uplink direction, and can be considered as the path where the RN7 and the RN8 are located close to the host base station.
  • the first convergence point in the direction such as RN3 in Figure 2.
  • the core node may also be a target node or a source node.
  • 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 may not be directly connected, but are indirectly connected through one or more relay nodes.
  • one or more relay nodes between the target node and the core node may be called It is the first relay node, such as RN5 in FIG.
  • the target node and the core node can also be directly connected, that is, there is no first relay node.
  • 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 may not be directly connected, but are indirectly connected through one or more relay nodes. In the embodiment of the present invention, one or more relay nodes between the source node and the core node may be called It is the second relay node, such as RN6 in FIG. Of course, the source node and the core node can also be directly connected, that is, there is no second relay node.
  • the core node and the node below the core node may receive a message indicating a handover status of the node, such as the foregoing first message.
  • the first node may be any one of RN3, RN5, RN6, RN7, and RN8, and the second node may be any one of RN3, RN5, RN6, RN7, RN8, and RN9.
  • a node and a second node are different nodes.
  • the RN9 (second node) sends a first message to the RN8 (first node)
  • the RN5 (second node) sends a first message to the RN3 (first node).
  • the first message may be used to indicate that the handover node leaves the source node and the handover node accesses the target node.
  • the first message is used to indicate that a node leaves node A and accesses the node B.
  • the first message may carry the information of the switching node, the information of the target node, and the information of the source node.
  • the information of a certain node may be understood as a information indicating the node, or may be A message that is understood to indicate the way a node is routed in the routing information can also be considered as the identity of the node.
  • the information of the handover node may be an identifier of the handover node
  • the information of the target node may be an identifier of the target node
  • the information of the source node may be an identifier of the source node.
  • the identifier of the switching node in the first message, the identifier of the target node, and the arrangement order of the identifiers of the source node may be used to identify whether the identifier indicates whether the source node is the source node or the target node or the switching node.
  • the solution for identifying the node by the order of the nodes in the first message is not limited to the above-mentioned possible implementations, and other possible implementations are also possible, which are not limited in the embodiment of the present invention.
  • the node corresponding to the node identifier in the first message may also be distinguished by a bit.
  • the first message includes “00RN7, 01RN8, 10RN9”, where “00” is used to identify the source node, that is, RN7 is the identifier of the source node; “01” is used to identify the target node, that is, RN8 is the target node. Identification; "10” is used to identify the handover node, that is, RN9 is the identifier of the handover node.
  • the node corresponding to the node identifier in the first message may be distinguished by other means, or the corresponding node may be represented by other means (non-node identifier), which is not limited by the embodiment of the present invention.
  • the first message may be used to indicate that the handover node leaves the source node.
  • the first message is used to indicate that a node has left node A.
  • the first message may carry the identity of the handover node and the identity of the source node. For example, how to distinguish between the node corresponding to the node identifier in the first message is a handover node or a source node, and reference may be made to the foregoing implementation manners, which are not described herein.
  • the first message may be used to indicate that the handover node is away.
  • the first message may carry the identity of the handover node.
  • the first message is used to indicate that the handover node accesses the target node.
  • the first message is used to indicate that a node joins the Node B.
  • the first message may carry the identity of the handover node and the identity of the target node. For example, how to distinguish between the node corresponding to the node identifier in the first message is a handover node or a target node, and reference may be made to the foregoing implementation manners, which are not described herein.
  • the handover node may not be the end of the path, ie, other RNs may be connected after the handover node.
  • the child node of the handover node RN9 is the RN 10, and the RN 9 holds the routing information related to the RN 10, such as "directly connected to the RN 10."
  • the first message sent by the first node may also carry the routing information of the handover node.
  • the first message sent by the RN9 also carries the routing information of the RN9 “directly connected with the RN10”.
  • a child node of a certain node can be understood as a node directly connected to a certain node in the downlink direction, that is, a next hop of a direct connection of a certain node.
  • the "directly connected to the node B" in the routing information of the node A can be understood as the node B is a child node of the node A, and can also be understood that the node B is the next hop of the direct connection of the node A, and the routing information is used in the embodiment of the present invention.
  • the specific content is not limited.
  • the first node updates routing information of the first node according to the first message.
  • the host base station has a determined path to each UE, and the path from the host base station to the UE can be determined by the routing information saved by each node (RN).
  • Each node can record routing information in the form of a routing table.
  • the routing table includes the next hop corresponding to each path, and may also be considered as the next hop to reach a certain node.
  • the path where the RN3 is located is: the primary base station-RN1-RN3-RN6-RN8-RN9-RN10, and the primary base station-RN1-RN3-RN5-RN7.
  • the routing table of RN3 may be: directly connected to RN5, directly connected to RN6, RN8->RN6, RN7->RN5, RN9->RN6, RN10->RN6.
  • 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, and RN9->RN6 represents that the next hop from RN3 to RN9 is RN6, RN10->RN6 represents that the next hop from RN3 to RN10 is RN6.
  • the path may be indicated by a path identifier
  • the next hop may be indicated by a node identifier.
  • the path identifier may be an identifier of the node, that is, a path between the host base station and the node.
  • RN4 may indicate the path of "host base station-RN1-RN2-RN4"; or, there may be a dedicated path identifier indicating the path, for example, "path 4" indicates "the base station-RN1-RN2-RN4" path.
  • the next hop may be represented by a node identifier.
  • each data packet carries a path identifier and a UE identifier, and the host base station and the RN may send the data packet to the correct UE by using a routing information table.
  • the handover node may not be the end of the path, ie, other RNs may be connected after the handover node. Then, the switching node itself stores the routing information related to the lower node, and the first message sent by the first node may further carry the routing information of the switching node. Further, the second message sent by the first node may further include routing information of the switching node.
  • the first node may also notify other nodes of the situation of the node handover according to the received first message. Specifically, the first node may determine, according to the first message, the third node that receives the second message, and send the second message to the third node. The second message is used to notify other nodes of the situation of the node handover. 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.
  • the third node is any one of the following nodes: a source node, a core node, a target node, a first relay node, and a second relay node.
  • the third node may be any one of RN3, RN5, RN6, RN7, and RN8.
  • the RN9 (second node) sends a first message to the RN7 (first node), and then the RN7 can send a second message to the RN5 (third node).
  • the order of updating the route of the core node and the downlink node of the core node may be as follows:
  • the handover node notifies the target node of the handover of the node, and may first trigger the new path (the path where the handover node is switched), and the node that is in the downlink of the core node updates its own route according to the joining of the handover node. information. Subsequently, the core node triggers the original path (the path before the handover node is switched), and the node that is in the downlink of the core node updates its own routing information according to the departure of the handover node.
  • the processing of each node can be divided into the following types:
  • the target node receives the first message sent by the handover node, where the handover node is the second node.
  • the first message sent by the handover node may be used to indicate that the handover node leaves the source node and the handover node access target node.
  • the identifier of the destination node, the identifier of the source node, and the identifier of the handover node may be carried in the first message.
  • the target node may determine whether the routing information of the switching node is included in the routing information of the own node. If the target node determines that the routing information of the switching node is not included in the routing information, the third node is determined to be the parent node of the target node.
  • the target node may determine whether the identifier of the switching node and the identifier of the source node are included in the routing information of the own node. If the target node determines that the routing information of the routing node does not include the identifier of the switching node and does not include the identifier of the source node, the third node determines the third. The node is the parent of the target node. Alternatively, the target node may determine whether the identifier of the source node is included in the routing information of the own node. If the target node determines that the routing information of the source node does not include the identifier of the source node, the third node is determined to be the parent node of the target node.
  • the target node sends a second message to the parent node, where the second message is used to indicate that the handover node leaves the source node and the handover node accesses the target node.
  • the second message may carry the identifier of the target node, The identity of the source node and the identity of the switch node.
  • the first message sent by the handover node is used to indicate that the handover node accesses the target node.
  • the handover node reports its identity to the target node, and the handover node may indicate that the handover node accesses the target node.
  • the identifier of the handover node may be carried in the first message.
  • the switching node first obtains the identifier of the target node, and after the handover is completed, the handover node sends a first message to the target node to indicate that the handover node accesses the target node.
  • the first message may carry the identifier and target of the handover node. The identity of the node.
  • the target node may further determine whether the routing information of the handover node is included in the routing information. If the target node determines that the routing information of the handover node does not include the identifier of the handover node, the target node determines The third node is the parent node of the target node. The target node sends a second message to the parent node, where the second message is used to indicate that the handover node accesses the target node. Further, the second message carries the identifier of the target node and the identifier of the handover node.
  • the target node may further determine the identifier of the target node in the first message before sending the second message to the parent node. Whether the identity of the own is the same, if the target node determines that the identity of the target node in the first message is the same as the identity of the user, the target node sends a second message to the parent node.
  • a parent node of a node refers to a node that is directly connected to the uplink
  • a parent node of the target node is a first relay node that is directly connected to the target node.
  • the target node may also update its own routing information according to the joining of the switching node, such as adding routing information "direct connection with the switching node.”
  • the switching node is a second node
  • the target node is a first node
  • the first relay node or the core node connected to the target node is a third node.
  • the first relay node receives the first message sent by its child node (second node).
  • the first message received by the first relay node may be used to indicate that the handover node leaves the source node and the handover node accesses the target node, for example, the identifier of the target node and the identifier of the source node may be carried in the first message. And the identity of the switching node.
  • the first relay node may determine whether the routing information of the switching node is included in the routing information of the first relay node. If the routing information 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 of the first relay node. node.
  • the first relay node may determine whether the identifier of the switching node and the identifier of the source node are included in the routing information of the first relay node, if the routing information of the first relay node does not include the identifier of the switching node and does not include the identifier of the source node. And determining that the third node is the parent node of the first relay node.
  • the first relay node may determine whether the routing information of the source node includes the identifier of the source node. If the routing information of the first relay node does not include the identifier of the source node, the third node is determined to be the first relay node. The parent node.
  • the first relay node sends a second message to its own parent node, where the second message is used to indicate that the handover node leaves the source node and the handover node accesses the target node, and specifically, the second message can carry the target.
  • the second message is used to indicate that the handover node leaves the source node and the handover node accesses the target node, and specifically, the second message can carry the target.
  • the first message received by the first relay node is used to indicate that the handover node accesses the target node, for example, the identifier of the handover node and the identifier of the target node may be carried in the first message.
  • the first relay node determines that the identity of the handover node is not included in the routing information of the first relay node, and determines that the third node is the parent node of the first relay node.
  • the first relay node sends a second message to its own parent node, where the second message is used to indicate that the handover node accesses the target node. Specifically, the second message carries the identifier of the target node and the identifier of the handover node. .
  • 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), and does not include in determining its own routing information. After the identifier of the switching node and/or the routing information of the own node does not include the identifier of the source node, the second message is sent to the parent node, and the routing information is updated according to the joining of the switching node.
  • the routing information of the target node includes the identity of the target node.
  • a child node of a node refers to a node that is directly connected to the downlink, and the child node of the first relay node may be a target node, or may be another first relay. node.
  • the first relay node may be the first node, the child node of the first relay node may be the second node, and the parent node of the first relay node may be the third node.
  • the first relay node that is connected to the target node receives a message that the "switching node leaves the source node and joins the target node" sent by the target node, and determines whether the routing information in the message includes the identifier of the switching node in the message, that is, Determining whether the switching node is a newly added node on the path of the own node. If the routing information of the first relay node does not include the identifier of the switching node carried in the message, the first relay node connected to the target node determines to switch. The node is the newly added node on its own path, and further sends a message to the parent node that "the switch node leaves the source node and joins the target node".
  • the parent node of the first relay node may be a core node or other first relay nodes. Further, the first relay node further updates its own routing information according to the joining of the switching node, such as adding the routing information “the next hop to the switching node”.
  • the core node receives the first message sent by the first relay node (second node) directly connected to the core node.
  • the first message received by the core node may be used to indicate that the handover node leaves the source node and the handover node access target node, for example, the identifier of the handover node, the identifier of the source node, and the identifier of the target node may be carried in the first message. .
  • the core node may determine whether the routing information of the switching node includes the identifier of the switching node and/or the routing information of the source node in the routing information, and if the routing information of the core node includes the identifier of the switching node and/or the identifier of the source node, It indicates that the core node is the node on the path before the handover node is switched, and since the core node is also the node on the path after the handover node is switched, the routing information of the uplink node of the core node is not changed due to the handover of the handover node, then the core node is Instead of notifying the parent node of the node switch, it sends a second message to its own child node. At this time, the child node of the core node is the third node.
  • the second message sent by the core node may indicate that the handover node leaves. Specifically, the second message may include an identifier of the handover node.
  • the second message sent by the core node may also be used to indicate that the handover node leaves the source node.
  • the identifier of the source node and the identifier of the handover node may be carried in the second message.
  • the first message received by the core node may also be used to indicate that the handover node accesses the target node, for example, the identifier of the handover node and the identifier of the target node may be carried in the first message.
  • the core node can determine whether the routing information of the switching node is included in the routing information of the own node. If the routing information of the core node includes the identifier of the switching node, the core node does not need to notify the parent node of the switching status of the node, but to the own
  • the child node sends a second message, at which time the child node of the core node is the third node. The second message sent by the core node is used to indicate that the handover node leaves.
  • the core node may further determine whether the routing information of the target node is included in the routing information, if the core node determines that the routing information of the target node includes the identifier of the target node. Send a second message to its own child.
  • the core node may also update its own routing information according to the first message, such as adding the routing information "the next hop to the switching node", and deleting the routing information related to the next hop corresponding to the path before the switching node is switched.
  • the core node may be the first node, the first relay node or the target node or the handover node may be the second node, and the child node of the core node is the third node.
  • the core node can be the source node, for example, the node A is connected to the node B before the handover, and the node A is switched to the child node C of the node B.
  • the node B is the source node. It is also the core node. Further, the core node does not need to send a second message.
  • the second relay node receives the first message sent by its parent node (second node).
  • the first message received by the second relay node is used to indicate that the handover node leaves.
  • the first message may carry the identifier of the handover node.
  • the second relay node determines whether the routing information of the switching node includes the identity of the switching node, and the switching node is not the child node of the first node before the handover, if the second relay node determines that the routing information includes the switching node.
  • Identifying that the switching node is not a child node of the first node before the handover, and the child node that is not the first node before the handover of the handover node before the handover may also be understood as the routing information is not “directly connected with the handover node”, Then, the third node is determined to be the child node, and the second message is sent to the third node, where the second message is used to indicate that the handover node leaves. Specifically, the second message may carry the identifier of the handover node. It should be noted that the child node determined by the second relay node here is the next hop from the second relay node to the path of the handover node.
  • the first message received by the second relay node indicates that the handover node leaves the source node.
  • the identifier of the source node and the identifier of the handover node may be carried in the first message.
  • the second relay node may further determine whether the identifier of the source node in the first message is the same as the identifier of the first node, and if the second relay node determines that the identifier of the source node in the first message is different from the identifier of the first message, determining the third A node is its own child node, that is, it sends a second message to its own child node.
  • the second message is used to indicate that the handover node leaves the source node.
  • the second message may carry the identifier of the source node and the identifier of the handover node.
  • the child node determined by the second relay node here is the next hop from the second relay node to the path of the handover node.
  • the second relay node may further determine whether the routing information of the switching node is included in the routing information of the switching node, and the switching node is not a child node of the first node before the handover, if determining the routing information of the first node.
  • each second relay node between the source node and the core node can receive the first message sent by its parent node (core node or other second relay node), and determine that the routing information includes switching.
  • the identifier of the node and the switching node before the handover is not the child node of the first node, or the identity of the source node is determined to be different from the identifier of the source node, that is, the source node is not the source node, and the second message is sent to the own child node.
  • each second relay node may update its own routing information according to the first message, for example, deleting routing information related to the next hop of the path where the switching node is originally located. In this way, the node that is in the downlink of the core node on the path before the handover node can update its own routing information according to the situation of the node handover.
  • the second relay node may receive the first message sent by its parent node (the second node), if it is determined that the routing information of the switching node includes the identity of the switching node, and the switching node is a node directly connected with itself, or To determine that the identity of the source node is the same as that of the source node, that is, if it is the source node, you do not need to send the second message to its own child node. You only need to update its routing information according to the first message. For example, delete the switch node. Routing information for the next hop of the old path.
  • a child node of a node refers to a node directly connected to the node in the downlink.
  • the first node (such as the core node or the second relay node) queries its own routing information, determines that the next hop of the routing information that reaches the source node is the third node, or determines that the switching node is reached. One hop is the third node.
  • the node in which the handover occurs is connected to other nodes (denoted as a downlink node)
  • the node may carry the downlink node to switch together. If the node carries the downlink node to switch together, the first message sent by the handover node to the target node needs to include the routing information of the handover node, and the routing information of the handover node records the routing information related to the downlink node. Further, the routing information (such as the first message and the second message) sent by the target node, the first relay node, the core node, the second relay node, and the source node also needs to carry the routing information of the switching node.
  • the routing information (such as the first message and the second message) sent by the target node, the first relay node, the core node, the second relay node, and the source node also needs to carry the routing information of the switching node.
  • the target node, the first relay node, the core node, the second relay node, and the source node may further update their routing information according to the routing information of the switching node in the received message, for example, adding to the downlink node. Next hop, or delete the next hop to the downstream node.
  • the handover node notifies the source node of the handover of the node, and may first trigger the node that is in the downlink of the core node on the original path (the path before the handover node is switched) to update its own route according to the departure of the handover node. information. Subsequently, the core node triggers the new path (the path where the switching node is switched), and the node that is in the downlink of the core node updates its own routing information according to the joining of the switching node.
  • the processing of each node can be divided into the following types:
  • the source node receives the first message sent by the handover node, where the handover node is the second node.
  • the first message received by the source node is used to indicate that the handover node leaves the source node and the handover node access target node.
  • the first message may carry the identifier of the target node, the identifier of the source node, and the identifier of the handover node.
  • the second relay node determines whether the routing information of the target node is included in the routing information of the own node.
  • the third node determines that the third node is the parent node of the source node, that is, the source node.
  • the parent node sends a second message, where the second message is used to indicate that the handover node leaves the source node and the handover node accesses the target node.
  • the second message carries the identifier of the target node, the identifier of the source node, and the handover node. logo.
  • the first message received by the source node is used to indicate that the handover node accesses the target node.
  • the identifier of the handover node and the identifier of the target node may be carried in the first message.
  • the source node determines that the routing information of the switching node is not included in the routing information of the own node, and determines that the third node is the parent node of the source node.
  • the source node sends a second message to the parent node, where the second message is used to indicate that the handover node accesses the target node.
  • the second message carries the identifier of the target node and the identifier of the handover node.
  • the first message received by the source node is used to indicate that the handover node leaves and the handover node accesses the target node.
  • the identifier of the handover node and the identifier of the target node may be carried in the first message.
  • the source node determines that the routing information of the switching node is not included in the routing information of the own node, and determines that the third node is the parent node of the source node.
  • the source node sends a second message to the parent node, where the second message is used to indicate that the handover node leaves and the handover node accesses the target node.
  • the second message carries the identifier of the target node and the identifier of the handover node. .
  • the parent node of the source node (which may be the second relay node) is the third node. Further, the source node updates its own routing information, such as deleting the routing information "reaching the next hop node of the switching node.” It should be noted that before sending the first message to the first node, the source node knows that the handover node has switched and leaves the source node, and the source node updates its own routing information according to the departure of the handover node.
  • the second relay node receives the first message sent by its child node (second node).
  • the first message received by the second relay node is used to indicate that the handover node leaves the source node and the handover node access target node, for example, the identifier of the target node, the identifier of the source node, and the handover node may be carried in the first message.
  • logo The second relay node determines whether the identifier of the target node is included in the routing information of the own node. If the second relay node determines that the routing information of the target node does not include the identifier of the target node, the third node determines that the third node is the parent of the second relay node.
  • the second relay node sends a second message to the parent node, where the second message is used to indicate that the handover node leaves the source node and the handover node accesses the target node.
  • the second message carries the identifier of the target node. , the identity of the source node, and the identity of the switch node.
  • the first message is used to indicate that the handover node accesses the target node, for example, the identifier of the handover node and the identifier of the target node may be carried in the first message.
  • the second relay node determines that the identity of the handover node is not included in the routing information of the user, and determines that the third node is the parent node of the second relay node.
  • the second relay node sends a second message to the parent node, where the second message is used to indicate that the handover node accesses the target node.
  • the second message carries the identifier of the target node and the identifier of the handover node.
  • the first message received by the second relay node is used to indicate that the handover node leaves and the handover node accesses the target node.
  • the identifier of the handover node and the identifier of the target node may be carried in the first message.
  • the second relay node determines that the identity of the handover node is not included in the routing information of the user, and determines that the third node is the parent node of the second relay node.
  • the second relay node sends a second message to the parent node, where the second message is used to indicate that the handover node leaves and the handover node accesses the target node.
  • the second message carries the identifier of the target node and the handover. The identity of the node.
  • each second relay node between the source node and the core node can receive the first message sent by its child node (which may be the second relay node or the source node), in determining its own routing information. After the identifier of the target node is not included, the second message is sent to the parent node, and the routing information is updated according to the departure of the switching node.
  • the second relay node may be the first node
  • the child node of the second relay node may be the second node
  • the parent node of the second relay node may be the third node.
  • the second relay node connected to the source node receives a message indicating that the "switching node leaves the source node to join the target node" sent by the source node, and determines whether the routing information of the target node in the message is included in the routing information, if The routing information of the second relay node does not include the identifier of the target node in the message, that is, the second relay node determines that the target node is not in the path where the target node is located, and may also consider that the switching node is not in its own after the handover.
  • a message is sent to the parent node that "the switch node leaves the source node to join the target node", indicating that its parent node updates the routing information.
  • the parent node of the second relay node may be a core node or other second relay node. Further, the second relay node may further update its own routing information according to the departure of the handover node, such as deleting the routing information “the next hop to the handover node”.
  • the routing information including the identity of the switching node and/or its own routing information includes the identity of the source node.
  • the core node receives the first message sent by the second relay node (second node) directly connected thereto.
  • the first message received by the core node is used to indicate that the handover node leaves the source node and the handover node access target node.
  • the identifier of the handover node, the identifier of the source node, and the identifier of the target node may be carried in the first message.
  • the core node can determine whether the routing information of the target node includes the identifier of the target node.
  • the core node is a common node of the path before and after the handover of the switching node, and only the common node in the embodiment of the present invention
  • the core node and the downlink node of the core node perform routing update, then the core node does not need to notify the parent node of the handover of the node, but sends a second message to its own child node.
  • the child node of the core node is the first node.
  • the second message is used to indicate that the handover node accesses the target node, for example, the identifier of the target node and the identifier of the handover node may be carried in the second message.
  • the first message is used to indicate that the handover node accesses the target node, for example, the identifier of the handover node and the identifier of the target node may be carried in the first message.
  • the core node can determine whether the routing information of the target node is included in the routing information of the target node. If the routing information of the core node includes the identifier of the target node, the core node does not need to notify the parent node of the switching status of the node, but to the own
  • the child node sends a second message, at which time the child node of the core node is the third node.
  • the second message is used to indicate that the handover node accesses the target node. For example, the identifier of the target node and the identifier of the handover node may be carried in the second message.
  • the core node may also be determined that the routing information of the source node includes the identity of the source node and/or the routing information of the switch node including the switching node.
  • the core node may also update its own routing information according to the first message, such as adding the routing information “the next hop to the switching node”, and deleting the routing information of the next hop of the switching node originally in the old path.
  • the core node may be the first node, the second relay node or the source node may be the second node, and the child node receiving the second message is the third node, and the child node is the core node reaching the path of the target node. Next hop.
  • the first relay node receives the first message sent by its parent node, where the parent node of the first relay node is the second node.
  • the first message received by the first relay node indicates that the handover node accesses the target node, for example, the identifier of the handover node and the identifier of the handover node may be carried in the first message.
  • the first relay node determines that the identifier of the target node in the first message is different from the identifier of the first node, and determines that the third node is its own child node, that is, sends a second message to its own child node.
  • the second message is used to indicate that the handover node accesses the target node.
  • each first relay node between the target node and the core node can receive the first message sent by its parent node (core node or other first relay node), and determine its own identity and the first message.
  • the target node in the ID is different, that is, if it is not the target node, it sends a second message to its own child node.
  • the routing information of the target node includes the identity of the target node.
  • each of the first relay nodes may update its own routing information according to the first message, for example, adding the routing information “the next hop to the switching node”. In this way, the node that is in the downlink of the core node on the path after the handover node is switched can update its own routing information according to the situation of the node handover.
  • the first node (such as the core node or the first relay node) queries its own routing information, and determines that the next hop of the routing information that reaches the target node is the third node.
  • the node in which the handover occurs is connected to other nodes (denoted as a downlink node)
  • the node may carry the downlink node to switch together.
  • the first message sent by the switching node to the source node further includes routing information of the switching node, and the routing information of the switching node records routing information related to the downlink node.
  • the routing information (such as the first message and the second message) sent by the target node, the first relay node, the core node, the second relay node, and the source node also needs to carry the routing information of the switching node.
  • the target node, the first relay node, the core node, the second relay node, and the source node may further update their routing information according to the routing information of the switching node in the received message, for example, adding to the downlink node. One hop, or delete the next hop to the downstream node.
  • the first node receives the first message sent by the second node, where the first message is used to indicate that the handover node leaves the source node and/or the handover node accesses the target node.
  • the first node can also update its own routing information according to the first message.
  • the first node is any one of the following nodes: a target node, a 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: a handover node, a target node, a source node, a core node, a first relay node, and a second relay node. That is to say, in the embodiment of the present invention, 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 do not need to notify the nodes. The signaling overhead is saved, and at the same time, the number of nodes performing routing update is reduced, and the communication of the entire network can be restored in a short time, thereby shortening the data interruption time.
  • a node that needs to add routing information first performs routing update. After the routing information is added to the nodes, the node that needs to delete the routing information needs to update its own node. Routing information. For example, referring to FIG. 5, when the RN9 leaves the RN8 and joins the RN7, the RN9 sends a message to the target node RN7, "RN9 leaves the RN8 to join the RN7", and the message "RN9 leaves the RN8 to join the RN7" can carry the RN9, the RN8, and the RN7. The identity of the nodes.
  • Each node determines how to send a message to indicate a node handover based on the received message and its own routing information. Specifically, if the node determines that the identifier of the target node RN7 in the received message is the same as its own identifier, that is, the node is the target node RN7, the RN7 sends a message to the own parent node RN5 indicating that "RN9 leaves the RN8 and joins the RN7.”
  • the node determines that its routing information includes only the identifier of the target node, and does not include the identifier of the handover node and/or the identifier of the source node, it indicates that the node is the first relay node, such as: RN5.
  • the RN5 needs to continue to send "RN9 to leave RN8 to join RN7" to its own parent node RN3.
  • the RN5 may also update its own routing information table according to the message. Specifically, the information "RN9->RN7" is added, that is, the next hop from the RN5 to the RN9 path is RN7.
  • the node determines that its own routing information includes not only the identifier of the target node RN7 but also the identifiers of the source node RN8 and the handover node RN9, it indicates that the node is a core node, such as: RN3.
  • the RN3 does not need to continue to send the "RN9 to leave the RN8 to the RN7" to its own parent node RN1, but sends a message to the RN6 of its own child node (the child node connected to the core node on the path before the RN9 handover) to indicate "RN9 leaves".
  • the message "RN9 leaves” may carry the identifier of the handover node RN9.
  • the RN3 updates its own routing information according to "RN9 leaves the RN8 and joins the RN7". Specifically, the RN3 adds the routing information "RN9->RN5", that is, the next hop on the new path from RN3 to RN9 is RN5. RN3 deletes the routing information "RN9->RN6", that is, the next hop on the old path from RN3 to RN9 is RN6. "RN9->RN5" is the routing information to the new path of RN9, and "RN9->RN6" is the routing information to the old path of RN9.
  • the next step is to delete the routing information node for routing update.
  • the RN3 indicates "RN9 leaves" to the corresponding child node, where the "corresponding child node", that is, the child node on the path before the RN9 is switched, can be regarded as the next hop from the RN3 to the RN9 before the RN9 handover, such as: RN6.
  • the RN6 determines whether the routing information of the switching node RN9 and the routing information of the RN6 include "direct connection with the RN9", if the RN6 routing information includes the handover. If the identifier of the node does not include "direct connection with RN9", then a message is sent to its own child node indicating "RN9 leaves", such as: sending to RN8. Each node that receives the message sent by its parent node determines whether the routing information of the switching node RN9 is included in the routing information of the routing node and determines whether the routing information includes "direct connection with the RN9", if the identifier of the switching node RN9 is included.
  • RN9 "Direct connection with RN9" sends a message to its own child node indicating "RN9 leaves”. If the identity of the node RN9 is switched but "direct connection with RN9" is not included, the transmission is stopped. For example, RN6 and RN8 can update their own routing information according to the received message ("RN9 leaves"), for example, RN6 deletes information RN9->RN8, that is, the next hop from RN6 to RN9 is RN8. RN8 deletes the message "Direct connection with RN9".
  • the message sent by the RN3 to the RN6 may also be "RN9 leaves the RN8", and the message may carry the identifiers of the RN9 and the RN8.
  • the RN6 can determine whether the identifier of the source node RN8 is the same as its own identifier in the received message, and if it is different, send a message to its own child node indicating "RN9 leaves RN8".
  • Each node that receives the "RN9 leaving RN8" 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 it is different, it sends a message indication to its own child node.
  • RN9 leaves RN8 if it is the same, it stops transmitting.
  • the node in which the handover occurs is connected to other nodes in the downlink, the node may carry the handover with other nodes connected thereto, and if the node switches, it carries the handover with other nodes connected thereto, and the node not only indicates the target.
  • the switch node leaves the source node and accesses the target node
  • it can also send its own routing information to the target node. For example, referring to FIG. 6, the RN9 leaves the RN8 to access the RN7, and the RN9 sends a message to the RN7 indicating that the RN9 has left the RN8 and joined the RN7.
  • the message also needs to include the routing information of the RN9 itself.
  • the routing information of the RN9 is "directly connected to the RN 10."
  • the message transmitted between the target node, the first relay node, the core node, the second relay node, and the source node also needs to include routing information of the switching node.
  • the message sent by the RN 7 to the RN 5 includes the routing information “directly connected to the RN 10” of the RN 9
  • the message sent by the RN 5 to the RN 3 includes the routing information “directly connected to the RN 10” of the RN 9 and the message sent by the RN 3 to the RN 6 .
  • the routing information of the RN9 is "directly connected to the RN10"
  • the message sent by the RN6 to the RN8 includes the routing information "directly connected to the RN10" of the RN9.
  • the message sent by RN3 to RN6 may also be "RN9 leaves RN8", which may carry the identity of RN9 and RN8.
  • the RN6 can determine whether the identifier of the source node RN8 is the same as its own identifier in the received message, and if it is different, send a message to its own child node indicating that "RN9 leaves RN8".
  • Each node that receives the "RN9 leaving RN8" 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 it is different, it sends a message to its own child node indicating "RN9". Leave RN8", if the same, stop sending a message indicating "RN9 leaves RN8".
  • the message sent by the handover node to the target node may be different from the example given in FIG. 5, the message may only indicate that the handover node accesses the target node, in particular, the message includes the identity of the handover node and the target node Logo.
  • the RN9 when the RN9 leaves the RN8 to join the RN7, the RN9 sends a message to the target node RN7 indicating "RN9 joins the RN7", and the message may carry the identifiers of the RN9 and the RN7.
  • Each node determines how to send a message according to the received message and its own routing information table to indicate the handover status of the node. Specifically, if the node determines that the identifier of the target node RN7 in the received message is the same as its own identifier, that is, the node is the target node RN7, the RN7 sends a message to the own parent node RN5 indicating that "RN9 joins RN7.” Alternatively, the target node RN7 itself knows that the handover node accesses itself, and knows the identity of the handover node RN9 according to the received message, and the target node RN7 sends a message "RN9 joins RN7" to its parent node RN5.
  • the node determines that its own routing information includes only the identifier of the target node, and does not include the identifier of the switching node and the identifier of the source node, it indicates that the node is the first relay node, such as: RN5.
  • the RN5 needs to continue to send "RN9 to RN7" to its own parent node RN3.
  • the RN5 may also update its own routing information table according to the message. Specifically, the information "RN9->RN7" is added, that is, the next hop from the RN5 to the RN9 path is RN7.
  • the node determines that its own routing information includes not only the identifier of the target node RN7 but also the identifier of the handover node RN9, it indicates that the node is a core node, such as: RN3, and RN3 does not need to continue to send "RN9 to RN7" to itself.
  • the parent node RN1 sends a message indicating "RN9 leaves” to the RN6 of the child node (the child node connected to the core node on the path before the RN9 is switched), and the message carries the identifier of the handover node RN9.
  • the RN3 needs to find its own routing information, determine the next hop from the RN3 to the handover node RN9, and send "RN9 leave” to the next hop.
  • the routing information of the RN3 includes "RN9->RN6", that is, from the RN3.
  • the next hop to the handover node RN9 is RN6, and the RN3 sends a message to the RN6 indicating "RN9 is away.”
  • the RN3 updates its own routing information according to the message, specifically, the RN3 adds the information "RN9->RN5", that is, from The next hop on the RN3 to RN9 path is RN5.
  • RN3 deletes the message "RN9->RN6", that is, the next hop on the path from RN3 to RN9 is RN6.
  • the next step is to delete the routing information node for routing update.
  • the RN3 indicates "RN9 leaves" to the corresponding child node, where the "corresponding child node", that is, the child node on the path before the RN9 is switched, can be regarded as the next hop from the RN3 to the RN9 before the RN9 handover, such as: RN6.
  • the RN6 determines whether the identity of the handover node RN9 is included in the routing information of the RN3, and whether it includes "directly connected to the handover node RN9", if the identifier of the handover node RN9 is included. Excluding "directly connected to the handover node RN9", a message will be sent to its own child node indicating "RN9 leaves", such as: sending to the RN8.
  • Each node that receives the message sent by its parent node determines whether the routing information of the switching node RN9 and the "directly connected to the switching node RN9" are included in the routing information, if the identifier of the switching node RN9 is included. But does not include "directly connected to the switching node RN9", then sends a message to its own child node indicating "RN9 leaves”; if it includes the identity including the switching node RN9 and "directly connected to the switching node RN9", then stops transmitting the indication "RN9" Leave the message.
  • RN6 deletes information RN9->RN8, that is, the next hop from RN6 to RN9 is RN8.
  • RN8 deletes the message "Direct connection with RN9".
  • the node in which the handover occurs if the node in which the handover occurs is connected to other nodes in the downlink, the node may carry the handover with other nodes connected thereto, and if the node switches, it carries the handover with other nodes connected thereto, and the handover node notifies the indication.
  • the target node switching node may also send its own routing information to the target node in addition to the source node accessing the target node. For example, a similar method as shown in FIG. 6 is omitted here.
  • a method for updating a route provided by an embodiment of the present invention is described below with reference to the accompanying drawings.
  • a node that needs to delete routing information first performs routing update. After the routing information is deleted by these nodes, the node that needs to add routing information needs to update its own node. Routing information. For example, referring to FIG. 8, when the RN9 leaves the RN8 to join the RN7, the RN9 sends a message to the source node RN8 indicating "RN9 joins the RN7", and the message may carry the identifiers of the RN9 and the RN7.
  • Each node determines how to send a message to indicate a node handover based on the received message and its own routing information table. Specifically, the source node knows that the handover node has switched and leaves the source node. If the source node RN8 receives the message indicating that the RN9 joins the RN7, the RN8 sends a message to the parent node RN6 indicating that the RN9 leaves the RN8 to join the RN7. Optionally, the RN9 sends a message to the source node RN8, and may also indicate that the RN9 leaves the RN8 to join the RN7.
  • the source node determines that the identifier of the source node RN8 in the received message is the same as its own identifier, and the RN8 sends its own parent node RN6.
  • the message is sent indicating "RN9 leaves RN8 to join RN7". If the node determines that its routing information does not include the identifier of the target node RN7, it indicates that the node is the second relay node, such as: RN6.
  • the RN6 needs to continue to send "RN9 to leave RN8 to join RN7" to its own parent node RN3.
  • the RN 6 may also update its own routing information table according to the message. Specifically, the information "RN9->RN8" is deleted, that is, the next hop from the RN6 to the RN9 path is RN8.
  • the node determines that the routing information of the target node RN7 is included in the routing information, the node indicates that the node is a core node, for example, RN3, and the RN3 does not need to continue to send the RN9 to the RN8 to the RN1, but to the parent node RN1.
  • the RN5 sends a message indicating that the RN9 joins the RN7, and the message can carry the identifiers of the RN9 and the RN7.
  • the RN3 updates its own routing information according to "RN9 leaves the RN8 and joins the RN7". Specifically, the RN3 adds the information "RN9->RN5", that is, the next hop from the RN3 to the RN9 path is RN5. RN3 deletes the message "RN9->RN6", that is, the next hop from the RN3 to the RN9 path is RN6.
  • the next step is to add the routing information to the node for routing update.
  • the RN3 indicates to the corresponding child node that the RN9 joins the RN7, and the corresponding child node, that is, the child node on the path after the RN9 is switched, can be regarded as the next hop from the RN3 to the RN9 after the RN9 handover, for example, the RN5 .
  • the RN5 determines whether the identifier of the target node RN7 in the received message is the same as its own identifier, and if not, sends a message to its own child node indicating that “RN9 joins the RN7”. ", such as: send to RN7.
  • Each node (such as RN5, RN7) that receives the message sent by its parent node determines whether the identity of the target node RN7 in the message is the same as its own identity. If it is different, it sends a message to its own child node indicating that "RN9 joins RN7. ", if it is the same, stop sending.
  • RN5 and RN7 can update their own routing information according to the received message ("RN9 joins RN7"). For example, RN5 adds information RN9->RN7, that is, the next hop from RN5 to RN9 is RN7. RN7 adds the message "Direct connection to RN9".
  • the node in which the handover occurs is connected to other nodes in the downlink, the node may carry the handover with other nodes connected thereto, and if the node switches, it carries the handover with other nodes connected thereto, and the handover node notifies the indication.
  • the source node "the switching node accesses the target node node”
  • it can also send its own routing information to the target node. For example, referring to FIG. 9, the RN9 leaves the RN8 to access the RN7, and the RN9 sends a message to the RN8 indicating that "RN9 has left the RN8 and joined the RN7". At the same time, the message also needs to include the routing information of the RN9 itself.
  • the routing information of the RN9 is "directly connected to the RN 10."
  • the routing information of the handover node RN9 is also required in the message transmitted between the target node, the first relay node, the core node, the second relay node, and the source node.
  • the message sent by the RN8 to the RN6 includes the routing information "directly connected to the RN10" of the RN9
  • the message sent by the RN6 to the RN3 includes the routing information "directly connected to the RN10" of the RN9
  • the routing information of the RN9 is directly connected to the RN 10.
  • the message sent by the RN 5 to the RN 7 includes the routing information of the RN 9 "directly connected to the RN 10.”
  • the message sent by the handover node RN9 to the source node RN8 may be different from the example given in Figure 8, which may only indicate that the handover node is accessing the target node.
  • the RN9 when the RN9 leaves the RN8 and joins the RN7, the RN9 sends "RN9 to the RN7" to the source node RN8, and the message may carry the identifiers of the RN9 and the RN7.
  • Each node determines how to send a message according to the received message and its own routing information table to indicate the handover status of the node. Specifically, the source node knows that the handover node has switched and leaves the source node. If the source node RN8 receives the message indicating that the RN9 joins the RN7, the RN8 sends a message to the parent node RN6 indicating that the RN9 joins the RN7.
  • the node determines that its own routing information does not include the identity of the target node RN7, it indicates that the node is the second relay node, such as: RN6.
  • the RN6 needs to continue to send "RN9 to RN7" to its own parent node RN3.
  • the RN 6 may also update its own routing information table according to the message. Specifically, the information "RN9->RN8" is deleted, that is, the next hop from the RN6 to the RN9 path is RN8.
  • the node determines that its own routing information includes the identifier of the target node RN7, it indicates that the node is a core node, such as: RN3, and RN3 does not need to continue to send "RN9 to RN7" to its own parent node RN1, but to its own
  • the RN5 sends a message indicating that the RN9 joins the RN7, and the RN3 updates its own routing information according to the message. Specifically, the RN3 adds the information "RN9->RN5". That is, the next hop on the path from RN3 to RN9 is RN5. RN3 deletes the message "RN9->RN6", that is, the next hop from the RN3 to the RN9 path is RN6.
  • the next step is to add the routing information to the node for routing update.
  • the RN3 indicates to the corresponding child node that the RN9 joins the RN7, and the corresponding child node, that is, the child node on the path after the RN9 is switched, can be regarded as the next hop from the RN3 to the RN9 after the RN9 handover, for example, the RN5 .
  • the RN5 determines whether the identifier of the target node RN7 in the received message is the same as its own identity, and if not, sends the received message to its own child node. Indicates that "RN9 joins RN7", such as: sends to RN7.
  • Each node that receives the message sent by its parent node eg, RN5, RN7 determines whether the identity of the target node RN7 is the same as its own identity. If it is different, it sends a message to its own child node indicating that "RN9 joins RN7". If they are the same, stop sending.
  • Both RN5 and RN7 can update their own routing information according to the received message ("RN9 joins RN7"). For example, RN5 adds information RN9->RN7, that is, the next hop from RN5 to RN9 is RN7. RN7 adds the message "Direct connection to RN9".
  • the message sent by the handover node RN9 to the source node RN8 may also be “RN9 leaves, RN9 accesses RN7”, and the message may carry the identifiers of the RN9 and the RN7.
  • the RN8 can determine whether the routing information of the target node RN7 is included in the routing information of the RN8. If the routing information of the RN8 does not include the identifier of the target node RN7, the RN8 sends a message to the parent RN6 indicating that "RN9 leaves and RN9 accesses RN7". .
  • the RN6 can determine whether the routing information of the target node RN7 is included in the routing information of the RN6.
  • the RN8 sends a message to the parent node RN3 indicating that "RN9 leaves and RN9 accesses RN7". .
  • the RN3 determines that the routing information of the target node RN7 is included in its own routing information, and sends a message "RN9 access RN7" to its own child node RN5, which may carry the identifiers of RN9 and RN7.
  • the RN5 receives the message sent by the RN3, determines that its own identity is different from the identity of the target node RN7, and sends a message to the own child node RN7 indicating that "RN9 accesses the RN7.”
  • the RN7 receives the message sent by the RN5, determines that its own identity is the same as the identity of the target node RN7, and stops transmitting the message indicating that the RN9 accesses the RN7.
  • the node in which the handover occurs if the node in which the handover occurs is connected to other nodes in the downlink, the node may carry the handover with other nodes connected thereto, and if the node switches, it carries the handover with other nodes connected thereto, and the handover node notifies the indication.
  • the source node the switching node accesses the target node node
  • it can also send its own routing information to the target node. For example, a similar method as shown in FIG. 9 will not be repeated here.
  • the device for routing update includes a corresponding hardware structure and/or software module for executing each function in order to implement the above functions.
  • the present application can be implemented in a combination of hardware or hardware and computer software in combination with the algorithmic steps of the various examples described in the embodiments disclosed herein. Whether a function is implemented in hardware or computer software to drive hardware depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods to implement the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present application.
  • the embodiment of the present application may perform the division of the function module on the network device according to the foregoing method example.
  • each function module may be divided according to each function, or two or more functions may be integrated into one processing module.
  • the above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of the module in the embodiment of the present application is schematic, and is only a logical function division, and the actual implementation may have another division manner.
  • the embodiment of the present invention provides a communication device, where the communication device may be the first node, the second node, or the third node involved in the embodiment of the present invention.
  • FIG. 11 shows a possible structural diagram of the above communication device.
  • the network device includes a receiving unit 1101, an updating unit 1102, and a transmitting unit 1103.
  • the receiving unit 1101 is configured to support the network device to perform step 401 in the foregoing embodiment, and/or other processes for the techniques described herein;
  • An update unit 1102 configured to support the network device to perform step 402 in the above embodiments, and/or other processes for the techniques described herein;
  • the sending unit 1103 is configured to support the network device to send a message to other nodes, such as 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 is used for the description herein. Other processes of technology.
  • the network device includes a processing module 1201 and a communication module 1202.
  • the processing module 1201 is for controlling management of actions of the network device, for example, performing the steps performed by the update unit 1102 described above, and/or other processes for performing the techniques described herein.
  • the communication module 1202 is for supporting interaction between the network device and other devices, for example, performing the steps performed by the receiving unit 1101 and the transmitting unit 1103 described above.
  • the network device may further include a storage module 1203, where the storage module 1203 is configured to store program codes and data of the network device.
  • the network device may be the network device shown in FIG. If the transceiver is a receiver and a transmitter, the receiver performs the steps performed by the receiving unit 1101 described above, and the transmitter performs the steps performed by the transmitting unit 1103.
  • the embodiments of the present application are applied to a 5G communication system or other systems that may appear in the future, and some of the terms in the present application are explained below so as to be understood by those skilled in the art. It should be noted that, when the solution of the embodiment of the present application is applied to a 5G system or other systems that may appear in the future, the names of the network device and the user device may change, but this does not affect the implementation of the solution in the embodiment of the present application.
  • UE User Equipment
  • user and user equipment is a device that provides voice and/or data connectivity to users, for example, a handheld device with a wireless connection function, an in-vehicle device, and the like.
  • Common user equipment includes, for example, a mobile phone, a tablet computer, a notebook computer, a palmtop computer, a mobile internet device (MID), and a wearable device.
  • the wearable device includes, for example, a smart watch, a smart wristband, and a step counter. And so on.
  • a network device also known as a radio access network (RAN) device, is a device that accesses a user equipment to a wireless network, and includes network devices in various communication systems, including but not limited to : a base station, an evolved Node B (eNB), a radio network controller (RNC), a Node B (Node B, NB), a network device controller (BSC), a network device Base Transceiver Station (BTS), home network equipment (for example, Home evolved NodeB, or Home Node B, HNB), Baseband Unit (BBU), and the like.
  • the network device includes network devices of various frequency systems, including, but not limited to, low frequency network devices and high frequency network devices.
  • the user equipment informs a network device (such as a base station, etc.) of how much data needs to be sent in the uplink buffer by the Buffer Status Reporting (BSR), so that the network device determines how many uplink resources are allocated to the UE.
  • BSR Buffer Status Reporting
  • the UE triggers a Scheduling Request (SR) to inform the network device that it has data to send, and the network device allocates a UE to the UE. At least enough to send the uplink resource of the BSR, the UE uses the uplink resource to send the BSR to the network device.
  • SR Scheduling Request
  • Condition 1 when a Medium Access Control (MAC) protocol data unit (Protocol Data Unit, PDU) group packet completes and contains a BSR, and the BSR contains the buffer status until the most recent event that triggers the BSR; condition 2, when a transmitted MAC PDU contains all available for transmission Pass data.
  • the triggered BSR may be canceled when any of the following two conditions are met: Condition 1, when a transmitted MAC PDU packet is completed and contains a BSR, the triggered BSR is cancelled.
  • Condition 2 when a transmitted MAC PDU contains all pending data that can be used for transmission but can no longer contain a BSR MAC Control Unit (CE) plus its header, the triggered BSR may be cancelled.
  • CE BSR MAC Control Unit
  • the user equipment receives the downlink scheduling information sent by the network device on the physical downlink control channel (PDCCH) resource (Downlink Control).
  • DCI Downlink Control
  • the downlink scheduling information indicates an uplink grant (UL grant), and indicates how long the elapsed time from the current reception of the downlink scheduling information can be used to send uplink data using the indicated uplink grant.
  • the downlink control information indicates K. The value indicates that the uplink data may be sent using the indicated uplink grant after the K time is received after receiving the downlink control information.
  • the uplink data is transmitted on a Physical Uplink Shared Channel (PUSCH) resource.
  • PUSCH Physical Uplink Shared Channel
  • the user equipment can start the group packet after receiving the downlink scheduling information, that is, the Medium Access Control (MAC) Protocol Data Unit (PDU), and the packet needs to be completed before the uplink license arrives.
  • the grouped good MAC PDU is successfully sent using the indicated uplink grant.
  • the user equipment can perform grouping at any time in the K time period, depending on the user equipment itself. After the user equipment completes the MAC PDU, it is very likely that the time for the uplink grant has not been used, that is, the time when the physical uplink shared channel resource has not yet appeared. At this time, the good MAC PDU needs to wait for a period of time before the indication can be used.
  • the uplink grant transmits the MAC PDU.
  • the MAC PDU group packet After the MAC PDU group packet is completed, it also needs to wait for the R time before the MAC PDU can be sent using the indicated uplink grant. That is to say, in the R time, since the SR has been canceled, even if a Physical Uplink Control Channel (PUCCH) resource that can send an SR is generated, the SR cannot be sent, and the MAC PDU can only be sent after the R time.
  • PUCCH Physical Uplink Control Channel
  • FIG. 13 is a schematic diagram of an application scenario provided by an embodiment of the present application.
  • the networking architecture shown in FIG. 13 mainly includes a network device 1301 and a user equipment 1302.
  • the user equipment 1302 can communicate with the network device 1301.
  • the data sent by the user equipment 1302 to the network device 1301 belongs to the uplink data, and the data sent by the network device 1301 to the user equipment 1302 is downlink data, and the uplink resource (for example, time-frequency resource) used by the user equipment 1302 to send the uplink data is
  • the network device 1301 is configured by static scheduling, semi-static scheduling, dynamic scheduling, and the like.
  • the user equipment 1302 informs the network device 1301 (such as a base station, etc.) of how much uplink data needs to be sent by the BSR, so that the network device 1301 determines how many uplink resources are allocated to the user equipment 1302.
  • the user equipment 1302 may send the 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 that is at least sufficient to send the BSR, and the user equipment 1302 sends the BSR by using the uplink resource.
  • the network device 1301 such as a base station, etc.
  • FIG. 14 is a schematic flowchart of a method for canceling a scheduling request according to an embodiment of the present disclosure, where the method includes but is not limited to the following steps:
  • Step 1401 The device determines that the first scheduling request is triggered.
  • the device may be a terminal device.
  • the trigger condition for triggering the scheduling request is met, the scheduling request is triggered, and the device determines that the first scheduling request is triggered. It can be understood that the device knows that there is a triggered first scheduling request.
  • the first scheduling request is a pending scheduling request, and it can also be understood that the first scheduling request is a scheduling request that is triggered and has not been cancelled.
  • Step 1402 When the media access control protocol data unit is sent, and the media access control protocol data unit includes the first cache status report, the device cancels the first scheduling request.
  • the device when the device receives the uplink resource allocated by the network device, the device combines the transmitted data into one MAC PDU, and the MAC PDU may include a cache status report.
  • the MAC PDU When the group of good MAC PDUs is sent, and the MAC PDU includes the first cache 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 cache status report includes a first cache status, where the first cache status is a cache status until an event that recently triggered the cache status report. For example, before the MAC PDU is sent, Event 1 triggers the trigger buffer status report at time 1, corresponding to the buffer status 1.
  • Event 2 triggers the trigger buffer status report at time 2, corresponding to the cache status. 2. There is no new event triggering the buffer status report before the MAC PDU is sent and after the event 2.
  • the first cache state can be regarded as the cache state of the last event 2 at time 2, that is, the first cache state can be regarded as a cache. State 2.
  • the medium access control protocol data unit is sent to be considered to be at least one medium access control protocol data unit, the medium access control protocol data unit including the first buffer status report may be considered to be the medium access control protocol data unit included At least one first cache status report is not limited by the present invention.
  • the media access control protocol data unit is sent may be sent by the media access control protocol data unit, or may be, after the media access control protocol data unit is sent, the invention is not limited.
  • the first cache state is a cache state when an event of the most recent buffer status report is triggered until the media access control protocol data unit group packet. That is, when the group of good MAC PDUs is sent, and the MAC PDU includes the first cache status report, the first cache status report includes a first cache status, the first cache status is up to the MAC PDU group packet.
  • the cache status of the event that triggered the buffer status report is triggered last time, it is considered that the condition for canceling the first scheduling request is satisfied, and the device cancels the first scheduling request to be processed.
  • event 1 triggers a trigger buffer status report at time 1, corresponding to buffer status 1, after time 1 and before the MAC PDU is sent
  • event 2 triggers a trigger buffer status report at time 2, corresponding to In the buffer state 2
  • Event 3 triggers the trigger buffer status report at time 3, corresponding to the buffer status 3.
  • the first buffer status can be regarded as the most recent event before the MAC PDU group packet.
  • the cache state at time 2 that is, the first cache state can be considered as cache state 2.
  • the first cache state is a cache state when an event reported by the first cache state is triggered.
  • the first scheduling request is a scheduling request triggered before the media access control protocol data unit group packet.
  • the scheduling request 1 is triggered, and after the MAC PDU group packet and before the MAC PDU is sent, the scheduling request 2 is triggered.
  • the first scheduling request may be regarded as a scheduling request triggered before the MAC PDU group packet. That is, scheduling request 1.
  • the first scheduling request is a scheduling request triggered by the second buffer status report, where the media access control protocol data unit includes a buffer status when the event that triggers the second buffer status report is triggered.
  • the MAC PDU will include a buffer status report when the group packet is included.
  • the cache status report will contain the latest cache status of the current group packet time, that is, the most recent trigger cache before the MAC PDU group packet.
  • the buffer status of the event reported by the status that is, the buffer status when the event reported by the second cache status is triggered. Therefore, the second cache status report can be considered as the cache status report triggered before the MAC PDU group packet, first.
  • the scheduling request is a scheduling request triggered by the second buffer status report, and the first scheduling request may be considered as a scheduling request triggered before the MAC PDU group packet.
  • the first scheduling request may be one or more, that is, the scheduling request triggered before the MAC PDU group packet is triggered is the first scheduling request, and the device canceling the first scheduling request may be understood as the device canceling all the first scheduling requests. .
  • the first cache status report does not include a first cache status, which is a cache status until an event that triggered the cache status report was last triggered. It can also be understood that the first cache status report includes a second cache status, which is not the cache status until the event that the cache status report was last triggered.
  • the first scheduling request is a scheduling request triggered before the media access control protocol data unit group packet.
  • the scheduling request 1 is triggered, and after the MAC PDU group packet and before the MAC PDU is sent, the scheduling request 2 is triggered.
  • the first scheduling request may be regarded as a scheduling request triggered before the MAC PDU group packet. That is, scheduling request 1.
  • the first scheduling request is a scheduling request triggered by the second buffer status report, where the media access control protocol data unit includes a buffer status when the event that triggers the second buffer status report is triggered. If there is currently a triggered buffer status report or scheduling request, the MAC PDU will include a buffer status report when the group packet is included.
  • the cache status report will contain the latest cache status of the current group packet time, that is, the most recent trigger cache before the MAC PDU group packet.
  • the buffer status of the event reported by the status that is, the buffer status when the event reported by the second cache status is triggered. Therefore, the second cache status report can be considered as the cache status report triggered before the MAC PDU group packet, first.
  • the scheduling request is a scheduling request triggered by the second buffer status report, and the first scheduling request may be considered as a scheduling request triggered before the MAC PDU group packet.
  • the first scheduling request may be one or more, that is, the scheduling request triggered before the MAC PDU group packet is triggered is the first scheduling request, and the device canceling the first scheduling request may be understood as the device canceling all the first scheduling requests. .
  • the device may also stop the scheduling request inhibit timer of the first scheduling request.
  • Each scheduling request may be configured corresponding to one scheduling request, and each scheduling request is configured with a respective scheduling request prohibition timer. Therefore, when a scheduling request configured by one scheduling request is cancelled, that is, a scheduling request configured for the scheduling request is not triggered. At this time, it is necessary to stop the scheduling request prohibition timer of the scheduling request. Therefore, when the device cancels the first scheduling request, it is also necessary to stop the scheduling request prohibition timer of the first scheduling request.
  • the first scheduling request may be one or more, and the multiple scheduling requests may be corresponding to one or more scheduling request configurations, and the device canceling the first scheduling request may be understood as the device canceling all the first scheduling requests, and stopping the first
  • the scheduling request prohibition timer of the scheduling request may be understood as stopping the scheduling request prohibition timer of the first scheduling request. If a plurality of scheduling requests correspond to one scheduling request configuration, stopping the corresponding scheduling request prohibiting timer, if multiple scheduling If the request corresponds to multiple scheduling request configurations, the corresponding scheduling request prohibition timers are stopped.
  • FIG. 15 is a schematic flowchart of a method for canceling a buffer status report according to an embodiment of the present disclosure, where the method includes but is not limited to the following steps:
  • Step 1501 The device determines that the first cache status report is triggered.
  • the device may be a terminal device.
  • the trigger condition for triggering the buffer status report is met, the cache status report is triggered, and the device determines that the first cache status report is triggered. It can be understood that the device knows that there is a triggered first cache status report.
  • Step 1502 When the media access control protocol data unit is sent, and the media access control protocol data unit includes a cache status report, the device cancels the first cache status report.
  • the device when the device receives the uplink resource allocated by the network device, the device combines the transmitted data into one MAC PDU, and the MAC PDU may include at least one cache status report.
  • the MAC PDU When the group of good MAC PDUs is sent, and the MAC PDU includes at least one cache status report, it is considered that the condition for canceling the first cache status report is satisfied, and the device cancels the first cache status report to be triggered.
  • the first cache status report may be one or more, and the device canceling the first cache status report may be understood as the device canceling all the first cache status reports.
  • the medium access control protocol data unit is sent to be considered to be at least one medium access control protocol data unit, and the medium access control protocol data unit includes a buffer status report, which may be considered to be that the medium access control protocol data unit includes at least one
  • the cache status report is not limited in the present invention.
  • the media access control protocol data unit is sent may be sent by the media access control protocol data unit, or may be, after the media access control protocol data unit is sent, the invention is not limited.
  • the first cache status report is a buffer status report that is triggered before the media access control protocol data unit group packet. That is, when a group of good MAC PDUs is sent, and the MAC PDU includes at least one cache status report, it is considered that the condition for canceling the first cache status report is satisfied, and the first cache status report is the MAC PDU group package.
  • the pre-triggered cache status report at which time the device cancels the triggered first scheduling request. For example, before the MAC PDU group packet is triggered, the buffer status report 1 is triggered. After the MAC PDU group packet and before the MAC PDU is sent, the buffer status report 2 is triggered.
  • the first buffer status report can be regarded as being triggered before the MAC PDU group packet.
  • the cache status report that is, the cache status report 1.
  • the first cache status report may be one or more, that is, the cache status report triggered before the MAC PDU group packet is triggered is the first cache status report, and the device cancels the first cache status report, which may be understood as the device cancels all The first cache status report.
  • the media access control protocol data unit includes a buffer status when an event that triggers the first cache status report is triggered. That is, when a good MAC PDU is sent, and the MAC PDU contains at least one cache status report, if the MAC PDU contains the buffer status when the event triggering the first cache status report is triggered, it is considered that the cancellation is satisfied.
  • the condition of the first cache status report at which time the device cancels the triggered first scheduling request. If there is currently a triggered buffer status report or scheduling request, the MAC PDU will include a buffer status report when the group packet is included.
  • the cache status report will contain the latest cache status of the current group packet time, that is, the most recent trigger cache before the MAC PDU group packet.
  • the cache status of the event reported by the status that is, the cache status when the event reported by the first cache status is triggered. Therefore, the first cache status report can be considered as the cache status report triggered before the MAC PDU group packet. It should be noted that the first cache status report may be one or more, that is, when the MAC PDU includes the event that triggers the first cache status report, the device cancels the first cache status report, which may be understood as the device cancels all. The first cache status report.
  • event 1 triggers the trigger buffer status report BSR1 at time 1, corresponding to the buffer status 1, and triggers the scheduling request SR1
  • event 2 is at time 2
  • the trigger buffer status report BSR2 is triggered, corresponding to the buffer status 2, and the scheduling request SR2 is triggered.
  • the MAC PDU may include a cache status report due to the currently triggered buffer status report, and the cache status report includes the cache status until the event that the cache status report was last triggered, that is, the cache status 2 At this time, SR1 and SR2 are not canceled, but SR1 and SR2 are canceled after the MAC PDU is transmitted.
  • Event 3 triggers the trigger buffer status report BSR3 at time 3, corresponding to the buffer status 3, and triggers the scheduling request SR3.
  • the MAC PDU may include a buffer status report, and the cache status report includes a buffer status, that is, a buffer status 2, until an event that the cache status report was last triggered before the MAC PDU group packet.
  • the scheduling request triggered before the MAC PDU group packet is cancelled, that is, the scheduling request SR1 and the scheduling request SR2 are canceled, and the MAC PDU group packet is not cancelled.
  • the MAC PDU includes a buffer status that triggers a certain buffer status report
  • cancel the scheduling request triggered by the buffer status report for example, the MAC PDU includes the buffer status 1 and event 1 and event 2 Cache state 2, thus canceling the scheduling request SR1 triggered by the buffer status report BSR1 and the scheduling request SR2 triggered by the buffer status report BSR2, and the MAC PDU does not contain the buffer status 3 of event 3, so the BSR3 is not cancelled by the buffer status report.
  • the triggered scheduling request SR3 is not cancelled by the buffer status report.
  • event 1 triggers the trigger buffer status report BSR1 at time 1, corresponding to the buffer status 1, and triggers the scheduling request SR1
  • event 2 is at time 2
  • the trigger buffer status report BSR2 is triggered, corresponding to the buffer status 2, and the scheduling request SR2 is triggered.
  • the MAC PDU group packet is completed, the MAC PDU may include a buffer status report due to the currently triggered buffer status report. At this time, BSR1 and BSR2 are not canceled, but BSR1 and BSR2 are cancelled after the MAC PDU is sent.
  • Event 3 triggers the trigger buffer status report BSR3 at time 3, corresponding to the buffer status 3, and triggers the scheduling request SR3.
  • the MAC PDU may include a buffer status report. In this case, instead of canceling all triggered buffer status reports, the cache status report triggered before the MAC PDU group packet is cancelled, that is, the buffer status is canceled. Report BSR1 and buffer status report BSR2 without canceling the cache status report BSR3 triggered after the MAC PDU group packet.
  • the buffer status report is cancelled, for example, the cache status 1 and the buffer status 2 when the event 1 and the event 2 are included in the MAC PDU. Therefore, the buffer status report BSR1 and the buffer status report BSR2 are canceled, and the MAC PDU does not contain the buffer status 3 of event 3, so the buffer status report BSR3 is not cancelled.
  • the method of the embodiment of the present invention 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 the uplink resource for transmitting the uplink data to the user equipment earlier. , thereby reducing the delay of the uplink data of the user equipment.
  • the embodiment of the present application may divide the function module into the device according to the foregoing method example.
  • each function module may be divided according to each function, or two or more functions may be integrated into one processing module.
  • the above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of the module in the embodiment of the present application is schematic, and is only a logical function division, and the actual implementation may have another division manner.
  • FIG. 17 shows a possible structural diagram of the above communication device. As shown in FIG. 17, the device includes a determining unit 1701 and a canceling unit 1702.
  • a determining unit 1701 for supporting the device to perform step 1401 in the above embodiment, and/or for supporting the device to perform step 1501 in the above embodiment, and/or other processes for the techniques described herein .
  • the canceling unit 1702 is configured to support the device to perform step 1402 in the above embodiment, and/or to support the device to perform step 1502 in the above embodiment, and/or other processes for the techniques described herein. .
  • the device includes a processing module 1801.
  • the processing module 1801 is configured to control and manage the actions of the device, for example, perform the steps performed by the determining unit 1701 described above, and/or perform the steps performed by the determining unit 1702, and/or other processes for performing the techniques described herein.
  • the device may further include a storage module 1802 for storing program codes and data of the device.
  • FIG. 19 a schematic structural diagram of a device provided by an embodiment of the present application is shown in FIG.
  • the device includes a processor 1901, a memory 1902.
  • the processing module 1801 is the processor 1901, for example, performing the steps performed by the determining unit 1701 described above, and/or other processes for performing the techniques described herein.
  • the storage module 1802 is a memory 1902 for storing program codes and data of the device.
  • the disclosed apparatus and method may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the modules or units is only a logical function division.
  • there may be another division manner for example, multiple units or components may be used.
  • the combination may be integrated into another device, or some features may be ignored or not performed.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may be one physical unit or multiple physical units, that is, may be located in one place, or may be distributed to multiple different places. . Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.
  • the integrated unit if implemented in the form of a software functional unit and sold or used as a standalone product, may be stored in a readable storage medium.
  • the technical solution of the embodiments of the present application may be embodied in the form of a software product in the form of a software product in essence or in the form of a contribution to the prior art, and the software product is stored in a storage medium.
  • a number of instructions are included to cause a device (which may be a microcontroller, chip, etc.) or processor to perform all or part of the steps of the methods described in various embodiments of the present application.
  • the foregoing storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本申请实施例提供了路由更新方法、调度请求取消方法及设备，涉及通信领域，能够节省信令开销，减少网络拓扑变化导致的数据中断时间。其中一种方法包括：第一节点接收第二节点发送的第一消息，根据接收到的第一消息更新自己的路由信息。第一消息用于指示切换节点离开源节点和/或切换节点接入目标节点。第一节点为以下任意一个：目标节点、源节点、核心节点、目标节点与核心节点之间的第一中继节点、源节点与核心节点之间的第二中继节点。第二节点为以下任意一个：切换节点、目标节点、源节点、核心节点、第一中继节点、第二中继节点。源节点是切换节点切换前连接的节点，目标节点为切换节点切换后连接的节点。核心节点是目标节点与源节点上行方向的第一个共同节点。

Description

一种路由更新方法、调度请求取消方法及设备 技术领域
本申请实施例涉及通信技术领域，尤其涉及一种路由更新方法及设备。
背景技术
在树网络拓扑结构中，用户设备(User Equipment，UE)可以直接与宿主基站(Donor gNB，DgNB)进行通信，也可以通过中继节点(Relay Node，RN)与宿主基站进行通信。也就是说UE到宿主基站的路径可能由多个RN组成。宿主基站、RN均保存了路由信息，路由信息中包括从本地到UE的路径信息，宿主基站、RN可以根据路由信息将数据包发给正确的UE。
当某个RN发生切换，如该RN从当前连接的一个RN切换到另一个RN上，网络拓扑结构就发生了变化，因此宿主基站、网络拓扑中的各个RN需要根据变化后的网络拓扑更新本地保存的路由信息。当RN1从RN2切换到RN3，一方面，RN2发现RN1离开，则向自己的父节点(Parent Node)RN4发送消息指示“RN1离开了RN2”，RN4根据该消息更新自己的路由信息并继续向自己的父节点RN5发送消息指示“RN1离开了RN2”，直到该消息到达宿主基站，宿主基站根据该消息更新自己的路由信息。父节点可以为宿主基站或中继节点。需要说明的是，某一节点的父节点可以理解为上行方向上与某一节点直接相连的节点，即可以理解为某一节点的直接连接的上一跳。
另一方面，RN3发现RN1接入，则向自己的父节点RN6发送消息指示“RN1加入了RN3”，RN6根据该消息更新自己的路由信息并继续向自己的父节点RN7发送消息指示“RN1加入了RN3”，直到该消息到达宿主基站，宿主基站还会根据该消息更新自己的路由信息。
可见，现有技术中RN切换导致网络拓扑发生变化时，该RN切换前到达宿主基站的路径上的每一个RN都会更新路由信息，同时，该RN切换后到达宿主基站的路径上所有RN也会更新路由信息。实际上，网络拓扑的改变并不影响某一些RN、宿主基站的路由信息，即更新后的路由信息与更新前的路由信息相同，因此这些RN、宿主基站不需要更新路由信息。另外，这些RN之间通过特定的消息指示网络拓扑的改变(如：RN离开了某个RN，或RN加入了某个RN)，也造成了不必要的信令开销。
当网络拓扑改变后，只有当宿主基站、所有RN完成路由信息更新后，宿主基站才能够重新将数据包从新路径发送出去，造成数据中断时间较长。
发明内容
本申请实施例提供一种路由更新方法及设备，能够节省信令开销，减少网络拓扑变化导致的数据中断时间。
为达到上述目的，本申请实施例采用如下技术方案：
第一方面，本申请实施例提供了一种路由更新方法，包括：第一节点接收第二节点发送的第一消息。具体地，第一消息用于指示切换节点离开源节点和/或切换节点接入目标节点。其中，源节点是切换节点切换前连接的节点，目标节点为切换节点切换后连接的节点。进一步，第一节点还可以根据接收到的第一消息更新自己的路由信息。例如：删除到达某节点的下一跳，或，增加到达某节点的下一跳。
具体实现中，第一节点为以下节点中的任意一个：目标节点、源节点、核心节点、目标节点与核心节点之间的第一中继节点、源节点与核心节点之间的第二中继节点。其中，核心节点是目标节点与源节点上行方向的第一个共同节点。第二节点为以下节点中的任意一个：切换节点、目标节点、源节点、核心节点、第一中继节点、第二中继节点。
可见，本发明实施例提供的方法中，在节点发生切换导致网络拓扑改变时，只是核心节点以及核心节点下行的节点之间交互消息指示节点切换的情况，并进行路由更新。现有技术中，IAB网络中的一个 节点切换后，该节点切换前到达宿主基站的路径上的每一个节点都会接收到指示节点切换情况的消息，也会更新路由信息，同时，该节点切换后到达宿主基站的路径上所有节点也会接收到指示节点切换情况的消息并更新路由信息。相比而言，本发明实施例中，IAB网络中除核心节点以及核心节点下行的节点外的其他节点无需进行路由更新，也不需要信令通知这些节点，节省了信令开销，同时由于进行路由更新的节点数量的减少，整个网络经过较短时间就可以恢复通信，缩短了数据中断时间。
结合第一方面，在第一方面的第一种可能的实现方式中，所述方法还包括：第一节点根据第一消息确定接收第二消息的第三节点，向第三节点发送第二消息，第二消息用于指示切换节点离开源节点和/或切换节点接入目标节点。其中，第三节点为以下节点中的任意一个：源节点、核心节点、目标节点、第一中继节点、第二中继节点。
也就是说，第一节点还会向其他节点发送消息指示节点切换的情况，如此使得IAB网络中与切换节点相关的核心节点以及该核心节点下行的节点均可以接收到指示节点切换情况的消息。在网络拓扑发生变化后，依据网络拓扑的实际变化更新自己的路由信息，根据正确的路由信息转发数据，使得网络恢复通信。
结合第一方面的第一种可能的实现方式，在第一方面的第二种可能的实现方式中，第二消息还包括切换节点的路由信息。
在一些实施例中，如果切换节点的下级还连接有其他下级节点，并且这些节点跟随切换节点一起切换。切换节点自己的路由信息中包括与这些下级节点相关的路由信息，为了保证后续宿主基站能够继续与这些下级节点进行通信，需要通过第二消息指示切换节点的路由信息，如此，使得各个节点还可以更新与这些下级节点相关的路由信息，保证宿主基站在后续发送的数据可以到达这些下级节点，或这些下级节点在后续发送的数据可以到达宿主基站。
结合第一方面或第一方面的第一或第二种可能的实现方式，在第一方面的第三种可能的实现方式中，第一消息还包括切换节点的路由信息。
在一些实施例中，如果切换节点的下级还连接有其他下级节点，并且这些节点跟随切换节点一起切换。切换节点自己的路由信息中包括与这些下级节点相关的路由信息，为了保证后续宿主基站能够继续与这些下级节点进行通信，需要通过第一消息指示切换节点的路由信息，如此，使得各个节点还可以更新与这些下级节点相关的路由信息，保证宿主基站在后续发送的数据可以到达这些下级节点，或这些下级节点在后续发送的数据可以到达宿主基站。
结合第一方面的第一种可能的实现方式，在第一方面的第四种可能的实现方式中，第一节点根据第一消息确定接收第二消息的第三节点包括：第一节点确定第一节点的路由信息中不包括切换节点的信息和/或第一节点的路由信息中不包括源节点的信息，则确定第三节点为第一节点的父节点。
在一些实施例中，需要增加路由信息的节点先进行路由更新，在这些节点增加完路由信息后，需要删除路由信息的节点再更新自己的路由信息。因此，切换节点向目标节点发送第一消息指示节点切换的情况，随后，目标节点可以将该消息传递给自己上行的第一中继节点，每一个第一中继节点都需要在接收子节点发送的消息后将该消息发送给自己的父节点，以便切换节点切换后所在路径上处于核心节点下行的节点完成路由更新。对于一个第一节点，如果第一节点的路由信息中不包括切换节点的信息，或者，第一节点的路由信息中不包括切换节点和源节点的信息，或者，第一节点的路由信息中不包括源节点的信息，则说明该节点是切换节点切换后所在路径上的节点，例如，该节点可以是第一中继节点或目标节点。
结合第一方面的第四种可能的实现方式，在第一方面的第五种可能的实现方式中，第一消息用于指 示切换节点离开源节点和切换节点接入目标节点，第二消息用于指示切换节点离开源节点和切换节点接入目标节点；或者，第一消息用于指示切换节点接入目标节点，第二消息用于指示切换节点接入目标节点。
也就是说，对于第一中继节点或目标节点来说，需要将接收到的消息指示的内容传递出去，即第一消息可以和第二消息指示的内容相同。
结合第一方面的第一种可能的实现方式，在第一方面的第六种可能的实现方式中，第一节点根据第一消息确定接收第二消息的第三节点包括：第一节点确定第一节点的路由信息包括切换节点的信息和/或第一节点的路由信息中包括源节点的信息，则确定第三节点为第一节点的子节点。
对于一个第一节点，如果第一节点的路由信息中包括切换节点的信息，或者，第一节点的路由信息中包括切换节点和源节点的信息，或者，第一节点的路由信息中包括源节点的信息，则说明该节点是切换节点切换后所在路径上的节点，还是切换节点切换前所在路径上的节点，例如，该节点可以是两条路径的靠近UE方向上的第一个共同节点，即本发明实施例所述的核心节点。另外，由于本发明实施例中核心点IAB网络中除核心节点以及核心节点下行的节点外的其他节点无需进行路由更新，也不需要信令通知这些节点，且切换节点切换后所在路径上的节点，如：第一中继节点、目标节点已经完成路由更新，因此，核心节点需要向自己的子节点发送消息指示切换节点离开的情况。
结合第一方面的第六种可能的实现方式，在第一方面的第七种可能的实现方式中，第一消息用于指示切换节点离开源节点和切换节点接入目标节点，第二消息用于指示切换节点离开源节点；或者，第一消息用于指示切换节点接入目标节点，第二消息用于指示切换节点离开源节点；或者，第一消息用于指示切换节点离开源节点和切换节点接入目标节点，第二消息用于指示切换节点离开；或者，第一消息用于指示切换节点接入目标节点，第二消息用于指示切换节点离开。
具有实现中，核心节点向自己的子节点(如：第二中继节点)可以指示切换节点离开源节点，也可以仅指示切换节点离开，接收到核心节点指示的消息后可以根据核心节点指示的内容进行路由更新，如：删除路由信息中的“到达切换节点的下一跳”。
结合第一方面的第一种可能的实现方式，在第一方面的第八种可能的实现方式中，第一节点根据第一消息确定接收第二消息的第三节点包括：第一节点确定第一节点的路由信息中包括切换节点的信息且切换节点切换前不是所述第一节点的子节点，则确定第三节点为第一节点的子节点。
如果第一节点确定第一节点的路由信息中包括切换节点的信息，说明该节点在切换节点切换前所在路径上，又由于切换节点切换前不是所述第一节点的子节点，说明该节点不是源节点，例如，该节点为第二中继节点。本发明实施例中，核心节点以及核心节点下行的节点进行路由更新，因此，第二中继节点向自己的子节点发送第二消息，指示节点切换的情况。
结合第一方面的第八种可能的实现方式，在第一方面的第九种可能的实现方式中，第一消息用于指示切换节点离开，第二消息用于指示切换节点离开。
也就是说第一节点为第二中继节点，第二中继节点接收到的消息指示切换节点离开，第二中继节点向自己的节点发送的消息指示切换节点离开。
结合第一方面的第六至第九种可能的实现方式中的任意一种，在第一方面的第十种可能的实现方式中，确定第三节点为第一节点的子节点具体包括：第一节点根据第一节点的路由信息确定到达切换节点的下一跳为第三节点。
也就是说第一节点为第二中继节点，第二中继节点接收到的消息指示切换节点离开，该消息可以携带切换节点的信息，因此，第二中继节点可以基于切换节点的信息以及自己的路由信息确定将指示切换 情况的消息发送给哪一节点。
结合第一方面的第一种可能的实现方式，在第一方面的第十一种可能的实现方式中，第一节点根据第一消息确定接收第二消息的第三节点包括：第一节点确定源节点的信息与第一节点的信息不同，则确定第三节点为第一节点的子节点；和/或，第一节点确定第一节点的路由信息中包括切换节点的信息且切换节点切换前不是所述第一节点的子节点，则确定第三节点为第一节点的子节点。
如果第一节点确定源节点的信息与自己的信息不同，说明该节点不是源节点，或者，如果第一节点确定第一节点的路由信息中包括切换节点的信息，说明该节点在切换节点切换前所在路径上，又由于切换节点切换前不是所述第一节点的子节点，说明该节点不是源节点，例如，该节点为第二中继节点。本发明实施例中，核心节点以及核心节点下行的节点进行路由更新，因此，第二中继节点向自己的子节点发送第二消息，指示节点切换的情况。
结合第一方面的第十一种可能的实现方式，在第一方面的第十二种可能的实现方式中，第一消息用于指示切换节点离开源节点，第二消息用于指示切换节点离开源节点。
具体地，第一消息可以携带切换节点的信息以及源节点的信息，第二消息可以携带切换节点的信息以及源节点的信息。
结合第一方面的第十一或第十二种可能的实现方式，在第一方面的第十三种可能的实现方式中，确定第三节点为第一节点的子节点具体包括：第一节点根据第一节点的路由信息确定到达源节点的下一跳为第三节点；和/或，第一节点根据第一节点的路由信息确定到达切换节点的下一跳为第三节点。
也就是说第一节点为第二中继节点，第二中继节点接收到的消息指示切换节点离开源节点，该消息可以携带切换节点的信息以及源节点的信息，因此，第二中继节点可以基于切换节点的信息或源节点的信息以及自己的路由信息确定将指示切换情况的消息发送给哪一节点。
结合第一方面的第一种可能的实现方式，在第一方面的第十四种可能的实现方式中，第一节点根据第一消息确定接收第二消息的第三节点包括：第一节点确定第一节点的路由信息中不包括目标节点的信息，则确定第三节点为第一节点的父节点。
在一些实施例中，需要删除路由信息的节点先进行路由更新，在这些节点删除完路由信息后，需要增加路由信息的节点再更新自己的路由信息。因此，切换节点向源节点发送第一消息指示节点切换的情况，随后，源节点可以将该消息传递给自己上行的第二中继节点，每一个第二中继节点都需要在接收子节点发送的消息后向自己的父节点发送消息指示节点的切换情况，以便切换节点切换前所在路径上处于核心节点下行的节点完成路由更新。对于一个节点如果自己的路由信息中不包括目标的标识，则说明该节点是切换节点切换前所在路径上的节点，例如，该节点可以是第二中继节点或源节点。
结合第一方面的第十四种可能的实现方式，在第一方面的第十五种可能的实现方式中，第一消息用于指示切换节点离开源节点和切换节点接入目标节点，第二消息用于指示切换节点离开源节点和切换节点接入目标节点；或者，第一消息用于指示切换节点接入目标节点，第二消息用于指示切换节点接入目标节点。
也就是说，对于第二中继节点或目标节点来说，需要将接收到的消息指示的内容传递出去，即第一消息可以和第二消息指示的内容相同。
结合第一方面的第一种可能的实现方式，在第一方面的第十六种可能的实现方式中，第一节点根据第一消息确定接收第二消息的第三节点包括：第一节点确定第一节点的路由信息中包括目标节点的信息，则确定第三节点为第一节点的子节点。
对于一个节点，如果自己的路由信息中包括目标节点的信息，则说明该节点是切换节点切换后所在 路径上的节点，由于该节点的子节点的路由信息中不包括目标节点的信息，说明该节点还是切换节点切换前所在路径上的节点，例如，该节点可以是两条路径的靠近UE方向上的第一个共同节点，即本发明实施例所述的核心节点。另外，由于本发明实施例中核心点IAB网络中除核心节点以及核心节点下行的节点外的其他节点无需进行路由更新，也不需要信令通知这些节点，且切换节点切换后所在路径上的节点，如：第一中继节点、目标节点已经完成路由更新，因此，核心节点需要向自己的子节点发送消息指示切换节点加入的情况。
结合第一方面的第十六种可能的实现方式，在第一方面的第十七六种可能的实现方式中，第一消息用于指示切换节点离开源节点和切换节点接入目标节点，第二消息用于指示切换节点接入目标节点；或者，第一消息用于指示切换节点接入目标节点，第二消息用于指示切换节点接入目标节点。
对于第二中继节点，接收到的第一消息与发送给子节点的第二消息可以不同，发送的第二消息用于指示切换节点接入目标节点。
结合第一方面的第一种可能的实现方式，在第一方面的第十八种可能的实现方式中，第一节点根据第一消息确定接收第二消息的第三节点包括：第一节点确定目标节点的信息与第一节点的信息不同，则确定第三节点为第一节点的子节点。
对于第一中继节点来说，如果自己不是目标节点，则需要向自己的节点发送第二消息指示切换节点的加入。
结合第一方面的第十八种可能的实现方式，在第一方面的第十九种可能的实现方式中，第一消息用于指示切换节点接入目标节点，第二消息用于指示切换节点接入目标节点。
结合第一方面的第十六至第十九种可能的实现方式中的任意一种，在第一方面的第二十种可能的实现方式中，确定第三节点为第一节点的子节点包括：第一节点根据第一节点的路由信息确定到达目标节点的下一跳为第三节点。
当第一节点为第一中继节点，第一中继节点接收到的消息中包括目标节点的信息，第二中继节点则可以基于目标节点的信息判断如何发送消息指示节点的切换情况。
第二方面，公开了一种设备，该设备作为第一节点，包括：接收单元，用于接收第二节点发送的第一消息，第一消息用于指示切换节点离开源节点和/或切换节点接入目标节点；源节点是切换节点切换前连接的节点，目标节点为切换节点切换后连接的节点；更新单元，用于根据第一消息更新第一节点的路由信息。
具体实现中，第一节点为以下节点中的任意一个：目标节点、源节点、核心节点、目标节点与核心节点之间的第一中继节点、源节点与核心节点之间的第二中继节点；核心节点是目标节点与源节点上行方向的第一个共同节点；第二节点为以下节点中的任意一个：切换节点、目标节点、源节点、核心节点、第一中继节点、第二中继节点。
可见，在节点发生切换导致网络拓扑改变时，只是核心节点以及核心节点下行的节点之间交互消息指示节点切换的情况，并进行路由更新。现有技术中，IAB网络中的一个节点切换后，该节点切换前到达宿主基站的路径上的每一个节点都会接收到指示节点切换情况的消息，也会更新路由信息，同时，该节点切换后到达宿主基站的路径上所有节点也会接收到指示节点切换情况的消息并更新路由信息。相比而言，本发明实施例中，IAB网络中除核心节点以及核心节点下行的节点外的其他节点无需进行路由更新，也不需要信令通知这些节点，节省了信令开销，同时由于进行路由更新的节点数量的减少，整个网络经过较短时间就可以恢复通信，缩短了数据中断时间。
结合第二方面，在第二方面的第一种可能的实现方式中，所述设备还包括确定单元。确定单元，用 于根据第一消息确定接收第二消息的第三节点，向第三节点发送第二消息，第二消息用于指示切换节点离开源节点和/或切换节点接入目标节点；其中，第三节点为以下节点中的任意一个：源节点、核心节点、目标节点、第一中继节点、第二中继节点。
结合第二方面的第一种可能的实现方式中，在第二方面的第二种可能的实现方式中，第二消息还包括切换节点的路由信息。
结合第二方面或第二方面的第一或第二种可能的实现方式中，在第二方面的第三种可能的实现方式中，第一消息还包括切换节点的路由信息。
结合第二方面的第一种可能的实现方式中，在第二方面的第四种可能的实现方式中，确定单元具体用于，确定第一节点的路由信息中不包括切换节点的信息和/或第一节点的路由信息中不包括源节点的信息，则确定第三节点为第一节点的父节点。
结合第二方面的第四种可能的实现方式中，在第二方面的第五种可能的实现方式中，第一消息用于指示切换节点离开源节点和切换节点接入目标节点，第二消息用于指示切换节点离开源节点和切换节点接入目标节点；或者，第一消息用于指示切换节点接入目标节点，第二消息用于指示切换节点接入目标节点。
结合第二方面的第一种可能的实现方式中，在第二方面的第六种可能的实现方式中，确定单元具体用于，确定第一节点的路由信息包括切换节点的信息和/或第一节点的路由信息中包括源节点的信息，则确定第三节点为第一节点的子节点。
结合第二方面的第六种可能的实现方式中，在第二方面的第七种可能的实现方式中，第一消息用于指示切换节点离开源节点和切换节点接入目标节点，第二消息用于指示切换节点离开源节点；或者，第一消息用于指示切换节点接入目标节点，第二消息用于指示切换节点离开源节点；或者，第一消息用于指示切换节点离开源节点和切换节点接入目标节点，第二消息用于指示切换节点离开；或者，第一消息用于指示切换节点接入目标节点，第二消息用于指示切换节点离开。
结合第二方面的第一种可能的实现方式中，在第二方面的第八种可能的实现方式中，确定单元具体用于，确定第一节点的路由信息中包括切换节点的信息且切换节点切换前不是所述第一节点的子节点，则确定第三节点为第一节点的子节点。
结合第二方面的第八种可能的实现方式中，在第二方面的第九种可能的实现方式中，第一消息用于指示切换节点离开，第二消息用于指示切换节点离开。
结合第二方面的第六或第七或第八或第九种可能的实现方式中，在第二方面的第十种可能的实现方式中，确定单元具体用于，根据第一节点的路由信息确定到达切换节点的下一跳为第三节点。
结合第二方面的第一种可能的实现方式中，在第二方面的第十一种可能的实现方式中，确定单元具体用于，确定源节点的信息与第一节点的信息不同，则确定第三节点为第一节点的子节点；和/或，确定第一节点的路由信息中包括切换节点的信息且切换节点切换前不是所述第一节点的子节点，则确定第三节点为第一节点的子节点。
结合第二方面的第十一种可能的实现方式中，在第二方面的第十二种可能的实现方式中，第一消息用于指示切换节点离开源节点，第二消息用于指示切换节点离开源节点。
结合第二方面的第十一或第十二种可能的实现方式中，在第二方面的第十三种可能的实现方式中，确定单元具体用于，根据第一节点的路由信息确定到达源节点的下一跳为第三节点；和/或，根据第一节点的路由信息确定到达切换节点的下一跳为第三节点。
结合第二方面的第一种可能的实现方式中，在第二方面的第十四种可能的实现方式中，确定单元具 体用于，确定第一节点的路由信息中不包括目标节点的信息，则确定第三节点为第一节点的父节点。
结合第二方面的第十四种可能的实现方式中，在第二方面的第十五种可能的实现方式中，第一消息用于指示切换节点离开源节点和切换节点接入目标节点，第二消息用于指示切换节点离开源节点和切换节点接入目标节点；或者，第一消息用于指示切换节点接入目标节点，第二消息用于指示切换节点接入目标节点。
结合第二方面的第一种可能的实现方式中，在第二方面的第十六种可能的实现方式中，确定单元具体用于，确定第一节点的路由信息中包括目标节点的信息，则确定第三节点为第一节点的子节点。
结合第二方面的第十六种可能的实现方式中，在第二方面的第十七种可能的实现方式中，第一消息用于指示切换节点离开源节点和切换节点接入目标节点，第二消息用于指示切换节点接入目标节点；或者，第一消息用于指示切换节点接入目标节点，第二消息用于指示切换节点接入目标节点。
结合第二方面的第一种可能的实现方式中，在第二方面的第十八种可能的实现方式中，确定单元用于，确定目标节点的信息与第一节点的信息不同，则确定第三节点为第一节点的子节点。
结合第二方面的第十八种可能的实现方式中，在第二方面的第十九种可能的实现方式中，第一消息用于指示切换节点接入目标节点，第二消息用于指示切换节点接入目标节点。
结合第二方面的第十六至第十九种可能的实现方式中中的任意一种，在第二方面的第二十种可能的实现方式中，确定单元具体用于，根据第一节点的路由信息确定到达目标节点的下一跳为第三节点。
第三方面，公开了一种设备，所述设备作为第一节点，包括：收发器和处理器，所述收发器接收第二节点发送的第一消息，所述第一消息用于指示切换节点离开源节点和/或切换节点接入目标节点；所述源节点是所述切换节点切换前连接的节点，所述目标节点为所述切换节点切换后连接的节点；所述处理器根据所述收发器接收的所述第一消息更新所述第一节点的路由信息；其中，所述第一节点为以下节点中的任意一个：所述目标节点、所述源节点、核心节点、所述目标节点与所述核心节点之间的第一中继节点、所述源节点与所述核心节点之间的第二中继节点；所述核心节点是所述目标节点与所述源节点上行方向的第一个共同节点；所述第二节点为以下节点中的任意一个：所述切换节点、所述目标节点、所述源节点、所述核心节点、所述第一中继节点、所述第二中继节点。
结合第三方面，在第三方面的第一种可能的实现方式中，所述处理器还根据所述第一消息确定接收第二消息的第三节点；所述收发器还向所述第三节点发送所述第二消息，所述第二消息用于指示所述切换节点离开源节点和/或所述切换节点接入目标节点；其中，所述第三节点为以下节点中的任意一个：所述源节点、所述核心节点、所述目标节点、所述第一中继节点、所述第二中继节点。
结合第三方面第一种可能的实现方式中，在第三方面的第二种可能的实现方式中，所述第一节点根据所述第一消息确定接收第二消息的第三节点包括：所述第一节点确定所述第一节点的路由信息中不包括所述切换节点的信息和/或所述第一节点的路由信息中不包括所述源节点的信息，则确定所述第三节点为所述第一节点的父节点。
结合第三方面第二种可能的实现方式中，在第三方面的第三种可能的实现方式中，所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开所述源节点和所述切换节点所述接入目标节点；或者，所述第一消息用于指示所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点接入所述目标节点。
结合第三方面第一种可能的实现方式中，在第三方面的第四种可能的实现方式中，所述处理器还用于，确定所述第一节点的路由信息包括所述切换节点的信息和/或所述第一节点的路由信息中包括所述源节点的信息，则确定所述第三节点为所述第一节点的子节点。
结合第三方面第四种可能的实现方式中，在第三方面的第五种可能的实现方式中，所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开所述源节点；或者，所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开；或者，所述第一消息用于指示所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开。
结合第三方面，在第三方面的第六种可能的实现方式中，所述处理器还确定所述第一节点的路由信息中包括所述切换节点的信息且所述切换节点切换前不是所述第一节点的子节点，则确定所述第三节点为所述第一节点的子节点。
结合第三方面的第六种可能的实现方式，在第三方面的第七种可能的实现方式中，所述第一消息用于指示所述切换节点离开，所述第二消息用于指示所述切换节点离开。
结合第三方面的第一种可能的实现方式，在第三方面的第八种可能的实现方式中，所述处理器还用于，确定所述源节点的信息与所述第一节点的信息不同，则确定所述第三节点为所述第一节点的子节点；和/或，所述第一节点确定所述第一节点的路由信息中包括所述切换节点的信息且所述切换节点切换前不是所述第一节点的子节点，则确定所述第三节点为所述第一节点的子节点。
结合第三方面的第八种可能的实现方式，在第三方面的第九种可能的实现方式中，所述第一消息用于指示所述切换节点离开所述源节点，所述第二消息用于指示所述切换节点离开所述源节点。
第四方面，公开了一种计算机可读存储介质，该计算机可读存储介质中存储有指令；当其在上述第二方面及其任意一项可能的实现方式所述的设备上运行时，使得该设备执行如上述第一方面及其各种可能的实现方式所述的路由更新方法。
第五方面，公开了一种无线通信装置，该无线通信装置中存储有指令，当该无线通信装置在上述第二方面及其任意一项可能的实现方式所述的设备上运行时，使得该设备执行如上述第一方面及其各种可能的实现方式所述的路由更新方法。具体实现中，该无线通信装置可以是芯片。
本申请中第二方面、第三方面、第四方面、第五方面及其各种实现方式的具体描述，可以参考第一方面及其各种实现方式中的详细描述；并且，第二方面、第三方面、第四方面、第五方面及其各种实现方式的有益效果，可以参考第一方面及其各种实现方式中的有益效果分析，此处不再赘述。
第六方面，申请实施例提供了一种调度请求取消方法，包括：设备确定第一调度请求被触发；当媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含第一缓存状态报告，所述设备取消所述第一调度请求。
结合第六方面，在第六方面的第一种可能的实现方式中，所述方法还包括：所述第一缓存状态报告包含第一缓存状态，所述第一缓存状态为直到最近一次触发缓存状态报告的事件时的缓存状态。
结合第六方面的第一种可能的实现方式，在第六方面的第二种可能的实现方式中，所述方法还包括：所述第一缓存状态为直到所述媒体接入控制协议数据单元组包前最近一次触发缓存状态报告的事件时的缓存状态。
结合第六方面或第六方面的第一或第二种可能的实现方式，在第六方面的第三种可能的实现方式中，所述方法还包括：所述第一调度请求为所述媒体接入控制协议数据单元组包前触发的调度请求；或者，所述第一调度请求为第二缓存状态报告触发的调度请求，其中，所述媒体接入控制协议数据单元包含触发所述第二缓存状态报告的事件时的缓存状态。
结合第六方面，在第六方面的第四种可能的实现方式中，所述方法还包括：所述第一缓存状态报告没有包含第一缓存状态，所述第一缓存状态为直到最近一次触发缓存状态报告的事件时的缓存状态。
结合第六方面的第四种可能的实现方式中，在第六方面的第五种可能的实现方式中，所述方法还包括：所述第一调度请求为所述媒体接入控制协议数据单元组包前触发的调度请求；或者，所述第一调度请求为第二缓存状态报告触发的调度请求，其中，所述媒体接入控制协议数据单元包含触发所述第二缓存状态报告的事件时的缓存状态。
结合第六方面或第六方面的第一至第五种任一种可能的实现方式，在第六方面的第六种可能的实现方式中，所述方法还包括：所述设备停止所述第一调度请求的调度请求禁止定时器。
第七方面，申请实施例提供了一种缓存状态报告取消方法，包括：设备确定第一缓存状态报告被触发；当媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含缓存状态报告，所述设备取消所述第一缓存状态报告。
结合第七方面，在第七方面的第一种可能的实现方式中，所述方法还包括：所述第一缓存状态报告为所述媒体接入控制协议数据单元组包前触发的缓存状态报告。
结合第七方面，在第七方面的第二种可能的实现方式中，所述方法还包括：所述媒体接入控制协议数据单元包含触发所述第一缓存状态报告的事件时的缓存状态。
第八方面，公开了一种设备，所述设备包括：确定单元，所述确定单元用于确定第一调度请求被触发；取消单元，所述当媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含第一缓存状态报告，所述取消单元用于取消所述第一调度请求。
结合第八方面，在第八方面的第一种可能的实现方式中，所述设备还包括：所述第一缓存状态报告包含第一缓存状态，所述第一缓存状态为直到最近一次触发缓存状态报告的事件时的缓存状态。
结合第八方面的第一种可能的实现方式，在第八方面的第二种可能的实现方式中，所述设备还包括：所述第一缓存状态为直到所述媒体接入控制协议数据单元组包前最近一次触发缓存状态报告的事件时的缓存状态。
结合第八方面或第八方面的第一或第二种可能的实现方式，在第八方面的第三种可能的实现方式中，所述设备还包括：所述第一调度请求为所述媒体接入控制协议数据单元组包前触发的调度请求；或者，所述第一调度请求为第二缓存状态报告触发的调度请求，其中，所述媒体接入控制协议数据单元包含触发所述第二缓存状态报告的事件时的缓存状态。
结合第八方面，在第八方面的第四种可能的实现方式中，所述设备还包括：所述第一缓存状态报告没有包含第一缓存状态，所述第一缓存状态为直到最近一次触发缓存状态报告的事件时的缓存状态。
结合第八方面的第四种可能的实现方式中，在第八方面的第五种可能的实现方式中，所述设备还包括：所述第一调度请求为所述媒体接入控制协议数据单元组包前触发的调度请求；或者，所述第一调度请求为第二缓存状态报告触发的调度请求，其中，所述媒体接入控制协议数据单元包含触发所述第二缓存状态报告的事件时的缓存状态。
结合第八方面或第八方面的第一至第五种任一种可能的实现方式，在第八方面的第六种可能的实现方式中，所述设备还包括：停止设备，所述停止设备用于停止所述第一调度请求的调度请求禁止定时器。
第九方面，公开了一种设备，所述设备包括：确定单元，所述确定单元用于确定第一缓存状态报告被触发；取消单元，所述当媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含缓存状态报告，所述取消单元用于取消所述第一缓存状态报告。
结合第九方面，在第九方面的第一种可能的实现方式中，所述设备还包括：所述第一缓存状态报告为所述媒体接入控制协议数据单元组包前触发的缓存状态报告。
结合第九方面，在第九方面的第二种可能的实现方式中，所述设备还包括：所述媒体接入控制协议 数据单元包含触发所述第一缓存状态报告的事件时的缓存状态。
第十方面，公开了一种设备，所述设备包括：处理器，所述处理器确定第一调度请求被触发；所述当媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含第一缓存状态报告，所述处理器用于取消所述第一调度请求。
结合第十方面，在第十方面的第一种可能的实现方式中，所述设备还包括：所述第一缓存状态报告包含第一缓存状态，所述第一缓存状态为直到最近一次触发缓存状态报告的事件时的缓存状态。
结合第十方面的第一种可能的实现方式，在第十方面的第二种可能的实现方式中，所述设备还包括：所述第一缓存状态为直到所述媒体接入控制协议数据单元组包前最近一次触发缓存状态报告的事件时的缓存状态。
结合第十方面或第十方面的第一或第二种可能的实现方式，在第十方面的第三种可能的实现方式中，所述设备还包括：所述第一调度请求为所述媒体接入控制协议数据单元组包前触发的调度请求；或者，所述第一调度请求为第二缓存状态报告触发的调度请求，其中，所述媒体接入控制协议数据单元包含触发所述第二缓存状态报告的事件时的缓存状态。
结合第十方面，在第十方面的第四种可能的实现方式中，所述设备还包括：所述第一缓存状态报告没有包含第一缓存状态，所述第一缓存状态为直到最近一次触发缓存状态报告的事件时的缓存状态。
结合第十方面的第四种可能的实现方式中，在第十方面的第五种可能的实现方式中，所述设备还包括：所述第一调度请求为所述媒体接入控制协议数据单元组包前触发的调度请求；或者，所述第一调度请求为第二缓存状态报告触发的调度请求，其中，所述媒体接入控制协议数据单元包含触发所述第二缓存状态报告的事件时的缓存状态。
结合第十方面或第十方面的第一至第五种任一种可能的实现方式，在第十方面的第六种可能的实现方式中，所述设备还包括：所述处理器停止所述第一调度请求的调度请求禁止定时器。
第十一方面，公开了一种设备，所述设备包括：处理器，所述处理器确定第一缓存状态报告被触发；所述当媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含缓存状态报告，所述处理器取消所述第一缓存状态报告。
结合第十一方面，在第十一方面的第一种可能的实现方式中，所述设备还包括：所述第一缓存状态报告为所述媒体接入控制协议数据单元组包前触发的缓存状态报告。
结合第十一方面，在第十一方面的第二种可能的实现方式中，所述设备还包括：所述媒体接入控制协议数据单元包含触发所述第一缓存状态报告的事件时的缓存状态。
第十二方面，公开了一种计算机可读存储介质，该计算机可读存储介质中存储有指令；当其在上述第八方面及其任意一项可能的实现方式所述的设备上运行时，使得该设备执行如上述第六方面及其各种可能的实现方式所述的调取请求取消方法。
第十三方面，公开了一种计算机可读存储介质，该计算机可读存储介质中存储有指令；当其在上述第九方面及其任意一项可能的实现方式所述的设备上运行时，使得该设备执行如上述第七方面及其各种可能的实现方式所述的缓存状态报告取消方法。
第十四方面，公开了一种无线通信装置，该无线通信装置中存储有指令，当该无线通信装置在上述第八方面及其任意一项可能的实现方式所述的设备上运行时，使得该设备执行如上述第六方面及其各种可能的实现方式所述的调取请求取消方法。具体实现中，该无线通信装置可以是芯片。
第十五方面，公开了一种无线通信装置，该无线通信装置中存储有指令，当该无线通信装置在上述第九方面及其任意一项可能的实现方式所述的设备上运行时，使得该设备执行如上述第七方面及其各种 可能的实现方式所述的缓存状态报告取消方法。具体实现中，该无线通信装置可以是芯片。
本申请中第八方面、第十方面、第十二方面、第十四方面及其各种实现方式的具体描述，可以参考第六方面及其各种实现方式中的详细描述；并且，第八方面、第十方面、第十二方面、第十四方面及其各种实现方式的有益效果，可以参考第六方面及其各种实现方式中的有益效果分析，此处不再赘述。
本申请中第九方面、第十一方面、第十三方面、第十五方面及其各种实现方式的具体描述，可以参考第七方面及其各种实现方式中的详细描述；并且，第九方面、第十一方面、第十三方面、第十五方面及其各种实现方式的有益效果，可以参考第七方面及其各种实现方式中的有益效果分析，此处不再赘述。
附图说明
图1为本申请实施例提供的IAB网络结构图；
图2为现有技术中的路由更新示意图；
图3为本发明实施例提供的网络设备的结构框图；
图4为本发明实施例提供的路由更新方法的流程图；
图5为本发明实施例提供的路由更新方法的示意图；
图6为本发明实施例提供的路由更新方法的另一示意图；
图7为本发明实施例提供的路由更新方法的另一示意图；
图8为本发明实施例提供的路由更新方法的另一示意图；
图9为本发明实施例提供的路由更新方法的另一示意图；
图10为本发明实施例提供的路由更新方法的另一示意图；
图11为本发明实施例提供的网络设备的另一结构框图；
图12为本发明实施例提供的网络设备的另一结构框图；
图13为本申请实施例提供的一种应用场景示意图；
图14为本发明实施例提供的一种调度请求取消方法的流程图；
图15为本发明实施例提供的一种缓存状态报告取消方法的流程图；
图16为本发明实施例提供的一种取消方法的示意图；
图17为本发明实施例提供的设备的结构框图；
图18为本发明实施例提供的设备的另一结构框图；
图19为本发明实施例提供的设备的另一结构框图。
具体实施方式
需要说明的是，本发明中的“A和/或B”可以理解成为“A和B”、或“A”、或“B”中的任一种。本发明的说明书和权利要求书及附图中的“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
第五代(5Generation，5G)新空口(New Radio，NR)技术中支持接入回传一体化(Integrated Access and Backhaul，IAB)，图1是一种可能的IAB网络结构图。如图1所示，可以在宿主基站和UE之间部署RN，通过RN来转发基站发送给UE的数据，或者UE发送给基站的数据。
其中，宿主基站与核心网直接相连，并且宿主基站可连接多个RN。UE可以通过一个或多个RN与宿主基站间接连接，即UE与宿主基站之间是多跳路径或多连接，宿主基站与RN之间的链路以及RN和RN之间的链路可以为回程(Backhaul)链路或前传(Fronthaul)链路。UE也可以直接与宿主基站连接，即UE与宿主基站之间是一跳路径，宿主基站与UE之间的链路以及RN与UE之间的链路可以为接入(Access)链路。
由于网络中存在多跳或多连接的情况，因此形成的网络拓扑结构可能为分层拓扑结构或网状拓扑结构。对于UE与宿主基站未直接连接的场景，宿主基站向UE发送数据包时，首先需要确定将该数据包发送给哪一个RN，另外，宿主基站到UE的路径上的每一个RN需要根据自己的路由信息确定到达UE路径上的下一跳是哪个RN，将接收到的数据包转发给下一跳的RN。当网络拓扑结构发生变化，如：某个RN由当前连接的RN切换到另一个RN上，如果仍按照原来的路由信息进行数据包的转发会导致数据包丢失，因此，当RN发生切换，RN需要对自己的路由信息进行更新。
现有技术中，RN切换导致网络拓扑发生变化时，该RN切换前到达宿主基站的路径上的每一个RN都会更新路由信息，同时，该RN切换后到达宿主基站的路径上所有RN也会更新路由信息。示例的，参考图2，RN9离开RN7加入RN8，当RN7发现RN9离开，则向自己父节点RN6发送消息指示“RN9离开RN7”，RN6根据该消息更新自己的路由信息，并继续向自己的父节点RN3发送消息指示“RN9离开RN7”，依次向上行发送消息指示“RN9离开RN7”，直至到达宿主基站，宿主基站以及每一个接收到“RN9离开RN7”的RN根据“RN9离开RN7”这一消息更新自己的路由信息。进一步，当RN8发现RN9加入，则向自己的父节点RN5发送消息指示“RN9加入RN8”，RN5根据该消息更新自己的路由信息，并继续向自己的父节点RN3发送消息指示“RN9加入RN8”，依次向上行发送消息指示“RN9离开RN7”，直至到达宿主基站，宿主基站以及每一个接收到“RN9加入RN8”的RN根据“RN9加入RN8”这一消息更新自己的路由信息。
通常，RN的路由信息指的是该RN到某个节点(RN或UE)的路径上的下一跳。实际上，网络拓扑的改变并不影响某一些RN的路由信息。如：图2中，RN8从RN6切换到RN7，对于宿主基站来说到达RN8的下一跳仍然是RN1，对于RN1来说到达RN8的下一跳仍然是RN3。因此，宿主基站或这些RN其实不需要更新路由信息，也不需要接收“RN9加入RN8”的消息或“RN9离开RN7”的消息，造成了多余的信令开销。更重要的是，当网络拓扑改变后，只有当RN切换前到达宿主基站路径上的所有RN、RN切换后到达宿主基站路径上的所有RN都完成路由信息更新后，宿主基站才能够重新将数据包从新路径发送出去，造成数据中断时间较长。
本发明实施例提供一种路由更新方法，在节点发生切换后，第一节点接收第二节点发送的第一消息，第一消息用于指示切换节点离开源节点和/或切换节点接入目标节点。其中，源节点是切换节点切换前连接的节点，目标节点为切换节点切换后连接的节点。第一节点还可以根据第一消息更新自己的路由信息。具体地，第一节点为以下节点中的任意一个：目标节点、源节点、核心节点、目标节点与核心节点之间的第一中继节点、源节点与核心节点之间的第二中继节点。第二节点为以下节点中的任意一个：切换节点、目标节点、源节点、核心节点、第一中继节点、第二中继节点。其中，核心节点是所述目标节点与所述源节点上行方向的第一个共同节点。现有技术中，IAB网络中的一个节点切换后，该节点切换前到达宿主基站的路径上的每一个节点都会更新路由信息，同时，该节点切换后到达宿主基站的路径上所有节点也会更新路由信息。相比而言，本发明实施例中，只是核心节点以及核心节点以下的节点进行路由更新，IAB网络中的其他节点无需进行路由更新，也不需要信令通知这些节点，节省了信令开销，进而进行路由更新的节点数量也会大量减少，整个网络经过较短时间就可以恢复通信，缩短了数据中断时间。
需要说明的是，本发明实施例对节点的命名(如：第一节点、核心节点、中继节点等)仅仅是为了方便描述，对节点的命名不限于本发明实施例提供的这些示例。只要符合相应功能的设备都可以包括在本发明实施例的范围内，如：基站、接入节点(access point，AP)等。另外，本发明实施例中某个节点以下的节点或节点下行的节点，指的是该节点靠近UE方向上的节点；某个节点以上的节点或节点上 行的节点，指的是该节点靠近核心网设备(如：宿主基站)方向上的节点。
在本申请中，设备可以是网络设备，在以下实施例中，以网络设备为例进行描述。此外，用户设备等也可以作为设备，包含于本申请思想范围之内。
本发明实施例提供的路由更新方法可应用于图3所示的网络设备，所述网络设备可以是本发明实施例所述的节点，该节点可以是以下节点中的任意一个：切换节点、目标节点、源节点、第一中继节点、第二中继节点、核心节点。
如图3所示，该网络设备可以包括至少一个处理器11，存储器12、收发器13以及通信总线14。
下面结合图3对该网络设备的各个构成部件进行具体的介绍：
处理器11是网络设备的控制中心，可以是一个处理器，也可以是多个处理元件的统称。例如，处理器11是一个中央处理器(central processing unit，CPU)，也可以是特定集成电路(Application Specific Integrated Circuit，ASIC)，或者是被配置成实施本发明实施例的一个或多个集成电路，例如：一个或多个微处理器(digital signal processor，DSP)，或，一个或者多个现场可编程门阵列(Field Programmable Gate Array，FPGA)。
其中，处理器11可以通过运行或执行存储在存储器12内的软件程序，以及调用存储在存储器12内的数据，执行网络设备的各种功能。
在具体的实现中，作为一种实施例，处理器11可以包括一个或多个CPU，例如图3中所示的CPU0和CPU1。
在具体实现中，作为一种实施例，网络设备可以包括多个处理器，例如图3中所示的处理器11和处理器15。这些处理器中的每一个可以是一个单核处理器(single-CPU)，也可以是一个多核处理器(multi-CPU)。这里的处理器可以指一个或多个设备、电路、和/或用于处理数据(例如计算机程序指令)的处理核。
存储器12可以是只读存储器(read-only memory，ROM)或可存储静态信息和指令的其他类型的静态存储设备，随机存取存储器(random access memory，RAM)或者可存储信息和指令的其他类型的动态存储设备，也可以是电可擦可编程只读存储器(Electrically Erasable Programmable Read-Only Memory，EEPROM)、只读光盘(Compact Disc Read-Only Memory，CD-ROM)或其他光盘存储、光碟存储(包括压缩光碟、激光碟、光碟、数字通用光碟、蓝光光碟等)、磁盘存储介质或者其他磁存储设备、或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，但不限于此。存储器12可以是独立存在，通过通信总线14与处理器11相连接。存储器12也可以和处理器11集成在一起。
其中，所述存储器12用于存储执行本发明方案的软件程序，并由处理器11来控制执行。
收发器13，使用任何收发器一类的装置，用于与图1所示系统中的其他节点间的通信，如：其他中继节点、核心节点、目标节点或源节点等。或用于实现网络设备与图1中的基站之间的通信。还可以用于与通信网络通信，如以太网，无线接入网(radio access network，RAN)，无线局域网(Wireless Local Area Networks，WLAN)等。收发器13可以包括接收单元实现接收功能，以及发送单元实现发送功能。
通信总线14，可以是工业标准体系结构(Industry Standard Architecture，ISA)总线、外部设备互连(Peripheral Component，PCI)总线或扩展工业标准体系结构(Extended Industry Standard Architecture，EISA)总线等。该总线可以分为地址总线、数据总线、控制总线等。为便于表示，图3中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
图3中示出的设备结构并不构成对网络设备的限定，可以包括比图示更多或更少的部件，或者组合某些部件，或者不同的部件布置。
本发明实施例提供一种路由更新方法，如图4所示，所述方法包括以下步骤：
401、第一节点接收第二节点发送的第一消息，第一消息用于指示切换节点离开源节点和/或切换节点接入目标节点。
需要说明的是，本发明实施例中的源节点是切换节点切换前连接的节点，目标节点为所述切换节点切换后连接的节点。另外，切换节点是从源节点切换到目标节点的RN，切换节点接入目标节点，可以认为切换节点加入目标节点，即切换节点与目标节点建立连接。源节点可以是宿主基站或RN，目标节点可以是宿主基站或RN。如图2所示，切换节点是RN9，目标节点可以是RN8，源节点可以是RN7。
具体实现中，第一节点为以下节点中的任意一个：目标节点、所述源节点、核心节点、第一中继节点、第二中继节点。
所述第二节点为以下节点中的任意一个：所述切换节点、所述目标节点、所述源节点、所述核心节点、所述第一中继节点、所述第二中继节点。
具体实现中，第一节点与第二节点可以是不同的节点，进一步，第一节点可以与第二节点直接连接。
另外，核心节点可以是目标节点与源节点上行方向的第一个共同节点。参考图2所示的网络，RN9离开RN7加入RN8，即RN7是源节点，RN8目标节点，RN7、RN8在上行方向上的第一个共同节点，可以认为是RN7、RN8所在路径靠近宿主基站的方向上的第一个汇聚点，如图2中的RN3。
具体实现中，核心节点也可以是目标节点或源节点。
第一中继节点是目标节点与核心节点之间的中继节点。也就是说，目标节点与核心节点可以不是直接连接，而是通过一个或多个中继节点间接连接，本发明实施例中，目标节点与核心节点之间的一个或多个中继节点可以称为第一中继节点，如图2中的RN5。当然，目标节点与核心节点也可以直接连接，也就是说不存在第一中继节点。
第二中继节点是源节点与核心节点之间的中继节点。也就是说，源节点与核心节点可以不是直接连接，而是通过一个或多个中继节点间接连接，本发明实施例中，源节点与核心节点之间的一个或多个中继节点可以称为第二中继节点，如图2中的RN6。当然，源节点与核心节点也可以直接连接，也就是说不存在第二中继节点。
本发明实施例中，核心节点及核心节点以下的节点可以接收到指示节点切换情况的消息，如：上述第一消息。参考图2所示的网络，第一节点可以是RN3、RN5、RN6、RN7、RN8中的任意一个，第二节点可以是RN3、RN5、RN6、RN7、RN8、RN9中的任意一个，当然第一节点和第二节点是不同的节点。如：RN9(第二节点)向RN8(第一节点)发送第一消息，RN5(第二节点)向RN3(第一节点)发送第一消息。
需要说明的是，第一消息可以用于指示切换节点离开源节点和切换节点接入目标节点，示例的，第一消息用于指示某节点离开了节点A接入了节点B。这种实现方式中，第一消息可以携带切换节点的信息、目标节点的信息以及源节点的信息，本发明实施例中，某个节点的信息，可以理解为能够指示节点的一个信息，也可以理解为在路由信息中指示节点路由方式的一个信息，也可以认为是该节点的标识。如：切换节点的信息可以是切换节点的标识，目标节点的信息可以是目标节点的标识，源节点的信息可以是源节点的标识。本发明实施例对此不做限定。进一步，可以通过第一消息中的切换节点的标识、目标节点的标识以及源节点的标识的排列顺序来识别某个标识指示的是源节点还是目标节点还是切换节点，示例的，第一消息中包括“RN7、RN8、RN9”，其中排列在最前的是源节点的标识，中间的是目标节 点的标识，排列在最后的是切换节点的标识。当然，通过节点标识在第一消息中的排列顺序来识别节点的方案不仅仅局限于上述可能的实现方式，还可以有其他可能的实现方式，本发明实施例对此不做限定。
在另一种实现方式中，还可以通过比特位来区分第一消息中节点标识对应的节点。示例的，第一消息中包括“00RN7、01RN8、10RN9”，其中，“00”用于标识源节点，即RN7是源节点的标识；“01”用于标识目标节点，即RN8是目标节点的标识；“10”用于标识切换节点，即RN9是切换节点的标识。
当然，还可以通过其他方式来区分第一消息中节点标识所对应的节点，或者通过其他方式(非节点标识)来表示对应的节点，本发明实施例对此不做限定。
在一些实施例中，第一消息可以用于指示切换节点离开源节点，示例的，第一消息用于指示某节点离开了节点A。第一消息可以携带切换节点的标识以及源节点的标识。如何区分第一消息中的节点标识对应的节点是切换节点还是源节点，可以参考上述几种实现方式，本发明实施例在此不做赘述。
在一些实施例中，第一消息可以用于指示切换节点离开，在此实现方式中，第一消息可以携带切换节点的标识。
在一些实施例中，第一消息用于指示切换节点接入目标节点，示例的，第一消息用于指示某节点加入了节点B。第一消息可以携带切换节点的标识以及目标节点的标识。如何区分第一消息中的节点标识对应的节点是切换节点还是目标节点，可以参考上述几种实现方式，本发明实施例在此不做赘述。
在一些实施例中，切换节点可以不是路径的末端，即切换节点之后还可以连接其他RN。参考图2，切换节点RN9的子节点(Child Node)是RN10，RN9保存了与RN10相关的路由信息，如“与RN10直接连接”。基于此，当切换节点切换时，第一节点发送的第一消息还可以携带切换节点的路由信息，如RN9发送的第一消息还携带RN9的路由信息“和RN10直接连接”。需要说明的是，某一节点的子节点可以理解为下行方向上与某一节点直接相连的节点，即可以理解为某一节点的直接连接的下一跳。节点A的路由信息中的“与节点B直接连接”可以理解为节点B是节点A的子节点，还可以理解为节点B是节点A直接连接的下一跳，本发明实施例对路由信息的具体内容不做限定。
402、第一节点根据第一消息更新第一节点的路由信息。
具体地，在IAB网络结构中，宿主基站到每个UE都有确定的路径，通过各个节点(RN)保存的路由信息可以确定从宿主基站到UE的路径。各个节点可以通过路由表的形式记录路由信息。
进一步，路由表中包括每条路径对应的下一跳，也可以认为是到达某个节点的下一跳。
示例的，参考图2所示的IAB网络结构，RN9切换前，RN3所在的路径有：宿主基站-RN1-RN3-RN6-RN8-RN9-RN10、宿主基站-RN1-RN3-RN5-RN7。RN3的路由表可以是：与RN5直接连接、与RN6直接连接、RN8->RN6、RN7->RN5、RN9->RN6、RN10->RN6。其中，RN8->RN6代表从RN3到达RN8的下一跳是RN6，RN7->RN5代表从RN3到达RN7的下一跳是RN5，RN9->RN6代表从RN3到达RN9的下一跳是RN6，RN10->RN6代表从RN3到达RN10的下一跳是RN6。
具体实现中，路径可以由路径标识指示，下一跳可以由节点标识指示。路径标识可以是节点的标识，即表示宿主基站到该节点之间的路径。示例的，RN4可以表示“宿主基站-RN1-RN2-RN4”这条路径；或者，可以有专门的路径标识表示路径，例如：“路径4”表示“宿主基站-RN1-RN2-RN4”这条路径。下一跳可以由节点标识表示，例如：RN3的路由表包括的路由信息“RN7->RN5”中的“RN5”是节点标识，代表从RN3到达RN7的下一跳是RN5。具体实现中，每个数据包携带路径标识和UE标识，宿主基站和RN可以通过路由信息表将数据包发给正确的UE。
在一些实施例中，切换节点可以不是路径的末端，即切换节点之后还可以连接其他RN。那么切换节点本身存储有下级节点相关的路由信息，第一节点发送的第一消息还可以携带切换节点的路由信息。 进一步，第一节点发送的第二消息还可以包括切换节点的路由信息。
在一些实施例中，第一节点还可以根据接收到的第一消息向其他节点通知节点切换的情况。具体地，第一节点可以根据第一消息确定接收第二消息的第三节点，并向第三节点发送第二消息。其中，第二消息用于向其他节点通知节点切换的情况，在一些实施例中，第二消息用于指示切换节点离开源节点和/或切换节点接入目标节点。另外，第三节点为以下节点中的任意一个：源节点、核心节点、目标节点、第一中继节点、第二中继节点。
示例的，参考图2，第三节点可以是RN3、RN5、RN6、RN7、RN8中的任意一个。如：RN9(第二节点)向RN7(第一节点)发送的第一消息，随后，RN7可以向RN5(第三节点)发送第二消息。
在本发明实施例中，核心节点以及核心节点的下行节点更新路由的顺序可以有以下两种情况：
第一、在一些实施例中，切换节点向目标节点通知节点切换的情况，可以先触发新路径(切换节点切换后所在的路径)上处于核心节点下行的节点根据切换节点的加入更新自己的路由信息。随后，核心节点触发原路径(切换节点切换前所在的路径)上处于核心节点下行的节点根据切换节点的离开更新自己的路由信息。具体地，各个节点的处理过程可以分为以下几种：
(1a)当第一节点为目标节点，目标节点接收切换节点发送的第一消息，其中，切换节点是第二节点。
具体实现中，切换节点发送的第一消息可以用于指示切换节点离开源节点和切换节点接入目标节点，例如，第一消息中可以携带目标节点的标识、源节点的标识以及切换节点的标识。目标节点可以判断自己的路由信息中是否包括切换节点的标识，如果目标节点确定自己的路由信息中不包括切换节点的标识，则确定第三节点为目标节点的父节点。或者，目标节点可以判断自己的路由信息中是否包括切换节点的标识以及源节点的标识，如果目标节点确定自己的路由信息中不包括切换节点的标识且不包括源节点的标识，则确定第三节点为目标节点的父节点。或者，目标节点可以判断自己的路由信息中是否包括源节点的标识，如果目标节点确定自己的路由信息中不包括源节点的标识，则确定第三节点为目标节点的父节点。
进一步，所述目标节点向其父节点发送第二消息，其中，第二消息用于指示切换节点离开源节点和切换节点接入目标节点，具体地，第二消息中可以携带目标节点的标识、源节点的标识以及切换节点的标识。
在另一些实施例中，切换节点发送的第一消息用于指示切换节点接入目标节点。具体实现中，切换节点在切换完成后，切换节点向目标节点上报自己的标识，可以认为切换节点向目标节点指示了切换节点接入了目标节点。进一步，第一消息中可以携带切换节点的标识。或者，切换节点先获取目标节点的标识，切换节点在切换完成后，切换节点向目标节点发送第一消息指示切换节点接入目标节点，具体地，第一消息中可以携带切换节点的标识以及目标节点的标识。
在第一消息指示切换节点接入目标节点的场景下，目标节点还可以判断自己的路由信息中是否包括切换节点的标识，如果目标节点确定自己的路由信息中不包括切换节点的标识，则确定第三节点为目标节点的父节点。所述目标节点则向自己的父节点发送第二消息，其中，第二消息用于指示切换节点接入目标节点，进一步，第二消息中携带目标节点的标识以及切换节点的标识。
在一些实施例中，如果目标节点接收到的第一消息携带目标节点的标识，则所述目标节点在向自己的父节点发送第二消息之前，还可以判断第一消息中目标节点的标识与自己的标识是否相同，如果所述目标节点确定第一消息中目标节点的标识和自己的标识相同，所述目标节点则向自己的父节点发送第二消息。
需要说明的是，本发明实施例中某个节点的父节点指的是该节点是上行直接连接的一个节点，目标节点的父节点即与目标节点直接连接的第一中继节点。另外，目标节点还可以根据切换节点的加入更新自己的路由信息，如增加路由信息“与切换节点直接连接”。其中，切换节点为第二节点，目标节点为第一节点，与目标节点连接的第一中继节点或核心节点为第三节点。
(1b)当第一节点为第一中继节点，第一中继节点接收其子节点(第二节点)发送的第一消息。
具体实现中中，第一中继节点接收到的第一消息可以用于指示切换节点离开源节点和切换节点接入目标节点，例如，第一消息中可以携带目标节点的标识、源节点的标识以及切换节点的标识。第一中继节点可以判断自己的路由信息中是否包括切换节点的标识，如果第一中继节点自己的路由信息中不包括切换节点的标识，则确定第三节点为第一中继节点的父节点。或者，第一中继节点可以判断自己的路由信息中是否包括切换节点的标识以及源节点的标识，如果第一中继节点自己的路由信息中不包括切换节点的标识且不包括源节点的标识，则确定第三节点为第一中继节点的父节点。或者，第一中继节点可以判断自己的路由信息中是否包括源节点的标识，如果第一中继节点自己的路由信息中不包括源节点的标识，则确定第三节点为第一中继节点的父节点。
进一步，所述第一中继节点向自己的父节点发送第二消息，其中，第二消息用于指示切换节点离开源节点和切换节点接入目标节点，具体地，第二消息中可以携带目标节点的标识、源节点的标识以及切换节点的标识。
在另一些实施例中，第一中继节点接收到的第一消息用于指示切换节点接入目标节点，例如，第一消息中可以携带切换节点的标识以及目标节点的标识。第一中继节点确定自己的路由信息中不包括切换节点的标识，则确定第三节点为第一中继节点的父节点。所述第一中继节点则向自己的父节点发送第二消息，其中，第二消息用于指示切换节点接入目标节点，具体地，第二消息中携带目标节点的标识以及切换节点的标识。
也就是说，目标节点与核心节点之间的每一个第一中继节点都可以接收其子节点(第一中继节点或目标节点)发送的第一消息，在确定自己的路由信息中不包括切换节点的标识和/或自己的路由信息中不包括源节点的标识后，向自己的父节点发送第二消息，并根据切换节点的加入更新自己的路由信息。
在一些实施例中，所述第一中继节点向自己的父节点发送第二消息之前，还可以确定自己的路由信息中包括目标节点的标识。
需要说明的是，本发明实施例中某个节点的子节点指的是该节点是下行直接连接的一个节点，第一中继节点的子节点可以是目标节点，也可以是其他第一中继节点。其中，第一中继节点可以是第一节点，该第一中继节点的子节点可以是第二节点，该第一中继节点的父节点可以是第三节点。
示例的，与目标节点连接的第一中继节点接收目标节点发送的指示“切换节点离开源节点加入目标节点”的消息，判断自己的路由信息中是否包括该消息中的切换节点的标识，即判断切换节点是否为自己所在路径上新加入的节点，如果该第一中继节点的路由信息中不包括该消息中携带的切换节点的标识，与目标节点连接的第一中继节点则确定切换节点是自己所在路径上新加入的节点，进一步向自己的父节点发送“切换节点离开源节点加入目标节点”的消息。第一中继节点的父节点可以是核心节点，也可以是其他第一中继节点。进一步该第一中继节点进一步根据切换节点的加入更新自己的路由信息，如增加路由信息“到达切换节点的下一跳”。
(1c)当第一节点为核心节点，核心节点接收到与核心节点直接连接的第一中继节点(第二节点)发送的第一消息。
具体地，核心节点接收到的第一消息可以用于指示切换节点离开源节点和切换节点接入目标节点， 例如，第一消息中可以携带切换节点的标识、源节点的标识以及目标节点的标识。核心节点可以判断自己的路由信息中是否包括切换节点的标识和/或自己的路由信息中是否包括源节点的标识，若核心节点的路由信息中包括切换节点的标识和/或源节点的标识，表明核心节点是切换节点切换前所在路径上的节点，又由于核心节点也是切换节点切换后路径上的节点，因此核心节点上行的节点的路由信息不会因为切换节点切换而改变，那么核心节点则不需要向其父节点通知节点切换的情况，而是向自己的子节点发送第二消息，此时，核心节点的子节点为第三节点。核心节点发送的第二消息可以指示切换节点离开，具体地，第二消息可以包括切换节点的标识。
在另一些实施例中，核心节点发送的第二消息还可以用于指示切换节点离开源节点，具体地，第二消息中可以携带源节点的标识以及切换节点的标识。
在另一些实施例中，核心节点接收到的第一消息还可以用于指示切换节点接入目标节点，例如，第一消息中可以携带切换节点的标识以及目标节点的标识。核心节点可以判断自己的路由信息中是否包括切换节点的标识，若核心节点的路由信息中包括切换节点的标识，那么核心节点则不需要向其父节点通知节点的切换情况，而是向自己的子节点发送第二消息，此时，核心节点的子节点为第三节点。其中，核心节点发送的第二消息用于指示切换节点离开。
如果核心节点接收到的第一消息中包括目标节点的标识，所述核心节点还可以判断自己的路由信息中是否包括目标节点的标识，如果核心节点确定自己的路由信息中包括目标节点的标识则向自己的子节点发送第二消息。另外，核心节点还可以根据第一消息更新自己的路由信息，如增加路由信息“到达切换节点的下一跳”，删除切换节点切换前路径所对应的下一跳相关的路由信息。其中，核心节点可以是第一节点，第一中继节点或目标节点或切换节点可以是第二节点，该核心节点的子节点是第三节点。一种特殊的情况，若核心节点可以是源节点，示例的，节点A切换前与节点B连接，节点A切换后与节点B的子节点节点C连接，在此场景下节点B是源节点，也是核心节点。进一步，核心节点不需要发送第二消息。
(1d)当第一节点为第二中继节点，第二中继节点接收到其父节点(第二节点)发送的第一消息。
具体实现中，第二中继节点接收到的第一消息用于指示切换节点离开，具体地，第一消息可以携带切换节点的标识。第二中继节点判断自己的路由信息中是否包括切换节点的标识且所述切换节点切换前不是所述第一节点的子节点，如果第二中继节点确定自己的路由信息中包括切换节点的标识且所述切换节点切换前不是所述第一节点的子节点，切换前所述切换节点切换前不是所述第一节点的子节点还可以理解为路由信息不是“和切换节点直接连接”，则确定第三节点为自己的子节点，向第三节点发送第二消息，第二消息用于指示切换节点离开，具体地，第二消息可以携带切换节点的标识。需要说明的是，这里第二中继节点确定的子节点是从第二中继节点到达切换节点路径上的下一跳。
在另一些实施例中，第二中继节点接收到的第一消息指示切换节点离开源节点，具体地，第一消息中可以携带源节点的标识以及切换节点的标识。第二中继节点还可以判断第一消息中的源节点的标识与自己的标识是否相同，如果第二中继节点确定第一消息中的源节点的标识与自己的标识不同，则确定第三节点为自己的子节点，即向自己的子节点发送第二消息。其中，所述第二消息用于指示切换节点离开源节点，具体地，第二消息中可以携带源节点的标识以及切换节点的标识。需要说明的是，这里第二中继节点确定的子节点是从第二中继节点到达切换节点路径上的下一跳。当然，在此场景下，第二中继节点还可以判断自己的路由信息中是否包括切换节点的标识且所述切换节点切换前不是所述第一节点的子节点，如果确定自己的路由信息中包括切换节点的标识且切换前所述切换节点不是所述第一节点的子节点，切换前所述切换节点不是所述第一节点的子节点还可以理解为路由信息不是“和切换节点直接连 接”，则确定第三节点为自己的子节点。
也就是说，源节点与核心节点之间的每一个第二中继节点都可以接收其父节点(核心节点或其他第二中继节点)发送的第一消息，确定自己的路由信息中包括切换节点的标识且切换前所述切换节点不是所述第一节点的子节点，或者，确定自己的标识与源节点的标识不同，即自己不是源节点，则向自己的子节点发送第二消息。另外，每一个第二中继节点接收自己的父节点发送的第一消息后，可以根据第一消息更新自己的路由信息，如：删除与切换节点原来所在路径的下一跳相关的路由信息。如此，切换节点切换前所在路径上处于核心节点下行的节点可以根据节点切换的情况更新自己的路由信息。
需要说明的是，第二中继节点可以接收其父节点(第二节点)发送的第一消息，若确定自己的路由信息中包括切换节点的标识并且切换节点是与自己直接连接的节点，或者，确定自己的标识与源节点的标识相同，即自己是源节点，则不需要向自己的子节点发送第二消息，只需要根据第一消息更新自己的路由信息，如：删除切换节点原来在旧路径的下一跳的路由信息。
另外，本发明实施例中某个节点的子节点指的是该节点下行直接连接的一个节点。具体实现中，第一节点(如：核心节点或第二中继节点)查询自己的路由信息，确定路由信息中到达源节点的下一跳为所述第三节点，或者确定到达切换节点的下一跳为第三节点。
在一些实施例中，若发生切换的节点下行还连接有其他节点(记为下行节点)，节点切换时可能会携带下行节点一起切换。若节点切换时携带下行节点一起切换，那么切换节点发送给目标节点的第一消息中还需要包括切换节点的路由信息，切换节点的路由信息记录有与下行节点相关的路由信息。进一步，目标节点、第一中继节点、核心节点、第二中继节点以及源节点之间发送的消息(如：第一消息、第二消息)中也需要携带切换节点的路由信息。当然，目标节点、第一中继节点、核心节点、第二中继节点以及源节点还可以根据接收到的消息中的切换节点的路由信息更新自己的路由信息，如：增加到达所述下行节点的下一跳，或删除到达所述下行节点的下一跳。
第二、在一些实施例中，切换节点向源节点通知节点切换的情况，可以先触发原路径(切换节点切换前所在的路径)上处于核心节点下行的节点根据切换节点的离开更新自己的路由信息。随后，核心节点触发新路径(切换节点切换后所在的路径)上处于核心节点下行的节点根据切换节点的加入更新自己的路由信息。各个节点的处理过程可以分为以下几种：
(2a)当第一节点为源节点，源节点接收切换节点的发送的第一消息，其中，切换节点为第二节点。
具体地，源节点接收到的第一消息用于指示切换节点离开源节点和切换节点接入目标节点，例如，第一消息中可以携带目标节点的标识、源节点的标识以及切换节点的标识。第二中继节点判断自己的路由信息中是否包括目标节点的标识，如果源节点确定自己的路由信息中不包括目标节点的标识，则确定第三节点为源节点的父节点，即源节点向自己的父节点发送第二消息，其中，第二消息用于指示切换节点离开源节点和切换节点接入目标节点，例如，第二消息中携带目标节点的标识、源节点的标识以及切换节点的标识。
在另一些实施例中，源节点接收到的第一消息用于指示切换节点接入目标节点，例如，第一消息中可以携带切换节点的标识以及目标节点的标识。源节点确定自己的路由信息中不包括切换节点的标识，则确定第三节点为源节点的父节点。所述源节点则向自己的父节点发送第二消息，其中，第二消息用于指示切换节点接入目标节点，例如，第二消息中携带目标节点的标识以及切换节点的标识。
在另一些实施例中，源节点接收到的第一消息用于指示切换节点离开和切换节点接入目标节点，例如，第一消息中可以携带切换节点的标识以及目标节点的标识。源节点确定自己的路由信息中不包括切换节点的标识，则确定第三节点为源节点的父节点。所述源节点则向自己的父节点发送第二消息，其中， 第二消息用于指示切换节点离开和切换节点接入目标节点，例如，第二消息中携带目标节点的标识以及切换节点的标识。
其中，源节点的父节点(可以是第二中继节点)是第三节点。进一步，源节点更新自己的路由信息，如删除路由信息“到达切换节点的下一跳节点”。需要说明的是，在发送第一消息给第一节点之前，源节点知道切换节点发生切换并离开了源节点，源节点根据切换节点的离开更新自己的路由信息。
(2b)当第一节点为第二中继节点，第二中继节点接收其子节点(第二节点)发送的第一消息。
具体地，第二中继节点接收到的第一消息用于指示切换节点离开源节点和切换节点接入目标节点，例如，第一消息中可以携带目标节点的标识、源节点的标识以及切换节点的标识。第二中继节点判断自己的路由信息中是否包括目标节点的标识，如果第二中继节点确定自己的路由信息中不包括目标节点的标识，则确定第三节点为第二中继节点的父节点，即第二中继节点向自己的父节点发送第二消息，其中，第二消息用于指示切换节点离开源节点和切换节点接入目标节点，例如，第二消息中携带目标节点的标识、源节点的标识以及切换节点的标识。
在另一些实施例中，第一消息用于指示切换节点接入目标节点，例如，第一消息中可以携带切换节点的标识以及目标节点的标识。第二中继节点确定自己的路由信息中不包括切换节点的标识，则确定第三节点为第二中继节点的父节点。所述第二中继节点则向自己的父节点发送第二消息，其中，第二消息用于指示切换节点接入目标节点，例如，第二消息中携带目标节点的标识以及切换节点的标识。
在另一些实施例中，第二中继节点接收到的第一消息用于指示切换节点离开和切换节点接入目标节点，例如，第一消息中可以携带切换节点的标识以及目标节点的标识。第二中继节点确定自己的路由信息中不包括切换节点的标识，则确定第三节点为第二中继节点的父节点。所述第二中继节点则向自己的父节点发送第二消息，其中，第二消息用于指示切换节点离开和切换节点接入目标节点，例如，第二消息中携带目标节点的标识以及切换节点的标识。
也就是说，源节点与核心节点之间的每一个第二中继节点都可以接收其子节点(可以是第二中继节点或源节点)发送的第一消息，在确定自己的路由信息中不包括目标节点的标识后，向自己的父节点发送第二消息，并根据切换节点的离开更新自己的路由信息。其中，第二中继节点可以是第一节点，该第二中继节点的子节点可以是第二节点，该第二中继节点的父节点可以是第三节点。
示例的，与源节点连接的第二中继节点接收源节点发送的指示“切换节点离开源节点加入目标节点”的消息，判断自己的路由信息中是否包括该消息中的目标节点的标识，如果该第二中继节点的路由信息中不包括该消息中的目标节点的标识，即该第二中继节点确定目标节点不在自己所在的路径上，也可以认为切换节点切换后也不在自己所在的路径上，则向自己的父节点发送“切换节点离开源节点加入目标节点”的消息，指示自己的父节点更新路由信息。第二中继节点的父节点可以是核心节点，也可以是其他第二中继节点。进一步，该第二中继节点还可以根据切换节点的离开更新自己的路由信息，如删除路由信息“到达切换节点的下一跳”。
在一些实施例中，第二中继节点向自己的父节点发送第二消息之前，还可以确定自己的路由信息中包括切换节点的标识和/或自己的路由信息中包括源节点的标识。
(2c)当第一节点为核心节点，核心节点接收到与其直接连接的第二中继节点(第二节点)发送的第一消息。
具体地，核心节点接收到的第一消息用于指示切换节点离开源节点和切换节点接入目标节点，例如，第一消息中可以携带切换节点的标识、源节点的标识以及目标节点的标识。核心节点可以判断自己的路由信息中是否包括目标节点的标识，若核心节点的路由信息中包括目标节点的标识，表明核心节点是切 换节点切换前后所在路径的一个共同节点，本发明实施例中只有核心节点以及核心节点下行的节点进行路由更新，那么核心节点则不需要向其父节点通知节点的切换情况，而是向自己的子节点发送第二消息，此时，核心节点的子节点为第三节点。另外，第二消息用于指示切换节点接入目标节点，例如，第二消息中可以携带目标节点的标识以及切换节点的标识。
在另一些实施例中，第一消息用于指示切换节点接入目标节点，例如，第一消息中可以携带切换节点的标识以及目标节点的标识。核心节点可以判断自己的路由信息中是否包括目标节点的标识，若核心节点的路由信息中包括目标节点的标识，那么核心节点则不需要向其父节点通知节点的切换情况，而是向自己的子节点发送第二消息，此时，核心节点的子节点为第三节点。其中，第二消息用于指示切换节点接入目标节点，例如，第二消息中可以携带目标节点的标识以及切换节点的标识。
示例的，所述核心节点则向其子节点发送第二消息之前，还可以确定自己的路由信息中包括源节点的标识和/或自己的路由信息中包括切换节点的标识。另外，核心节点还可以根据第一消息更新自己的路由信息，如增加路由信息“到达切换节点的下一跳”，删除切换节点原来在旧路径的下一跳的路由信息。
其中，核心节点可以是第一节点，第而第二中继节点或源节点可以是第二节点，接收第二消息的子节点是第三节点，该子节点是核心节点到达目标节点路径上的下一跳。
(2d)当第一节点为第一中继节点，第一中继节点接收到其父节点发送的第一消息，其中，第一中继节点的父节点为第二节点。
具体地，第一中继节点接收到的第一消息指示切换节点接入目标节点，例如，第一消息中可以携带切换节点的标识以及切换节点的标识。第一中继节点确定第一消息中的目标节点的标识与自己的标识不同，则确定第三节点为自己的子节点，即向自己的子节点发送第二消息。其中，所述第二消息用于指示切换节点接入目标节点。
也就是说，目标节点与核心节点之间的每一个第一中继节点都可以接收其父节点(核心节点或其他第一中继节点)发送的第一消息，确定自己的标识与第一消息中的目标节点的标识不同，即自己不是目标节点，则向自己的子节点发送第二消息。在一些实施例中，所述第一中继节点向自己的子节点发送第二消息之前，还可以确定自己的路由信息中包括目标节点的标识。另外，每一个第一中继节点接收自己的父节点发送的第一消息后，可以根据第一消息更新自己的路由信息，如：增加路由信息“到达切换节点的下一跳”。如此，切换节点切换后所在路径上处于核心节点下行的节点可以根据节点切换的情况更新自己的路由信息。
具体实现中，第一节点(如：核心节点或第一中继节点)查询自己的路由信息，确定路由信息中到达目标节点的下一跳为所述第三节点。
在一些实施例中，若发生切换的节点下行还连接有其他节点(记为下行节点)，节点切换时可能会携带下行节点一起切换。若节点切换时携带下行节点一起切换，那么切换节点发送给源节点的第一消息中还需要包括切换节点的路由信息，切换节点的路由信息记录有与上述下行节点相关的路由信息。进一步，目标节点、第一中继节点、核心节点、第二中继节点以及源节点之间发送的消息(如：第一消息、第二消息)中也需要携带切换节点的路由信息。当然，目标节点、第一中继节点、核心节点、第二中继节点以及源节点还可以根据接收到的消息中的切换节点的路由信息更新自己的路由信息，如：增加到达下行节点的下一跳，或删除到达下行节点的下一跳。
本发明实施例提供的路由更新方法，在节点发生切换后，第一节点接收第二节点发送的第一消息，第一消息用于指示切换节点离开源节点和/或切换节点接入目标节点。第一节点还可以根据第一消息更 新自己的路由信息。具体地，第一节点为以下节点中的任意一个：目标节点、源节点、核心节点、目标节点与核心节点之间的第一中继节点、源节点与核心节点之间的第二中继节点。第二节点为以下节点中的任意一个：切换节点、目标节点、源节点、核心节点、第一中继节点、第二中继节点。也就是说，本发明实施例中，在网络拓扑发生变化后，只是核心节点以及核心节点以下的节点进行路由更新，IAB网络中的其他节点无需进行路由更新，也不需要信令通知这些节点，节省了信令开销，同时由于进行路由更新的节点数量的减少，经过较短时间就可以恢复整个网络的通信，缩短了数据中断时间。
以下结合附图介绍本发明实施例提供的一种路由更新方法，具体地，需要增加路由信息的节点先进行路由更新，在这些节点增加完路由信息后，需要删除路由信息的节点再更新自己的路由信息。示例的，参考图5，当RN9离开RN8加入RN7，RN9发送向目标节点RN7发送消息“RN9离开RN8加入RN7”，“RN9离开RN8加入RN7”这一消息中可以携带RN9、RN8以及RN7这三个节点的标识。
各个节点(RN)根据接收到的消息和自己的路由信息判断如何发送消息指示节点切换的情况。具体地：如果节点确定接收到的消息中的目标节点RN7的标识与自己的标识相同，即该节点是目标节点RN7，RN7则向自己的父节点RN5发送消息指示“RN9离开RN8加入RN7”。
如果节点判断自己的路由信息中仅包括目标节点的标识，不包括切换节点的标识和/或源节点的标识，则表明该节点是第一中继节点，如：RN5。RN5需要继续将“RN9离开RN8加入RN7”发送给自己的父节点RN3。RN5还可以根据该消息更新自己的路由信息表，具体地，添加信息“RN9->RN7”，即从RN5到RN9路径上的下一跳是RN7。
如果节点判断自己的路由信息中不仅包括目标节点RN7的标识，还包括源节点RN8和切换节点RN9的标识，则表明该节点是核心节点，如：RN3。RN3不需要继续将“RN9离开RN8加入RN7”发送给自己的父节点RN1，而是向自己的子节点(RN9切换前所在路径上与核心节点连接的子节点)RN6发送消息指示“RN9离开”，“RN9离开”这一消息中可以携带切换节点RN9的标识。进一步，RN3根据“RN9离开RN8加入RN7”更新自己的路由信息，具体地，RN3添加路由信息“RN9->RN5”，即从RN3到RN9新路径上的下一跳是RN5。RN3删除路由信息“RN9->RN6”，即从RN3到RN9旧路径上的下一跳是RN6。“RN9->RN5”是到RN9新路径的路由信息，“RN9->RN6”是到RN9旧路径的路由信息。
此时，需要增加路由信息的节点都完成了路由更新，下一步需要删除路由信息的节点进行路由更新。RN3向对应的子节点指示“RN9离开”，其中，“对应的子节点”即RN9切换前所在路径上的子节点，可以认为是RN9切换前从RN3到达RN9的下一跳，如：RN6。
当RN6接收到RN3发送的“RN9离开”的消息，RN6判断自己的路由信息中是否包括切换节点RN9的标识以及自己的路由信息中是否包括“与RN9直接连接”，如果RN6路由信息中包括切换节点的标识且不包括“与RN9直接连接”，则向自己的子节点发送消息指示“RN9离开”，如：向RN8发送。每一个接收到自己父节点发送的消息的节点都会判断自己的路由信息中是否包括切换节点RN9的标识并且判断自己的路由信息中是否包括“与RN9直接连接”，如果包括切换节点RN9的标识以及“与RN9直接连接”，则向自己的子节点发送消息指示“RN9离开”，如果切换节点RN9的标识但不包括“与RN9直接连接”则停止发送。如：RN6、RN8，都可以根据接收到的消息(“RN9离开”)更新自己的路由信息，如：RN6删除信息RN9->RN8，即从RN6到RN9的下一跳是RN8。RN8删除信息“与RN9直接连接”。
另外，尽管图5中未示出，RN3发送给RN6的消息还可以是“RN9离开RN8”，该消息可以携带RN9以及RN8的标识。RN6可以判断接收到的消息中源节点RN8的标识与自己的标识是否相同，如果 不同则向自己的子节点发送消息指示“RN9离开RN8”。每一个接收到自己父节点发送的“RN9离开RN8”的节点，如RN6、RN8，都可以判断源节点RN8的标识与自己的标识是否相同，如果不同则向给自己的子节点发送消息指示“RN9离开RN8”，如果相同则停止发送。
在一些实施例中，若发生切换的节点下行还连接有其他节点，节点切换时可能会携带与其相连的其他节点一起切换，若节点切换时携带与其相连的其他节点一起切换，该节点除了指示目标节点“切换节点离开了源节点接入了目标节点”之外，还可以将自己的路由信息发送给目标节点。示例的，参考图6，RN9离开了RN8接入RN7，RN9向RN7发送消息指示“RN9离开了RN8加入了RN7”，同时，该消息中还需要包括RN9自身的路由信息。示例的，RN9的路由信息是“与RN10直接连接”。当然，目标节点、第一中继节点、核心节点、第二中继节点以及源节点之间传递的消息中也需要包括切换节点的路由信息。如图6所示，RN7发送给RN5的消息中包括RN9的路由信息“与RN10直接连接”，RN5发送给RN3的消息中包括RN9的路由信息“与RN10直接连接”，RN3发送给RN6的消息中包括RN9的路由信息“与RN10直接连接”，RN6发送给RN8的消息中包括RN9的路由信息“与RN10直接连接”。
尽管图6中未示出，RN3发送给RN6的消息还可以是“RN9离开RN8”，该消息可以携带RN9以及RN8的标识。RN6可以判断接收到的消息中源节点RN8的标识与自己的标识是否相同，如果不同则向自己的子节点发送消息指示“RN9离开RN8”。每一个接收到自己父节点发送的“RN9离开RN8”的节点，如RN6、RN8，都可以判断源节点RN8的标识与自己的标识是否相同，如果不同则向自己的子节点发送消息指示“RN9离开RN8”，如果相同则停止发送指示“RN9离开RN8”的消息。
在一些实施例中，切换节点发送给目标节点的消息可以不同与图5中给出的示例，该消息可以仅仅指示切换节点接入目标节点，具体地，该消息包括切换节点的标识和目标节点的标识。
具体地，参考图7，当RN9离开RN8加入RN7，RN9发送消息给目标节点RN7指示“RN9加入RN7”，该消息可以携带RN9以及RN7的标识。
各个节点(RN)根据接收到的消息和自己的路由信息表判断如何发送消息指示节点的切换情况。具体地：如果节点判断接收到的消息中的目标节点RN7的标识与自己的标识相同，即该节点是目标节点RN7，RN7则向自己的父节点RN5发送消息指示“RN9加入RN7”。或者，目标节点RN7本身知道切换节点接入到自己，并根据接收到的消息知道切换节点RN9的标识，目标节点RN7则向自己的父节点RN5发送消息“RN9加入RN7”。
如果节点判断自己的路由信息中仅包括目标节点的标识，不包括切换节点的标识和源节点的标识，则表明该节点是第一中继节点，如：RN5。RN5需要继续将“RN9加入RN7”发送给自己的父节点RN3。RN5还可以根据该消息更新自己的路由信息表，具体地，添加信息“RN9->RN7”，即从RN5到RN9路径上的下一跳是RN7。
如果节点判断自己的路由信息中不仅包括目标节点RN7的标识，还包括切换节点RN9的标识，则表明该节点是核心节点，如：RN3，RN3不需要继续将““RN9加入RN7”发送给自己的父节点RN1，而是向自己的子节点(RN9切换前所在路径上与核心节点连接的子节点)RN6发送消息指示“RN9离开”，该消息携带切换节点RN9的标识。需要说明的是，RN3需要查找自己的路由信息，确定从RN3到达切换节点RN9的下一跳，向该下一跳发送“RN9离开”。示例的，RN3的路由信息中包括“RN9->RN6”，即从RN3到达切换节点RN9的下一跳为RN6，RN3则向RN6发送消息指示“RN9离开”。另外，RN3根据该消息更新自己的路由信息，具体地，RN3添加信息“RN9->RN5”，即从RN3到RN9路径上的下一跳是RN5。RN3删除信息“RN9->RN6”，即从RN3到RN9路径上的下一跳是RN6。
此时，需要增加路由信息的节点都完成了路由更新，下一步需要删除路由信息的节点进行路由更新。 RN3向对应的子节点指示“RN9离开”，其中，“对应的子节点”即RN9切换前所在路径上的子节点，可以认为是RN9切换前从RN3到达RN9的下一跳，如：RN6。
当RN6接收到RN3发送的指示“RN9离开”的消息，RN6判断自己的路由信息中是否包括切换节点RN9的标识，以及是否包括“与切换节点RN9直接相连”，如果包括切换节点RN9的标识但不包括“与切换节点RN9直接相连”，则将向自己的子节点发送消息指示“RN9离开”，如：向RN8发送。每一个接收到自己父节点发送的消息的节点，如：RN6、RN8，都会判断自己的路由信息中是否包括切换节点RN9的标识以及“与换节点RN9直接相连”，如果包括切换节点RN9的标识但不包括“与换节点RN9直接相连”，则向自己的子节点发送消息指示“RN9离开”；如果包括包括切换节点RN9的标识以及“与换节点RN9直接相连”，则停止发送指示“RN9离开”的消息。进一步，还可以都可以根据接收到的消息(指示“RN9离开”)更新自己的路由信息，如：RN6删除信息RN9->RN8，即从RN6到RN9的下一跳是RN8。RN8删除信息“与RN9直接连接”。
在一些实施例中，若发生切换的节点下行还连接有其他节点，节点切换时可能会携带与其相连的其他节点一起切换，若节点切换时携带与其相连的其他节点一起切换，该切换节点除了指示目标节点切换节点离开了源节点接入了目标节点”之外，还可以将自己的路由信息发送给目标节点。示例的，如参考图6所示类似的方法，在此不再赘述。
以下结合附图介绍本发明实施例提供的一种路由更新方法，具体地，需要删除路由信息的节点先进行路由更新，在这些节点删除完路由信息后，需要增加路由信息的节点再更新自己的路由信息。示例的，参考图8，当RN9离开RN8加入RN7，RN9发送消息给源节点RN8指示“RN9加入RN7”，该消息可以携带RN9以及RN7的标识。
各个节点(RN)根据接收到的消息和自己的路由信息表判断如何发送消息指示节点切换的情况。具体地：源节点知道切换节点发生切换并离开了源节点，如果源节点RN8接收到消息指示“RN9加入RN7”，RN8则向自己的父节点RN6发送消息指示“RN9离开RN8加入RN7”。可选的，RN9发送消息给源节点RN8还可以指示“RN9离开RN8加入RN7”，源节点判断接收到的消息中的源节点RN8的标识与自己的标识相同，RN8则向自己的父节点RN6发送消息指示“RN9离开RN8加入RN7”。如果节点判断自己的路由信息不包目标节点RN7的标识，则表明该节点是第二中继节点，如：RN6。RN6需要继续将“RN9离开RN8加入RN7”发送给自己的父节点RN3。RN6还可以根据该消息更新自己的路由信息表，具体地，删除信息“RN9->RN8”，即从RN6到RN9路径上的下一跳是RN8。
如果节点判断自己的路由信息中包括目标节点RN7的标识，则表明该节点是核心节点，如：RN3，RN3不需要继续将“RN9离开RN8加入RN7”发送给自己的父节点RN1，而是向自己的子节点(RN9切换后所在路径上与核心节点连接的子节点)RN5发送消息指示“RN9加入RN7”，该消息可以携带RN9以及RN7的标识。RN3根据“RN9离开RN8加入RN7”更新自己的路由信息，具体地，RN3添加信息“RN9->RN5”，即从RN3到RN9路径上的下一跳是RN5。RN3删除信息“RN9->RN6”，即从RN3到RN9路径上的下一跳是RN6。
此时，需要删除路由信息的节点都完成了路由更新，下一步需要增加路由信息的节点进行路由更新。RN3向对应的子节点指示“RN9加入RN7”，其中，“对应的子节点”即RN9切换后所在路径上的子节点，可以认为是RN9切换后从RN3到达RN9的下一跳，如：RN5。
当RN5接收到RN3发送的指示“RN9加入RN7”的消息，RN5判断接收到的消息中目标节点RN7的标识与自己的标识是否相同，如果不同则向自己的子节点发送消息指示“RN9加入RN7”，如：向RN7发送。每一个接收到自己父节点发送的消息的节点(如：RN5、RN7)都会判断消息中目标节点 RN7的标识与自己的标识是否相同，如果不同则向自己的子节点发送消息指示“RN9加入RN7”，如果相同则停止发送。RN5、RN7，都可以根据接收到的消息(“RN9加入RN7”)更新自己的路由信息，如：RN5增加信息RN9->RN7，即从RN5到RN9的下一跳是RN7。RN7增加信息“与RN9直接连接”。
在一些实施例中，若发生切换的节点下行还连接有其他节点，节点切换时可能会携带与其相连的其他节点一起切换，若节点切换时携带与其相连的其他节点一起切换，该切换节点除了指示源节点“切换节点接入了目标节点节点”之外，还可以将自己的路由信息发送给目标节点。示例的，参考图9，RN9离开了RN8接入RN7，RN9向RN8发送消息指示“RN9离开了RN8加入了RN7”，同时，该消息中还需要包括RN9自身的路由信息。示例的，RN9的路由信息是“与RN10直接连接”。当然，目标节点、第一中继节点、核心节点、第二中继节点以及源节点之间传递的消息中也需要包括切换节点RN9的路由信息。如图9所示，RN8发送给RN6的消息中包括RN9的路由信息“与RN10直接连接”，RN6发送给RN3的消息中包括RN9的路由信息“与RN10直接连接”，RN3发送给RN5的消息中包括RN9的路由信息“与RN10直接连接”，RN5发送给RN7的消息中包括RN9的路由信息“与RN10直接连接”。
在一些实施例中，切换节点RN9发送给源节点RN8的消息可以不同与图8中给出的示例，该消息可以仅仅指示切换节点接入目标节点。具体地，参考图10，当RN9离开RN8加入RN7，RN9向源节点RN8发送“RN9加入RN7”，该消息可以携带RN9以及RN7的标识。
各个节点(RN)根据接收到的消息和自己的路由信息表判断如何发送消息指示节点的切换情况。具体地：源节点知道切换节点发生切换并离开了源节点，如果源节点RN8接收到消息指示“RN9加入RN7”，RN8则向自己的父节点RN6发送消息指示“RN9加入RN7”。
如果节点确定自己的路由信息不包目标节点RN7的标识，则表明该节点是第二中继节点，如：RN6。RN6需要继续将“RN9加入RN7”发送给自己的父节点RN3。RN6还可以根据该消息更新自己的路由信息表，具体地，删除信息“RN9->RN8”，即从RN6到RN9路径上的下一跳是RN8。
如果节点判断自己的路由信息中包括目标节点RN7的标识，则表明该节点是核心节点，如：RN3，RN3不需要继续将“RN9加入RN7”发送给自己的父节点RN1，而是向自己的子节点(RN9切换后所在路径上与核心节点RN3连接的子节点)RN5发送消息指示“RN9加入RN7”，RN3根据该消息更新自己的路由信息，具体地，RN3添加信息“RN9->RN5”，即从RN3到RN9路径上的下一跳是RN5。RN3删除信息“RN9->RN6”，即从RN3到RN9路径上的下一跳是RN6。
此时，需要删除路由信息的节点都完成了路由更新，下一步需要增加路由信息的节点进行路由更新。RN3向对应的子节点指示“RN9加入RN7”，其中，“对应的子节点”即RN9切换后所在路径上的子节点，可以认为是RN9切换后从RN3到达RN9的下一跳，如：RN5。
当RN5接收到RN3发送的指示“RN9加入RN7”的消息，RN5判断接收到的消息中目标节点RN7的标识与自己的标识是否相同，如果不同则将接收到的消息向自己的子节点发送消息指示“RN9加入RN7”，如：向RN7发送。每一个接收到自己父节点发送的消息的节点(如：RN5、RN7)都会判断目标节点RN7的标识与自己的标识是否相同，如果不同则向自己的子节点发送消息指示“RN9加入RN7”，如果相同则停止发送。RN5、RN7都可以根据接收到的消息(“RN9加入RN7”)更新自己的路由信息，如：RN5增加信息RN9->RN7，即从RN5到RN9的下一跳是RN7。RN7增加信息“与RN9直接连接”。
尽管图8～图10中未示出，切换节点RN9发送给源节点RN8的消息还可以是“RN9离开，RN9接入RN7”，该消息可以携带RN9以及RN7的标识。RN8可以判断自己的路由信息中是否包括目标节点RN7的标识，如果RN8的路由信息中不包括目标节点RN7的标识，RN8则向自己的父节点RN6发送消息指示“RN9离开，RN9接入RN7”。RN6可以判断自己的路由信息中是否包括目标节点RN7的标 识，如果RN6的路由信息中不包括目标节点RN7的标识，RN8则向自己的父节点RN3发送消息指示“RN9离开，RN9接入RN7”。RN3确定自己的路由信息中包括目标节点RN7的标识，则向自己的子节点RN5发送消息“RN9接入RN7”，该消息可以携带RN9以及RN7的标识。RN5接收RN3发送的消息，确定自己的标识与目标节点RN7的标识不同，则向自己的子节点RN7发送消息指示“RN9接入RN7”。RN7接收RN5发送的消息，确定自己的标识与目标节点RN7的标识相同，则停止发送指示“RN9接入RN7”的消息。
在一些实施例中，若发生切换的节点下行还连接有其他节点，节点切换时可能会携带与其相连的其他节点一起切换，若节点切换时携带与其相连的其他节点一起切换，该切换节点除了指示源节点“切换节点接入了目标节点节点”之外，还可以将自己的路由信息发送给目标节点。示例的，如参考图9所示类似的方法，在此不再赘述。
上述主要从各个节点之间交互的角度对本申请实施例提供的方案进行了介绍。可以理解的是，路由更新的装置为了实现上述功能，其包含了执行各个功能相应的硬件结构和/或软件模块。本领域技术人员应该很容易意识到，结合本文中所公开的实施例描述的各示例的算法步骤，本申请能够以硬件或硬件和计算机软件的结合形式来实现。某个功能究竟以硬件还是计算机软件驱动硬件的方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
本申请实施例可以根据上述方法示例对网络设备进行功能模块的划分，例如，可以对应各个功能划分各个功能模块，也可以将两个或两个以上的功能集成在一个处理模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。需要说明的是，本申请实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。
在采用对应各个功能划分各个功能模块的情况下，本发明实施例提供一种通信设备，所述通信设备可以是本发明实施例涉及的第一节点、第二节点或第三节点。在采用对应各个功能划分各个功能模块的情况下，图11示出了上述通信设备的一种可能的结构示意图。如图11所示，所述网络设备包括接收单元1101、更新单元1102以及发送单元1103。
接收单元1101，用于支持所述网络设备执行上述实施例中的步骤401，和/或用于本文所描述的技术的其它过程；
更新单元1102，用于支持所述网络设备执行上述实施例中的步骤402，和/或用于本文所描述的技术的其它过程；
发送单元1103，用于支持网络设备向其他节点发送消息，如当网络设备作为第一节点，发送单元1103用于支持第一节点向第三节点发送第二消息，和/或用于本文所描述的技术的其它过程。
需要说明的是，上述方法实施例涉及的各步骤的所有相关内容均可以援引到对应功能模块的功能描述，在此不再赘述。
示例性的，在采用集成的单元的情况下，本申请实施例提供的网络设备的结构示意图如图12所示。在图12中，该网络设备包括：处理模块1201和通信模块1202。处理模块1201用于对网络设备的动作进行控制管理，例如，执行上述更新单元1102执行的步骤，和/或用于执行本文所描述的技术的其它过程。通信模块1202用于支持网络设备与其他设备之间的交互，例如，执行上述接收单元1101和发送单元1103执行的步骤。如图12所示，网络设备还可以包括存储模块1203，存储模块1203用于存储网络设备的程序代码和数据。
当处理模块1201为处理器，通信模块1202为收发器，存储模块1203为存储器时，网络设备可以 为图3所示的网络设备。如果收发器为接收器和发射器，接收器执行上述接收单元1101所执行的步骤，发射器执行发送单元1103执行的步骤。
本申请实施例应用于5G通信系统或未来可能出现的其他系统，以下对本申请中的部分用语进行解释说明，以便于本领域技术人员理解。需要说明的是，当本申请实施例的方案应用于5G系统或未来可能出现的其他系统时，网络设备和用户设备的名称可能发生变化，但这并不影响本申请实施例方案的实施。
1)用户设备(User Equipment，UE)，又称为用户、用户设备，是一种向用户提供语音和/或数据连通性的设备，例如，具有无线连接功能的手持式设备、车载设备等。常见的用户设备例如包括：手机、平板电脑、笔记本电脑、掌上电脑、移动互联网设备(mobile internet device，MID)、可穿戴设备，其中，可穿戴设备例如包括：智能手表、智能手环、计步器等。
2)网络设备，又称为无线接入网(Radio Access Network，RAN)设备是一种将用户设备接入到无线网络的设备，其包括各种通信制式中的网络设备，例如包括但不限于：基站、演进型节点B(evolved Node B，eNB)、无线网络控制器(radio network controller，RNC)、节点B(Node B，NB)、网络设备控制器(Base Station Controller，BSC)、网络设备收发台(Base Transceiver Station,BTS)、家庭网络设备(例如，Home evolved NodeB，或Home Node B，HNB)、基带单元(BaseBand Unit，BBU)等。另外，网络设备包括了各类频率制式的网络设备，例如包括但不限于：低频网络设备、高频网络设备。
现有技术中，用户设备通过缓存状态报告(Buffer Status Reporting，BSR)告知网络设备(如基站等)其上行缓存中有多少数据需要发送，以便网络设备决定给该UE分配多少上行资源。当用户设备触发了常规缓存状态报告(Regular BSR)，且当前没有可以使用的上行资源，则UE触发调度请求(Scheduling Request，SR)告知网络设备其有数据需要发送，网络设备会给UE分配一个至少足够发送BSR的上行资源，UE使用该上行资源将BSR发送给网络设备。对于SR的取消条件，当满足如下2个条件中的任一个时，处于待处理(pending)状态的SR会被取消：条件1，当一个媒体接入控制(Medium Access Control，MAC)协议数据单元(Protocol Data Unit，PDU)组包完成并包含一个BSR，且该BSR包含了直到触发BSR的最近一次事件时的缓存状态；条件2，当一个传输的MAC PDU中包含了所有可用于传输的待传数据。对于BSR的取消条件，当满足如下2个条件中的任一个时，触发的BSR可能会被取消：条件1，当一个传输的MAC PDU组包完成并包含一个BSR，触发的BSR会被取消；条件2，当一个传输的MAC PDU中包含了所有可用于传输的待传数据但是无法再包含一个BSR MAC控制单元(Control Element，CE)加上其头部，触发的BSR可能会被取消。
在第五代(5Generation，5G)新空口(New Radio，NR)系统中，当用户设备在物理下行控制信道(Physical Downlink Control Channel，PDCCH)资源上接收到网络设备发送的下行调度信息(Downlink Control Information,DCI)，该下行调度信息指示了上行许可(UL grant)，同时还指示了从当前接收下行调度信息开始经过多长时间可以使用指示的上行许可发送上行数据，例如，下行控制信息指示K值，表示接收下行控制信息后经过K时间可以使用指示的上行许可发送上行数据。上行数据在物理上行共享信道(Physical Uplink Shared Channel，PUSCH)资源上发送。用户设备可以在接收完下行调度信息后开始组包，即组装媒体接入控制(Medium Access Control，MAC)协议数据单元(Protocol Data Unit，PDU)，并且需要在上行许可到来前组包完成，才能成功使用指示的上行许可将组好的MAC PDU发送出去。用户设备可以在K时间段中的任一时刻进行组包，这取决于用户设备自己实现。当用户设备组完MAC PDU之后，很有可能还没有到使用上行许可的时间，即还没有到物理上行共享信道资源出现的时间，此时组好的MAC PDU需要等一段时间才可以使用指示的上行许可发送该 MAC PDU，例如，MAC PDU组包完成后还需要等待R时间才可以使用指示的上行许可发送该MAC PDU。也就是说，在R时间内，由于SR已经被取消，即使出现了可以发送SR的物理上行共享信道(Physical Uplink Control Channel，PUCCH)资源也无法发送SR，只能等到R时间后发送MAC PDU才能让基站知道用户设备有缓存的数据需要发送，即无法让基站通过更早的SR知道用户设备有缓存的数据需要发送，从而可能影响基站更早地调度用户设备的上行数据，导致用户设备的上行数据的时延增大。
图13为本申请实施例提供的一种应用场景示意图。如图13所示的组网架构，主要包括网络设备1301和用户设备1302；用户设备1302可以与网络设备1301进行通信。该用户设备1302发送给网络设备1301的数据属于上行数据，该网络设备1301发送给用户设备1302的数据为下行数据，该用户设备1302发送上行数据所使用的上行资源(例如，时频资源)由该网络设备1301通过静态调度、半静态调度、动态调度等方式进行配置。本发明实施例中，用户设备1302通过BSR告知网络设备1301(如基站等)其有多少上行数据需要发送，以便网络设备1301决定给该用户设备1302分配多少上行资源。在发送BSR之前，用户设备1302可能给网络设备1301发送了SR告知网络设备1301其有数据需要发送，以便网络设备1301分配一个至少足够发送BSR的上行资源，用户设备1302使用该上行资源将BSR发送给网络设备1301。
图14为本发明实施例提供的一种调度请求取消方法的流程示意图，该方法包括但不限于如下步骤：
步骤1401：设备确定第一调度请求被触发。
具体地，设备可以是终端设备。当满足了触发调度请求的触发条件，调度请求会被触发，设备确定第一调度请求被触发可以理解为设备知道存在被触发的第一调度请求。此时，第一调度请求是待处理(pending)的调度请求，也可以理解为，第一调度请求为被触发了、且没有被取消的调度请求。
步骤1402：当媒体接入控制协议数据单元被发送，且该媒体接入控制协议数据单元包含第一缓存状态报告，设备取消第一调度请求。
具体地，当设备接收到网络设备分配的上行资源，设备将带传输的数据组成一个MAC PDU，并且MAC PDU中可以包含缓存状态报告。当组好的MAC PDU被发送，且该MAC PDU包含了第一缓存状态报告，则认为满足了取消第一调度请求的条件，此时设备取消待处理的第一调度请求。其中，第一缓存状态报告包含第一缓存状态，该第一缓存状态为直到最近一次触发缓存状态报告的事件时的缓存状态。例如，MAC PDU发送前，事件1在时间1触发了触发缓存状态报告，对应缓存状态1，在时间1之后、且MAC PDU发送前，事件2在时间2触发了触发缓存状态报告，对应缓存状态2，MAC PDU发送前及事件2之后没有新的事件触发缓存状态报告，此时，第一缓存状态可以认为是最近一次事件2在时间2时的缓存状态，即第一缓存状态可以认为是缓存状态2。
需要说明的是，第一调度请求可以是一个或多个，设备取消第一调度请求可以理解为设备取消所有第一调度请求。媒体接入控制协议数据单元被发送可以认为是至少一个媒体接入控制协议数据单元被发送，该媒体接入控制协议数据单元包含第一缓存状态报告可以认为是该媒体接入控制协议数据单元包含至少一个第一缓存状态报告，本发明不做限定。媒体接入控制协议数据单元被发送可以是媒体接入控制协议数据单元开始被发送，或者，可以是媒体接入控制协议数据单元被发送完成后，本发明不做限定。
在一些实施例中，该第一缓存状态为直到该媒体接入控制协议数据单元组包前最近一次触发缓存状态报告的事件时的缓存状态。也就是说，当组好的MAC PDU被发送，且该MAC PDU包含了第一缓存状态报告，该第一缓存状态报告包含第一缓存状态，该第一缓存状态为直到该MAC PDU组包前最近一次触发缓存状态报告的事件时的缓存状态，则认为满足了取消第一调度请求的条件，此时设备取消待处 理的第一调度请求。例如，在MAC PDU组包前，事件1在时间1触发了触发缓存状态报告，对应缓存状态1，在时间1之后、且MAC PDU发送前，事件2在时间2触发了触发缓存状态报告，对应缓存状态2，MAC PDU组包后及MAC PDU发送前，事件3在时间3触发了触发缓存状态报告，对应缓存状态3，此时，第一缓存状态可以认为是MAC PDU组包前最近一次事件2在时间2时的缓存状态，即第一缓存状态可以认为是缓存状态2。可选的，第一缓存状态为直到触发所述第一缓存状态报告的事件时的缓存状态。
在一些实施例中，进一步，第一调度请求为该媒体接入控制协议数据单元组包前触发的调度请求。例如，在MAC PDU组包前，触发调度请求1，MAC PDU组包后及MAC PDU发送前，触发调度请求2，此时，第一调度请求可以认为是MAC PDU组包前触发的调度请求，即调度请求1。可选的，第一调度请求为第二缓存状态报告触发的调度请求，其中，该媒体接入控制协议数据单元包含触发该第二缓存状态报告的事件时的缓存状态。若当前有触发的缓存状态报告或调度请求，MAC PDU在组包时会包含一个缓存状态报告，该缓存状态报告会包含当前组包时刻最新的缓存状态，即MAC PDU组包前最近一次触发缓存状态报告的事件时的缓存状态，也即触发该第二缓存状态报告的事件时的缓存状态，因此，可以认为该第二缓存状态报告即为MAC PDU组包前触发的缓存状态报告，第一调度请求为第二缓存状态报告触发的调度请求，可以认为该第一调度请求即为MAC PDU组包前触发的调度请求。需要说明的是，第一调度请求可以是一个或多个，即满足MAC PDU组包前触发的调度请求都是第一调度请求，设备取消第一调度请求可以理解为设备取消所有第一调度请求。
在一些实施例中，该第一缓存状态报告没有包含第一缓存状态，该第一缓存状态为直到最近一次触发缓存状态报告的事件时的缓存状态。还可以理解为，该第一缓存状态报告包含第二缓存状态，该第二缓存状态不是直到最近一次触发缓存状态报告的事件时的缓存状态。
具体地，进一步，第一调度请求为该媒体接入控制协议数据单元组包前触发的调度请求。例如，在MAC PDU组包前，触发调度请求1，MAC PDU组包后及MAC PDU发送前，触发调度请求2，此时，第一调度请求可以认为是MAC PDU组包前触发的调度请求，即调度请求1。可选的，第一调度请求为第二缓存状态报告触发的调度请求，其中，该媒体接入控制协议数据单元包含触发该第二缓存状态报告的事件时的缓存状态。若当前有触发的缓存状态报告或调度请求，MAC PDU在组包时会包含一个缓存状态报告，该缓存状态报告会包含当前组包时刻最新的缓存状态，即MAC PDU组包前最近一次触发缓存状态报告的事件时的缓存状态，也即触发该第二缓存状态报告的事件时的缓存状态，因此，可以认为该第二缓存状态报告即为MAC PDU组包前触发的缓存状态报告，第一调度请求为第二缓存状态报告触发的调度请求，可以认为该第一调度请求即为MAC PDU组包前触发的调度请求。需要说明的是，第一调度请求可以是一个或多个，即满足MAC PDU组包前触发的调度请求都是第一调度请求，设备取消第一调度请求可以理解为设备取消所有第一调度请求。
在一些实施例中，设备还可以停止该第一调度请求的调度请求禁止定时器。每个调度请求可以对应一个调度请求配置，每个调度请求配置有各自关联的调度请求禁止定时器，因此当一个调度请求配置的调度请求被取消，即没有对应该调度请求配置的调度请求被触发，此时需要停止该调度请求的调度请求禁止定时器。因此，当设备取消第一调度请求，还需要停止该第一调度请求的调度请求禁止定时器。需要说明的是，第一调度请求可以是一个或多个，多个调度请求可能对应一个或多个调度请求配置，设备取消第一调度请求可以理解为设备取消所有第一调度请求，停止第一调度请求的调度请求禁止定时器可以理解为停止第一调度请求各自的调度请求禁止定时器，若多个调度请求对应一个调度请求配置，则停止对应的那个调度请求禁止定时器，若多个调度请求对应多个调度请求配置，则停止各自对应的调度请 求禁止定时器。
图15为本发明实施例提供的一种缓存状态报告取消方法的流程示意图，该方法包括但不限于如下步骤：
步骤1501：设备确定第一缓存状态报告被触发。
具体地，设备可以是终端设备。当满足了触发缓存状态报告的触发条件，缓存状态报告会被触发，设备确定第一缓存状态报告被触发可以理解为设备知道存在被触发的第一缓存状态报告。
步骤1502：当媒体接入控制协议数据单元被发送，且该媒体接入控制协议数据单元包含缓存状态报告，设备取消所述第一缓存状态报告。
具体地，当设备接收到网络设备分配的上行资源，设备将带传输的数据组成一个MAC PDU，并且MAC PDU中可以包含至少一个缓存状态报告。当组好的MAC PDU被发送，且该MAC PDU包含了至少一个缓存状态报告，则认为满足了取消第一缓存状态报告的条件，此时设备取消待触发的第一缓存状态报告。
需要说明的是，第一缓存状态报告可以是一个或多个，设备取消第一缓存状态报告可以理解为设备取消所有第一缓存状态报告。媒体接入控制协议数据单元被发送可以认为是至少一个媒体接入控制协议数据单元被发送，该媒体接入控制协议数据单元包含缓存状态报告可以认为是该媒体接入控制协议数据单元包含至少一个缓存状态报告，本发明不做限定。媒体接入控制协议数据单元被发送可以是媒体接入控制协议数据单元开始被发送，或者，可以是媒体接入控制协议数据单元被发送完成后，本发明不做限定。
在一些实施例中，该第一缓存状态报告为该媒体接入控制协议数据单元组包前触发的缓存状态报告。也就是说，当组好的MAC PDU被发送，且该MAC PDU包含了至少一个缓存状态报告，则认为满足了取消第一缓存状态报告的条件，该第一缓存状态报告为该MAC PDU组包前触发的缓存状态报告，此时设备取消触发的的第一调度请求。例如，在MAC PDU组包前，触发缓存状态报告1，MAC PDU组包后及MAC PDU发送前，触发缓存状态报告2，此时，第一缓存状态报告可以认为是MAC PDU组包前触发的缓存状态报告，即缓存状态报告1。需要说明的是，第一缓存状态报告可以是一个或多个，即满足MAC PDU组包前触发的缓存状态报告都是第一缓存状态报告，设备取消第一缓存状态报告可以理解为设备取消所有第一缓存状态报告。
在一些实施例中，该媒体接入控制协议数据单元包含触发该第一缓存状态报告的事件时的缓存状态。也就是说，当组好的MAC PDU被发送，且该MAC PDU包含了至少一个缓存状态报告，若该MAC PDU包含了触发该第一缓存状态报告的事件时的缓存状态，则认为满足了取消第一缓存状态报告的条件，此时设备取消触发的第一调度请求。若当前有触发的缓存状态报告或调度请求，MAC PDU在组包时会包含一个缓存状态报告，该缓存状态报告会包含当前组包时刻最新的缓存状态，即MAC PDU组包前最近一次触发缓存状态报告的事件时的缓存状态，也即触发该第一缓存状态报告的事件时的缓存状态，因此，可以认为该第一缓存状态报告即为MAC PDU组包前触发的缓存状态报告。需要说明的是，第一缓存状态报告可以是一个或多个，即满足MAC PDU包含了触发该第一缓存状态报告的事件时的缓存状态，设备取消第一缓存状态报告可以理解为设备取消所有第一缓存状态报告。
以下结合附图介绍本发明实施例提供的一种调度请求取消方法，示例的，参考图16。在MAC PDU组包前，事件1在时间1触发了触发缓存状态报告BSR1，对应缓存状态1，并触发了调度请求SR1，在时间1之后、且在MAC PDU组包前，事件2在时间2触发了触发缓存状态报告BSR2，对应缓存状态2，并触发了调度请求SR2。当MAC PDU组包完成，由于当前有触发的缓存状态报告，MAC PDU 中可以包含一个缓存状态报告，并且该缓存状态报告包含直到最近一次触发缓存状态报告的事件时的缓存状态，即缓存状态2，此时不取消SR1以及SR2，而是在MAC PDU被发送后，取消SR1以及SR2。
另外，MAC PDU组包后及MAC PDU发送前，事件3在时间3触发了触发缓存状态报告BSR3，对应缓存状态3，并触发了调度请求SR3。此时，当MAC PDU组包完成，MAC PDU中可以包含一个缓存状态报告，并且该缓存状态报告包含直到MAC PDU组包前最近一次触发缓存状态报告的事件时的缓存状态，即缓存状态2，而不是直到最近一次触发缓存状态报告的事件时的缓存状态3，满足上述条件，则取消MAC PDU组包前触发的调度请求，即取消调度请求SR1和调度请求SR2，而不取消MAC PDU组包后触发的调度请求SR3。或者，若MAC PDU中包含的触发某些缓存状态报告的时间的缓存状态，则取消由这些缓存状态报告触发的调度请求，例如，MAC PDU中包含了事件1和事件2时的缓存状态1和缓存状态2，因此取消由缓存状态报告BSR1触发的调度请求SR1和由缓存状态报告BSR2触发的调度请求SR2，而MAC PDU中没有包含了事件3的缓存状态3，因此不取消由缓存状态报告BSR3触发的调度请求SR3。
以下结合附图介绍本发明实施例提供的一种缓存状态报告取消方法，示例的，参考图16。在MAC PDU组包前，事件1在时间1触发了触发缓存状态报告BSR1，对应缓存状态1，并触发了调度请求SR1，在时间1之后、且在MAC PDU组包前，事件2在时间2触发了触发缓存状态报告BSR2，对应缓存状态2，并触发了调度请求SR2。当MAC PDU组包完成，由于当前有触发的缓存状态报告，MAC PDU中可以包含一个缓存状态报告，此时不取消BSR1以及BSR2，而是在MAC PDU被发送后，取消BSR1以及BSR2。
另外，MAC PDU组包后及MAC PDU发送前，事件3在时间3触发了触发缓存状态报告BSR3，对应缓存状态3，并触发了调度请求SR3。此时，当MAC PDU组包完成，MAC PDU中可以包含一个缓存状态报告，此时，不是取消所有触发的缓存状态报告，而是取消MAC PDU组包前触发的缓存状态报告，即取消缓存状态报告BSR1和缓存状态报告BSR2，而不取消MAC PDU组包后触发的缓存状态报告BSR3。或者，若MAC PDU中包含的触发某些缓存状态报告的时间的缓存状态，则取消由这些缓存状态报告，例如，MAC PDU中包含了事件1和事件2时的缓存状态1和缓存状态2，因此取消缓存状态报告BSR1和缓存状态报告BSR2，而MAC PDU中没有包含了事件3的缓存状态3，因此不取消缓存状态报告BSR3。
采用本发明实施例的方法，能够保证调度请求被更早的发送给基站，即让基站更早的知道用户设备有数据需要传输，以便基站能够更早地给用户设备分配传输上行数据的上行资源，从而减少了用户设备的上行数据的时延。
上述详细阐述了本发明实施例的方法。本领域技术人员应该很容易意识到，结合本文中所公开的实施例描述的各示例的算法步骤，本申请能够以硬件或硬件和计算机软件的结合形式来实现。某个功能究竟以硬件还是计算机软件驱动硬件的方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
本申请实施例可以根据上述方法示例对设备进行功能模块的划分，例如，可以对应各个功能划分各个功能模块，也可以将两个或两个以上的功能集成在一个处理模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。需要说明的是，本申请实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。
在采用对应各个功能划分各个功能模块的情况下，本发明实施例提供一种通信设备，所述通信设备 可以是本发明实施例涉及的设备。在采用对应各个功能划分各个功能模块的情况下，图17示出了上述通信设备的一种可能的结构示意图。如图17所示，所述设备包括确定单元1701和取消单元1702。
确定单元1701，用于支持所述设备执行上述实施例中的步骤1401，和/或用于支持所述设备执行上述实施例中的步骤1501，和/或用于本文所描述的技术的其它过程。
取消单元1702，用于支持所述设备执行上述实施例中的步骤1402，和/或用于支持所述设备执行上述实施例中的步骤1502，和/或用于本文所描述的技术的其它过程。
需要说明的是，上述方法实施例涉及的各步骤的所有相关内容均可以援引到对应功能模块的功能描述，在此不再赘述。
示例性的，在采用集成的单元的情况下，本申请实施例提供的设备的结构示意图如图18所示。在图18中，该设备包括：处理模块1801。处理模块1801用于对设备的动作进行控制管理，例如，执行上述确定单元1701执行的步骤，和/或执行上述确定单元1702执行的步骤，和/或用于执行本文所描述的技术的其它过程。如图18所示，设备还可以包括存储模块1802，存储模块1802用于存储设备的程序代码和数据。
示例性的，本申请实施例提供的设备的结构示意图如图19所示。在图19中，该设备包括：处理器1901，存储器1902。处理模块1801为处理器1901，例如，执行上述确定单元1701执行的步骤，和/或用于执行本文所描述的技术的其它过程。存储模块1802为存储器1902，用于存储设备的程序代码和数据。
通过以上的实施方式的描述，所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，仅以上述各功能模块的划分进行举例说明，实际应用中，可以根据需要而将上述功能分配由不同的功能模块完成，即将装置的内部结构划分成不同的功能模块，以完成以上描述的全部或者部分功能。
在本申请所提供的几个实施例中，应该理解到，所揭露的装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述模块或单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个装置，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是一个物理单元或多个物理单元，即可以位于一个地方，或者也可以分布到多个不同地方。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个可读取存储介质中。基于这样的理解，本申请实施例的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该软件产品存储在一个存储介质中，包括若干指令用以使得一个设备(可以是单片机，芯片等)或处理器执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、ROM、RAM、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何在本申请揭露的技术范围内的变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (102)

  1. 一种调度请求取消方法，其特征在于，包括：
    设备确定第一调度请求被触发；
    当媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含第一缓存状态报告，所述设备取消所述第一调度请求；
    所述第一缓存状态报告包含第一缓存状态，所述第一缓存状态为直到所述媒体接入控制协议数据单元组包前最近一次触发缓存状态报告的事件时的缓存状态；
    所述第一调度请求为所述媒体接入控制协议数据单元组包前触发的调度请求。
  2. 根据权利要求1所述的方法，其特征在于，所述第一调度请求是待处理的调度请求。
  3. 根据权利要求1所述的方法，其特征在于，所述第一调度请求为被触发了、且没有被取消的调度请求。
  4. 根据权利要求1-3任一项所述的方法，其特征在于，所述设备取消所述第一调度请求具体包括：所述设备取消所有所述第一调度请求，所述第一调度请求是一个或多个。
  5. 根据权利要求1-4任一项所述的方法，其特征在于，所述媒体接入控制协议数据单元包含第一缓存状态报告具体包括：所述媒体接入控制协议数据单元包含至少一个第一缓存状态报告。
  6. 根据权利要求1所述的方法，其特征在于，所述第一调度请求为第二缓存状态报告触发的调度请求，其中，所述媒体接入控制协议数据单元包含触发所述第二缓存状态报告的事件时的缓存状态。
  7. 根据权利要求1-6任一项所述的方法，其特征在于，还包括：
    所述设备确定第二调度请求被触发；
    当所述媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含所述第一缓存状态报告，所述设备不取消所述所述第二调度请求；
    所述第二调度请求为所述媒体接入控制协议数据单元组包后触发的调度请求。
  8. 根据权利要求1-7任一项所述的方法，其特征在于，还包括：
    所述设备在物理下行控制信道资源上接收到网络设备发送的下行调度信息，所述下行调度信息指示上行许可；
    所述设备在接收完下行调度信息后组装所述媒体接入控制协议数据单元，并使用所述上行许可发送所述媒体接入控制协议数据单元。
  9. 根据权利要求1-8任一项所述的方法，其特征在于，还包括：
    当所述媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含所述第一缓存状态报告，所述设备停止所述第一调度请求的调度请求禁止定时器。
  10. 根据权利要求9所述的方法，其特征在于，所述设备停止所述第一调度请求的调度请求禁止定时器具体包括：
    所述设备停止所述第一调度请求各自的调度请求禁止定时器。
  11. 一种缓存状态报告取消方法，其特征在于，包括：
    设备确定第一缓存状态报告被触发；
    当媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含缓存状态报告，所述设备取消所述第一缓存状态报告；
    所述第一缓存状态报告为所述媒体接入控制协议数据单元组包前触发的缓存状态报告。
  12. 根据权利要求11所述的方法，其特征在于，所述媒体接入控制协议数据单元包含缓存状态报告具体包括：所述媒体接入控制协议数据单元包含所述媒体接入控制协议数据单元组包前最近一次触 发缓存状态报告的事件时的缓存状态。
  13. 根据权利要求11或12所述的方法，其特征在于，所述设备取消所述第一缓存状态报告具体包括：所述设备取消所有所述第一缓存状态报告，所述第一缓存状态报告是一个或多个。
  14. 根据权利要求11-13任一项所述的方法，其特征在于，所述媒体接入控制协议数据单元被发送具体包括：至少一个所述媒体接入控制协议数据单元被发送。
  15. 根据权利要求11-14任一项所述的方法，其特征在于，所述媒体接入控制协议数据单元包含缓存状态报告具体包括：所述媒体接入控制协议数据单元包含至少一个缓存状态报告。
  16. 根据权利要求11所述的方法，其特征在于，所述媒体接入控制协议数据单元包含触发所述第一缓存状态报告的事件时的缓存状态。
  17. 根据权利要求11-16任一项所述的方法，其特征在于，还包括：
    所述设备确定第二缓存状态报告被触发；
    当所述媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含所述缓存状态报告，所述设备不取消所述所述第二缓存状态报告被触发；
    所述第二缓存状态报告为所述媒体接入控制协议数据单元组包后触发的缓存状态报告。
  18. 根据权利要求11-17任一项所述的方法，其特征在于，还包括：
    所述设备在物理下行控制信道资源上接收到网络设备发送的下行调度信息，所述下行调度信息指示上行许可；
    所述设备在接收完下行调度信息后组装所述媒体接入控制协议数据单元，并使用所述上行许可发送所述媒体接入控制协议数据单元。
  19. 一种设备，其特征在于，包括：
    处理器，用于确定第一调度请求被触发；
    收发器，用于发送媒体接入控制协议数据单元；
    当所述媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含第一缓存状态报告，所述处理器还用于取消所述第一调度请求；
    所述第一缓存状态报告包含第一缓存状态，所述第一缓存状态为直到所述媒体接入控制协议数据单元组包前最近一次触发缓存状态报告的事件时的缓存状态；
    所述第一调度请求为所述媒体接入控制协议数据单元组包前触发的调度请求。
  20. 根据权利要求19所述的设备，其特征在于，所述第一调度请求是待处理的调度请求。
  21. 根据权利要求19所述的设备，其特征在于，所述第一调度请求为被触发了、且没有被取消的调度请求。
  22. 根据权利要求19-21任一项所述的设备，其特征在于，所述取消所述第一调度请求，所述处理器具体用于：所述设备取消所有所述第一调度请求，所述第一调度请求是一个或多个。
  23. 根据权利要求19-22任一项所述的设备，其特征在于，所述媒体接入控制协议数据单元包含第一缓存状态报告具体包括：所述媒体接入控制协议数据单元包含至少一个第一缓存状态报告。
  24. 根据权利要求19所述的设备，其特征在于，所述第一调度请求为第二缓存状态报告触发的调度请求，其中，所述媒体接入控制协议数据单元包含触发所述第二缓存状态报告的事件时的缓存状态。
  25. 根据权利要求19-24任一项所述的设备，其特征在于，
    所述处理器还用于确定第二调度请求被触发；
    当所述媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含所述第一缓存状态报告，所述处理器还用于不取消所述所述第二调度请求；
    所述第二调度请求为所述媒体接入控制协议数据单元组包后触发的调度请求。
  26. 根据权利要求19-25任一项所述的设备，其特征在于，
    所述收发器还用于在物理下行控制信道资源上接收到网络设备发送的下行调度信息，所述下行调度信息指示上行许可；
    所述处理器还用于在所述收发器在接收完下行调度信息后组装所述媒体接入控制协议数据单元，并通过所述收发器使用所述上行许可发送所述媒体接入控制协议数据单元。
  27. 根据权利要求19-26任一项所述的设备，其特征在于，还包括：
    当所述媒体接入控制协议数据单元通过所述收发器被发送，且所述媒体接入控制协议数据单元包含所述第一缓存状态报告，所述设备还用于停止所述第一调度请求的调度请求禁止定时器。
  28. 根据权利要求27所述的设备，其特征在于，所述停止所述第一调度请求的调度请求禁止定时器时，所述处理器具体用于：
    停止所述第一调度请求各自的调度请求禁止定时器。
  29. 一种设备，其特征在于，包括：
    处理器，用于确定第一缓存状态报告被触发；
    收发器，用于发送媒体接入控制协议数据单元；
    当媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含缓存状态报告，所述处理器还用于取消所述第一缓存状态报告；
    所述第一缓存状态报告为所述媒体接入控制协议数据单元组包前触发的缓存状态报告。
  30. 根据权利要求29所述的设备，其特征在于，所述媒体接入控制协议数据单元包含缓存状态报告具体包括：所述媒体接入控制协议数据单元包含所述媒体接入控制协议数据单元组包前最近一次触发缓存状态报告的事件时的缓存状态。
  31. 根据权利要求29或30所述的设备，其特征在于，在取消所述第一缓存状态报告时，所述处理器具体用于：取消所有所述第一缓存状态报告，所述第一缓存状态报告是一个或多个。
  32. 根据权利要求29-31任一项所述的设备，其特征在于，发送所述媒体接入控制协议数据单元时，所述收发器具体用于：发送至少一个所述媒体接入控制协议数据单元。
  33. 根据权利要求29-32任一项所述的设备，其特征在于，所述媒体接入控制协议数据单元包含缓存状态报告具体包括：所述媒体接入控制协议数据单元包含至少一个缓存状态报告。
  34. 根据权利要求33所述的设备，其特征在于，所述媒体接入控制协议数据单元包含触发所述第一缓存状态报告的事件时的缓存状态。
  35. 根据权利要求29-34任一项所述的设备，其特征在于，
    所述处理器还用于确定第二缓存状态报告被触发；
    当所述媒体接入控制协议数据单元被所述收发器发送，且所述媒体接入控制协议数据单元包含所述缓存状态报告，所述处理器还用于不取消所述所述第二缓存状态报告被触发；
    所述第二缓存状态报告为所述媒体接入控制协议数据单元组包后触发的缓存状态报告。
  36. 根据权利要求29-35任一项所述的设备，其特征在于，
    所述收发器还用于在物理下行控制信道资源上接收到网络设备发送的下行调度信息，所述下行调度信息指示上行许可；
    所述处理器还用于在通过所述收发器接收完下行调度信息后组装所述媒体接入控制协议数据单元，并通过所述收发器、使用所述上行许可发送所述媒体接入控制协议数据单元。
  37. 一种设备，其特征在于，包括：
    存储器，用于存储程序或指令；
    收发器，用于收发信息；
    处理器；用于执行所述程序或指令，并配合收发器，以使所述设备执行如权利要求1-18中任一项所述的方法。
  38. 一种设备，其特征在于，包括：
    处理模块，用于确定第一调度请求被触发；
    发送模块，用于发送媒体接入控制协议数据单元
    所述处理模块还用于，当媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含第一缓存状态报告，所述设备取消所述第一调度请求；
    所述第一缓存状态报告包含第一缓存状态，所述第一缓存状态为直到所述媒体接入控制协议数据单元组包前最近一次触发缓存状态报告的事件时的缓存状态；
    所述第一调度请求为所述媒体接入控制协议数据单元组包前触发的调度请求。
  39. 根据权利要求38所述的设备，其特征在于，所述第一调度请求是待处理的调度请求。
  40. 根据权利要求38所述的设备，其特征在于，所述第一调度请求为被触发了、且没有被取消的调度请求。
  41. 根据权利要求38-40任一项所述的设备，其特征在于，所述设备取消所述第一调度请求具体包括：所述设备取消所有所述第一调度请求，所述第一调度请求是一个或多个。
  42. 根据权利要求38-40任一项所述的设备，其特征在于，所述媒体接入控制协议数据单元包含第一缓存状态报告具体包括：所述媒体接入控制协议数据单元包含至少一个第一缓存状态报告。
  43. 根据权利要求38所述的设备，其特征在于，所述第一调度请求为第二缓存状态报告触发的调度请求，其中，所述媒体接入控制协议数据单元包含触发所述第二缓存状态报告的事件时的缓存状态。
  44. 根据权利要求38-43任一项所述的设备，其特征在于，所述处理模块还用于：
    确定第二调度请求被触发；
    当所述媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含所述第一缓存状态报告，不取消所述所述第二调度请求；
    所述第二调度请求为所述媒体接入控制协议数据单元组包后触发的调度请求。
  45. 根据权利要求38-44任一项所述的设备，其特征在于，
    所述收发模块还用于在物理下行控制信道资源上接收网络设备发送的下行调度信息，所述下行调度信息指示上行许可；
    所述处理模块还用于：
    在接收完下行调度信息后组装所述媒体接入控制协议数据单元，并通过所述收发单元使用所述上行许可发送所述媒体接入控制协议数据单元。
  46. 根据权利要求38-45任一项所述的设备，其特征在于，所述处理模块还用于：
    当所述媒体接入控制协议数据单元被所述收发模块发送，且所述媒体接入控制协议数据单元包含所述第一缓存状态报告，停止所述第一调度请求的调度请求禁止定时器。
  47. 根据权利要求46所述的设备，其特征在于，所述停止所述第一调度请求的调度请求禁止定时器，所述处理模块具体用于：
    所述设备停止所述第一调度请求各自的调度请求禁止定时器。
  48. 根据权利要求38-47中任一项所述的设备，其特征在于，所述处理模块包括处理器，所述收发模块包括无线收发器。
  49. 一种设备，其特征在于，包括：
    处理模块，用于确定第一缓存状态报告被触发；
    收发模块，用于发送媒体接入控制协议数据单元；
    当媒体接入控制协议数据单元被发送，且所述媒体接入控制协议数据单元包含缓存状态报告，所述处理器还用于取消所述第一缓存状态报告；
    所述第一缓存状态报告为所述媒体接入控制协议数据单元组包前触发的缓存状态报告。
  50. 根据权利要求49所述的设备，其特征在于，所述媒体接入控制协议数据单元包含缓存状态报告具体包括：所述媒体接入控制协议数据单元包含所述媒体接入控制协议数据单元组包前最近一次触发缓存状态报告的事件时的缓存状态。
  51. 根据权利要求49或50所述的设备，其特征在于，所述设备取消所述第一缓存状态报告具体包括：所述设备取消所有所述第一缓存状态报告，所述第一缓存状态报告是一个或多个。
  52. 根据权利要求49-51任一项所述的设备，其特征在于，所述媒体接入控制协议数据单元被发送具体包括：至少一个所述媒体接入控制协议数据单元被发送。
  53. 根据权利要求49-52任一项所述的设备，其特征在于，所述媒体接入控制协议数据单元包含缓存状态报告具体包括：所述媒体接入控制协议数据单元包含至少一个缓存状态报告。
  54. 根据权利要求53所述的设备，其特征在于，所述媒体接入控制协议数据单元包含触发所述第一缓存状态报告的事件时的缓存状态。
  55. 根据权利要求49-54任一项所述的设备，其特征在于，所述处理模块还用于：
    确定第二缓存状态报告被触发；
    当所述媒体接入控制协议数据单元被所述收发模块发送，且所述媒体接入控制协议数据单元包含所述缓存状态报告，不取消所述所述第二缓存状态报告被触发；
    所述第二缓存状态报告为所述媒体接入控制协议数据单元组包后触发的缓存状态报告。
  56. 根据权利要求49-55任一项所述的设备，其特征在于，所述收发模块还用于：
    在物理下行控制信道资源上接收网络设备发送的下行调度信息，所述下行调度信息指示上行许可；
    所述处理模块还用于在接收完下行调度信息后组装所述媒体接入控制协议数据单元，并通过所述收发模块、使用所述上行许可发送所述媒体接入控制协议数据单元。
  57. 根据权利要求38-56中任一项所述的设备，其特征在于，所述处理模块包括处理器，所述收发模块包括无线收发器。
  58. 一种路由更新方法，其特征在于，包括：
    第一节点接收第二节点发送的第一消息，所述第一消息用于指示切换节点离开源节点和/或切换节点接入目标节点；所述源节点是所述切换节点切换前连接的节点，所述目标节点为所述切换节点切换后连接的节点；
    所述第一节点根据所述第一消息更新所述第一节点的路由信息；
    其中，所述第一节点为以下节点中的任意一个：所述目标节点、所述源节点、核心节点、所述目标节点与所述核心节点之间的第一中继节点、所述源节点与所述核心节点之间的第二中继节点；所述核心节点是所述目标节点与所述源节点上行方向的第一个共同节点；
    所述第二节点为以下节点中的任意一个：所述切换节点、所述目标节点、所述源节点、所述核心节点、所述第一中继节点、所述第二中继节点。
  59. 根据权利要求58所述的方法，其特征在于，所述方法还包括：
    所述第一节点根据所述第一消息确定接收第二消息的第三节点，向所述第三节点发送所述第二消 息，所述第二消息用于指示所述切换节点离开源节点和/或所述切换节点接入目标节点；
    其中，所述第三节点为以下节点中的任意一个：所述源节点、所述核心节点、所述目标节点、所述第一中继节点、所述第二中继节点。
  60. 根据权利要求59所述的方法，其特征在于，所述第二消息还包括所述切换节点的路由信息。
  61. 根据权利要求59-60任一项所述的方法，其特征在于，所述第一消息还包括所述切换节点的路由信息。
  62. 根据权利要求59所述的方法，其特征在于，所述第一节点根据所述第一消息确定接收第二消息的第三节点包括：
    所述第一节点确定所述第一节点的路由信息中不包括所述切换节点的信息和/或所述第一节点的路由信息中不包括所述源节点的信息，则确定所述第三节点为所述第一节点的父节点。
  63. 根据权利要求62所述的方法，其特征在于，所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开所述源节点和所述切换节点所述接入目标节点；或者，
    所述第一消息用于指示所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点接入所述目标节点。
  64. 根据权利要求59所述的方法，其特征在于，所述第一节点根据所述第一消息确定接收第二消息的第三节点包括：
    所述第一节点确定所述第一节点的路由信息包括所述切换节点的信息和/或所述第一节点的路由信息中包括所述源节点的信息，则确定所述第三节点为所述第一节点的子节点。
  65. 根据权利要求64所述的方法，其特征在于，所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开所述源节点；或者，
    所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开；或者，
    所述第一消息用于指示所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开。
  66. 根据权利要求59所述的方法，其特征在于，所述第一节点根据所述第一消息确定接收第二消息的第三节点包括：
    所述第一节点确定所述第一节点的路由信息中包括所述切换节点的信息且所述切换节点切换前不是所述第一节点的子节点，则确定所述第三节点为所述第一节点的子节点。
  67. 根据权利要求66所述的方法，其特征在于，所述第一消息用于指示所述切换节点离开，所述第二消息用于指示所述切换节点离开。
  68. 根据权利要求64-67任一项所述的方法，其特征在于，所述确定所述第三节点为所述第一节点的子节点具体包括：
    所述第一节点根据所述第一节点的路由信息确定到达所述切换节点的下一跳为所述第三节点。
  69. 根据权利要求59所述的方法，其特征在于，所述第一节点根据所述第一消息确定接收第二消息的第三节点包括：
    所述第一节点确定所述源节点的信息与所述第一节点的信息不同，则确定所述第三节点为所述第一节点的子节点；和/或，
    所述第一节点确定所述第一节点的路由信息中包括所述切换节点的信息且所述切换节点切换前不是所述第一节点的子节点，则确定所述第三节点为所述第一节点的子节点。
  70. 根据权利要求69所述的方法，其特征在于，所述第一消息用于指示所述切换节点离开所述源节点，所述第二消息用于指示所述切换节点离开所述源节点。
  71. 根据权利要求69或70所述的方法，其特征在于，所述确定所述第三节点为所述第一节点的子节点具体包括：
    所述第一节点根据所述第一节点的路由信息确定到达所述源节点的下一跳为所述第三节点；和/或，
    所述第一节点根据所述第一节点的路由信息确定到达所述切换节点的下一跳为所述第三节点。
  72. 根据权利要求59所述的方法，其特征在于，所述第一节点根据所述第一消息确定接收第二消息的第三节点包括：
    所述第一节点确定所述第一节点的路由信息中不包括所述目标节点的信息，则确定所述第三节点为所述第一节点的父节点。
  73. 根据权利要求72所述的方法，其特征在于，所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开所述源节点和所述切换节点所述接入目标节点；或者，
    所述第一消息用于指示所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点接入所述目标节点。
  74. 根据权利要求59所述的方法，其特征在于，所述第一节点根据所述第一消息确定接收第二消息的第三节点包括：
    所述第一节点确定所述第一节点的路由信息中包括所述目标节点的信息，则确定所述第三节点为所述第一节点的子节点。
  75. 根据权利要求74所述的方法，其特征在于，所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点接入所述目标节点；或者，
    所述第一消息用于指示所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点接入所述目标节点。
  76. 根据权利要求59所述的方法，其特征在于，所述第一节点根据所述第一消息确定接收第二消息的第三节点包括：
    所述第一节点确定所述目标节点的信息与所述第一节点的信息不同，则确定所述第三节点为所述第一节点的子节点。
  77. 根据权利要求76所述的方法，其特征在于，
    所述第一消息用于指示所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点接入所述目标节点。
  78. 根据权利要求74-77任一项所述的方法，其特征在于，所述确定所述第三节点为所述第一节点的子节点包括：
    所述第一节点根据所述第一节点的路由信息确定到达所述目标节点的下一跳为所述第三节点。
  79. 一种设备，所述设备作为第一节点，其特征在于，包括：
    接收单元，用于接收第二节点发送的第一消息，所述第一消息用于指示切换节点离开源节点和/或切换节点接入目标节点；所述源节点是所述切换节点切换前连接的节点，所述目标节点为所述切换节点切换后连接的节点；
    更新单元，用于根据所述第一消息更新所述第一节点的路由信息；
    其中，所述第一节点为以下节点中的任意一个：所述目标节点、所述源节点、核心节点、所述目 标节点与所述核心节点之间的第一中继节点、所述源节点与所述核心节点之间的第二中继节点；所述核心节点是所述目标节点与所述源节点上行方向的第一个共同节点；
    所述第二节点为以下节点中的任意一个：所述切换节点、所述目标节点、所述源节点、所述核心节点、所述第一中继节点、所述第二中继节点。
  80. 根据权利要求79所述的设备，其特征在于，还包括确定单元，
    所述确定单元，用于根据所述第一消息确定接收第二消息的第三节点，向所述第三节点发送所述第二消息，所述第二消息用于指示所述切换节点离开源节点和/或所述切换节点接入目标节点；
    其中，所述第三节点为以下节点中的任意一个：所述源节点、所述核心节点、所述目标节点、所述第一中继节点、所述第二中继节点。
  81. 根据权利要求80所述的设备，其特征在于，所述第二消息还包括所述切换节点的路由信息。
  82. 根据权利要求79-81任一项所述的设备，其特征在于，所述第一消息还包括所述切换节点的路由信息。
  83. 根据权利要求80所述的设备，其特征在于，所述确定单元具体用于，确定所述第一节点的路由信息中不包括所述切换节点的信息和/或所述第一节点的路由信息中不包括所述源节点的信息，则确定所述第三节点为所述第一节点的父节点。
  84. 根据权利要求83所述的设备，其特征在于，所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开所述源节点和所述切换节点所述接入目标节点；或者，
    所述第一消息用于指示所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点接入所述目标节点。
  85. 根据权利要求80所述的设备，其特征在于，所述确定单元具体用于，确定所述第一节点的路由信息包括所述切换节点的信息和/或所述第一节点的路由信息中包括所述源节点的信息，则确定所述第三节点为所述第一节点的子节点。
  86. 根据权利要求85所述的设备，其特征在于，所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开所述源节点；或者，
    所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开；或者，
    所述第一消息用于指示所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开。
  87. 根据权利要求80所述的设备，其特征在于，所述确定单元具体用于，确定所述第一节点的路由信息中包括所述切换节点的信息且所述切换节点切换前不是所述第一节点的子节点，则确定所述第三节点为所述第一节点的子节点。
  88. 根据权利要求87所述的设备，其特征在于，所述第一消息用于指示所述切换节点离开，所述第二消息用于指示所述切换节点离开。
  89. 根据权利要求85-88任一项所述的设备，其特征在于，所述确定单元具体用于，根据所述第一节点的路由信息确定到达所述切换节点的下一跳为所述第三节点。
  90. 根据权利要求85所述的设备，其特征在于，所述确定单元具体用于，确定所述源节点的信息与所述第一节点的信息不同，则确定所述第三节点为所述第一节点的子节点；和/或，确定所述第一节点的路由信息中包括所述切换节点的信息且所述切换节点切换前不是所述第一节点的子节点，则确定所述第三节点为所述第一节点的子节点。
  91. 根据权利要求90所述的设备，其特征在于，所述第一消息用于指示所述切换节点离开所述源节点，所述第二消息用于指示所述切换节点离开所述源节点。
  92. 根据权利要求90或91所述的设备，其特征在于，所述确定单元具体用于，根据所述第一节点的路由信息确定到达所述源节点的下一跳为所述第三节点；和/或，根据所述第一节点的路由信息确定到达所述切换节点的下一跳为所述第三节点。
  93. 根据权利要求80所述的设备，其特征在于，所述确定单元具体用于，确定所述第一节点的路由信息中不包括所述目标节点的信息，则确定所述第三节点为所述第一节点的父节点。
  94. 根据权利要求93所述的设备，其特征在于，所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点离开所述源节点和所述切换节点所述接入目标节点；或者，
    所述第一消息用于指示所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点接入所述目标节点。
  95. 根据权利要求80所述的设备，其特征在于，所述确定单元具体用于，确定所述第一节点的路由信息中包括所述目标节点的信息，则确定所述第三节点为所述第一节点的子节点。
  96. 根据权利要求95所述的设备，其特征在于，所述第一消息用于指示所述切换节点离开所述源节点和所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点接入所述目标节点；或者，
    所述第一消息用于指示所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点接入所述目标节点。
  97. 根据权利要求96所述的设备，其特征在于，所述确定单元用于，确定所述目标节点的信息与所述第一节点的信息不同，则确定所述第三节点为所述第一节点的子节点。
  98. 根据权利要求97所述的设备，其特征在于，
    所述第一消息用于指示所述切换节点接入所述目标节点，所述第二消息用于指示所述切换节点接入所述目标节点。
  99. 根据权利要求85-98任一项所述的设备，其特征在于，所述确定单元具体用于，根据所述第一节点的路由信息确定到达所述目标节点的下一跳为所述第三节点。
  100. 一种设备，其特征在于，包括：存储器、处理器和收发器，所述存储器用于存储程序或指令，所述收发器用于收发信息，所述处理器执行所述程序或指令，并与所述收发器配合，以使所述设备执行如权利要求58至78中任一项所述的方法。
  101. 一种设备，其特征在于，包括：存储器、处理器和收发器，所述存储器用于存储程序或指令，所述收发器用于收发信息，所述处理器执行所述程序或指令，并与所述收发器配合，以使所述设备执行如权利要求58至78中任一项所述的方法。
  102. 一种系统，包括：第一节点和第二节点，
    所述第一节点为以下节点中的任意一个：目标节点、源节点、核心节点、所述目标节点与所述核心节点之间的第一中继节点、所述源节点与所述核心节点之间的第二中继节点，其中，所述核心节点是所述目标节点与所述源节点上行方向的第一个共同节点，
    所述第二节点为以下节点中的任意一个：所述切换节点、所述目标节点、所述源节点、所述核心节点、所述第一中继节点、所述第二中继节点；
    所述第二节点用于发送第一消息给所述第一节点，所述第一消息用于指示所述切换节点离开所述源节点和/或所述切换节点接入所述目标节点；所述源节点是所述切换节点切换前连接的节点，所述目标节点为所述切换节点切换后连接的节点；
    所述第一节点用于接收第二节点发送的第一消息，根据所述第一消息更新所述第一节点的路由信息。
PCT/CN2019/074864 2018-02-13 2019-02-12 一种路由更新方法、调度请求取消方法及设备 Ceased WO2019158053A1 (zh)

Priority Applications (12)

Application Number Priority Date Filing Date Title
CN201980003020.5A CN110754132B (zh) 2018-02-13 2019-02-12 一种路由更新方法、调度请求取消方法及设备
AU2019220020A AU2019220020B2 (en) 2018-02-13 2019-02-12 Scheduling request cancellation method, buffer status report cancellation method and device
KR1020207023610A KR102455331B1 (ko) 2018-02-13 2019-02-12 라우트 갱신 방법, 스케줄링 요청 취소 방법 및 장치
ES19754007T ES2913702T3 (es) 2018-02-13 2019-02-12 Procedimiento y dispositivo de actualización de encaminamiento, y procedimiento y dispositivo de cancelación de solicitudes de planificación
CA3088457A CA3088457C (en) 2018-02-13 2019-02-12 Scheduling request cancellation method, buffer status report cancellation method and device
EP22156753.0A EP4093133A1 (en) 2018-02-13 2019-02-12 Buffer status report cancellation method, and device
RU2020129965A RU2754427C1 (ru) 2018-02-13 2019-02-12 Способ обновления маршрута, устройство и способ отмены запроса планирования
EP19754007.3A EP3629658B1 (en) 2018-02-13 2019-02-12 Routing updating method and device, and scheduling request canceling method and device
JP2020565010A JP7139457B2 (ja) 2018-02-13 2019-02-12 ルート更新方法、スケジューリング要求キャンセル方法及びデバイス
BR112020015724-4A BR112020015724B1 (pt) 2018-02-13 2019-02-12 Método de cancelamento de solicitação de agendamento, dispositivo de comunicação, e mídia de armazenamento legível por computador
US16/700,625 US11044740B2 (en) 2018-02-13 2019-12-02 Route update method, scheduling request cancellation method, and device
US17/326,025 US11671959B2 (en) 2018-02-13 2021-05-20 Route update method, scheduling request cancellation method, and device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810150653.6 2018-02-13
CN201810150653.6A CN110149674A (zh) 2018-02-13 2018-02-13 一种路由更新方法及设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/700,625 Continuation US11044740B2 (en) 2018-02-13 2019-12-02 Route update method, scheduling request cancellation method, and device

Publications (1)

Publication Number Publication Date
WO2019158053A1 true WO2019158053A1 (zh) 2019-08-22

Family

ID=67588999

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/074864 Ceased WO2019158053A1 (zh) 2018-02-13 2019-02-12 一种路由更新方法、调度请求取消方法及设备

Country Status (10)

Country Link
US (2) US11044740B2 (zh)
EP (2) EP4093133A1 (zh)
JP (1) JP7139457B2 (zh)
KR (1) KR102455331B1 (zh)
CN (4) CN110149674A (zh)
AU (1) AU2019220020B2 (zh)
CA (1) CA3088457C (zh)
ES (1) ES2913702T3 (zh)
RU (1) RU2754427C1 (zh)
WO (1) WO2019158053A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111093211A (zh) * 2019-11-07 2020-05-01 中兴通讯股份有限公司 一种控制信令传输方法、装置和存储介质
WO2022067592A1 (zh) * 2020-09-29 2022-04-07 华为技术有限公司 一种数据无损传输的通信方法、装置及系统
CN115104342A (zh) * 2020-02-13 2022-09-23 高通股份有限公司 缓冲器状态报告的连续性

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110149674A (zh) * 2018-02-13 2019-08-20 华为技术有限公司 一种路由更新方法及设备
US11212695B2 (en) * 2018-02-15 2021-12-28 Qualcomm Incorporated Configuration, activation and deactivation of packet duplication
KR102114992B1 (ko) * 2018-04-25 2020-05-25 (주)휴맥스 무선 통신 장비 및 무선 통신 장비의 메쉬 네트워크 구성 방법
US11109399B2 (en) * 2018-06-29 2021-08-31 Asustek Computer Inc. Method and apparatus for multi-hop integrated access and backhaul systems
US20200045610A1 (en) * 2018-07-31 2020-02-06 Asustek Computer Inc. Method and apparatus of updating routing table of an iab (integrated access backhaul) node in a wireless communication system
CN110830182B (zh) * 2018-08-09 2023-08-01 北京三星通信技术研究有限公司 数据重传的方法和装置
WO2021051313A1 (zh) * 2019-09-18 2021-03-25 华为技术有限公司 切换方法及装置
CN113015211B (zh) * 2019-12-20 2022-08-19 大唐移动通信设备有限公司 一种数据传输调度方法及终端
US12507132B2 (en) 2020-04-03 2025-12-23 Lg Electronics Inc. Method and apparatus for mobility of wireless base station in wireless communication system
CN113766582B (zh) * 2020-06-03 2023-03-14 维沃移动通信有限公司 网络切换方法、装置、通信设备及系统
CN114339942B (zh) * 2020-09-30 2024-04-23 华为技术有限公司 路由信息更新方法、通信装置及存储介质
CN113114703B (zh) * 2021-05-14 2022-02-22 恒隆通信技术有限公司 一种组网通信的数据加密方法及系统
WO2023056637A1 (zh) * 2021-10-09 2023-04-13 北京小米移动软件有限公司 多连接下的通信方法和通信装置
WO2024010103A1 (ko) * 2022-07-04 2024-01-11 엘지전자 주식회사 무선 통신 시스템에서 자원 요청을 수행하는 방법 및 장치
TWI855933B (zh) * 2023-11-30 2024-09-11 四零四科技股份有限公司 多跳式無線網路系統、維護樹狀網路拓撲的方法及第一成員節點

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101778418A (zh) * 2009-01-13 2010-07-14 中兴通讯股份有限公司 无线网络中触发或上报调度请求的方法和设备
CN102088752A (zh) * 2011-03-10 2011-06-08 张毅昆 用于无线多跳网络的锁定路由方法
CN102726113A (zh) * 2010-01-26 2012-10-10 夏普株式会社 处理方法以及移动站装置
US20130070700A1 (en) * 2011-09-16 2013-03-21 Htc Corporation Method of Handling Random Access Procedure on Primary Cell When Random Access Procedure on Secondary Cell is Ongoing or about to Start
CN105722172A (zh) * 2016-04-12 2016-06-29 江苏中科羿链通信技术有限公司 无线链状网下的快速路由恢复方法
CN107079469A (zh) * 2014-11-05 2017-08-18 Lg 电子株式会社 在d2d通信系统中取消通过侧链路缓冲器状态报告触发的调度请求的方法及其设备

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101772049A (zh) * 2009-01-05 2010-07-07 中兴通讯股份有限公司 周期性缓冲区状态报告定时器的处理方法及终端
CN104320857B (zh) * 2009-05-05 2018-03-30 瑞典爱立信有限公司 处理调度请求触发
KR101164117B1 (ko) * 2009-09-04 2012-07-12 엘지전자 주식회사 무선 통신 시스템상에서 물리 하향 채널의 모니터링 동작을 효율적으로 제어하는 방법
KR101623977B1 (ko) * 2009-10-09 2016-05-24 삼성전자주식회사 이동통신 시스템에서 스케줄링 요청 신호를 전송하는 방법 및 장치
JP2011155336A (ja) * 2010-01-26 2011-08-11 Sharp Corp 通信システム及び移動局装置及び基地局装置及び処理方法
US20150003371A1 (en) * 2012-06-26 2015-01-01 Lg Electronics Inc. Method and apparatus for cancelling buffer status report in wireless communication system
EP2946608B1 (en) * 2013-01-17 2017-11-29 Sun Patent Trust Dynamic tdd uplink/downlink configuration using dci
WO2014183664A1 (en) * 2013-05-17 2014-11-20 Mediatek Singapore Pte. Ltd. Enhanced mechanism of uplink time alignment maintenance for inter-enb carrier aggregation
WO2014186956A1 (zh) * 2013-05-22 2014-11-27 华为技术有限公司 一种优先级调度方法、用户设备及基站
WO2015143170A1 (en) * 2014-03-19 2015-09-24 Interdigital Patent Holdings, Inc. Device-to-device synchronization
US10568114B2 (en) * 2014-09-17 2020-02-18 Innovative Sonic Corporation Method and apparatus for requesting resources in a wireless communication system
WO2017007171A1 (en) * 2015-07-06 2017-01-12 Lg Electronics Inc. Method for triggering a buffer status reporting in dual connectivity and a device therefor
GB2542172A (en) 2015-09-10 2017-03-15 Nec Corp Communication system
US20170093541A1 (en) * 2015-09-25 2017-03-30 Asustek Computer Inc. Method and apparatus for reducing signaling overhead in a wireless communication system
US11246147B2 (en) * 2017-06-15 2022-02-08 Convida Wireless, Llc Scheduling requests, status reports, and logical channel prioritization
US10986667B2 (en) * 2017-12-20 2021-04-20 Lenovo (Singapore) Pte. Ltd. Random-access procedure for scheduling request
CN110149674A (zh) * 2018-02-13 2019-08-20 华为技术有限公司 一种路由更新方法及设备

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101778418A (zh) * 2009-01-13 2010-07-14 中兴通讯股份有限公司 无线网络中触发或上报调度请求的方法和设备
CN102726113A (zh) * 2010-01-26 2012-10-10 夏普株式会社 处理方法以及移动站装置
CN102088752A (zh) * 2011-03-10 2011-06-08 张毅昆 用于无线多跳网络的锁定路由方法
US20130070700A1 (en) * 2011-09-16 2013-03-21 Htc Corporation Method of Handling Random Access Procedure on Primary Cell When Random Access Procedure on Secondary Cell is Ongoing or about to Start
CN107079469A (zh) * 2014-11-05 2017-08-18 Lg 电子株式会社 在d2d通信系统中取消通过侧链路缓冲器状态报告触发的调度请求的方法及其设备
CN105722172A (zh) * 2016-04-12 2016-06-29 江苏中科羿链通信技术有限公司 无线链状网下的快速路由恢复方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3629658A4 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111093211A (zh) * 2019-11-07 2020-05-01 中兴通讯股份有限公司 一种控制信令传输方法、装置和存储介质
CN115104342A (zh) * 2020-02-13 2022-09-23 高通股份有限公司 缓冲器状态报告的连续性
CN115104342B (zh) * 2020-02-13 2024-04-05 高通股份有限公司 缓冲器状态报告的连续性
US12245071B2 (en) 2020-02-13 2025-03-04 Qualcomm Incorporated Continuity for buffer status reports
WO2022067592A1 (zh) * 2020-09-29 2022-04-07 华为技术有限公司 一种数据无损传输的通信方法、装置及系统
US12615573B2 (en) 2020-09-29 2026-04-28 Huawei Technologies Co., Ltd. Lossless data transmission communication method, apparatus, and system

Also Published As

Publication number Publication date
RU2754427C1 (ru) 2021-09-02
AU2019220020A1 (en) 2020-08-13
US20210377973A1 (en) 2021-12-02
CN110754132A (zh) 2020-02-04
KR20200108884A (ko) 2020-09-21
CN110149674A (zh) 2019-08-20
US20200107342A1 (en) 2020-04-02
EP3629658B1 (en) 2022-04-13
CN110754132B (zh) 2022-01-28
EP3629658A4 (en) 2020-08-05
US11044740B2 (en) 2021-06-22
CN121367972A (zh) 2026-01-20
CN110461021B (zh) 2020-07-14
JP2021513822A (ja) 2021-05-27
AU2019220020B2 (en) 2021-09-09
CA3088457A1 (en) 2019-08-22
JP7139457B2 (ja) 2022-09-20
ES2913702T3 (es) 2022-06-03
CN110461021A (zh) 2019-11-15
KR102455331B1 (ko) 2022-10-14
US11671959B2 (en) 2023-06-06
CA3088457C (en) 2024-05-14
EP4093133A1 (en) 2022-11-23
EP3629658A1 (en) 2020-04-01
BR112020015724A2 (pt) 2020-12-08

Similar Documents

Publication Publication Date Title
CN110461021B (zh) 一种调度请求取消方法及设备
JP7541162B2 (ja) ルーティング方法及び装置
US12294895B2 (en) IAB node switching method and apparatus
US20210112471A1 (en) Method for establishing a fronthaul interface, method for performing access for a ue, method and apparatus for performing a handover for a ue, data forwarding method, user equipment and base station
JP7254831B2 (ja) 中継リソースの設定方法及び装置
US11445430B2 (en) Data forwarding method and apparatus
KR20240089760A (ko) 원격 단말 정보의 송신 방법, 수신 방법 및 기기
EP4013146B1 (en) Method and apparatus for determining associations among logical channel groups
WO2022082679A1 (zh) 一种通信方法及相关设备
CN110463296A (zh) 用于在跨越多种无线电接入技术的区域中寻呼用户设备的方法和装置
JP7300510B2 (ja) 無線基地局
WO2021026936A1 (zh) 一种处理回传链路发生链路失败的方法及装置
WO2025152174A1 (zh) 无线通信方法及装置
JP7288061B2 (ja) 端末
WO2025200780A1 (zh) 通信方法、装置及系统
WO2023205941A1 (zh) 信息的发送、接收、配置方法以及装置和通信系统
WO2025044334A1 (zh) 一种通信方法及装置
WO2024140723A1 (zh) 一种通信方法及装置
CN121175983A (zh) 无线通信的拥塞信息暴露机制之间的互操作
BR112020015724B1 (pt) Método de cancelamento de solicitação de agendamento, dispositivo de comunicação, e mídia de armazenamento legível por computador
WO2017162191A1 (zh) 一种无线通信方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19754007

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019754007

Country of ref document: EP

Effective date: 20191223

ENP Entry into the national phase

Ref document number: 3088457

Country of ref document: CA

ENP Entry into the national phase

Ref document number: 2020565010

Country of ref document: JP

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2019220020

Country of ref document: AU

Date of ref document: 20190212

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 20207023610

Country of ref document: KR

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112020015724

Country of ref document: BR

ENP Entry into the national phase

Ref document number: 112020015724

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20200731