Hybrid Tree-Link State Routing for Wireless Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Wireless communication systems face challenges with non-optimal routes and single points of failure in tree routing methods, which affect route optimization and robustness.
Innovation Solution
A routing method that combines adaptive tree routing and link state routing, using an adaptive tree table and link state table to dynamically assign logical addresses and optimize packet routing, while addressing single points of failure and improving network robustness.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If tree routing is used, then routing complexity is reduced and storage space is saved, but route optimality deteriorates and single points of failure occur
Solution Approach 1:
The patent merges tree routing and link state routing into a hybrid approach. The tree routing component provides hierarchical structure and reduced complexity, while the link state routing component maintains multiple paths and improves reliability. This combination resolves the contradiction by integrating the advantages of both methods.
Solution Approach 2:
The patent implements dynamic route selection where the routing protocol can adapt between tree-based paths and link-state paths based on network conditions. This dynamic behavior allows the system to maintain low complexity during normal operation while providing alternative paths when failures occur, thus improving reliability without permanently increasing complexity.
2Loss of time
If tree routing is used, then initial delay is reduced, but route optimization deteriorates
Solution Approach 1:
The patent performs preliminary route setup by establishing tree structures in advance, which eliminates initial delay for route discovery. The tree structure is pre-configured so that nodes can immediately begin communication without waiting for route discovery protocols, thus resolving the contradiction between reduced initial delay and maintained route optimization.
3Quantity of substance
If tree routing is used, then storage space is saved, but adaptability deteriorates
Solution Approach 1:
The patent implements dynamic address assignment within the tree structure, where logical addresses are assigned adaptively based on network conditions and node capabilities. This dynamic approach allows the system to maintain efficient storage usage while improving adaptability in address assignment.
Solution Approach 2:
The patent changes the parameter of address assignment from static to adaptive, allowing the system to adjust address allocation based on network topology and node requirements. This parameter change enables better adaptability without significantly increasing storage requirements.
Data Source
AI summary
A routing method of a wireless communication system is provided implementing advantageous features of both the tree routing and the link state routing. In the routing method, the system generates an adaptive tree table which defines a network in a tree structure of at least one branch with at least one node and each node generates a link state table which includes information on neighbor nodes, such that the packets are routed on the basis of the adaptive tree table and the link state table. Advantageous mechanisms of the tree routing and the link state routing are combined, thereby it is possible to eliminate most single point of failures of conventional tree routing and provide shorter paths compared with conventional tree routing.