Link Metric Cross-Correlation Vector for Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing solutions in communication networks do not effectively consider the interacting effects between links, leading to suboptimal route selection, especially in multi-radio multi-hop networks where links using different radio access technologies or channels interfere with each other, resulting in inefficient resource utilization.
Innovation Solution
The introduction of a link metric cross-correlation vector to account for the interaction between links, allowing for the calculation of updated link metrics that reflect the coupling between active links, enabling the selection of routes that minimize the impact of interference and resource sharing constraints, thereby improving routing decisions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If route selection is based on individual link metrics independently, then the routing mechanism is simple and easy to implement, but the route selection becomes suboptimal when links share common resources or interfere with each other
Solution Approach 1:
The patent combines individual link metrics with cross-correlation metric values to create an enhanced route selection mechanism. By merging the independent link metric assessment with the interactive cross-correlation component, the system achieves both computational feasibility and improved routing optimality in multi-radio multi-hop networks.
Solution Approach 2:
The patent introduces cross-correlation metric values as an additional parameter to the traditional link metric framework. This parameter change enables the system to capture interactions between links sharing common resources or channels, transforming the route selection process from purely independent to interactive metric-based decision making.
2Productivity
If cross-correlation link metric values are considered in route selection, then network resource efficiency improves, but the computational complexity and routing decision process increases
Solution Approach 1:
The patent performs preliminary calculations of cross-correlation metric values during the route setup phase, before actual data transmission begins. By pre-computing these interaction-based metrics, the system reduces the computational burden during runtime routing decisions while still capturing the essential interactions between links.
Solution Approach 2:
The patent segments the routing decision process into distinct components: independent link metric evaluation and cross-correlation metric evaluation. This segmentation allows the system to handle complexity by processing different aspects of link quality separately and then combining them, making the overall routing decision more manageable.
3Reliability
If links sharing common resources or channels are considered in route selection, then service quality improves, but the routing mechanism becomes more complex
Solution Approach 1:
The patent introduces cross-correlation metric values as an intermediary component that mediates between the link selection process and the resource sharing considerations. This intermediary captures the interaction effects between links in a standardized form, enabling service quality optimization without directly implementing complex resource management logic in the routing mechanism.
Data Source
AI summary
This invention extends routing mechanisms that use link metrics for route selection so that: A link metric cross correlation vector is determined for all links, where each element in the vector corresponds to some other link, and reflects the change in the link metric value if a data flow would already use this other link. The invention further describes a specific embodiment where all cross-correlating links are adjacent to each other, i.e., they terminate or originate in a common node. A mechanism is described to create an extended routing graph. This extended graph permits the use of standard polynomial time algorithms that simultaneously construct the optimal route and find the optimal route metric (such as shortest-path algorithms) also for the adjacent link cross-correlating case.