Coordinated Random Access for Multi-BSS Uplink Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communication networks, particularly in 802.11ax systems, the existing methods for multi-user uplink random access in multiple Basic Service Sets (BSSs) lead to inefficient channel usage due to high transmission of signaling messages and contention-based medium access, which increases channel occupation and collision probabilities.
Innovation Solution
A method that involves receiving trigger frames from an access point to reserve transmission opportunities, updating contention window values based on access success or failure, and using a contention scheme with parameters initialized or re-initialized according to group changes, allowing stations to efficiently access random resource units in a contention-based manner.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multiple BSSs use independent contention-based access to random resource units, then each BSS can autonomously manage its own access, but channel occupation time increases and collision probability increases
Solution Approach 1:
The patent merges multiple independent BSS contention processes into a single coordinated contention framework. Stations from different BSSs participate in a unified contention mechanism where the AP coordinates random resource unit allocation across all BSSs simultaneously, reducing the need for repeated independent contention procedures and thereby decreasing overall channel occupation time.
Solution Approach 2:
The patent creates a universal contention mechanism that serves multiple BSSs simultaneously. A single trigger frame can initiate contention for stations from multiple BSSs, and the same random resource units can be allocated to stations from different BSSs in a coordinated manner, making the contention system multi-functional rather than requiring separate systems for each BSS.
2Adaptability or versatility
If multiple BSSs use independent contention-based access to random resource units, then each BSS maintains its own access control, but collision probability increases
Solution Approach 1:
The patent implements feedback mechanisms where the AP monitors contention outcomes across multiple BSSs and adjusts random resource unit allocation accordingly. The AP uses information from previous contention rounds to make informed decisions about which stations should be granted access in subsequent rounds, thereby reducing collision probability while maintaining independent BSS access control through coordinated management.
Solution Approach 2:
The patent employs preliminary actions by having the AP pre-coordinate random resource unit allocation before actual data transmission begins. The AP sends trigger frames that pre-allocate random resources to stations from multiple BSSs in a coordinated manner, preventing collisions before they occur rather than resolving them after independent contention attempts fail.
3Ease of operation
If traditional CSMA/CA is used for uplink access, then simple access procedure is maintained, but channel efficiency decreases in dense deployments
Solution Approach 1:
The patent introduces dynamic elements to the access procedure while maintaining simplicity. The system dynamically allocates random resource units based on real-time network conditions, station buffers, and BSS configurations. The AP can adaptively adjust contention parameters, random resource unit sizes, and allocation strategies based on observed channel conditions, thereby improving channel efficiency without significantly complicating the access procedure for stations.
Solution Approach 2:
The patent changes key parameters of the access procedure to improve efficiency. Instead of fixed contention windows and random resource allocations, the system dynamically adjusts contention parameters, random resource unit sizes, and allocation patterns based on network conditions. This includes modifying contention window sizes, adjusting the number and distribution of random resources, and changing allocation strategies based on observed performance metrics.
Data Source
AI summary
The present invention relates to a wireless communication method in a wireless network comprising an access point and stations. The method comprises, at a station: receiving a trigger frame from the access point, the trigger frame reserving a transmission opportunity on at least one communication channel of the wireless network, the transmission opportunity including a random resource unit that the stations may access using a contention scheme; receiving parameters of the contention scheme in management frames from the access point, the parameters comprising a contention window range; contending access to the random resource unit of the transmission opportunity reserved by the received trigger frame, using a contention window value; and updating the contention window value based on the success or failure of the access to the random resource unit. The updated contention window value remains within the contention window range obtained from the most recently received contention scheme parameters.


