Ad Hoc Network Relay Node Election Mechanism
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing broadcast protocols in ad hoc networks face inefficiencies, including excessive redundant transmissions and increased likelihood of packet collisions, due to the lack of scalable mechanisms for reliable and orderly broadcast message dissemination without a central controller.
Innovation Solution
The method involves electing relay nodes based on weighted values computed from node attributes, such as mobility and signal strength, to probabilistically nominate and elect nodes for relaying broadcast packets, thereby reducing redundant transmissions and improving network efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If broadcast protocols are used in ad hoc networks without a central controller, then network self-organization and adaptability are improved, but broadcast efficiency deteriorates due to excessive redundant transmissions
Solution Approach 1:
The patent segments the broadcast relay function by electing specific relay nodes rather than having all nodes participate equally. Each node is assigned a role (relay node or non-relay node) based on evaluated attributes, dividing the broadcast task into functional segments that improve efficiency while maintaining distributed control.
Solution Approach 2:
Different nodes are assigned different qualities or roles within the network. Relay nodes are selected based on local attributes (mobility, signal strength, energy levels) to perform broadcast relay functions, while non-relay nodes perform other functions. This local differentiation optimizes broadcast efficiency without requiring centralized control.
2Reliability
If all nodes rebroadcast broadcast messages, then message delivery reliability is improved, but the number of redundant transmissions increases
Solution Approach 1:
The patent extracts the broadcast relay function from all nodes and assigns it to specific selected relay nodes. By taking out this function and concentrating it in nodes with appropriate attributes, the system maintains reliable message delivery while eliminating redundant transmissions from nodes that should not be relaying.
Solution Approach 2:
Nodes autonomously evaluate their own attributes and the network state to determine whether they should become relay nodes. This self-service mechanism allows nodes to self-organize and self-configure their broadcast relay roles without external control, achieving both reliability and efficiency.
3Measurement precision
If nodes perform periodic link and topology updates, then routing information accuracy is improved, but network overhead increases
Solution Approach 1:
The patent introduces dynamic evaluation of node attributes (mobility, signal strength, energy levels) to dynamically select relay nodes. This dynamic approach allows the system to adapt relay node selections to changing network conditions, maintaining routing accuracy without requiring frequent comprehensive updates from all nodes.
Solution Approach 2:
Nodes perform preliminary evaluation of their attributes and the network state before engaging in broadcast relay operations. By pre-evaluating and pre-selecting appropriate relay nodes, the system reduces the need for continuous updates and maintains accurate routing information with lower overhead.
Data Source
AI summary
A method and apparatus for electing broadcast relay nodes (520B, H, M) in an ad hoc network (500). Each node (520A-520O) generates an attribute message including associated parameters. Each node (520A-520O) generates a weighted value (WV) based on the parameters. The WV can be included in the attribute message for that node, can provide a metric for ranking that node to be nominated to be a broadcast relay node, can alternatively provide a probability measure for that node to probabilistically elect itself as a broadcast relay node. The broadcast manager node (520C) receives the attribute messages and elects at least one nominated node as a broadcast relay node (520B, H, M) based on the attribute messages. Each node (520A-520O) can also initiate election of an intermediate broadcast relay node if that node fails to receive a test message within a predetermined time.