RTA Traffic Scheduling for WLAN Latency Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless communication systems using CSMA/CA lack low latency capability for real-time applications, leading to significant packet latency due to random channel access and high probabilities of packet collisions.
Innovation Solution
The system identifies and prioritizes real-time application packets, scheduling channel time based on expected packet arrival times and sharing this information with neighboring stations to prevent collisions, allowing real-time packets to have priority over non-real-time packets and transmit earlier.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If CSMA/CA random channel access is used, then fair access between all packet transmissions is provided, but significant packet latency occurs due to channel contention and collisions
Solution Approach 1:
The patent segments channel access into two distinct mechanisms: CSMA/CA for non-real-time traffic and scheduled access for real-time traffic. This segmentation allows each traffic type to use the access method best suited for its requirements, preventing real-time packets from suffering CSMA/CA latency while non-real-time packets continue to enjoy fair random access.
Solution Approach 2:
The patent implements preliminary scheduling of channel access times for real-time packets based on expected arrival times. By pre-allocating channel resources and coordinating with neighboring stations before transmission, real-time packets bypass the contention process entirely, eliminating latency while maintaining overall network fairness through the continued operation of CSMA/CA for other traffic.
2Speed
If channel contention period is shortened to accelerate channel access, then packet transmission speed increases, but probability of packet collision increases
Solution Approach 1:
The patent performs preliminary coordination with neighboring stations to schedule channel access times before real-time packet transmission. This advance planning allows stations to transmit at high speed without collision risk because the channel is reserved in advance, eliminating the trade-off between speed and collision probability for real-time traffic.
3Reliability
If channel contention period is lengthened to avoid packet collisions, then packet delivery success rate improves, but packet latency increases significantly
Solution Approach 1:
The patent separates real-time and non-real-time traffic into different access mechanisms. Real-time packets use scheduled access with guaranteed delivery and minimal latency, while non-real-time packets use CSMA/CA with extended contention periods for collision avoidance. This segmentation resolves the contradiction by applying the right strategy to the right traffic type.
Solution Approach 2:
By scheduling channel access in advance based on expected packet arrival times and coordinating with neighboring stations, the patent ensures real-time packets achieve high delivery success rates without experiencing the latency penalties of extended contention periods.
4Loss of time
If priority scheduling is implemented for real-time packets, then latency is reduced, but coordination complexity between stations increases
Solution Approach 1:
The patent reduces coordination complexity by performing all necessary scheduling and collision avoidance coordination in advance, before real-time packet transmission begins. Stations exchange scheduling information and agree on channel access times beforehand, allowing simple execution during actual transmission without complex real-time decision-making or continuous coordination overhead.
Data Source
Figure 1
Figure 2~4
Figure 5
AI summary
A wireless communication circuit for operating over a wireless local area network (WLAN) supporting carrier sense multiple access / collision avoidance (CSMA / CA) in which real time application (RTA) traffic and non-RTA traffic coexist. Channel time is scheduled for transmitting real-time application (RTA) traffic based on expected RTA packet arrival time, with the schedule being shared with neighboring stations. Schedule time is adjusted based on schedules of neighboring stations to prevent channel contention collisions of multiple RTA traffics contending for the channel. Various mechanisms are described for supporting RTA transmissions while reducing channel access latency and contention collision.