Methods and apparatus for priority-enhanced distributed channel access enhancement in wireless communications
The enhanced priority arbitration inter-frame space and virtual start time mechanisms address channel access imbalances and hidden node issues in P-EDCA, ensuring fair access and compliance with regulatory standards.
Patent Information
- Application Number
- PCT/CN2026/094765
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2025-05-06
- Filing Date
- 2026-05-06
- Publication Date
- 2026-11-12
AI Technical Summary
Existing priority-based channel access mechanisms in wireless communications, such as P-EDCA, lead to imbalances among communication devices, reducing access opportunities for non-priority devices and introducing fairness issues due to varying channel conditions and locations, which also affect compliance with regulatory requirements.
Implementing an enhanced priority arbitration inter-frame space (EP-AIFS) that adjusts based on channel access success, and using a virtual start time for aligned channel access attempts to mitigate fairness issues and hidden node problems, ensuring consistent timing across devices.
Enhances channel access fairness among devices with varying priorities and conditions, improving compliance with regulatory standards and reducing collisions, while maintaining priority-based transmission support.
Smart Images

Figure CN2026094765_12112026_PF_FP_ABST
Abstract
Description
METHODS AND APPARATUS FOR PRIORITY-ENHANCED DISTRIBUTED CHANNEL ACCESS ENHANCEMENT IN WIRELESS COMMUNICATIONSCROSS REFERENCE TO RELATED PATENT APPLICATION
[0001] The present disclosure is part of a non-provisional patent application claiming the priority benefit of U.S. Provisional Patent Application No. 63 / 800,517, filed 6 May 2025, the content of which being incorporated by reference in its entirety.TECHNICAL FIELD
[0002] The present disclosure is generally related to wireless communications and, more particularly, to priority-enhanced distributed channel access (P-EDCA) enhancement in wireless communications.BACKGROUND
[0003] Unless otherwise indicated herein, approaches described in this section are not prior art to the claims listed below and are not admitted as prior art by inclusion in this section.
[0004] In a wireless communication system, such as a wireless local area network (WLAN) , multiple communication devices may access a shared wireless medium. To support distributed access, contention-based channel access mechanisms are commonly employed, allowing the communication devices to access the shared medium at different times. Such mechanisms are typically based on random backoff procedures to distribute channel access opportunities among the devices.
[0005] In some scenarios, some communication devices may need to support traffic with higher priority or more stringent latency requirements. Accordingly, priority-based channel access mechanisms may be introduced to enable the communication devices to obtain higher access priority during channel contention. In such mechanisms, control signaling or other techniques may be used to increase the likelihood that a particular communication device acquires a channel access opportunity.
[0006] However, in a shared medium environment, the introduction of priority-based access mechanisms may lead to an imbalance among communication devices. For example, devices with higher priority may repeatedly gain access to the medium, thereby reducing access opportunities for other devices. Additionally, due to differences in channel conditions or device locations, communication devices may experience different probabilities of successfully accessing the medium, which may further affect overall access balance.
[0007] Accordingly, there is a need for improved channel access mechanisms in wireless communications that can support priority-based transmission while enhancing coordination among multiple communication devices.SUMMARY
[0008] The following summary is illustrative only and is not intended to be limiting in any way. That is, the following summary is provided to introduce concepts, highlights, benefits and advantages of the novel and non-obvious techniques described herein. Select implementations are further described below in the detailed description. Thus, the following summary is not intended to identify essential features of the claimed subject matter, nor is it intended for use in determining the scope of the claimed subject matter.
[0009] An objective of the present disclosure is to provide schemes, concepts, designs, techniques, methods and apparatuses pertaining to priority-enhanced distributed channel access (P-EDCA) enhancement in wireless communications. Under various proposed schemes in accordance with the present disclosure, it is believed that the aforementioned issues may be addressed or otherwise alleviated.
[0010] In one aspect, a method may involve contending, by a device, for channel access after an enhanced priority arbitration inter-frame space (EP-AIFS) based on a distributed channel access procedure. The method may also involve increasing, by the device, the EP-AIFS in response to a success in contending for channel access. The increased EP-AIFS may be used by the device for a next contention for channel access.
[0011] In another aspect, a method may involve determining, by a device, a virtual start time. The method may also involve transmitting, by the device, an enhanced priority control frame for contending for a transmission opportunity (TXOP) on a shared wireless medium at a slot boundary based on the virtual start time. The virtual start time may correspond to an end time of a previous TXOP prior to the TXOP on the shared wireless medium.
[0012] In another aspect, a device may include a transceiver configured to communicate wirelessly with another device and a processor communicatively coupled to the transceiver. The processor, during operation, may perform operations comprising contending for channel access after an enhanced priority arbitration inter-frame space (EP-AIFS) based on a distributed channel access procedure. The processor, during operation, may also perform operations comprising increasing the EP-AIFS in response to a success in contending for channel access. The increased EP-AIFS may be used by the device for a next contention for channel access.
[0013] The methods disclosed in the present application are applicable to a non-AP STA and / or an AP contending for a TXOP.
[0014] It is noteworthy that, although description provided herein may be in the context of certain radio access technologies, networks and network topologies such as Wi-Fi, the proposed concepts, schemes and any variation (s) / derivative (s) thereof may be implemented in, for and by other types of radio access technologies, networks and network topologies such as, for example and without limitation, Bluetooth, ZigBee, 5th Generation (5G) / New Radio (NR) , Long-Term Evolution (LTE) , LTE-Advanced, LTE-Advanced Pro, Internet-of-Things (IoT) , Industrial IoT (IIoT) and narrowband IoT (NB-IoT) . Thus, the scope of the present disclosure is not limited to the examples described herein.BRIEF DESCRIPTION OF THE DRAWINGS
[0015] The accompanying drawings are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of the present disclosure. The drawings illustrate implementations of the disclosure and, together with the description, serve to explain the principles of the disclosure. It is appreciable that the drawings are not necessarily in scale as some components may be shown to be out of proportion than the size in actual implementation to clearly illustrate the concept of the present disclosure.
[0016] FIG. 1 is a diagram of an example network environment in which various solutions and schemes in accordance with the present disclosure may be implemented.
[0017] FIG. 2 is a diagram of an example scenario in accordance with the present disclosure.
[0018] FIG. 3 is a diagram of an example scenario in accordance with the present disclosure.
[0019] FIG. 4 is a diagram of an example scenario in accordance with the present disclosure.
[0020] FIG. 5 is a diagram of an example scenario in accordance with the present disclosure.
[0021] FIG. 6 is a diagram of an example scenario in accordance with the present disclosure.
[0022] FIG. 7 is a diagram of an example scenario in accordance with the present disclosure.
[0023] FIG. 8 is a block diagram of an example communication system in accordance with an implementation of the present disclosure.
[0024] FIG. 9 is a flowchart of an example process in accordance with an implementation of the present disclosure.
[0025] FIG. 10 is a flowchart of an example process in accordance with an implementation of the present disclosure. DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS
[0026] Detailed embodiments and implementations of the claimed subject matters are disclosed herein. However, it shall be understood that the disclosed embodiments and implementations are merely illustrative of the claimed subject matters which may be embodied in various forms. The present disclosure may, however, be embodied in many different forms and should not be construed as limited to the exemplary embodiments and implementations set forth herein. Rather, these exemplary embodiments and implementations are provided so that description of the present disclosure is thorough and complete and will fully convey the scope of the present disclosure to those skilled in the art. In the description below, details of well-known features and techniques may be omitted to avoid unnecessarily obscuring the presented embodiments and implementations. Overview
[0027] Implementations in accordance with the present disclosure relate to various techniques, methods, schemes and / or solutions pertaining to P-EDCA enhancement in wireless communications. According to the present disclosure, a number of possible solutions may be implemented separately or jointly. That is, although these possible solutions may be described below separately, two or more of these possible solutions may be implemented in one combination or another.
[0028] In a wireless communication system, such as a wireless local area network (WLAN) , enhanced distributed channel access (EDCA) employs a random backoff mechanism to distribute channel access opportunities among different devices over time in a shared medium. In EDCA, each station (STA) selects a random backoff value within a contention window and transmits when the backoff counter reaches zero. This mechanism enables multiple STAs to contend for the medium in a distributed manner and provides probabilistic fairness among devices.
[0029] In some scenarios, a priority-based channel access mechanism, such as priority enhanced distributed channel access (P-EDCA) , is introduced to support low-latency or high-priority traffic. In P-EDCA, a STA may transmit a control signal, such as a request-to-send (RTS) frame, a clear-to-send (CTS) frame, or other control frames, to initiate channel access. The transmission of such control signals may form a protected contention period, thereby increasing the likelihood that the transmitting STA acquires a transmission opportunity (TXOP) .
[0030] However, in some scenarios, the use of P-EDCA may introduce fairness concerns in the shared medium. For example, when a STA uses P-EDCA to transmit low-latency or high-priority traffic, the STA may repeatedly obtain channel access with higher priority than legacy STAs using EDCA. As a result, the P-EDCA STA may dominate channel occupancy, thereby reducing channel access opportunities for non-P-EDCA STAs.
[0031] In some scenarios, fairness issues may also arise among multiple STAs using P-EDCA. When multiple STAs transmit control signals simultaneously, an AP may receive the control signals with different received signal strength indicator (RSSI) levels. For example, a control signal transmitted by a STA located closer to the AP may be received with a higher RSSI, while a control signal transmitted by a STA located farther from the AP may be received with a lower RSSI. In such cases, a control signal with a higher RSSI may dominate or overwrite a control signal with a lower RSSI at the AP, and thus the STA located closer to the AP may have a higher probability of successfully acquiring a TXOP, while the farther STA may repeatedly fail to acquire the TXOP.
[0032] In some implementations, channel access mechanisms are required to satisfy regulatory or standard requirements, such as the idle period assessment requirement defined in European Telecommunications Standards Institute (ETSI) Broadband Radio Access Networks (BRAN) Harmonized Standards. For example, each cumulative probability p (n) of all idle periods prior to transmissions recorded in a corresponding bin may be required not to exceed a maximum probability threshold. However, when P-EDCA is enabled, control signals transmitted prior to each low-latency transmission may be part of a frame exchange sequence, which may affect the distribution of idle periods and cause the cumulative distribution function (CDF) to exceed the specified requirement.
[0033] In some implementations, the use of P-EDCA may be subject to certain conditions, such as requiring a STA to experience one or more unsuccessful transmission attempts before enabling higher-priority channel access. In such cases, additional delay may be introduced before the STA can utilize the priority mechanism. For delay-sensitive traffic, such delay may reduce the effectiveness of P-EDCA and may result in increased latency or packet loss.
[0034] In some scenarios, this application addresses channel access fairness issues associated with P-EDCA. In particular, channel access fairness issues may arise between STAs supporting low-latency (LL) traffic and STAs not supporting low-latency traffic, as well as among STAs with different channel conditions, such as near STAs and far-away STAs. This application aims to improve channel access fairness under such scenarios. In some scenarios, this application further addresses hidden node issues among STAs operating with P-EDCA. Due to differences in channel visibility and timing perception, multiple STAs may attempt channel access at misaligned time instances, which may result in undecodable collisions or unfair access opportunities. This application aims to improve channel access coordination among such STAs.
[0035] In some implementations, this application provides an enhanced priority EDCA (EP-EDCA) mechanism to address multiple issues in channel access. For example, the proposed mechanism may improve fairness between low-latency and non-low-latency transmissions, improve fairness among STAs with different channel conditions, and facilitate compliance with regulatory or standard requirements, such as idle period assessment requirements defined in ETSI BRAN specifications. In some implementations, this application further provides a timing alignment mechanism based on a virtual start time. Such a mechanism may be used to align transmissions of an enhanced priority control frame for contending for a transmission opportunity (TXOP) on a shared wireless medium among multiple STAs, thereby mitigating hidden node issues and improving coordination in channel access among STAs. In summary, this application aims to provide mechanisms that, while supporting priority-based channel access, reduce negative impacts on fairness among STAs and improve channel access coordination in a shared wireless medium. In some implementations in this application, STA may directly use EP-EDCA without experiencing one or more unsuccessful channel access attempts before using EP-EDCA.
[0036] FIG. 1 illustrates an example network environment 100 in which various solutions and schemes in accordance with the present disclosure may be implemented. FIG. 2 ~ FIG. 10 illustrate examples of implementation of various proposed schemes in network environment 100 in accordance with the present disclosure. The following description of various proposed schemes is provided with reference to FIG. 1 ~ FIG. 10.
[0037] Referring to FIG. 1, network environment 100 may involve at least a device 110 and a device 120 that may be communicating wirelessly with each other in accordance with one or more IEEE 802.11 standards (e.g., IEEE 802.11bn) . Each of device 110 (herein interchangeably denoted as “device 1” ) and device 120 (herein interchangeably denoted as “device 2” ) may function as an AP or a non-AP STA (hereinafter referred to as “a STA” for brevity) . Moreover, each of device 110 and device 120 may perform P-EDCA enhancement operations. Under various proposed schemes in accordance with the present disclosure, device 110 and device 120 may be configured to perform P-EDCA enhancement operations with at least one of fairness adjustment, timing alignment, and slot-aligned transmission in wireless communications in accordance with various proposed schemes described below.
[0038] Under a first proposed scheme in accordance with the present disclosure with respect to enhanced priority channel access, a STA may determine an enhanced arbitration inter-frame space (EP-AIFS) , and contend for channel access after EP-AIFS based on a distributed channel access procedure, and may update the EP-AIFS used for a subsequent contention for channel access in response to a success in contending for channel access. The success in contending for channel access means that the STA obtains a TXOP. In some implementations, when the STA obtains the TXOP, the STA may increase the EP-AIFS by adding M × aSlotTime to the EP-AIFS, where M is a parameter value. The parameter value may be determined by the STA to dynamically adjust a channel access priority. Because the EP-AIFS is increased, a subsequent channel access by the STA is performed with a reduced priority relative to other STAs. A failure in contending for channel access means the STA fails to obtain the TXOP. In some implementations, when the STA fails to obtain the TXOP, the STA may maintain the EP-AIFS or decrease the EP-AIFS, thereby maintaining or increasing a priority for a subsequent channel access. In some implementations, the mechanism may be applied by a STA and / or an AP, such that either the STA or the AP may update the EP-AIFS.
[0039] Under a second proposed scheme in accordance with the present disclosure with respect to channel access timing alignment, a STA may determine a virtual start time for contending for channel access. In some implementations, the STA may align transmission of an enhanced priority control frame for contending for a TXOP to a slot boundary based on the virtual start time. The virtual start time corresponds to an end time of a previous transmission opportunity (TXOP) that precedes the TXOP on a shared wireless medium. In some implementations, the virtual start time may correspond to an end time of a network allocation vector (NAV) associated with the previous TXOP. The NAV may be set based on a duration field in a frame transmitted by an AP during the previous TXOP. The slot boundary may follow an EP-AIFS starting from the virtual start time. By using the virtual start time as a common timing reference, multiple STAs may align transmissions of enhanced priority control frames for contending for channel access. The second proposed scheme in accordance with the present disclosure can also be applied to an inter-frame space (AIFS) for a P-EDCA procedure, and the slot boundary may follow the AIFS starting from the virtual start time.
[0040] Under a second proposed scheme in accordance with the present disclosure, in some implementations, for addressing hidden node scenarios, STAs may determine channel access attempt timing based on timing information indicated by an AP. For example, a STA may use a duration value indicated by the AP in a frame during a previous TXOP that precedes a TXOP which the STA will contend for as a reference for determining the virtual start time. In some implementations, the duration value may be carried in a medium access control protocol data unit (MPDU) transmitted from the AP in the previous TXOP and may indicate a remaining duration of the previous TXOP from the MPDU to an end of the previous TXOP. In some implementations, channel access attempt timing by different STAs may be aligned to a common slot boundary based on the timing information indicated by the AP, such that misalignment due to different channel observations among STAs may be mitigated.
[0041] FIG. 2 is a diagram of an example scenario 200 in accordance with the present disclosure. The example scenario 200 illustrates a basic service set (BSS) network comprising an AP, e.g., AP1, and a plurality of STAs, including STA11, STA12, and STA13. In some scenarios, STA11 and STA12 are within communication range of each other, and thus can detect transmissions from one another. In contrast, STA13 may be outside a communication range of STA11 and STA12, and may operate as a hidden node with respect to STA11 and STA12. In some scenarios, STA12 is located closer to AP1 than STA11 and, therefore, AP1 may experience a stronger received signal strength from STA12 compared to STA11. As a result, STA12 may have a higher likelihood of successfully accessing a wireless medium than STA11 under certain channel access attempt conditions. In some implementations, the example scenario 200 shown in FIG. 2 may represent a network model that captures both near-far fairness issues and hidden node issues. For example, STA11 and STA12 may experience different channel access success probabilities due to their relative positions with respect to AP1, while STA13 may introduce hidden node effects that impact channel access coordination among the STAs. In some scenarios, due to the hidden node condition, STA11 and STA12 may not be able to detect the last frame transmitted by STA13, such as a block acknowledgment (BA) frame, using physical carrier sensing (PHY CCA) . In a second proposed scheme in accordance with the present disclosure, STA11 and STA12 may determine a channel idle timing based on a network allocation vector (NAV) rather than an actual frame transmission end time detected by CCA. In some implementations, the network model illustrated in FIG. 2 may be used to describe or evaluate mechanisms for improving channel access fairness and coordination among multiple STAs in a shared wireless medium.
[0042] Under a first proposed scheme in accordance with the present disclosure with respect to enhanced priority channel access, in some scenarios, a fairness mechanism is introduced to dynamically adjust a channel access priority of a STA by using a parameter value, e.g., a parameter M. The parameter may be determined by the STA itself. In some implementations, the parameter may be used to reduce a priority of a STA that has successfully acquired a TXOP, while maintaining or increasing a priority of a STA that fails to acquire the TXOP.
[0043] Under a first proposed scheme in accordance with the present disclosure with respect to enhanced priority channel access, in some scenarios, an enhanced arbitration inter-frame space (EP-AIFS) is used to represent a channel access priority. In some implementations, the EP-AIFS lowest boundary may be determined based on an arbitration inter-frame space number (AIFSN) , such that: EP-AIFS lowest boundary = AIFSN × aSlotTime + aSIFSTime, wherein aSlotTime corresponds to a slot time, and aSIFSTime corresponds to a short inter-frame space (SIFS) time. The EP-AIFS may be adjusted based on a previous EP-AIFS for previous contention for channel access and whether the previous contention for channel access is successful. In some scenarios, after a station (STA) successfully gains channel access (i.e., successfully acquires a transmission opportunity (TXOP) ) , the STA may increase the EP-AIFS, such that: the increased EP-AIFS = EP-AIFS + M × aSlotTime, where M is a parameter value, M is an integer larger than 0, and the increased EP-AIFS satisfies: the increased EP-AIFS < (AIFSN + EP-CW) × aSlotTime + aSIFSTime, where EP-CW may correspond to a contention window value. In other words, (AIFSN + EP-CW) × aSlotTime + aSIFSTime is the upper boundary of EP-AIFS. In some implementations, when the STA does not gain channel access (i.e., does not acquire the TXOP) , the STA may decrease the EP-AIFS, such that the decreased EP-AIFS = EP-AIFS -N × aSlotTime, where N is a parameter value greater than or equal to 1, wherein the decreased EP-AIFS is not smaller than the EP-AIFS lowest boundary (i.e., AIFSN × aSlotTime + aSIFSTime) . In some implementations, an arbitration inter-frame space number (AIFSN) may be configured the same or differently for AP-initiated channel access and STA-initiated channel access. In some implementations, an initial EP-AIFS may be configured with a relatively high priority, such that a STA may have a high likelihood of accessing a shared medium when competing with legacy STAs. For example, the initial EP-AIFS = AIFSN × aSlotTime + aSIFSTime. For example, when a STA contends for channel access a first time, the initial EP-AIFS is used. In the event that STA gains channel access, the STA may adjust the EP-AIFS, wherein the adjusted EP-AIFS = EP-AIFS + M ×aSlotTime. When the STA contends for channel access a second time, the adjusted EP-AIFS is used. In some implementations, the mechanism may be applied by a STA and / or an AP, such that either the STA or the AP may determine and update the EP-AIFS.
[0044] In some scenarios, when a STA successfully acquires a TXOP using an enhanced distributed channel access procedure, the STA may update the EP-AIFS by increasing the EP-AIFS with M aSlotTimes, wherein M is an integer larger than 0. In such cases, the STA may perform a subsequent channel access contention with a reduced priority relative to other STAs. As a result, channel access opportunities may be distributed to other STAs fairly.
[0045] In some scenarios, when a STA fails to acquire a TXOP, the STA may maintain the same EP-AIFS or decrease the EP-AIFS. In some implementations, decreasing the EP-AIFS may increase the likelihood that the STA successfully acquires a TXOP in a subsequent channel access contention. This mechanism may allow STAs that repeatedly fail in channel access contention to improve their chances of success.
[0046] In some implementations, the parameter value used for updating the EP-AIFS may be determined locally by the STA and / or the AP. For example, the parameter value may be selected based on a current legacy backoff state, such as a remaining value of a backoff counter used in a legacy enhanced distributed channel access procedure at the time that an EP-EDCA procedure is being initiated, or may be determined based on other criteria. In some implementations, the parameter value may also be selected within a range associated with a contention window. The remaining value of the backoff counter is a legacy EDCA counter backoff status just before the STA starts the EP-EDCA and sends the enhanced priority control frame for contending for a TXOP. So, the STA may assign the remaining value of the backoff counter to M for updating EP-AIFS after the STA acquires the TXOP.
[0047] In some scenarios, different types of enhanced priority control frames may be used in the enhanced channel access procedure. For example, an enhanced priority control frame (EP-CTL) may include a request-to-send (RTS) frame, a clear-to-send (CTS) frame, or other control frame formats. In some implementations, when an RTS frame is used, a collision may be detected when a corresponding CTS response is not received, and the STA may perform a retransmission procedure. In some implementations, when a CTS frame is used, the CTS frame may first form a protected contention period to allow the STA to continue channel access contention, and meanwhile to block other STAs contending for the channel.
[0048] In some scenarios, a frame exchange sequence based on EP-EDCA may be performed among one or more STAs, such as STA1, STA2, or STA3, and an AP, such as AP1. In such scenarios, the STAs may be EP-EDCA capable and enabled, and the AP may also be EP-EDCA capable and enabled. In some implementations, the AP may control the enablement or disablement of EP-EDCA for the STAs, as well as configure EDCA parameters associated with EP-EDCA operation. In some implementations, EDCA parameters used by a control frame in EP-EDCA, such as an EP-CTL frame, may include an AIFSN. For example, AIFSN may be set to 1 for the AP and 2 for a STA. In some implementations, EDCA parameters used by a control frame in EP-EDCA, such as an EP-CTL frame, may include an EP-AIFS. The EP-AIFS may be adjusted based on a previous EP-AIFS and whether the previous contention for channel access is successful as shown in the above description.
[0049] In some scenarios, EDCA parameters configured comprise a duration value in a duration field in the EP-CTL frame. The duration value in the duration field in the EP-CTL frame may be determined based on a transmission rate of a subsequent control frame and a contention window value (EP-CW) . In some implementations, a transmission rate of the subsequent control frame, such as an RTS frame, a buffer status report poll (BSRP) frame, or other control frames transmitted during a protected contention period indicated by the duration value, may be set to a predetermined data rate, such as 6 Mbps or another data rate.
[0050] In some implementations, EDCA parameters configured comprise parameters used by the subsequent control frame transmitted during the protected contention period, wherein the parameters may include an AIFS, a contention window value between a minimum contention window value (EP-CWmin) and a maximum contention window value (EP-CWmax) . In some scenarios, the EP-CTL frame used in EP-EDCA may correspond to different types of control frames. For example, the EP-CTL frame may include at least one of a RTS frame, a CTS frame, a BSRP frame, or another control frame format.
[0051] FIG. 3 is a diagram of an example scenario 300 in accordance with the present disclosure. In some scenarios, FIG. 3 illustrates an example frame exchange sequence based on enhanced priority channel access. When a shared wireless medium is idle, a STA may contend for channel access by transmitting an enhanced priority control frame (e.g., EP-CTS) after an EP-AIFS. In some implementations, there is a protected contention period corresponding to a time period indicated in a duration field of the EP-CTL, and the third party STAs will set NAV according to the time period if the EP-CTL frame is decoded correctly and does not contend for channel access during the protected contention period. A subsequent control frame, such as an RTS or BSRP frame, may be transmitted after the backoff time following an AIFS. Upon successful contention, a TXOP may be obtained, followed by frame exchanges such as data transmission and block acknowledgment (BA) or Multi-STA Block Ack (MSBA) .
[0052] FIG. 4 is a diagram of an example scenario 400 in accordance with the present disclosure. In some scenarios, FIG. 4 illustrates example channel access procedures under different cases. In Part A of FIG. 4, a STA may transmit an enhanced priority control frame (e.g., EP-RTS) after an EP-AIFS when a channel becomes idle. Upon successful transmission and reception of a corresponding response (e.g., CTS) from an AP, the STA acquires a TXOP and performs frame exchanges with the AP, including data frames transmitted by the STA and BA or Multi-STA Block Ack (MSBA) transmitted by the AP. In some scenarios, Part B of FIG. 4 illustrates a case in which multiple STAs attempt to access a channel using enhanced priority control frames. For example, an EP-RTS transmitted by one STA may collide with another transmission, resulting in a failed contention. In some implementations, a timeout associated with the enhanced priority control frame (EP-CTL) may occur when a response is not received. Subsequently, one or more STAs may attempt retransmission of EP-RTS after the time of an EP-AIFS or the time of an AIFS plus backoff, and a STA that successfully receives a CTS may acquire a TXOP. In response to acquiring the TXOP, the STA may proceed with frame exchanges with the AP, including data frames transmitted by the STA and BA or Multi-STA Block Ack (MSBA) transmitted by the AP.
[0053] In some implementations, the example scenarios illustrated in FIG. 3 and FIG. 4 may be used to describe channel access behaviors, including protected contention, collision handling, and retransmission mechanisms under enhanced priority channel access.
[0054] In some scenarios, a STA may initiate an enhanced priority channel access procedure by transmitting an EP-CTL after an EP-AIFS. After transmitting the EP-CTL, if the STA receives a CTS from the AP, the STA successfully acquires the TXOP. In some scenarios, when the STA successfully acquires the TXOP for transmission, a priority update may be performed. For example, the STA may increase the EP-AIFS by adding M× aSlotTime for a subsequent channel access using EP-EDCA. In some implementations, the parameter value M may be equal to 1, a contention window value-1 or another value, and an updated EP-AIFS may satisfy a condition that the updated EP-AIFS is less than (AIFSN + EP-CW) × aSlotTime + aSIFSTime. By increasing the EP-AIFS after successfully acquiring the TXOP for transmission, a priority of the STA for subsequent channel access may be reduced, thereby allowing other STAs to contend for channel access.
[0055] In some scenarios, when the STA fails to acquire the TXOP using the EP-CTL, a different priority update behavior may be applied. For example, the STA may continue using the same EP-AIFS value for a subsequent channel access procedure. In some implementations, when the EP-AIFS is greater than AIFSN× aSlotTime + aSIFSTime, the STA may decrease the EP-AIFS by N aSlotTime (e.g., N=1, EP-AIFS = EP-AIFS –aSlotTime) before initiating another EP-EDCA procedure in a next channel access procedure, wherein the decreased EP-AIFS is not smaller than the EP-AIFS lowest boundary (i.e. AIFSN × aSlotTime + aSIFSTime) . For example, when the EP-AIFS is greater than aSIFSTime + AIFSN × aSlotTime, the EP-AIFS is decreased by one slot time. Such behavior may maintain or increase the priority of the STA in subsequent channel access attempts.
[0056] In some scenarios, a second scheme is provided to address channel access attempt timing misalignment issues in an EP-EDCA procedure. For example, the scheme may address a hidden node problem, inconsistent determination of a medium idle starting time among different STAs, and misalignment of transmission timing of EP-CTL, which may otherwise lead to undecodable collisions or unfair channel access. In some scenarios, a virtual start time may be introduced. The virtual start time may serve as a common timing reference for EP-EDCA STAs to contend for channel access. In some implementations, the virtual start time may be used to determine subsequent slot boundaries for transmitting the EP-CTL frames, such that multiple STAs may transmit EP-CTL frames based on a same timing reference. Compared to existing approaches that rely on physical CCA, the virtual start time may provide a unified timing basis. In the existing approaches, channel access relies solely on physical CCA; several issues may arise. For example, in a hidden node scenario, some STAs may not be able to detect certain transmissions by physical CCA. As a result, different STAs may obtain different medium busy ending times. This may cause EP-CTL transmissions from different STAs to occur at different time instants. The second scheme proposed in the application may avoid this issue by using the virtual start time. In some implementations, the virtual start time may correspond to an end time of a network allocation vector (NAV) associated with the previous TXOP. The NAV may be set based on duration information in a duration field in a frame transmitted by an AP during the previous TXOP. The duration information may be carried in a medium access control (MAC) header, such as a duration field of a MAC header in the frame transmitted by the AP, wherein the duration information may indicate a remaining duration of the TXOP from the frame to an end of the TXOP. Compared to physical layer indications, MAC-layer duration information may provide a more accurate and consistent timing reference across multiple STAs.
[0057] In some scenarios, one or more frames transmitted by the AP may comprise at least one of a control frame and a data frame. Each of one or more frames may carry duration information indicating a remaining duration of the TXOP from the corresponding frame to an end of the TXOP, so the virtual start time may be set or updated. In some embodiments, STAs may set a NAV based on the duration information in the last frame (i.e., the duration information in the last frame transmitted by the AP in the TXOP) and use an end time of the NAV as the virtual start time. In this manner, multiple STAs may share a consistent timing reference for subsequent channel access attempts. In some implementations, after determining the virtual start time, each STA may align a transmission timing of the EP-CTL to a slot boundary based on the virtual start time, wherein the slot boundary follows the EP-AIFS starting from the virtual start time. As a result, EP-CTL transmissions from multiple STAs may occur at a common slot boundary. In some scenarios, when there is a conflict between a physical CCA-based determination and the slot boundary based on the virtual start time, the STA may prioritize the slot boundary based on the virtual start time. In this manner, the STAs may rely on a consistent timing reference rather than independent physical sensing. In some scenarios, in a hidden node condition, the last frame of a previous TXOP may be transmitted by a STA that is not detectable by other STAs. In such cases, if each STA relies on locally detected frame ending times by using CCA, different STAs may have inconsistent interpretations of a TXOP ending time, resulting in misaligned channel access attempt timing. Therefore, using duration information in the last frame transmitted by the AP as a primary reference may allow EP-CTL transmissions from multiple STAs to be more consistently aligned. In some implementations, the scheme may primarily involve STA-side behavior. The AP may support EP-EDCA operation and provide or update timing information, such as duration information, to serve as a timing reference. However, priority updates, parameter determination, and slot-boundary-based transmission behaviors may be performed by the STAs.
[0058] The second scheme, which is provided to address channel access attempt timing misalignment issues in the EP-EDCA procedure, may be applied to example scenarios in FIG. 3 and FIG. 4.
[0059] FIG. 5 is a diagram of an example scenario 500 in accordance with the present disclosure. In some scenarios, FIG. 5 illustrates an example of channel access attempt alignment in an EP-EDCA procedure. An EP-CTL, such as a CTS frame, a RTS frame, or another control frame format with specific parameter settings, may be used for a channel access attempt. In this embodiment, STA 11 and STA 12 may receive the last frame transmitted by the AP in a TXOP, and set NAV based on duration information in a duration field in the last frame. The STA 11 and STA 12 set a virtual start time based on the NAV, wherein the virtual start time corresponds to an end time of the NAV. The STA 11 and STA 12 may transmit the EP-CTL at a slot boundary when a channel is detected to be idle, wherein the slot boundary follows the EP-AIFS starting from the virtual start time. In some alternative implementations, the EP-CTL may be transmitted at a slot boundary corresponding to a time offset of (EP-AIFS -aSlotTime) from the virtual start time when the channel is detected to be idle, so as to align transmissions of the STA 11 and STA 12 to the slot boundary. In some implementations, the virtual start time may be adjusted or indicated by the AP through duration information carried in the last frame transmitted by the AP in the TXOP, wherein the TXOP is a previous TXOP of the slot boundary. By using the virtual start time and the slot boundary, transmissions of EP-CTL from STA 11 and STA 12 may be aligned.
[0060] In some scenarios, a protected contention period may correspond to a time period indicated in a duration field of the EP-CTL. In some implementations, one or more third-party STAs may set a NAV according to the time period when the EP-CTL is successfully decoded. In some scenarios, multiple STAs, such as STA11 and STA12, may transmit EP-CTL frames after the EP-AIFS from the virtual start time and then perform random backoff within the protected contention period. In some scenarios, when a STA (e.g., STA12) successfully receives a CTS, the STA (e.g., STA12) acquires a TXOP, and a priority update may be performed. For example, the STA may increase the EP-AIFS by adding M × aSlotTime to the EP-AIFS for a subsequent channel access attempt using EP-EDCA. In some implementations, M is an integer larger than 0, M may be equal to 1 or another value, and an updated EP-AIFS satisfies a condition: the updated EP-AIFS < (AIFSN + EP-CW) × aSlotTime + aSIFSTime, wherein the EP-CW is a contention window value (EP-CW) . In some scenarios, when a STA (e.g., STA11) fails to acquire a TXOP using the EP-CTL, the STA may continue using the same EP-AIFS value. In some implementations, when a STA (e.g., STA11) fails to receive a CTS, the STA (e.g., STA11) fails to acquire a TXOP, and when the EP-AIFS is greater than AIFSN × aSlotTime + aSIFSTime, the STA may decrease the EP-AIFS by one aSlotTime (EP-AIFS = EP-AIFS -aSlotTime) and initiate another EP-EDCA procedure in a subsequent channel access.
[0061] FIG. 6 is a diagram of an example scenario 600 in accordance with the present disclosure. In some scenarios, FIG. 6 illustrates an example of an aligned channel access attempt to a slot boundary in an EP-EDCA procedure. An AP, such as AP1, may act as a TXOP holder and perform frame exchanges with a STA, such as STA13. During the frame exchanges, the AP1 may transmit a data frame, and the STA13 receives the data frame and transmits a BA to the AP1. During the frame exchanges, one or more other STAs, such as STA11 and STA12, may set a NAV to protect the transmissions between AP1 and STA13. In this embodiment, STA 11 and STA 12 may receive the last frame transmitted by the AP in the TXOP, and set NAV based on duration information in a duration field in the last frame. The STA 11 and STA 12 set a virtual start time based on the NAV, wherein the virtual start time corresponds to an end time of the NAV. Because of hidden node issues, a STA such as STA 11 and / or STA 12 cannot hear a BA from STA 13. For obtaining a consistent timing for transmitting the EP-CTL, the STA 11 and STA 12 set NAV based on duration information in a duration field in the last frame transmitted from the AP. In some implementations, the last frame is an MPDU transmitted from the AP, and the MPDU may be a data frame transmitted from the AP. Due to a potential different end times of the TXOP observed by different STAs, EP-CTLs from STA11 and STA12 may not be naturally aligned in time if using the end time of the TXOP determined by CCA. After a channel becomes idle or the NAV expires, STAs such as STA11 and STA12 may perform clear channel assessment (CCA) at an EP-AIFS. In some implementations, to achieve alignment of EP-CTL transmissions, STAs such as STA11 and STA12 may transmit an EP-CTL at the slot boundary after the EP-AIFS. In some scenarios, when a STA such as STA12 successfully receives a CTS, the STA such as STA2 acquires a TXOP, and the STA such as STA12 may update an EP-AIFS for a subsequent channel access contention, such that the STA such as STA12 lowers its priority for a subsequent channel access. In some implementations, a STA such as STA11 that does not receive a CTS, the STA such as STA11 does not acquire the TXOP and may continue using the same EP-AIFS value for transmitting an EP-CTL for a subsequent channel access contention. The STA such as STA11 may transmit an EP-CTL at a slot boundary after the EP-AIFS and perform backoff for medium contention.
[0062] FIG. 7 is a diagram of an example scenario 700 in accordance with the present disclosure. In some scenarios, FIG. 7 illustrates an example of an aligned channel access attempt to a slot boundary in an EP-EDCA procedure. At an initial stage, a STA such as STA13 may act as a TXOP holder and communicate with an AP, such as AP1. During the frame exchange, the STA such as STA13 may transmit a data frame to the AP, and the AP may transmit a BA. During or after the frame exchange, other STAs, such as STA11 and STA12, may receive the BA from the AP. In this embodiment, the last frame transmitted from the AP is the BA from the AP. In some scenarios, after a channel becomes idle or a NAV expires, STAs such as STA11 and STA12 may perform CCA at an EP-AIFS. STA11 and / or STA12 may transmit an EP-CTL at a slot boundary after the EP-AIFS, such that EP-CTL transmissions from multiple STAs are aligned. In some scenarios, a STA, such as STA12, that successfully acquires a TXOP after transmitting the EP-CTL may update an EP-AIFS to lower its priority for a subsequent channel access. A STA such as STA11 that does not acquire the TXOP may continue using the same EP-AIFS value for transmitting an EP-CTL in a subsequent channel access procedure. The STA, such as STA11, may transmit an EP-CTL at a slot boundary after the EP-AIFS and perform backoff for medium contention with other STAs, such as STA13. The STA, such as STA13, may transmit an EP-CTL at a slot boundary after an EP-AIFS starting from the virtual start time. In some scenarios, a STA, such as STA13, that successfully acquires a TXOP after transmitting the EP-CTL may update an EP-AIFS to lower its priority for a subsequent channel access. In some implementations, a STA such as STA11 that does not acquire the TXOP may continue using the same EP-AIFS value or the EP-AIFS minus one aSlotTime for transmitting an EP-CTL in a subsequent channel access procedure. Illustrative Implementations
[0063] FIG. 8 illustrates an example system 800 having at least an example device 810 and an example device 820 in accordance with an implementation of the present disclosure. Each of device 810 and device 820 may perform various functions to implement schemes, techniques, processes and methods described herein pertaining to P-EDCA enhancement in wireless communications, including the various schemes described above with respect to various proposed designs, concepts, schemes, systems and methods described above as well as processes described below. For instance, device 810 may be implemented in or as device 110 and device 820 may be implemented in or as device120, or vice versa.
[0064] Each of device 810 and device 820 may be a part of an electronic apparatus, which may be a non-AP STA or an AP, such as a portable or mobile apparatus, a wearable apparatus, a wireless communication apparatus or a computing apparatus. When implemented in a non-AP STA, each of device 810 and device 820 may be implemented in a smartphone, a smart watch, a personal digital assistant, a digital camera, or a computing equipment such as a tablet computer, a laptop computer or a notebook computer. Each of device 810 and device 820 may also be a part of a machine type apparatus, which may be an IoT apparatus such as an immobile or a stationary apparatus, a home apparatus, a wire communication apparatus or a computing apparatus. For instance, each of device 810 and device 820 may be implemented in a smart thermostat, a smart fridge, a smart door lock, a wireless speaker or a home control center. When implemented in or as a network apparatus, device 810 and / or device 820 may be implemented in a network node, such as an AP in a WLAN.
[0065] In the various schemes described above, each of device 810 and device 820 may be implemented in or as a non-AP STA or an AP. Each of device 810 and device 820 may include at least some of those components shown in FIG. 8 such as a processor 812 and a processor 822, respectively, for example. Each of device 810 and device 820 may further include one or more other components not pertinent to the proposed scheme of the present disclosure (e.g., internal power supply, display device and / or user interface device) , and, thus, such component (s) of device 810 and device 820 are neither shown in FIG. 8 nor described below in the interest of simplicity and brevity.
[0066] In one aspect, each of processor 812 and processor 822 may be implemented in the form of one or more single-core processors, one or more multi-core processors, one or more RISC processors or one or more CISC processors. That is, even though a singular term “a processor” is used herein to refer to processor 812 and processor 822, each of processor 812 and processor 822 may include multiple processors in some implementations and a single processor in other implementations in accordance with the present disclosure. In another aspect, each of processor 812 and processor 822 may be implemented in the form of hardware (and, optionally, firmware) with electronic components including, for example and without limitation, one or more transistors, one or more diodes, one or more capacitors, one or more resistors, one or more inductors, one or more memristors and / or one or more varactors that are configured and arranged to achieve specific purposes in accordance with the present disclosure. In other words, in at least some implementations, each of processor 812 and processor 822 is a special-purpose machine specifically designed, arranged and configured to perform specific tasks including those pertaining to P-EDCA enhancement in wireless communications in accordance with various implementations of the present disclosure.
[0067] In some implementations, device 810 may also include a transceiver 816 coupled to processor 812. Transceiver 816 may include a transmitter capable of wirelessly transmitting and a receiver capable of wirelessly receiving data or a control frame. In some implementations, device 820 may also include a transceiver 826 coupled to processor 822. Transceiver 826 may include a transmitter capable of wirelessly transmitting and a receiver capable of wirelessly receiving data or a control frame.
[0068] In some implementations, device 810 may further include a memory 814 coupled to processor 812 and capable of being accessed by processor 812 and storing data therein. In some implementations, device 820 may further include a memory 824 coupled to processor 822 and capable of being accessed by processor 822 and storing data therein. Each of memory 814 and memory 824 may include a type of random-access memory (RAM) such as dynamic RAM (DRAM) , static RAM (SRAM) , thyristor RAM (T-RAM) and / or zero-capacitor RAM (Z-RAM) . Alternatively, or additionally, each of memory 814 and memory 824 may include a type of read-only memory (ROM) such as mask ROM, programmable ROM (PROM) , erasable programmable ROM (EPROM) and / or electrically erasable programmable ROM (EEPROM) . Alternatively, or additionally, each of memory 814 and memory 824 may include a type of non-volatile random-access memory (NVRAM) such as flash memory, solid-state memory, ferroelectric RAM (FeRAM) , magnetoresistive RAM (MRAM) and / or phase-change memory.
[0069] Each of device 810 and device 820 may be a communication entity capable of communicating with each other using various proposed schemes in accordance with the present disclosure. For illustrative purposes and without limitation, a description of capabilities of device 810, as device 110 (e.g., an AP) , and device 820, as device 120 (e.g., a non-AP STA) , is provided below. It is noteworthy that, although the example implementations described below are provided in the context of WLAN, the same may be implemented in other types of networks.
[0070] Under a proposed scheme pertaining to P-EDCA enhancement in wireless communications in accordance with the present disclosure, with device 810 implemented in or as device 110 and device 820 implemented in or as device 120 in network environment 100 in accordance with one or more of IEEE 802.11 standards, processor 812 of device 810 may contend for channel access after an enhanced priority arbitration inter-frame space (EP-AIFS) based on a distributed channel access procedure. Processor 812 may increase the EP-AIFS in response to a success in contending for channel access. The increased EP-AIFS may be used by the device 810 for a next contention for channel access.
[0071] In some implementations, the step of increasing the EP-AIFS may comprise: adding M × aSlotTime, wherein M is an integer larger than 0, the increased EP-AIFS is less than (AIFSN +EP-CW) × aSlotTime + aSIFSTime, the AIFSN may be an arbitration inter-frame space number, aSlotTime may correspond to a slot time, aSIFSTime may correspond to a short inter-frame space (SIFS) time, and the EP-CW may correspond to a contention window value. In other words, (AIFSN + EP-CW) × aSlotTime + aSIFSTime is the upper boundary of EP-AIFS.
[0072] In some implementations, Processor 812 may maintain or decrease the EP-AIFS in response to a failure in contending for channel access. Processor 812 may decrease the EP-AIFS by subtracting one aSlotTime from the EP-AIFS in an event that the EP-AIFS is greater than AIFSN ×aSlotTime + aSIFSTime. The AIFSN may be an arbitration inter-frame space number, aSlotTime may correspond to a slot time, and aSIFSTime may correspond to a short inter-frame space (SIFS) time. Illustrative Processes
[0073] FIG. 9 illustrates an example process 900 in accordance with an implementation of the present disclosure. Process 900 may represent an aspect of implementing various proposed designs, concepts, schemes, systems and methods described above. More specifically, process 900 may represent an aspect of the proposed concepts and schemes pertaining to P-EDCA enhancement in wireless communications in accordance with the present disclosure. Process 900 may include one or more operations, actions, or functions as illustrated by one or more of blocks 910 and 920. Although illustrated as discrete blocks, various blocks of process 900 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks / sub-blocks of process 900 may be executed in the order shown in FIG. 9 or, alternatively in a different order. Furthermore, one or more of the blocks / sub-blocks of process 900 may be executed repeatedly or iteratively. Process 900 may be implemented by or in device 810 and device 820 as well as any variations thereof. Solely for illustrative purposes and without limiting the scope, process 900 is described below in the context of device 810 implemented in or as device 110 (e.g., AP or non-AP STA) and device 820 implemented in or as device 120 (e.g., non-AP STA or AP) of a wireless network such as a WLAN in network environment 100 in accordance with one or more of IEEE 802.11 standards. Process 900 may begin at block 910.
[0074] At 910, process 900 may involve processor 812 of device 810 contending for channel access after an enhanced priority arbitration inter-frame space (EP-AIFS) based on a distributed channel access procedure. Process 900 may proceed from 910 to 920.
[0075] At 920, process 900 may involve processor 812 increasing the EP-AIFS in response to a success in contending for channel access. The increased EP-AIFS may be used by the device 810 for a next contention for channel access. The next contention for channel access will be performed after the increased EP-AIFS.
[0076] In some implementations, the step of increasing the EP-AIFS may comprise: adding M × aSlotTime. M may be an integer larger than 0. In some implementations, the value is determined by the STA. In some implementations, the step of contending for channel access may comprise transmitting, by processor 812 via transceiver 816, an enhanced priority control frame to contend for a transmission opportunity (TXOP) . The M may be determined by processor 812 based on a remaining value of a backoff counter before processor 812, via transceiver 816, sends the enhanced priority control frame.
[0077] In some implementations, the increased EP-AIFS may be less than (AIFSN + EP-CW) × aSlotTime + aSIFSTime, the AIFSN may be an arbitration inter-frame space number, aSlotTime may correspond to a slot time, aSIFSTime may correspond to a short inter-frame space (SIFS) time, and the EP-CW may correspond to a contention window value. In some implementations, process 900 may further involve processor 812 maintaining or decreasing the EP-AIFS in response to a failure in contending for channel access. The maintained or decreased EP-AIFS may be used by the device 810 for a next contention for channel access. The next contention for channel access will be performed after the maintained or decreased EP-AIFS. In some implementations, processor 812 may decrease the EP-AIFS by subtracting one aSlotTime from the EP-AIFS in an event that the EP-AIFS is greater than AIFSN × aSlotTime + aSIFSTime. The AIFSN may be an arbitration inter-frame space number, aSlotTime may correspond to a slot time, and aSIFSTime may correspond to a short inter-frame space (SIFS) time.
[0078] In some implementations, the distributed channel access procedure may comprise a priority enhanced distributed channel access (P-EDCA) enhancement procedure, the step of contending for channel access may comprise transmitting, by processor 810 via transceiver 816, an enhanced priority control frame, and the enhanced priority control frame may comprise at least one of:a request-to-send (RTS) frame, a clear-to-send (CTS) frame, and a buffer status report poll (BSRP) frame. In some implementations, the enhanced priority control frame may comprise a duration field indicating a protected contention period, and during the protected contention period, other devices may be prohibited from contending for channel access.
[0079] In some implementations, a network allocation vector (NAV) may be set by one or more STAs based on the duration field in an event that the enhanced priority control frame is decoded. In some implementations, the success in contending for channel access may indicate processor 812 acquiring a transmission opportunity (TXOP) .
[0080] FIG. 10 illustrates an example process 1000 in accordance with an implementation of the present disclosure. Process 1000 may represent an aspect of implementing various proposed designs, concepts, schemes, systems and methods described above. More specifically, process 1000 may represent an aspect of the proposed concepts and schemes pertaining to P-EDCA enhancement in wireless communications in accordance with the present disclosure. Process 1000 may include one or more operations, actions, or functions as illustrated by one or more of blocks 1010 and 1020. Although illustrated as discrete blocks, various blocks of process 1000 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks / sub-blocks of process 1000 may be executed in the order shown in FIG. 10 or, alternatively in a different order. Furthermore, one or more of the blocks / sub-blocks of process 1000 may be executed repeatedly or iteratively. Process 1000 may be implemented by or in device 810 and device 820 as well as any variations thereof. Solely for illustrative purposes and without limiting the scope, process 1000 is described below in the context of device 810 implemented in or as device 110 (e.g., non-AP STA) and device 820 implemented in or as device 120 (e.g., AP) of a wireless network such as a WLAN in network environment 100 in accordance with one or more of the IEEE 802.11 standards. Process 1000 may begin at block 1010.
[0081] At 1010, process 1000 may involve processor 812 of device 810 determining a virtual start time. Process 1000 may proceed from 1010 to 1020.
[0082] At 1020, process 1000 may involve processor 812 transmitting, via transceiver 816, an enhanced priority control frame for contending for a transmission opportunity (TXOP) on a shared wireless medium at a slot boundary based on the virtual start time. The virtual start time may correspond to an end time of a previous TXOP prior to the TXOP on the shared wireless medium.
[0083] In some implementations, the virtual start time may correspond to an end time of a network allocation vector (NAV) associated with the previous TXOP. In some implementations, the NAV may be set by processor 812 based on a duration field of a frame transmitted by an access point (AP) in the previous TXOP, and the duration field may indicate a remaining duration of the previous TXOP. In some implementations, the slot boundary may follow an inter-frame space (AIFS) in a P-EDCA or an enhanced priority arbitration inter-frame space (EP-AIFS) starting from the virtual start time. In some implementations, the virtual start time may be used by multiple stations to align transmissions of the enhanced priority control frame of each station in the multiple stations.
[0084] In some implementations, processor 812 via transceiver 816 may transmit the enhanced priority control frame at the slot boundary following an enhanced priority arbitration inter-frame space (EP-AIFS) starting from the virtual start time in an event that the shared wireless medium is detected idle. In some implementations, the enhanced priority control frame may comprise a duration field indicating a protected contention period, and during the protected contention period, other devices may be prohibited from contending for channel access. Additional Notes
[0085] The herein-described subject matter sometimes illustrates different components contained within, or connected with, different other components. It is to be understood that such depicted architectures are merely examples, and that in fact many other architectures can be implemented which achieve the same functionality. In a conceptual sense, any arrangement of components to achieve the same functionality is effectively "associated" such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality can be seen as "associated with" each other such that the desired functionality is achieved, irrespective of architectures or intermedial components. Likewise, any two components so associated can also be viewed as being "operably connected" , or "operably coupled" , to each other to achieve the desired functionality, and any two components capable of being so associated can also be viewed as being "operably couplable" , to each other to achieve the desired functionality. Specific examples of operably couplable include but are not limited to physically mateable and / or physically interacting components and / or wirelessly interactable and / or wirelessly interacting components and / or logically interacting and / or logically interactable components.
[0086] Further, with respect to the use of substantially any plural and / or singular terms herein, those having skill in the art can translate from the plural to the singular and / or from the singular to the plural as is appropriate to the context and / or application. The various singular / plural permutations may be expressly set forth herein for sake of clarity.
[0087] Moreover, it will be understood by those skilled in the art that, in general, terms used herein, and especially in the appended claims, e.g., bodies of the appended claims, are generally intended as “open” terms, e.g., the term “including” should be interpreted as “including but not limited to, ” the term “having” should be interpreted as “having at least, ” the term “includes” should be interpreted as “includes but is not limited to, ” etc. It will be further understood by those within the art that if a specific number of an introduced claim recitation is intended, such an intent will be explicitly recited in the claim, and in the absence of such recitation no such intent is present. For example, as an aid to understanding, the following appended claims may contain usage of the introductory phrases "at least one" and "one or more" to introduce claim recitations. However, the use of such phrases should not be construed to imply that the introduction of a claim recitation by the indefinite articles "a" or "an" limits any particular claim containing such introduced claim recitation to implementations containing only one such recitation, even when the same claim includes the introductory phrases "one or more" or "at least one" and indefinite articles such as "a" or "an, " e.g., “a” and / or “an” should be interpreted to mean “at least one” or “one or more; ” the same holds true for the use of definite articles used to introduce claim recitations. In addition, even if a specific number of an introduced claim recitation is explicitly recited, those skilled in the art will recognize that such recitation should be interpreted to mean at least the recited number, e.g., the bare recitation of "two recitations, " without other modifiers, means at least two recitations, or two or more recitations. Furthermore, in those instances where a convention analogous to “at least one of A, B, and C, etc. ” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention, e.g., “a system having at least one of A, B, and C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and / or A, B, and C together, etc. In those instances where a convention analogous to “at least one of A, B, or C, etc. ” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention, e.g., “a system having at least one of A, B, or C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and / or A, B, and C together, etc. It will be further understood by those within the art that virtually any disjunctive word and / or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase “A or B” will be understood to include the possibilities of “A” or “B” or “A and B. ”
[0088] From the foregoing, it will be appreciated that various implementations of the present disclosure have been described herein for purposes of illustration, and that various modifications may be made without departing from the scope and spirit of the present disclosure. Accordingly, the various implementations disclosed herein are not intended to be limiting, with the true scope and spirit being indicated by the following claims.
Claims
1.A method, comprising:contending, by a device, for channel access after an enhanced priority arbitration inter-frame space (EP-AIFS) based on a distributed channel access procedure; andincreasing, by the device, the EP-AIFS in response to a success in contending for channel access, wherein the increased EP-AIFS is used by the device for a next contention for channel access.2.The method of Claim 1, wherein the step of increasing the EP-AIFS comprises: adding M × aSlotTime, wherein M is an integer larger than 0.3.The method of Claim 2, wherein the step of contending for channel access comprises transmitting, by the device, an enhanced priority control frame to contend for a transmission opportunity (TXOP) , and wherein the M is determined by the device based on a remaining value of a backoff counter before the device sends the enhanced priority control frame.4.The method of Claim 1, wherein the increased EP-AIFS is less than (AIFSN + EP-CW) × aSlotTime + aSIFSTime, wherein the AIFSN is an arbitration inter-frame space number, wherein aSlotTime corresponds to a slot time, wherein aSIFSTime corresponds to a short inter-frame space (SIFS) time, and wherein the EP-CW corresponds to a contention window value.5.The method of Claim 1, further comprising: maintaining or decreasing, by the device, the EP-AIFS in response to a failure in contending for channel access.6.The method of Claim 5, wherein the device decreases the EP-AIFS by subtracting one aSlotTime from the EP-AIFS in an event that the EP-AIFS is greater than AIFSN × aSlotTime +aSIFSTime, wherein the AIFSN is an arbitration inter-frame space number, wherein aSlotTime corresponds to a slot time, and wherein aSIFSTime corresponds to a short inter-frame space (SIFS) time.7.The method of Claim 1, wherein the distributed channel access procedure comprises a priority enhanced distributed channel access (P-EDCA) enhancement procedure, wherein the step of contending for channel access comprises transmitting, by the device, an enhanced priority control frame, and wherein the enhanced priority control frame comprises at least one of:a request-to-send (RTS) frame;a clear-to-send (CTS) frame; anda buffer status report poll (BSRP) frame.8.The method of Claim 7, wherein the enhanced priority control frame comprises a duration field indicating a protected contention period, and wherein during the protected contention period, other devices are prohibited from contending for channel access.9.The method of Claim 8, wherein a network allocation vector (NAV) is set by one or more STAs based on the duration field in an event that the enhanced priority control frame is decoded.10.The method of Claim 1, wherein the success in contending for channel access indicates the device acquiring a transmission opportunity (TXOP) .11.A method, comprising:determining, by a device, a virtual start time; andtransmitting, by the device, an enhanced priority control frame for contending for a transmission opportunity (TXOP) on a shared wireless medium at a slot boundary based on the virtual start time, wherein the virtual start time corresponds to an end time of a previous TXOP prior to the TXOP on the shared wireless medium.12.The method of Claim 11, wherein the virtual start time corresponds to an end time of a network allocation vector (NAV) associated with the previous TXOP.13.The method of Claim 12, wherein the NAV is set by the device based on a duration field of a frame transmitted by an access point (AP) in the previous TXOP, and wherein the duration field indicates a remaining duration of the previous TXOP.14.The method of Claim 11, wherein the slot boundary follows an inter-frame space (AIFS) or an enhanced priority arbitration inter-frame space (EP-AIFS) starting from the virtual start time.15.The method of Claim 11, wherein the virtual start time is used by multiple stations to align transmissions of the enhanced priority control frame of each station in the multiple stations.16.The method of Claim 11, wherein the device transmits the enhanced priority control frame at the slot boundary following an enhanced priority arbitration inter-frame space (EP-AIFS) starting from the virtual start time in an event that the shared wireless medium is detected idle.17.The method of Claim 11, wherein the enhanced priority control frame comprises a duration field indicating a protected contention period, and wherein during the protected contention period, other devices are prohibited from contending for channel access.18.A device, comprising:a transceiver, configured to wirelessly communicate with another device; anda processor communicatively coupled to the transceiver such that the processor performs operations comprising:contending for channel access after an enhanced priority arbitration inter-frame space (EP-AIFS) via the transceiver based on a distributed channel access procedure; andincreasing the EP-AIFS in response to a success in contending for channel access, wherein the increased EP-AIFS is used by the device for a next contention for channel access.19.The device of Claim 18, wherein the step of increasing the EP-AIFS comprises: adding M × aSlotTime, wherein M is an integer larger than 0, andwherein the increased EP-AIFS is less than (AIFSN + EP-CW) × aSlotTime + aSIFSTime, wherein the AIFSN is an arbitration inter-frame space number, wherein aSlotTime corresponds to a slot time, wherein aSIFSTime corresponds to a short inter-frame space (SIFS) time, and wherein the EP-CW corresponds to a contention window value.20.The device of Claim 18, wherein the processor further performs operations comprising:maintaining or decreasing the EP-AIFS in response to a failure in contending for channel access,wherein the device decreases the EP-AIFS by subtracting one aSlotTime from the EP-AIFS in an event that the EP-AIFS is greater than AIFSN × aSlotTime + aSIFSTime, andwherein the AIFSN is an arbitration inter-frame space number, wherein aSlotTime corresponds to a slot time, and wherein aSIFSTime corresponds to a short inter-frame space (SIFS) time.
