Topology Server Shortcut Routing in Wireless Mesh Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Wireless networks using tree structures face inefficiencies in data transmission due to lengthened routing paths and increased communication costs, as well as difficulties in maintaining the network when errors occur on the routing path.
Innovation Solution
An optimal path routing method is introduced, where a server or coordinator determines and transmits shortcut information for data transmission from a source node to a destination node through a tree mesh structure, using shortcut request and response messages to establish a shorter path, and neighboring nodes can act as backups in case of errors or out-of-coverage areas.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If data is transmitted along the tree structure from source node to destination node, then the routing path is established using existing address information, but the routing path becomes lengthened and communication costs increase
Solution Approach 1:
The system performs preliminary actions by establishing shortcut paths in advance between nodes in the tree structure. When data transmission is needed, pre-computed shortcut information is used to directly route data along optimized paths rather than traversing the entire tree structure, thereby reducing communication cost and transmission time.
Solution Approach 2:
The invention introduces an intermediary mechanism (shortcut path information) between the source and destination nodes. This intermediary provides alternative routing information that mediates the direct transmission, allowing data to bypass the lengthy tree structure path and use optimized shortcut paths instead.
2Device complexity
If data transmission follows the tree structure, then routing is simple using parent-child node relationships, but the network becomes difficult to maintain when errors occur on the routing path
Solution Approach 1:
The system pre-establishes multiple shortcut paths between nodes before errors occur. When an error is detected on the current routing path, the pre-computed alternative shortcut paths are immediately activated, allowing rapid network maintenance and fault recovery without requiring complex real-time path recalculation.
Solution Approach 2:
The invention changes the routing parameter from fixed tree structure paths to dynamic shortcut paths. When errors occur, the system switches between different shortcut path parameters, enabling flexible route changes and improving network reliability while maintaining relatively simple routing logic.
3Loss of time
If shortcut paths are established to reduce communication cost, then routing efficiency improves, but the device complexity increases due to additional shortcut information management
Solution Approach 1:
The invention introduces a centralized intermediary (topology server) that manages all shortcut path information. This intermediary handles the complexity of shortcut information storage, update, and distribution, while individual nodes in the network only need to store and use the shortcut information provided by the server, thereby distributing the complexity burden and keeping individual device complexity low.
Data Source
AI summary
An optimal path routing method is provided for transmitting data from a source node to a destination node. The optimal path setting method includes transmitting a shortcut request (SCRQ) message from the source node to a topology server; determining shortcut information at the topology server based on the SCRQ message; and transmitting a shortcut notification (SCNF) message containing the shortcut information from the topology server to the destination node.