Wireless Mesh Beacon Node Election Mechanism
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing 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 disruption.
Innovation Solution
A method where nodes in a wireless network can detect the absence of a beacon signal and nominate themselves as potential replacement beacon nodes based on probability, location, and link-quality metrics, with an election process to select a new beacon node, ensuring no single point of failure and internal synchronization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a dedicated node is used to generate synchronizing messages, then time synchronization can be maintained within the network, but a single point of failure is created that can disrupt the entire network
Solution Approach 1:
The patent divides the beacon node function across multiple nodes in the network rather than concentrating it in a single dedicated node. Each node can potentially become a beacon node, segmenting the synchronization function to eliminate the single point of failure while maintaining synchronization reliability.
Solution Approach 2:
The patent implements a dynamic beacon node selection mechanism where the beacon node role can transition between different nodes based on network conditions, node availability, and election processes. This dynamic approach allows the system to adapt to failures and maintain reliability without a fixed single point of failure.
2Measurement precision
If external time references such as NTP servers are used, then accurate time synchronization can be achieved, but the network becomes dependent on external authorities that may be unavailable due to isolation or interference
Solution Approach 1:
The patent extracts the time reference authority from external sources and places it within the wireless mesh network itself. Nodes elect their own beacon node internally, removing dependence on external NTP servers or time authorities, thereby ensuring synchronization availability in isolated or interfered environments.
Solution Approach 2:
The network performs self-synchronization by having nodes elect a beacon node from among themselves and using that beacon for time reference. The system serves its own time synchronization needs internally without requiring external services, ensuring both accuracy and availability within the network's operational context.
3Use of energy by moving object
If nodes cycle between sleeping and waking phases to conserve power, then energy consumption is reduced, but maintaining clock synchronization among nodes becomes more difficult
Solution Approach 1:
The patent implements periodic wake intervals where nodes wake up at synchronized times to listen for beacon signals and exchange synchronization information. This periodic action allows nodes to remain in low-power sleep mode most of the time while maintaining clock synchronization agreement through brief, coordinated wake periods.
Solution Approach 2:
The beacon node provides feedback signals that inform other nodes about the current time and synchronization status. Nodes use this feedback to adjust their clocks and wake schedules, maintaining synchronization agreement while minimizing power consumption through optimized sleep-wake cycling based on the received feedback.
Data Source
Figure 1a~1b
Figure 1c~1d
Figure 2a
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 random number generated by the node. If the node determines that it should nominate itself as a potential replacement beacon node, the node sends out one or more beacon signals. 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.