Power Line Communication Route Cost Granularity Refinement
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The G3-PLC standard's routing method for mesh networks using powerline communications has a coarse granularity of route costs, which fails to discriminate between routes with different characteristics, leading to suboptimal route selection and performance issues.
Innovation Solution
A method to refine the granularity of route costs by identifying and utilizing only discriminant values of metrics such as quality and filling rate, using sub-part ranges to vary unit costs, ensuring that only significant metric variations impact route selection, thereby improving routing performance without increasing computational complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If the G3-PLC standard's routing method uses a cost function with limited granularity, then the computational complexity is reduced and the routing calculation is simpler, but the route cost cannot discriminate between routes with different characteristics, leading to suboptimal route selection
Solution Approach 1:
The patent segments the metric value range into multiple sub-ranges, where each sub-range corresponds to a specific unit cost value. This segmentation allows the system to distinguish between different metric values that fall within the same sub-range by assigning them different weights, thereby increasing route cost granularity without requiring a proportional increase in the number of discrete cost levels. The segmentation approach resolves the contradiction by creating intermediate differentiation layers within broad metric ranges.
Solution Approach 2:
The patent applies local quality by assigning different weights to metric values within the same sub-range based on their specific positions. Instead of treating all values within a sub-range uniformly, the system applies localized weight adjustments that reflect the relative quality differences between specific metric values. This allows for fine-grained discrimination of route costs while maintaining a manageable number of sub-ranges, thus improving measurement precision without proportionally increasing computational complexity.
2Measurement precision
If the routing method uses all metric values to calculate unit costs, then the route cost discrimination capability is improved, but the computational complexity increases
Solution Approach 1:
The patent divides the continuous metric value range into a finite number of sub-ranges, reducing the infinite or very large number of possible metric values into a manageable set of discrete segments. This segmentation dramatically reduces the computational complexity by limiting the number of distinct unit cost calculations required, while still preserving sufficient discrimination capability through the weighted differentiation within each segment. The segmentation approach provides a practical balance between precision and complexity.
Solution Approach 2:
The patent changes the parameter representation by introducing weights as an additional dimension for differentiation. Instead of directly using the full range of metric values as unit costs, the system transforms metric values into weighted values within sub-ranges. This parameter transformation maintains the discrimination capability of the original metric values while compressing them into a smaller set of manageable unit cost levels, thereby reducing computational complexity without sacrificing route cost discrimination capability.
3Productivity
If the routing method uses coarse granularity of route costs, then the computational complexity is reduced, but the performance of the routing method deteriorates due to inability to discriminate between routes
Solution Approach 1:
The patent segments the metric value range into multiple sub-ranges with weighted differentiation, creating a hierarchical structure that provides both coarse and fine-grained discrimination capabilities. The sub-range level provides coarse granularity for overall route comparison, while the weight differentiation within sub-ranges provides fine-grained discrimination for closely related routes. This hierarchical segmentation improves routing performance by enabling multi-level route discrimination without requiring uniformly fine granularity across all metric values, thus avoiding excessive computational complexity.
Solution Approach 2:
The patent applies local quality by assigning different weights to specific metric values within sub-ranges based on their local characteristics. This allows the system to provide enhanced discrimination capability only where needed (locally within sub-ranges) rather than uniformly across all metric values. The local quality approach improves routing performance for routes with similar characteristics while maintaining computational efficiency for routes with vastly different characteristics, thus optimizing the performance-complexity trade-off.
Data Source
Figure 1~2
Figure 3
Figure 4~5
AI summary
Method for determining the cost of a communication link connecting two nodes of a power line communication network, the said link cost being calculated from a unit cost dependent on a metric within a predefined range of values.The method, when implemented by one of said two network nodes, comprises: obtaining (3311) a sub-part of said predefined range of values such that, when two different communication routes are made up of two different links each associated with a value of said metric included in the sub-part, the values of said metric associated with said two links are considered non-discriminating for selecting one of the two communication routes; calculating (3312) said unit cost using a function relating said unit cost to the metric such that only values of said metric not belonging to said sub-part produce variations in said unit cost, and determining (3313) the cost of the link as a function of said unit cost.