Wireless Data Routing via Link Cost Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless communication networks face inefficiencies in establishing and maintaining routing paths due to the reliance on minimum hop counts, which can lead to increased signal to noise ratio and packet loss, as well as wastage of power, as they do not effectively consider link costs and energy consumption.
Innovation Solution
A data routing method and apparatus that optimizes data routes by considering link costs between nodes, using a Dijkstra algorithm to generate minimum cost information and forming routes that consume minimal energy, thereby reducing overhead and establishing efficient data paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If minimum hop counts are used as the standard for selecting routing paths, then the routing selection process is simple and fast, but the signal to noise ratio increases and packet loss occurs
Solution Approach 1:
The patent changes the routing selection parameter from minimum hop count to link cost, which considers multiple factors including signal to noise ratio, packet loss rate, and transmission power. This parameter transformation allows the system to select routes based on actual communication quality rather than just the number of hops, thereby reducing packet loss while maintaining routing efficiency
2Device complexity
If minimum hop counts are used for routing selection, then the routing protocol is simple to implement, but power is wasted due to faulty wireless links
Solution Approach 1:
The patent transforms the routing selection criterion from simple hop count to link cost, which incorporates power consumption and link quality metrics. This allows the system to identify and avoid faulty links that waste power, while the Dijkstra algorithm provides a systematic approach that balances complexity with effective power management
Solution Approach 2:
The patent implements feedback mechanisms where nodes report their link quality and power consumption information to neighboring nodes. This feedback allows the routing protocol to learn from actual transmission experiences and adjust future routing decisions to avoid power-wasting paths, while the feedback overhead is managed through efficient information exchange protocols
3Reliability
If link cost is considered for routing selection, then packet loss is reduced and optimal routes are established, but the routing calculation complexity increases
Solution Approach 1:
The patent introduces the Dijkstra algorithm as an intermediary computational tool that processes link cost information and generates optimal routing paths. This algorithm acts as a mediator between the raw link cost data and the final routing decisions, systematically processing complexity to produce reliable routes without overwhelming individual nodes
Solution Approach 2:
The patent segments the routing calculation process into distributed components where each node independently calculates routes to its neighbors based on local link cost information. This segmentation allows the complex global routing optimization to be broken down into manageable local computations, reducing the burden on any single node while maintaining overall optimization effectiveness
4Reliability
If all nodes consider link costs for routing optimization, then optimal routes are established, but overhead increases due to extensive information exchange
Solution Approach 1:
The patent applies local quality by having each node consider only link costs and information relevant to its immediate neighbors rather than processing all network information. This localized approach to routing optimization allows nodes to make informed decisions based on local conditions, reducing the information exchange overhead while still achieving effective route optimization through the cumulative effect of local optimizations
Data Source
AI summary
A data routing method and system, the data routing method including: locating a destination node using a destination locating packet; establishing a preliminary route including anchor nodes based on a route where the destination locating packet is transmitted to the destination node; determining a link cost between neighbor nodes of each of the anchor nodes, and also between the anchor nodes and the neighbor nodes of each of the anchor nodes; generating minimum cost information with respect to a route consuming a minimum cost from the destination node to a source node using the link cost; and forming a data route from the destination node to the source node using the minimum cost information.