Two-Hop Relay for Distance Vector Routing Bandwidth
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In mobile ad hoc networks, distance vector routing protocols consume excessive bandwidth due to redundant updates when nodes change, particularly when nodes two hops away experience changes in routing information, leading to wasteful use of scarce communication resources.
Innovation Solution
Implementing a two-hop relay process where update messages are forwarded only through designated relay nodes, reducing the number of nodes that receive and send update messages, and using extended distance vector routing protocol messages to include relay information and willingness data to determine optimal relay nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If distance vector routing protocols forward update messages to all neighbors, then routing information is propagated comprehensively, but bandwidth is consumed excessively due to redundant updates
Solution Approach 1:
The patent applies local quality by making different nodes perform different functions based on their role. Relay nodes forward update messages while non-relay nodes do not forward them. This differentiation reduces redundant transmissions locally at each node while maintaining global routing information propagation, directly addressing the bandwidth consumption problem.
Solution Approach 2:
The patent introduces relay nodes as intermediaries between the source node and other nodes two hops away. Instead of all nodes forwarding updates to all their neighbors, only designated relay nodes perform the forwarding function. This intermediary approach eliminates redundant update messages while ensuring routing information reaches all necessary nodes.
2Loss of information
If all nodes receive and process update messages, then routing information is distributed completely, but network overhead increases due to redundant processing
Solution Approach 1:
The patent implements local quality by assigning different roles to different nodes. Relay nodes are designated to forward update messages while non-relay nodes simply receive and process them without forwarding. This role differentiation reduces the quantity of forwarding operations across the network while ensuring all nodes receive necessary routing information, thereby reducing network overhead.
Solution Approach 2:
Relay nodes serve as intermediaries that selectively forward update messages to nodes two hops away. This intermediary mechanism ensures that routing information is distributed to all necessary nodes without requiring every node to perform forwarding operations, thus reducing the overall quantity of routing overhead in the network.
3Reliability
If update messages are forwarded to nodes two hops away, then routing information reaches all nodes, but redundant updates occur when multiple relay nodes forward the same information
Solution Approach 1:
The patent uses relay nodes as intermediaries to forward update messages to nodes two hops away. By designating specific nodes as relays rather than having all nodes forward updates, the system achieves reliable routing information distribution to distant nodes while minimizing redundant transmissions. Each relay node forwards updates only when it has new information, preventing unnecessary retransmissions.
Solution Approach 2:
The patent applies local quality by making relay nodes perform the forwarding function while non-relay nodes do not. This localized differentiation ensures that routing information reaches all nodes two hops away through designated relays, eliminating redundant updates from non-relay nodes while maintaining complete information reachability across the network.
Data Source
AI summary
In one embodiment, a method for using a two-hop relay includes receiving an update message for a distance vector routing protocol from a first neighbor. The update message is sent to a different neighbor. Often, it is first determined whether the receiving node is a relay node for the first neighbor in the protocol. The relay node is a node preferred to update a particular node two hops from the first neighbor. In another embodiment, a method for serving as the two-hop relay includes receiving from each neighbor a first message that includes neighbor data that indicates nodes that are in direct communication with the neighbor. A relay set of fewer than all neighbors is determined. Every node two hops from the first node is updated using only the relay set of neighbors. The relay set is sent in a second message for the protocol.