Wireless Mesh Node Beacon Nomination Probability Adaptation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Wireless mesh networks face challenges in maintaining clock synchronization among nodes, particularly due to reliance on external time references that may be unavailable and dedicated nodes that create single points of failure, leading to potential network failure from clock drift.
Innovation Solution
A method where each node in the network can detect the absence of a beacon signal and nominate itself as a replacement beacon node based on probability values, with adaptive modification of nomination probabilities according to received beacon signals and network conditions, ensuring no single point of failure and robust time synchronization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a dedicated node is used as a local time reference authority, then clock synchronization accuracy is improved, but the network reliability deteriorates due to single point of failure
Solution Approach 1:
The patent divides the single dedicated time reference into multiple distributed time reference nodes. Each node can independently generate and broadcast beacon signals for synchronization, eliminating the single point of failure while maintaining synchronization accuracy through multiple concurrent references.
Solution Approach 2:
The patent enables nodes to autonomously determine their role in time synchronization. Nodes self-evaluate based on criteria such as beacon signal reception quality and network position to decide whether to become time reference nodes, eliminating the need for centralized authority while maintaining synchronization functionality.
2Measurement precision
If external time reference such as Internet Time Service is used, then time accuracy is improved, but network independence deteriorates due to external dependency
Solution Approach 1:
The patent extracts the time reference function from external authorities and embeds it within the network itself. Nodes generate their own beacon signals based on local clocks, making the network self-sufficient for time synchronization without requiring external services like NTP or ITS.
Solution Approach 2:
The patent makes every node capable of performing multiple functions including time reference generation, beacon broadcasting, and synchronization. This multi-functionality allows the network to maintain time accuracy internally without external dependencies, while still being able to synchronize with external references if needed.
3Reliability
If multiple nodes nominate themselves as potential replacement beacon nodes, then network reliability is improved, but device complexity increases due to election process
Solution Approach 1:
The patent implements a feedback mechanism where nodes continuously monitor beacon signal reception quality and network conditions. This feedback informs nodes' decisions to nominate themselves as replacement beacon nodes, creating a dynamic adjustment process that maintains reliability while managing complexity through condition-based automation.
Solution Approach 2:
The patent changes parameters such as nomination probability thresholds and election criteria dynamically based on network conditions. Nodes adjust their behavior parameters in response to observed beacon signal quality and network state, simplifying the election process through automated parameter adjustment rather than complex manual configuration.
Data Source
Figure 1a
Figure 1b
Figure 1c
AI summary
A system and method of operating a wireless network having a plurality of nodes. Each node determines whether to replace the beacon node. When a node determines that the beacon node is to be replaced, the node determines whether it should nominate itself as a potential replacement beacon node. The decision whether to nominate itself as a potential replacement beacon node is a function of a nomination probability associated with the node. If the nodc determines that it should nominate itself as a potential replacement beacon node, the node sends out one or more beacon signals. Each node then adaptively modifies the probability of nominating itself as a function of the number of beacon signals received from other nodes. Beacon signals are received by potential replacement nodes and, if the potential replacement beacon node has received a beacon signal from a higher ranking potential replacement beacon node, the node removes itself as a candidate for the replacement beacon node.