Mesh Network Routing Using ETX and Data Rate Ranking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing mesh communication networks face challenges in minimizing battery consumption and latency, particularly in battery-powered nodes, due to inefficient routing protocols that prioritize hops over energy-efficient data transmission.
Innovation Solution
A method for routing information that sets data communication rates, estimates transmission needs, determines alternative routes, and ranks them based on ETX and data communication rate to select the most energy-efficient path.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Length of moving object
If routing protocols prioritize minimizing the number of hops, then the path length is reduced, but battery consumption increases due to unnecessary transmissions and processing
Solution Approach 1:
The patent changes the routing parameters from simple hop count to a composite metric that includes ETX (Expected Transmissions) and data communication rate. This parameter transformation allows the system to evaluate routes based on actual energy efficiency rather than just path length, resolving the contradiction by redefining what constitutes an optimal route.
Solution Approach 2:
The routing metric is made dynamic by incorporating real-time factors such as ETX measurements and varying data communication rates of different nodes. Instead of static hop-based routing, the system continuously adapts route selection based on current network conditions and node capabilities, allowing it to dynamically avoid battery-powered nodes when alternative paths exist.
2Loss of time
If nodes wake up frequently to receive messages, then latency is reduced, but battery consumption increases
Solution Approach 1:
The patent incorporates data communication rate as a key parameter in the routing metric. Nodes with faster communication rates (which typically wake up more frequently) are preferred for routing, but the system can still route through slow-listening battery-powered nodes when necessary, balancing latency requirements against energy consumption based on the calculated rank.
Solution Approach 2:
The patent introduces non-battery-powered nodes or nodes with higher energy reserves as intermediary relay points. These intermediary nodes can maintain more aggressive wake-up schedules and faster communication rates, effectively shielding battery-powered nodes from the need to wake up frequently, thus reducing their energy consumption while maintaining low latency.
3Reliability
If packets are routed through battery-powered nodes, then network connectivity is maintained, but processing power and energy are consumed
Solution Approach 1:
The patent transforms the routing decision parameters to include ETX and data communication rate, which inherently account for the energy cost of processing and transmitting packets. By calculating route rank based on these parameters, the system automatically identifies and prefers routes that minimize processing power consumption, while still maintaining network connectivity through alternative paths.
Solution Approach 2:
The system dynamically evaluates and updates route rankings based on current network conditions, node energy status, and communication rates. This dynamic approach allows the network to adaptively route packets away from battery-powered nodes when sufficient alternative paths exist, thereby reducing their processing load and energy consumption while maintaining overall network connectivity.
Data Source
AI summary
The present invention relates to a method for routing information from a source node to a target node in a mesh communicating network comprising a plurality of nodes. Each node comprises a transceiver circuitry and is configured to communicate wirelessly with adjacent nodes. The method comprises: setting a data communication rate for each node, estimating a number of transmissions, ETX, needed for a successful link-local transaction between adjacent nodes in the network, determining alternative routes between the source node and the target node, via one or more transit nodes, determining a rank between the source node and the target node for each alternative routes based on ETX and data communication rate for each transit nodes, and routing information using the route having the lowest rank.