Mesh Network Path Selection Using Dynamic Selective Scores
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional mesh network systems face inefficiencies due to exponential airtime penalties, high path adaptation latency, and insufficient consideration of network and device metrics for optimal path selection, particularly in complex wireless networks with multiple hops.
Innovation Solution
A method and system for selecting a communication network path by transmitting beacons with informative parameters, calculating dynamic selective scores based on network, device, and application metrics, and identifying the target path with the highest score, which reduces airtime penalties and latency while considering multi-backhaul aspects.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional mesh network path selection is used, then network connectivity is established, but airtime penalty increases exponentially with the number of nodes
Solution Approach 1:
The system performs preliminary path scoring and selection by calculating selective scores for multiple candidate paths before actual data transmission. Nodes pre-evaluate paths using beacons containing informative parameters and device metrics, identifying optimal paths in advance to avoid exponential airtime penalties during runtime path selection
Solution Approach 2:
The path selection mechanism dynamically adapts to changing network conditions by continuously updating selective scores based on current device metrics, network metrics, and application metrics. Nodes can switch between multiple candidate paths depending on real-time conditions, making the system flexible and responsive rather than static
2Reliability
If conventional path selection algorithms are used, then paths are established, but path adaptation latency is high
Solution Approach 1:
Multiple candidate paths are pre-calculated and scored using selective score mechanisms before they are needed for data transmission. This preliminary path preparation eliminates the need for time-consuming path discovery when adaptation is required, as nodes already have evaluated alternative paths ready for immediate switching
Solution Approach 2:
The system continuously monitors network conditions, device metrics, and application requirements, using this feedback to dynamically adjust selective scores and path selections. This feedback loop enables rapid path adaptation by comparing current conditions against pre-calculated path scores and selecting the optimal path without extensive re-evaluation
3Ease of operation
If simple path selection based on single metric is used, then selection process is simple, but network and device metrics are insufficiently considered
Solution Approach 1:
The selective score mechanism combines multiple different metrics (device metrics, network metrics, application metrics) into a single composite scoring system for each candidate path. This composite approach maintains the simplicity of single-score comparison while incorporating comprehensive multi-dimensional evaluation of path quality
Solution Approach 2:
The system dynamically adjusts the weights and parameters of different metrics based on current network conditions, device states, and application requirements. This allows the path selection to consider multiple factors with varying importance depending on the situation, achieving both simplicity in the selection process and precision in path evaluation
Data Source
AI summary
Disclosed is a method for selecting a path in a communication network. The method comprises transmitting, through a device connected to a target node, a beacon, to one or more nodes in the communication network. The beacon comprises a set of informative parameters. The method comprises calculating, by each node, a selective score towards one more paths to be selected for reaching the target node in the communication network. The method further comprises identifying, by each node, a target path from the one or more path. The target path is a path having a highest value of the selective score as compared to selective score for other paths in the one or more paths. The method further comprises selecting, by each node, the target path from the one or more paths for reaching the target node.