Partitioned Network Routing via Link Probability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing MANET routing protocols fail to establish routes in frequently partitioned networks, leading to inefficiencies and resource constraints, as they rely on instantaneous connections that may not always be available.
Innovation Solution
A routing module that tracks former links between nodes and determines the probability of future links, sending advertisements to indicate reachability based on these probabilities, allowing for the discovery and utilization of both instantaneous and asynchronous routes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If flooding technique is used to route messages in partitioned networks, then message delivery is possible, but resource consumption becomes prohibitively expensive
Solution Approach 1:
The patent changes the parameter of link state representation by maintaining multiple possible states for each link (up, down, indeterminate) and using probability thresholds to determine reachability. This allows the system to avoid flooding by making informed routing decisions based on link probability, reducing resource consumption while maintaining message delivery capability.
Solution Approach 2:
Each node independently determines the reachability of other nodes by evaluating link probabilities and maintaining reachability information autonomously. This self-service approach eliminates the need for centralized control or extensive message flooding, as nodes make local decisions about which nodes are reachable based on their own link probability assessments.
2Reliability
If DTLSR is used to maintain broken links in routing graph, then route recovery is possible, but routing efficiency decreases due to aged-out metrics
Solution Approach 1:
Instead of maintaining all broken links with aged metrics as DTLSR does, the patent applies partial action by only considering links with probability above a threshold as reachable. This selective approach improves routing efficiency by avoiding unnecessary route attempts through unlikely links, while still maintaining the ability to recover routes when link probabilities increase.
Solution Approach 2:
The patent performs preliminary assessment of link probabilities before attempting routing through potential paths. By evaluating link stability and predicting future link states in advance, the system can make more efficient routing decisions without wasting resources on unlikely routes, thereby improving routing efficiency while preserving route recovery capability.
3Productivity
If SABR is used with contact plan, then future connectivity is optimized, but requirement for network management infrastructure increases
Solution Approach 1:
The patent enables each node to independently determine link probabilities and assess reachability without requiring centralized network management infrastructure. Nodes autonomously evaluate their own links and make routing decisions based on probability thresholds, achieving connectivity optimization through distributed self-service rather than centralized control.
Solution Approach 2:
The patent introduces probability thresholds as an intermediary mechanism that mediates between raw link state data and routing decisions. This intermediary layer allows nodes to optimize routing based on link stability without requiring complex network management infrastructure, as the threshold mechanism simplifies the decision-making process.
4Speed
If existing MANET protocols are used in frequently partitioned networks, then instantaneous routing is attempted, but route establishment fails due to partitioning
Solution Approach 1:
The patent makes the routing system dynamic by continuously evaluating link probabilities and updating reachability information based on changing network conditions. Instead of attempting fixed instantaneous routing, the system adapts to partitioning by dynamically adjusting which nodes are considered reachable, thereby maintaining route establishment success in frequently partitioned networks.
Solution Approach 2:
The patent performs preliminary evaluation of link probabilities before attempting route establishment. By assessing the stability and future likelihood of links in advance, the system can identify potential routes through partitioned networks before attempting instantaneous routing, thereby improving both the speed and success of route establishment.
Data Source
AI summary
Embodiments for a routing module for a first node are disclosed. The routing module includes a computer readable medium having instructions thereon. The instructions cause one or more processing devices to track former links between the first node and a second node and determine a probability of a future link with the second node based on the former links. If the probability of a future link with a second node is above a threshold, an advertisement is sent to at least one other node indicating that the second node is reachable from the first node. If the probability of a future link with the second node is below the threshold and no other route exists from the first node to the second node, an advertisement is sent to at least one other node indicating that the second node is not reachable from the first node.