Route Update Method for Tree Network Topology Signaling Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In tree network topologies, network topology changes due to relay node switching lead to unnecessary signaling overheads and prolonged data interruption times, as all nodes in the path to the donor base station update routing information even when it is not necessary.
Innovation Solution
A route update method where only the core node and downstream nodes exchange messages to indicate node switching and update routes, reducing signaling overheads and accelerating network recovery by minimizing the number of nodes that update routing information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all nodes in the path to the donor base station update routing information when a relay node switches, then routing information is kept synchronized, but signaling overheads increase and data interruption time is prolonged
Solution Approach 1:
The patent applies local quality by differentiating which nodes need to update routing information based on their position in the network topology. Instead of uniformly updating all nodes, only the core node and downstream nodes (nodes that actually need the updated routing information to reach the switching relay node) perform updates. This selective approach reduces signaling overhead and data interruption time while maintaining routing synchronization where actually needed.
2Reliability
If all nodes in the path to the donor base station update routing information when a relay node switches, then routing information is kept synchronized, but signaling overheads increase
Solution Approach 1:
The patent implements local quality by making the routing update process selective rather than universal. The core node determines which downstream nodes actually require routing information updates based on their position in the topology relative to the switching relay node. This prevents unnecessary signaling messages from being sent to nodes that would not use the updated routing information, thereby reducing signaling overheads and energy consumption.
3Loss of information
If route updates are propagated to all nodes in the path, then complete routing information is maintained, but the number of nodes updating routes increases unnecessarily
Solution Approach 1:
The patent applies local quality by identifying and updating only those nodes that have actual need for the routing information changes. The core node performs selective propagation of route update messages to downstream nodes based on their topological relationship with the switching relay node. This reduces the number of nodes performing updates while ensuring that all nodes that require the information receive it, maintaining routing information completeness where necessary.
Data Source
AI summary
Embodiments of this application relate to the communications field, and provide a route update method, the method, comprising: sending a medium access control protocol data unit (MAC PDU), wherein the MAC PDU comprises a first buffer status report (BSR); and canceling, in response to the sending of the MAC PDU, a scheduling request triggered prior to the MAC PDU assembly, wherein the first BSR comprises a buffer status up to the last event that triggers a BSR prior to the MAC PDU assembly.


