Non-Zero Backoff Procedure for Bounded Latency in WLAN
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless communication systems using CSMA/CA procedures face challenges in supporting low latency applications due to unbounded contention times, which are unsuitable for real-time applications requiring predictable and low latency packet delivery.
Innovation Solution
A non-zero backoff procedure is introduced, where the backoff counter is initialized to at least one count, ensuring that it decreases by at least one between two CCA busy events, bounding the contention time and providing higher priority through a shorter Arbitration Inter-Frame Spacing (AIFS) time, thereby ensuring bounded latency for real-time applications.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a random backoff procedure with zero initialization is used, then the system achieves high throughput for conventional traffic, but the contention time becomes unbounded and unsuitable for real-time applications
Solution Approach 1:
The patent changes the parameter of backoff counter initialization from zero to a non-zero value (at least one count). This modification ensures that the backoff counter must be decremented at least once between two CCA busy events, thereby bounding the contention time while maintaining system throughput through controlled randomization.
2Speed
If the backoff counter is initialized to zero, then the channel access is faster on average, but the contention time cannot be bounded for low latency applications
Solution Approach 1:
The patent applies partial action by initializing the backoff counter to a small non-zero value (at least one count) rather than a large value. This ensures the counter decrements at least once between CCA busy events, providing bounded latency guarantees while minimizing the impact on average channel access speed.
3Loss of time
If a short AIFS time is used for non-zero backoff procedure, then real-time applications gain higher priority and earlier channel access, but the system complexity increases due to multiple backoff procedures
Solution Approach 1:
The patent applies local quality by implementing different backoff procedures for different traffic types. Non-RTA traffic uses the traditional zero-initialized backoff procedure, while RTA traffic uses the non-zero initialized backoff procedure with short AIFS time. This allows priority differentiation for real-time applications without requiring complete system redesign.
Data Source
AI summary
A wireless local area network (WLAN) protocol having a non-zero backoff procedure which is bounded by setting a backoff counter to a random value greater than or equal to at least one backoff slot in starting to contend for a channel. This is preferably utilized in combination with setting the Arbitration Inter-Frame Spacing (AIFS) time to an amount less than that utilized for a legacy backoff. The parameters controlling the non-zero backoff may be set by the station performing the contention, or by an associated Access Point (AP), or in response to negotiation between the station and the AP. In some cases the station can switch between enabling and disabling the non-zero backoff procedure during different periods of time.