Hierarchical Route Optimization for 5G Mesh Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
5G multi-hop relay mesh networks face challenges in efficiently optimizing routes due to the need for fast route switching and scalability, especially in millimeter wave networks where channel impairments like blocking occur, and existing technologies struggle to manage route updates and traffic efficiently.
Innovation Solution
A method for route optimization in hierarchical mesh networks that involves determining the topology of wireless network devices, calculating utility metrics for hops and routes, and using a distributed algorithm to select the best routes, allowing for efficient route updates and scalability through a select and pass concept, where each node sends route metrics to lower hop order nodes, enabling fast route switching and mitigating blocking.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a routing technique is used in mesh networks to propagate messages along paths, then the network reliability is improved through multiple paths, but the route optimization efficiency deteriorates due to channel impairments and blocking in millimeter wave networks
Solution Approach 1:
The patent segments the route optimization process into multiple phases: topology discovery, utility metric calculation, and route selection. It divides the network into hierarchical levels (first order nodes, second order nodes, third order nodes) to manage complexity. This segmentation allows the system to handle channel impairments and blocking by processing route optimization in manageable segments rather than attempting to optimize the entire network at once.
Solution Approach 2:
The patent performs preliminary actions by pre-calculating utility metrics for potential routes and maintaining updated topology information before actual data transmission occurs. The system pre-determines multiple candidate routes and their associated metrics, enabling faster route switching when blocking or channel impairments occur, thus improving route optimization efficiency while maintaining network reliability.
2Reliability
If continuous connections are allowed to ensure path availability, then the self-healing capability is improved, but the device complexity increases due to continuous route updates and reconfiguration
Solution Approach 1:
The patent implements feedback mechanisms where nodes continuously monitor the quality of their connections and routes. Utility metrics are updated based on observed channel conditions, and this feedback is propagated through the network. When blocking or degradation is detected, the feedback loop triggers route reoptimization only when necessary, reducing unnecessary complexity while maintaining self-healing capability.
Solution Approach 2:
The patent introduces dynamic adaptability by allowing the network to switch between different route selection strategies based on current conditions. The system dynamically adjusts its behavior between using pre-established routes and performing new route optimization, balancing self-healing requirements with complexity reduction. The hierarchical structure enables dynamic responses at different levels of the network.
3Speed
If fast route switching is implemented to mitigate blocking, then the network responsiveness is improved, but the scalability deteriorates due to the difficulty of managing route updates across the network
Solution Approach 1:
The patent segments the network into hierarchical levels (first order nodes closest to core network, second order nodes, third order nodes at edge) and processes route optimization from highest to lowest order. This segmentation enables fast local route switching at lower levels without requiring network-wide reoptimization, thus improving responsiveness while maintaining scalability through distributed decision-making.
Solution Approach 2:
The patent introduces a hierarchical dimension to route optimization, organizing nodes by their order relative to the core network rather than treating all nodes equally. This dimensional organization allows route updates to propagate efficiently through the hierarchy, enabling fast switching at the local level while maintaining overall network scalability through the structured approach.
4Adaptability or versatility
If distributed algorithms are used for route selection, then the scalability is improved, but the measurement precision of route metrics deteriorates due to the complexity of calculating utility metrics across multiple hops
Solution Approach 1:
The patent segments the utility metric calculation into hop-by-hop components, where each node calculates and contributes its own segment of the metric based on local measurements. This segmentation maintains scalability through distributed computation while improving measurement precision by allowing accurate local measurements to be aggregated into comprehensive route metrics without requiring centralized processing.
Data Source
AI summary
A more efficient mesh network can be achieved by optimizing relay hops between node devices. A number of routes can be determined between node devices of various orders. Furthermore, a number of more efficient routes can be determined between the node devices of various orders. Based on the more efficient routes, relay paths between the node devices can either be maintained or terminated. Accordingly, route metrics can be updated dynamically to reevaluate which routes are more efficient than other routes, thereby optimizing system performance.