Timer-Based Routing Message Delivery for Relay Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In proximity-based relay networks, managing network topology and selecting optimal routes is challenging due to potential overloading, power issues, and changes in network node status, leading to network errors and data packet loss.
Innovation Solution
A routing message delivery method that uses timers to manage message initiation and forwarding, evaluates paths based on metrics, and updates routing tables dynamically to adapt to changing network conditions, ensuring efficient data packet delivery and minimizing errors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If each network node initiates its own message and dumps it into the network at any time, then network nodes can independently operate and maintain routing information, but the proximity-based relay network may overload due to glut of information
Solution Approach 1:
The patent applies preliminary action by having network nodes pre-establish routing tables before message transmission. Each node maintains updated routing information about neighboring nodes and available routes in advance, so when messages need to be transmitted, the routing decisions are already prepared. This prevents the need for each node to independently initiate and flood routing discovery messages continuously, thereby reducing information glut while maintaining independent operation capability.
2Productivity
If a network node selects the route having the least number of hops, then routing decision is simple and fast, but the route selection may not be optimal considering power level, connection quality, and distances
Solution Approach 1:
The patent applies parameter changes by transforming the routing metric from simple hop count to a composite metric that includes power level, connection quality, and distance factors. The routing table stores multiple parameters for each neighboring node, and the routing decision evaluates these parameters to determine the optimal route. This allows the system to maintain relatively fast routing decisions while achieving more reliable and optimal route selection that considers energy constraints and link quality.
3Stability of the object's composition
If network nodes do not update their routing tables when topology changes occur, then network operation is stable and simple, but routing table discrepancies among nodes result in network errors and data packet loss
Solution Approach 1:
The patent applies feedback by implementing a mechanism where network nodes continuously monitor topology changes and update their routing tables accordingly. When a node detects that a neighboring node goes offline or becomes active, it generates an update message that propagates through the network, allowing all nodes to synchronize their routing information. This feedback loop maintains routing table consistency across the network while preserving operational stability through structured update propagation.
Data Source
AI summary
The disclosure proposes a routing message delivery method, a relay node using the same method, and a communication network using the same method. According to one of the exemplary embodiments, the proposed routing message delivery method would include at least but not limited to initiating a timer having a first timer value that is a non-zero positive number, forwarding a first routing message via a first path in response to receiving the first routing message before the timer expires, initiating a second routing message via the first path and a second path in response to not receiving the first routing message before the timer expires, constructing a current network topology, evaluating the first path and the second path within the current network topology, and updating the current network topology.