Mesh Network Route Discovery via Quality-Based Waiting Delay
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In mesh communication networks, the existing route-discovery mechanism is inefficient due to high broadcasting load and bandwidth consumption, particularly in dense networks where collision-avoidance mechanisms can lead to delayed or lost route-discovery requests, potentially overlooking the most optimum routes.
Innovation Solution
A method is introduced where node devices determine a waiting delay for relaying route-discovery requests based on link quality levels, prioritizing 'average' quality links by setting different waiting delays for link quality thresholds, and updating the waiting delay if the path includes unreliable links, thereby reducing the discovery time of an optimum route and broadcasting load.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If node devices broadcast route-discovery requests using collision-avoidance mechanism (CSMA/CA), then transmission collisions are avoided, but transmission delays increase and route-discovery requests may be lost indefinitely in dense networks
Solution Approach 1:
The patent applies preliminary action by determining a waiting delay before relaying route-discovery requests. This pre-calculated delay is based on link quality metrics (such as received signal strength indicator RSSI or link quality indicator LQI) and is used to prioritize transmissions. Nodes with better link qualities wait shorter times, while nodes with poorer link qualities wait longer, ensuring that critical route discoveries are not delayed by collision avoidance mechanisms.
Solution Approach 2:
The patent changes the parameter of transmission timing by introducing a variable waiting delay that depends on link quality parameters. Instead of using a fixed or random delay as in traditional CSMA/CA, the system dynamically adjusts the waiting period based on measured link conditions. This allows the system to optimize transmission timing and reduce unnecessary delays while maintaining reliable delivery.
2Reliability
If node devices relay all received route-discovery requests, then complete route exploration is achieved, but broadcasting load and bandwidth consumption increase significantly
Solution Approach 1:
The patent applies local quality by making relaying decisions based on the local link quality of each node. Instead of uniformly relaying all requests, each node evaluates the quality of its incoming link and compares it against threshold values or neighboring nodes. Only requests arriving on links with sufficient quality are relayed further, ensuring that energy is spent on promising routes while discarding poor-quality transmissions that would waste bandwidth.
Solution Approach 2:
The patent implements partial action by selectively relaying only a subset of received route-discovery requests. Rather than forwarding every request (excessive action), the system filters requests based on link quality criteria, relaying only those that meet quality thresholds. This partial relaying strategy reduces broadcasting load and bandwidth consumption while still ensuring that adequate route options are explored.
3Reliability
If random waiting delay is used for collision avoidance, then transmission collisions are reduced, but transmission order becomes unpredictable and optimum routes may be delayed
Solution Approach 1:
The patent changes the parameter of waiting delay from random to deterministic and quality-based. Instead of using random delays that cause unpredictable transmission ordering, the system calculates waiting delays based on measurable link quality parameters such as RSSI or LQI. This ensures that transmissions occur in an optimal order (best links first) while still providing collision avoidance, thereby improving route discovery speed without sacrificing reliability.
Solution Approach 2:
The patent employs feedback by using link quality measurements (RSSI, LQI) to determine transmission timing. Each node continuously monitors its link conditions and uses this feedback information to adjust its waiting delay before relaying requests. This feedback mechanism ensures that the system adapts to current network conditions and prioritizes transmissions through high-quality links, improving overall route discovery speed.
Data Source
AI summary
For relaying a route-discovery request in order to discover at least one route from a source node device to a destination node device in a communication network comprising other node devices able to act as relays between the source node device and the destination node device, at least one node device among said other node devices dynamically defines a waiting delay value to be applied before relaying the route-discovery request. More precisely, said at least one node device defines the waiting delay value according to a quality level of a link via which the route-discovery request was received.