Server-Assisted Routing for Mesh Network Congestion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network routing techniques, such as RPL, are inefficient in mesh networks due to reliance on a single head node, leading to network congestion and scalability issues, as they do not effectively facilitate direct node-to-node communications without traversing through the root node, which can cause bottlenecks and congestion.
Innovation Solution
Implementing server-assisted routing that uses a network management server to analyze network topology, identify chokepoints, and establish lateral bands of nodes for efficient communication paths, allowing direct communication between nodes without relying solely on the root node, thereby reducing congestion and optimizing network traffic.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If vertical routing through a single head node is used in mesh networks, then all nodes can access the network via a centralized point, but network congestion and bottlenecks occur at the root node
Solution Approach 1:
The patent segments the network routing function by dividing nodes into different levels (root node, border nodes, interior nodes) and creating multiple routing paths. Instead of all traffic converging at the root node, the network is segmented into hierarchical levels that allow distributed routing decisions, thereby reducing congestion at the centralized point while maintaining structured access control.
Solution Approach 2:
The patent introduces border nodes as intermediary elements between interior nodes and the root node. These border nodes act as mediators that can handle routing decisions locally, preventing all traffic from directly congesting the root node. The border nodes serve as intermediate routing points that distribute traffic more evenly across the network infrastructure.
2Adaptability or versatility
If self-forming routing protocols like RPL are used, then nodes can autonomously learn routes from neighbors, but scalability is limited and congestion occurs near the root node
Solution Approach 1:
The patent implements dynamic routing where interior nodes can select multiple parent nodes based on current network conditions. Instead of static single-parent relationships in traditional RPL, the system dynamically adjusts routing paths by allowing nodes to switch between different parents and by creating lateral bands that adapt to traffic patterns, thereby improving scalability while maintaining self-organization.
Solution Approach 2:
The patent adds a lateral dimension to the traditional vertical routing by creating lateral bands of nodes at the same hierarchical level. This dimensional change allows traffic to flow laterally across the network rather than only moving vertically through the root node, effectively adding another routing dimension that improves scalability and reduces congestion.
3Ease of operation
If all communications traverse through the root node, then centralized routing control is maintained, but communication time increases and congestion worsens
Solution Approach 1:
The patent performs preliminary routing setup by pre-establishing multiple parent node relationships and defining lateral bands before traffic needs to flow. Interior nodes are pre-configured with knowledge of alternative paths through their selected parents and lateral neighbors, allowing them to quickly route traffic without repeatedly traversing through the root node, thereby reducing communication delay while maintaining controlled routing.
Data Source
AI summary
A network node device and method of determining a communication route to one or more other network nodes through a network. The method includes sending current routing information to a network management server (NMS), and receiving new or supplemental routing information from the NMS, this supplemental routing information determined by the NMS based on the current routing information of the network node and the other network node(s). The supplemental routing information may include lateral route information identifying designated routing nodes that form lateral band(s) of nodes that span the network. Each lateral band may include gate node(s) as entrances/exits to the lateral band. The method further includes determining, based on the supplemental routing information, a route to one or more of the other network nodes, which may include an optimal path and/or alternate path(s) from the network node to one or more of the other network nodes.