Unicast Routing via Helping Nodes in Mesh Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In dense mesh networks, unicast message routing is unreliable due to long transmission paths and high RF interference, leading to unpredictable delivery times and increased failure rates, especially in large networks with many nodes.
Innovation Solution
The implementation of a method where neighbor nodes act as 'helping nodes' to retransmit messages after a predetermined time interval, with a limited number of nodes participating to avoid congestion, and only if an acknowledgement is not received, to create concurrent delivery paths, reducing the need for route discovery and improving reliability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Area of stationary object
If unicast message routing is used in dense mesh networks with long transmission paths, then the network can cover large areas, but the reliability of packet delivery deteriorates due to RF interference and node failures
Solution Approach 1:
The patent segments the unicast transmission process by introducing multiple independent transmission attempts with different time intervals. Instead of a single transmission path, the message is segmented into multiple transmission opportunities, where each attempt uses the same route but benefits from temporal diversity to overcome RF interference and node failures.
Solution Approach 2:
The patent implements periodic retransmission actions with predetermined time intervals between transmission attempts. This periodic action allows the system to systematically retry failed deliveries while managing network traffic load, transforming the unreliable single-shot transmission into a series of periodic opportunities for successful delivery.
2Reliability
If multiple concurrent delivering paths are introduced to increase reliability, then packet delivery reliability improves, but delivering speed and channel capacity allocation deteriorate
Solution Approach 1:
The patent applies partial action by limiting the number of retransmission attempts to a predetermined maximum number. This prevents excessive retransmissions that would degrade network performance, while still providing sufficient redundancy to overcome typical RF interference and node failures in dense mesh networks.
Solution Approach 2:
The patent introduces dynamic adaptability by allowing the system to adjust the number of retransmission attempts based on network conditions. The predetermined time intervals and maximum attempt limits create a dynamic framework that balances reliability requirements with network productivity, avoiding static over-provisioning of retransmission resources.
3Reliability
If timeout-based retry mechanisms are used at each intermediate node, then transmission reliability improves, but delivering time becomes highly variable and unpredictable
Solution Approach 1:
The patent applies preliminary action by establishing predetermined time intervals and maximum retransmission limits before transmission begins. This pre-planned framework eliminates the variability introduced by adaptive timeout mechanisms at each node, creating predictable delivering times while maintaining reliability through the predetermined retransmission strategy.
Data Source
AI summary
The present invention relates to a method for routing messages through a mesh network comprising a plurality of nodes, wherein a message is send from a sending node to a receiving node. The method comprises the steps of defining a routing table designating a path from a source node to a destination node through the mesh network, and defining a neighbor table listing one or more neighbor nodes from the plurality of nodes which are in the neighborhood of the sending node. If the destination node is not in the neighbor table of the sending node, the message is transmitted by the sending node to a receiving node adapted to forward the message to the destination node in accordance with the routing table. The one or more neighbor nodes save the message in internal storage and a predetermined number of helping nodes from the one or more neighbor nodes repeat the message after respective predetermined time intervals have passed, wherein the number of helping nodes being smaller or equal than the number of neighbor nodes.