Core Node Routing Protocol for Mesh Network Overhead Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network protocols face challenges in efficiently managing routing table updates in dynamic and static networks, particularly in mesh networks, where continuous connectivity and low routing overhead are essential, and existing protocols often require switching between proactive and reactive algorithms.
Innovation Solution
A node-based system that designates a core set of nodes within a mesh network to periodically analyze connectedness, detect node connections or disconnections, update lists of connected nodes, and transmit routing updates only when necessary, utilizing a combination of distance vector and link state routing protocols to maintain efficient routing without switching between proactive and reactive algorithms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all nodes transmit routing updates continuously, then routing information is kept current, but network overhead and congestion increase
Solution Approach 1:
The network is segmented into core nodes and non-core nodes. Only core nodes transmit routing updates, while non-core nodes listen and update their routing tables passively. This segmentation reduces the number of nodes generating traffic from all nodes to only core nodes, significantly reducing network overhead while maintaining routing information currentness.
Solution Approach 2:
Instead of all nodes participating equally in routing update transmission, only a partial set of nodes (core nodes) performs the expensive action of transmitting updates. Non-core nodes perform only the lighter action of listening and processing updates, creating an asymmetric division of labor that reduces overall network traffic.
2Loss of energy
If a core set of nodes is designated to transmit routing updates, then routing overhead is reduced, but network complexity increases due to node classification
Solution Approach 1:
The core node designation is not static but dynamic. Nodes can transition between core and non-core status based on network conditions and metrics such as connectedness. This dynamic approach allows the network to adapt to topology changes while maintaining the benefits of reduced overhead, and the complexity is managed through automated metrics-based classification rather than manual configuration.
3Reliability
If proactive routing algorithms are used, then routing tables are maintained continuously, but network traffic increases
Solution Approach 1:
Core nodes transmit routing updates periodically or triggered by topology changes rather than continuously. This periodic action maintains routing information currentness while avoiding the constant traffic generation characteristic of traditional proactive algorithms. Non-core nodes update their tables based on these periodic updates from core nodes.
Data Source
AI summary
A node for connecting to an interconnection network may include a network interface. The node may also include a processor coupled with the network interface. The node may further include a memory coupled with the processor. The processor may be configured for periodically analyzing the connectedness of the node to the interconnection network to determine a metric for the node in relation to other nodes within the interconnection network. The node may be designated as a member of a core set of nodes within the interconnection network based upon the metric. The node may detect at least one of a derived update or an update indicating another node connects to or disconnects from the interconnection network. The node may transmit a routing update to another member of the core set of nodes only when the node is designated as part of the core set of nodes.