Neighboring Access Point Scheduling Without a Common Time-Base
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional approaches for wireless network synchronization and scheduling require a precise common time-base, centralized schedulers that do not scale well, and are intolerant to delays, leading to inefficiencies and high overheads, especially in large networks with variable buffering delays.
Innovation Solution
A distributed time-based scheduling method that translates transmission schedules between neighboring access points using Timing Synchronization Function (TSF) beacons, allowing for efficient Spatial Reuse (SR) and Time-Division Multiple Access (TDMA) without a common time-base, using time-base translation parameters to synchronize APs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a precise common time-base is required for synchronization, then timing accuracy is improved, but system complexity and scalability deteriorate due to centralized schedulers and rigid synchronization requirements
Solution Approach 1:
The patent segments the synchronization function by allowing each AP to maintain its own independent time-base rather than requiring a single common time-base. Each AP translates schedules from neighbors using local time-base translation parameters, eliminating the need for centralized coordination and rigid synchronization while maintaining timing accuracy locally.
Solution Approach 2:
The patent introduces dynamic time-base translation parameters that allow APs to adapt their schedules relative to each other without requiring a common time-base. The system dynamically adjusts translation parameters based on local conditions, enabling flexibility and scalability while maintaining sufficient timing accuracy for collision avoidance.
2Ease of operation
If centralized schedulers are used for coordination, then scheduling control is improved, but scalability deteriorates in large networks with variable buffering delays
Solution Approach 1:
Each AP autonomously maintains its own transmission schedule and time-base, translating schedules from neighboring APs using local time-base translation parameters. This self-service approach eliminates the need for centralized schedulers, allowing each AP to independently manage its resources while adapting to variable network conditions and buffering delays.
Solution Approach 2:
The scheduling function is segmented and distributed across multiple APs rather than centralized. Each AP maintains its own schedule and communicates only with immediate neighbors, enabling the system to scale to large networks while maintaining effective scheduling control through local coordination.
3Reliability
If strict time synchronization is enforced, then collision avoidance is improved, but system flexibility and tolerance to delays deteriorate
Solution Approach 1:
The patent changes the synchronization parameter from a rigid common time-base requirement to flexible time-base translation parameters. Each AP translates schedules from neighbors using these parameters, which allow for tolerance to variable delays and buffering while maintaining sufficient timing accuracy for collision avoidance through spatial reuse and TDMA mechanisms.
Data Source
AI summary
Differential time synchronization and scheduling may be provided. A first Access Point (AP) may wirelessly receive time-base translation parameters of a second AP. The first AP and the second AP may be neighboring. Next, a first transmission schedule for the first AP and a second transmission schedule for the second AP may be maintained. Then the second transmission schedule for the second AP may be translated into a time-base of the first AP based on the time-base translation parameters of the second AP. Then the first AP may transmit based upon the first transmission schedule for the first AP and the translated second transmission schedule for the second AP.