Directed Acyclic Graph Routing for Mobile Network Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing protocols in ad hoc mobile networks, such as MANETs, face challenges in efficiently managing topology changes and optimizing route calculations due to unstable wireless links and the need for frequent updates, leading to increased overhead and performance issues.
Innovation Solution
A method where each network node calculates and distributes a directed acyclic graph (DAG) by orienting links towards itself, allowing for optimized reachability and minimal complexity, enabling unequal cost load balancing and efficient response to topology changes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If existing routing protocols use proactive approaches to maintain shortest path routes in MANETs, then route optimization is improved, but control message overhead increases substantially
Solution Approach 1:
The patent implements dynamic route maintenance by allowing routers to adaptively update routes based on topology changes without requiring periodic full routing table updates. The system transitions from static periodic updates to dynamic event-driven updates, where routes are maintained only when necessary, reducing control message overhead while preserving route optimization.
Solution Approach 2:
The patent applies the principle of discarding obsolete routing information and recovering only when necessary. Routers discard periodic routing updates when the topology remains stable and recover by generating updates only when topology changes occur, thereby reducing overall control message overhead while maintaining route optimization when needed.
2Adaptability or versatility
If routing protocols frequently update route information to adapt to topology changes, then adaptability is improved, but processing overhead and convergence time increase
Solution Approach 1:
The patent implements preliminary anti-action by pre-calculating and storing alternative routes alongside primary shortest path routes. When topology changes occur, the system can immediately switch to pre-computed alternative routes, preventing the need for time-consuming recalculations and reducing convergence time while maintaining adaptability to topology changes.
Solution Approach 2:
The patent applies preliminary action by proactively computing and maintaining multiple potential routes before topology changes occur. This allows the system to quickly respond to topology changes by selecting from pre-computed alternatives, reducing convergence time while preserving adaptability.
3Productivity
If equal cost multi-path routing is used to balance load, then network utilization is improved, but route calculation complexity increases
Solution Approach 1:
The patent applies segmentation by dividing the routing problem into hierarchical levels: primary shortest path routes for normal operation and alternative routes for backup or load balancing. This segmentation allows the system to maintain simple primary routes for efficient forwarding while computing alternative routes only when needed for load balancing or failure recovery, reducing overall calculation complexity while improving network utilization.
Solution Approach 2:
The patent implements partial action by computing and maintaining only the necessary portion of alternative routes rather than all possible paths. The system calculates alternative routes selectively based on specific criteria such as cost equivalence and disjointness, reducing route calculation complexity while still achieving load balancing across multiple paths.
Data Source
AI summary
Each network node in a network is configured for calculating a directed acyclic graph that provides at least one path from all the other network nodes toward the one network node. The network node performs a modified shortest path first calculation by identifying next-hop nodes adjacent to the network node, and orienting the link of each next-hop node toward itself (i.e., the origin). The network node also identifies secondary adjacent nodes, adjacent to each of the next hop nodes, and extends paths from next-hop nodes to the associated secondary adjacent nodes while orienting each of the links of the path between adjacent nodes and next-hop nodes toward the next hop nodes. The paths of the nodes form a directed acyclic graph from any other network node toward the origin, enabling distribution of the directed acyclic graph to the other network nodes for optimized reachability to the network node.