DAG Network Node Path Selection Using Link Metrics
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Ad hoc mobile networks using directed acyclic graphs face challenges in optimizing the utilization of all available paths to a DAG destination without route recalculation and maintaining state information for paths, leading to network instability and inefficient traffic distribution.
Innovation Solution
Each network node receives and updates path performance metrics from destination-oriented links, allowing nodes to assess and select the best paths for data forwarding based on aggregate link metrics, enabling dynamic adaptation to network changes without modifying the DAG structure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If route recalculation is performed to optimize path utilization in ad hoc mobile networks, then traffic distribution efficiency is improved, but network stability deteriorates due to frequent topology changes
Solution Approach 1:
The patent pre-establishes a Directed Acyclic Graph (DAG) structure that defines multiple valid paths to the destination before traffic optimization is needed. This preliminary topological framework allows nodes to select among pre-validat ed paths without triggering route recalculation, thus improving traffic distribution efficiency while maintaining network stability.
Solution Approach 2:
The patent introduces dynamic link metric collection and propagation mechanisms that allow nodes to adaptively select paths based on real-time network conditions without changing the underlying DAG structure. This dynamic path selection within a static topological framework resolves the contradiction by enabling efficient traffic distribution while preserving network stability.
2Productivity
If multiple paths are utilized for traffic forwarding, then network throughput is improved, but device complexity increases due to path selection and metric management
Solution Approach 1:
The patent implements a feedback mechanism where link metrics are collected from the destination and propagated back through the DAG to source nodes. This feedback provides nodes with the information needed for path selection without requiring complex local computations, thus enabling multiple path utilization while managing device complexity through centralized metric management.
Solution Approach 2:
The patent introduces link metrics as an intermediary that mediates between the complex DAG structure and simple path selection decisions. Nodes use these metrics as a straightforward criterion for path selection, avoiding the need to directly process complex topological information, thereby improving throughput while keeping device complexity manageable.
3Measurement precision
If state information is maintained for path optimization, then traffic forwarding accuracy is improved, but loss of energy increases due to memory and processing requirements
Solution Approach 1:
The patent extracts only the essential link metric information needed for path selection from the complete path state, propagating only these condensed metrics through the network. This extraction approach maintains sufficient forwarding accuracy while minimizing the energy required for state information storage and processing at each node.
Data Source
AI summary
Each network node having at least one destination-oriented link toward a directed acyclic graph (DAG) destination can receive a corresponding set of path performance metrics via the destination-oriented link. The set of path performance metrics, initiated by the DAG destination outputting initial link metrics on each of its source-connecting links, identifies aggregate link metrics for a corresponding path to the DAG destination via the corresponding destination-oriented link. The network node outputs a corresponding updated set of path performance metrics on each of its source-connecting links based on the received set of path performance metrics and the corresponding link metric for the corresponding source-connecting link. Hence, each network node in the DAG can assess the performance of each connected path to the DAG destination, and forward a data packet via a selected destination-oriented link based on the corresponding path performance metrics and forwarding policies for the forwarded data packet.