Topology Update via Broadcast Sync for Low-Power Ad Hoc Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
OLSR protocol causes high power consumption due to frequent link establishment and packet flooding during topology updates in mobile ad hoc networks, which is inefficient and not optimized for dynamic scenarios.
Innovation Solution
A method for topology information update that uses broadcast packets to determine whether neighboring nodes need to synchronize information, avoiding link establishment procedures and reducing power consumption by using BLE ADV packets to exchange topology identifiers and synchronization radius identifiers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If OLSR protocol performs packet flooding immediately after topology change, then topology information is synchronized between nodes, but power consumption increases and signaling overhead increases
Solution Approach 1:
The patent applies preliminary action by having nodes pre-select MPRs (Multipoint Relays) based on current topology information before topology changes occur. These pre-selected MPRs are stored and used for subsequent topology information dissemination, eliminating the need for immediate packet flooding when topology changes happen, thus reducing power consumption while maintaining synchronization reliability
Solution Approach 2:
The patent introduces MPRs as intermediary nodes that relay topology information between ordinary nodes and the network. Instead of all nodes performing packet flooding, only MPRs are responsible for disseminating topology updates, significantly reducing the number of nodes that need to wake up and process topology changes, thereby reducing overall power consumption and signaling overhead
2Reliability
If OLSR protocol performs packet flooding immediately after topology change, then topology information is synchronized between nodes, but signaling flooding increases
Solution Approach 1:
The patent extracts the topology information dissemination function from all nodes and concentrates it on selected MPR nodes only. By taking out this specific function from the general node population and assigning it to specialized intermediary nodes, the signaling overhead is dramatically reduced while topology synchronization reliability is maintained through the structured MPR hierarchy
Solution Approach 2:
MPRs serve as intermediary nodes that mediate topology information dissemination. Instead of direct packet flooding from all nodes, topology updates flow through MPRs who aggregate and relay information efficiently, reducing the total volume of signaling messages in the network while ensuring all nodes receive necessary topology updates
3Reliability
If nodes wake up to establish link for topology update, then topology information can be exchanged, but power consumption increases
Solution Approach 1:
The patent applies preliminary action by pre-establishing MPR selections and storing their address information before topology changes occur. When topology updates need to be disseminated, nodes can directly use the stored MPR address information to send updates without waking up to perform link establishment procedures, thus exchanging topology information while minimizing power consumption
Solution Approach 2:
Nodes maintain their own MPR selection information and address books locally, enabling them to independently determine which nodes to send topology updates to without needing to wake up and perform link establishment handshakes. This self-service approach allows topology information exchange while nodes remain in low-power states
Data Source
AI summary
A topology information update method includes a first node that sends a first packet in a broadcast manner, receives a second packet from a second node, where the second packet is a broadcast packet, and the first packet and the second packet each carry an identity identifier, a topology identifier, and a synchronization radius identifier that are of the respective node. The first node determines, based on the first packet and the second packet, whether the first node and the second node need to synchronize topology information.