Mesh Network Peer Table Management for Connectivity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In mesh networks, the limited number of slots in peer tables on devices with memory constraints leads to saturation, causing new stations to form isolated clusters and reducing connectivity as they cannot establish peer connections with stations that have full peer tables.
Innovation Solution
Implementing a station with a peer table that assigns qualification grades to neighboring peers, allowing the controller to remove high-grade peers when the table is full to ensure an empty slot for new connections, thereby preventing cluster formation and maintaining network connectivity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If the peer table is filled to capacity with existing peers, then the peer table utilization is maximized, but new stations cannot establish peer connections and form isolated clusters
Solution Approach 1:
The patent implements dynamic peer table management where the system continuously monitors peer table status and automatically adjusts peer connections. When a new station enters and the peer table is full, the system dynamically evaluates existing peer qualifications and may remove lower-qualified peers to accommodate new connections, ensuring the peer table size adapts to network conditions rather than remaining static
Solution Approach 2:
The patent changes the parameter of peer selection by introducing qualification grades and using probabilistic selection based on these grades. Instead of simple first-come-first-served or round-robin selection, the system uses qualification parameters (signal strength, connection stability, etc.) to weight peer selection probability, allowing flexible adjustment of peer table composition based on network quality metrics
2Quantity of substance
If the peer table size is limited due to memory constraints, then device memory usage is controlled, but network connectivity and reachability are reduced
Solution Approach 1:
The patent changes the selection parameter from uniform probability to qualified-based probability. Each peer is assigned a qualification grade based on multiple parameters (signal strength, connection stability, data reception timing), and the probability of selecting a peer for the peer table is proportional to their qualification grade. This allows the limited peer table slots to be allocated to the most valuable peers, maximizing network connectivity within memory constraints
Solution Approach 2:
The system implements feedback mechanisms where peer qualifications are continuously evaluated and updated based on ongoing network interactions. Signal strength measurements, connection stability assessments, and data reception patterns provide continuous feedback that updates peer qualification grades, which in turn influence future peer table selections. This closed-loop feedback ensures the peer table consistently contains the most suitable peers given current network conditions
3Adaptability or versatility
If new stations are added to a network with full peer tables, then network coverage is expanded, but cluster formation increases and overall connectivity decreases
Solution Approach 1:
The patent applies preliminary action by pre-calculating and assigning qualification grades to peers before peer table saturation occurs. When a new station enters, the system has already established qualification metrics for existing peers, enabling immediate evaluation and potential replacement decisions without disrupting network operation. This preliminary preparation allows seamless integration of new stations while maintaining connectivity
Solution Approach 2:
The system dynamically adjusts peer table composition in response to network changes. When new stations enter, the system doesn't rigidly maintain existing peer tables but instead dynamically re-evaluates peer qualifications and redistributes peer table slots to optimize overall network connectivity. This dynamic adaptation prevents cluster formation by ensuring new stations can always find peers to connect with
Data Source
AI summary
A station of a mesh network comprising a peer table which is configured to list neighboring peers within the mesh network. Each peer comprises a qualification grade and the station comprises a controller which is configured to detect a new peer entering the mesh network and to establish a peer connection with the new peer. The controller is also configured to add the new peer to the peer table and to determine if the peer table is full when the new peer has been added. The controller is further configured to compare the qualification grades of the neighboring peers in the peer table if the peer table is full, and to remove a peer having a high qualification grade in relation to the neighboring peers in the peer table.