Network Merging via Beacon ID Comparison for Ad-Hoc Synchronization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In ad-hoc communication systems, independently synchronized networks may interfere or fail to communicate when they overlap due to unsynchronized sleep and wake periods, necessitating a method to merge networks effectively.
Innovation Solution
Nodes synchronize with a different network if they receive a beacon with a larger Network ID or if the receiving network lacks a fixed network coordinator, using logic circuitry to determine the need for merging based on Network ID and Infrastructure Access Index indications, and adjusting their clock synchronization accordingly.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If nodes form independently synchronized networks with separate reference clocks, then each network can maintain stable internal synchronization and implement power-saving techniques, but when networks overlap geographically they interfere with each other and cannot communicate due to unsynchronized sleep and wake periods
Solution Approach 1:
The patent merges independently synchronized networks by having nodes compare Network IDs from different networks and selectively synchronize to a common reference clock. When a node receives a beacon with a different Network ID, it compares the IDs and determines whether to merge networks based on the comparison result, ultimately establishing a unified synchronization domain that enables cross-network communication while maintaining power-saving capabilities.
Solution Approach 2:
The patent changes the synchronization parameter (reference clock) based on Network ID comparison. Nodes dynamically adjust their reference clock selection by comparing Network IDs in received beacons with their current network's Network ID, switching reference clocks when appropriate to achieve network merging or maintain independence, thereby adapting synchronization behavior to geographic overlap conditions.
2Use of energy by moving object
If nodes synchronize to different reference clocks in overlapping networks, then each network maintains its own timing, but power-saving techniques become ineffective and communication fails due to non-coincident sleep and awake periods
Solution Approach 1:
The patent merges networks with different reference clocks by having nodes compare Network IDs and selectively adopt a common reference clock. This unification of timing references ensures that sleep and wake periods coincide across networks, enabling both effective power-saving techniques and reliable communication between nodes from different original networks.
Solution Approach 2:
The patent uses feedback through beacon reception and Network ID comparison to dynamically adjust synchronization behavior. Nodes continuously monitor beacons from other networks, compare Network IDs, and adjust their reference clock selection based on this feedback, ensuring that synchronization is optimized for both power-saving and communication reliability based on current network overlap conditions.
3Adaptability or versatility
If nodes continuously monitor for beacons from different networks, then they can detect overlapping networks and merge when necessary, but this increases power consumption and processing overhead
Solution Approach 1:
The patent applies partial monitoring by having nodes check for beacons from different networks only when specific conditions are met, such as during wake periods or when network overlap is suspected. This partial action approach provides sufficient network merging capability while avoiding the excessive power consumption of continuous monitoring, balancing adaptability with energy efficiency.
Data Source
AI summary
During operation, nodes that receive beacons from a different network will synchronize to the different network when a predetermined condition is met. Synchronization to the differing network will only take place if the node receiving the beacon from a different network does not have access to a fixed network coordinator and the predetermined condition is met. The predetermined condition may comprise such things as a Network ID for the different network being larger than the Network ID for the current network, or alternatively, the size of the different network being larger than a size of the current network.