Trickle Algorithm Routing Metric for Mesh Network Connectivity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In mesh networks, the Trickle Algorithm often fails to forward broadcast packets between clusters due to redundant transmission suppression, leading to connectivity issues, especially when nodes in one cluster cannot directly communicate with those in another, and signal quality measures like LQI saturation hinder effective packet forwarding.
Innovation Solution
A method that modifies the Trickle Algorithm by incorporating a Routable Index metric, which considers a node's role in unicast routing, static configuration, and forwarding history to determine the transmit time and redundancy constant, ensuring critical nodes rebroadcast broadcast packets effectively across clusters.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If the Trickle Algorithm suppresses redundant transmissions by comparing signal quality metrics, then network congestion is reduced, but broadcast packet forwarding between clusters fails due to LQI saturation
Solution Approach 1:
The patent changes the parameters used for transmission suppression decisions from signal quality metrics (LQI, RSSI) to routing status metrics (Routable Index). This parameter change allows nodes to make transmission decisions based on their actual routing importance rather than saturated signal quality measurements, resolving the contradiction between reducing redundant transmissions and ensuring reliable inter-cluster forwarding
Solution Approach 2:
The patent introduces the Routable Index as an intermediary metric that mediates between the need to suppress redundant transmissions and the need to ensure reliable forwarding. This intermediary metric captures the node's actual contribution to packet delivery between clusters, allowing the algorithm to distinguish between truly redundant transmissions and critical forwarding actions
2Productivity
If nodes in a cluster suppress retransmissions based on consistent packet detection, then local congestion is reduced, but inter-cluster connectivity is lost when border nodes fail to forward
Solution Approach 1:
The patent changes the decision parameters from local signal quality metrics to global routing status metrics. By using the Routable Index that reflects a node's importance for inter-cluster routing, the algorithm maintains network efficiency through suppression while ensuring border nodes with high routing importance continue to forward packets reliably
Solution Approach 2:
The patent segments the transmission suppression decision into two parts: local redundancy detection (maintaining efficiency) and routing importance evaluation (maintaining connectivity). Nodes first detect local redundancy through consistent packet comparison, then use the Routable Index to determine if suppression would harm inter-cluster connectivity, allowing both goals to be achieved simultaneously
3Ease of manufacture
If the algorithm uses signal quality thresholds to determine cluster membership, then local optimization is achieved, but nodes with similar LQI but different routing roles are treated equally
Solution Approach 1:
The patent changes the measurement parameter from signal quality (LQI) to routing status (Routable Index). This parameter change provides precise differentiation between nodes with different routing roles while maintaining algorithm simplicity, as the Routable Index is derived from existing routing table information without requiring complex measurements
Solution Approach 2:
Instead of using signal quality to determine transmission behavior (the conventional approach), the patent inverts the logic by using routing status to determine transmission behavior. This inversion allows nodes with similar signal characteristics but different routing roles to be differentiated, as the Routable Index directly reflects their contribution to packet delivery
Data Source
AI summary
The present invention provides an improved routing method for Trickle algorithm. The Trickle Algorithm is used to reduce traffic congestion where each node holds off retransmission for a random period of time and while waiting, it listens for other retransmissions and if multiple similar transmissions are detected, the node then omits the retransmission altogether. However, in certain cases, where individual nodes are critical to connecting parts of the network, connectivity may be lost when they decide not to forward the broadcast packets they receive. The present invention provides the solution to this problem by use of unicast routing information present in the nodes. All the nodes in the network track the frequency of forwarding unicast packets that can be used to calculate a metric. The metric is used to alter the trickle algorithm to increase the likelihood that broadcast packets are forwarded from one portion of the network to another.