Route Recovery in Wireless Tree Networks via Local Repair
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional algorithms for route recovery in wireless tree networks cause control overload, address changes, and topology changes when a node or link fails, leading to inefficient re-establishment of communication routes.
Innovation Solution
A method where a second node broadcasts a local repair request packet, selects a relay node based on hop count and hierarchy, and establishes a new route with the relay node, which informs the upper node to re-establish communication, allowing lower nodes to rebroadcast if necessary, thereby minimizing route changes and maintaining the existing tree structure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional algorithms are used for route recovery, then communication routes can be re-established, but control overload and topology changes occur
Solution Approach 1:
The route recovery process is segmented into localized repair operations. When a link breaks, only the affected subtree performs localized route recovery through LREQ/LREP packet exchange, rather than triggering全网 route re-establishment. This segmentation isolates the recovery operation to minimal necessary nodes, reducing control overhead.
Solution Approach 2:
Nodes pre-maintain information tables containing neighbor node lists, depth information, and local address data. This preliminary information gathering enables rapid route recovery decisions without requiring extensive real-time control signaling, thus reducing control overload during actual route recovery events.
2Reliability
If conventional algorithms are used for route recovery, then communication routes can be re-established, but address changes and topology changes occur
Solution Approach 1:
The invention applies local quality by allowing route recovery only in the affected subtree while preserving the global tree structure. The information table maintains stable tree topology information (depth, parent pointers) even when local routes change, enabling localized adaptation without global topology reconfiguration.
Solution Approach 2:
Instead of re-establishing routes from the root downward (conventional approach), the invention performs route recovery from the affected node upward and outward. The disconnected node or its children initiate LREQ packets that propagate upward to find alternative paths, inverting the traditional root-centric route establishment approach and preserving existing addresses and topology.
3Reliability
If descendent nodes attempt to re-connect to the network, then route recovery is achieved, but control overload and information table updates are required
Solution Approach 1:
Disconnected nodes autonomously initiate route recovery by broadcasting LREQ packets and processing LREP responses using their pre-stored information tables. This self-service approach eliminates the need for centralized control signaling to coordinate route recovery, significantly reducing control overhead and recovery time.
Solution Approach 2:
Nodes pre-populate information tables with neighbor lists, depth information, and routing data during normal operation. When disconnection occurs, this preliminary information enables immediate local route recovery decisions without requiring time-consuming control signaling or information gathering, thus reducing loss of time.
Data Source
AI summary
A route recovery method in a wireless network of a tree topology, in which a second node, which is a lower node of a first node and is disconnected from the first node, recovers the route in the network. The route recovery method includes the second node broadcasting a local repair request (LREQ) packet, each node receiving the LREQ packet sending a local repair reply (LREP) packet to the second node to act as a relay node for the route recovery, the second node selecting the relay node from among the nodes sending the LREP packet, and sending a local repair confirm (LCON) packet from the second node to the relay node, and establishing the route between the second node and the first node by the relay node sending a local repair inform (LINF) packet to the first node.