Routing Method Reducing Delay in Low-Power Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In low-power-consumption routing networks, data transmission is delayed because packets cannot be forwarded until the next-hop node wakes up, leading to prolonged transmission times.
Innovation Solution
A routing method that sends a probe frame to neighboring nodes to determine the next-hop node with the lowest cost parameter, allowing data to be sent as soon as any active node is reached, thereby reducing delay.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Use of energy by stationary object
If low-power-consumption routing nodes periodically enter sleep state, then power consumption is reduced, but data transmission delay increases
Solution Approach 1:
The system performs preliminary actions by establishing multiple alternative routing paths before the low-power routing node enters sleep state. The source node proactively discovers and stores backup routes through route discovery protocols, so when the primary next-hop node is sleeping, data can be immediately forwarded through alternative active nodes without waiting for wake-up cycles.
Solution Approach 2:
The routing system dynamically adapts path selection based on the real-time status of low-power routing nodes. The source node monitors which next-hop nodes are currently active and dynamically switches between primary and alternative routes, optimizing both power efficiency and transmission delay based on current network conditions.
2Use of energy by stationary object
If data waits for next-hop node to wake up before forwarding, then power consumption is optimized, but transmission delay increases
Solution Approach 1:
The source node acts as an intermediary that buffers and manages data transmission. Instead of data waiting idle at the source until the next-hop node wakes up, the source node proactively finds alternative active nodes to serve as intermediaries for forwarding data, maintaining continuous flow and improving transmission speed while preserving the sleep-wake cycle of low-power nodes.
Solution Approach 2:
The system performs preliminary route discovery to identify alternative active next-hop nodes before data transmission is blocked by a sleeping node. This preliminary action ensures that when the primary path is unavailable, data can be immediately redirected through pre-identified alternative paths without waiting delays.
3Reliability
If multiple routing paths are maintained for low-power nodes, then transmission reliability improves, but routing table complexity increases
Solution Approach 1:
The system applies local quality by maintaining detailed alternative routing information only for segments involving low-power consumption nodes, while using standard single-path routing for other segments. This localized approach to multi-path maintenance reduces overall routing table complexity while ensuring reliability specifically where needed - at the boundaries and paths involving sleeping nodes.
Solution Approach 2:
The routing table is segmented into different sections: primary next-hop nodes, alternative next-hop nodes for low-power segments, and standard routing entries. This segmentation allows the system to manage complexity by organizing alternative paths in a structured manner, maintaining reliability through segmentation of path information without requiring complete multi-path redundancy throughout the entire routing table.
Data Source
AI summary
A routing method and apparatus are provided. The routing method includes the following steps: sending a probe frame that carries an address of a destination node to a neighboring node(s); receiving a response message returned; selecting one neighboring node from the neighboring node(s) that returns the response message as a next-hop node to which data is sent. A neighboring node with a cost parameter which is lower than a cost parameter in a routing table of the destination node is selected as the next-hop node. In the routing method, when a routing node forwards data, the route is found in real time by broadcasting a probe frame, and data may be sent as long as any one of the neighboring nodes that may arrive at the destination node is in an active state, and thus a data transmission delay is shortened.