(en)Various aspects related to various apparatuses, methods, and computer-readable medium are described herein. Some aspects may enable an apparatus to protect downlink (DL) communication(s). Some aspects may enable an apparatus to perform DL communication(s). Some aspects may enable an apparatus to communicate regarding uplink (UL) communication(s). Some aspects may enable an apparatus to perform operation(s) related to an allocation vector. Some aspects may enable an apparatus to perform operation(s) related to random access. Some aspects may enable an apparatus to perform UL communication(s). The written description and appended drawings provide detailed descriptions regarding these and many other aspects.
(en)Various aspects related to various apparatuses, methods, and computer-readable medium are described herein. Some aspects may enable an apparatus to protect downlink (DL) communication(s). Some aspects may enable an apparatus to perform DL communication(s). Some aspects may enable an apparatus to communicate regarding uplink (UL) communication(s). Some aspects may enable an apparatus to perform operation(s) related to an allocation vector. Some aspects may enable an apparatus to perform operation(s) related to random access. Some aspects may enable an apparatus to perform UL communication(s). The written description and appended drawings provide detailed descriptions regarding these and many other aspects.

1.ApplicationNumber: US-201615322116-A
1.PublishNumber: US-10045349-B2
2.Date Publish: 20180807
3.Inventor: ATEFI, Ali

4.Inventor Harmonized: ATEFI ALI(US)

5.Country: US
6.Claims:
(en)Various aspects related to various apparatuses, methods, and computer-readable medium are described herein. Some aspects may enable an apparatus to protect downlink (DL) communication(s). Some aspects may enable an apparatus to perform DL communication(s). Some aspects may enable an apparatus to communicate regarding uplink (UL) communication(s). Some aspects may enable an apparatus to perform operation(s) related to an allocation vector. Some aspects may enable an apparatus to perform operation(s) related to random access. Some aspects may enable an apparatus to perform UL communication(s). The written description and appended drawings provide detailed descriptions regarding these and many other aspects.
(en)Various aspects related to various apparatuses, methods, and computer-readable medium are described herein. Some aspects may enable an apparatus to protect downlink (DL) communication(s). Some aspects may enable an apparatus to perform DL communication(s). Some aspects may enable an apparatus to communicate regarding uplink (UL) communication(s). Some aspects may enable an apparatus to perform operation(s) related to an allocation vector. Some aspects may enable an apparatus to perform operation(s) related to random access. Some aspects may enable an apparatus to perform UL communication(s). The written description and appended drawings provide detailed descriptions regarding these and many other aspects.

7.Description:
(en)CROSS-REFERENCE TO RELATED APPLICATION(S)
The present application claims the benefit of and right of priority to International Patent Cooperation Treaty (PCT) Patent Application No. PCT/US2016/042118, titled “APPARATUSES, METHODS, AND COMPUTER-READABLE MEDIUM FOR COMMUNICATION IN A WIRELESS LOCAL AREA NETWORK,” filed Jul. 13, 2016, which claims the benefit of and right of priority to U.S. Provisional Patent Application No. 62/193,497, titled “APPARATUSES, METHODS, AND COMPUTER-READABLE MEDIUM FOR COMMUNICATION,” filed Jul. 16, 2015, U.S. Provisional Patent Application No. 62/219,639, titled “APPARATUSES, METHODS, AND COMPUTER-READABLE MEDIUM FOR COMMUNICATION,” filed Sep. 16, 2015, and U.S. Provisional Patent Application No. 62/254,153, titled “APPARATUSES, METHODS, AND COMPUTER-READABLE MEDIUM FOR COMMUNICATION,” filed Nov. 11, 2015, the entirety of all of which is hereby expressly incorporated by reference herein.


TECHNICAL AREA
The present disclosure, generally, pertains to communication and, more specifically, to apparatuses, methods, and computer-readable medium for communication in a wireless local area network.
BACKGROUND
A wireless local area network (WLAN) may refer to a network that wirelessly connects two or more devices in a coverage area. A WLAN can be deployed in many types of environments, such as residential, commercial, and/or public. Devices can be moved around in the coverage area of the WLAN while maintaining a wireless connection. A WLAN may be utilized to access a local intranet and/or the Internet. Devices in a WLAN can communicate with each other using various procedures. Improvements to such procedures may enable relatively faster download and/or upload of information, relatively less latency, and/or relatively less power consumption, which may improve the overall user experience.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a conceptual diagram illustrating a non-limiting example of at least one wireless local area network according to some aspects of the present disclosure.
FIG. 2 is a timing diagram illustrating non-limiting examples of various communications between an access point (AP) and various stations (STAs) according to some aspects of the present disclosure.
FIG. 3 illustrates non-limiting examples of diagrams associated with some aspects of the present disclosure.
FIG. 4 is a flow diagram illustrating non-limiting examples of some aspects of the present disclosure.
FIG. 5 is a block diagram illustrating a non-limiting example of an AP according to some aspects of the present disclosure.
FIG. 6 is a block diagram illustrating a non-limiting example of a STA according to some aspects of the present disclosure.



The drawings are not intended to limit the scope of the present disclosure nor any aspect of the claims. The drawings are provided solely to illustrate a few aspects that may be described in greater detail throughout the present disclosure. Accordingly, some aspects described throughout the present disclosure may not be illustrated in the drawings.
DETAILED DESCRIPTION
A wireless local area network (WLAN) may have one or more access points (APs) and/or one or more stations (STAs). In some aspects, the term(s) ‘AP’ ‘apparatus’ (e.g., an apparatus of an AP), and/or ‘computer-readable medium’ (e.g., a computer-readable medium of an AP) may be, may reside within, and/or may refer to a router, a base station, a transmitter, a base transceiver station, a node, a radio base station, a radio transceiver, a network, a basic service set (BSS), an extended service set, a computing device, a user equipment (UE), a phone, a mesh node, a relay, a peer, a device, one or more software modules, one or more computer-executable code/instructions, one or more computer-readable medium, one or more memory, one or more processor, one or more hardware components, one or more circuits or modules, any combination of any one or more of the foregoing items, and/or any other suitable term(s), any one or more of which may be suitable for performing any one or more of the methods, operations, steps, functions, features, and/or other aspects described herein.
In some aspects, the term(s) ‘STA,’ ‘apparatus’ (e.g., an apparatus of an STA), and/or ‘computer-readable medium’ (e.g., a computer-readable medium of an STA) may be, may reside within, and/or may refer to a laptop computer, a mobile phone, a cellular phone, a mobile station, a UE, a phone, a handset device, a subscriber station, a mobile unit, a wireless device, a smartphone, a remote device, a tablet device, a desktop computer, a terminal, a mobile client, a mesh node, a relay, a peer, a netbook, a notebook, a computer display, a satellite radio, a projector, a payment device, a display device, a global positioning system device, a multimedia device, a game console, a camera, a video-recorder, an entertainment device, a wearable computing device, glasses, a watch, a health/fitness tracker, an appliance, a transport vehicle, a car, a sensor, a fax/facsimile machine, a printer, a scanner, one or more software modules, one or more computer-executable code/instructions, one or more computer-readable medium, one or more memory, one or more processor, one or more hardware components, one or more circuits or modules, any combination of any one or more of the foregoing items, and/or any other suitable term(s), any one or more of which may be suitable for performing any one or more of the methods, operations, steps, functions, features, and/or other aspects described herein.
An AP may be configured to communicate downlink (DL) signals to one or more other apparatuses, such as one or more STAs. An STA may be configured to communicate uplink (UL) signals to one or more other apparatuses, such as one or more APs and/or one or more other STAs. Generally, a transmission from an AP to one or more STAs may be characterized as DL, and a transmission from a STA to one or more APs may be characterized as UL. DL may refer to any communication initiated by, originated at, communicated from, generated by, and/or transmitted by an AP and destined for, intended for, and/or received by an STA. UL may refer to any communication initiated by, originate at, communicated from, generated by, and/or transmitted by an STA and destined for, intended for, and/or received by an AP.
FIG. 1 is a conceptual diagram 100 illustrating a non-limiting example of at least one WLAN according to some aspects of the present disclosure. In the example illustrated in FIG. 1 , AP 1 112 has a coverage area 110 that at least partially overlaps with a coverage area 140 of AP 2 142 . The coverage area 110 of AP 1 112 includes STA 1 114 , STA 2 116 , and STA 4 118 . The coverage area of AP 2 142 includes STA 1 114 , STA 3 144 , and STA 5 146 . FIG. 1 illustrates many DL transmissions 122 , 126 , 152 , 158 and many UL transmissions 124 , 128 , 154 , 156 . Additionally or alternatively, STAs may communicate with each other via peer-to-peer transmissions 130 , 132 . Additional details related to the aforementioned transmissions are provided throughout the present disclosure.
FIG. 2 is a timing diagram 200 illustrating non-limiting examples of various communications between an AP and various STAs according to some aspects of the present disclosure. In some aspects, at time T i , AP 1 112 may transmit one or more DL transmission(s) 202 , 204 to STA 1 114 , STA 2 116 , respectively. Such DL transmission(s) 202 , 204 may be configured to cause STA 1 114 , STA 2 116 to transmit an UL transmission (e.g., UL transmission(s) 212 , 214 , respectively) that may be configured to protect a DL multiuser transmission (e.g., DL multiuser transmission 222 ). In some aspects, at time T ii , STA 1 114 , STA 2 116 may respectively communicate UL transmission(s) 212 , 214 to AP 1 112 . Such UL transmission(s) 212 , 214 may be configured to protect a DL multiuser transmission (e.g., DL multiuser transmission 222 ). Various aspects pertaining to such DL transmission(s) 202 , 204 and/or UL transmission(s) 212 , 214 are provided in greater detail herein (e.g., with reference to FIG. 4 ).
In some aspects, at time T iii AP 1 112 may transmit a DL multiuser transmission 222 to STA 1 114 and STA 2 116 . The DL multiuser transmission 222 may include data and/or information destined/intended for a plurality STAs (e.g., STA 1 114 , STA 2 116 ). In some aspects, the term ‘multiuse’ may be described herein with reference to a transmission (or other similar terms, such as communication, signal, packet, and/or data unit). A DL multiuser transmission may refer to a transmission that originates at a single transmitter (e.g., apparatus, AP 1 BSS, node, network, etc.) and includes data and/or information destined/intended for a plurality of receivers (e.g., apparatuses, STAs, users, receivers, destinations, etc.). Various aspects pertaining to such DL multiuser transmission(s) 222 are provided in greater detail herein (e.g., with reference to FIG. 4 ).
In some aspects, at time T iv , AP 1 may transmit DL transmission(s) 232 , 234 to STA 1 114 , STA 2 116 , respectively. In some aspects, the DL transmission(s) 232 , 234 may be different transmissions (e.g., one DL transmission 232 destined/intended for STA 1 114 , and another DL transmission 234 destined/intended for STA 2 116 ). In some aspects, the DL transmission(s) 222 may refer to a single DL transmission (e.g., a single DL transmission destined/intended for STA 1 114 and STA 2 116 ). In some aspects, the DL transmission(s) 232 , 234 may be included as a part of another DL transmission(s) (e.g., DL multiuser transmission(s) 222 ).
In some aspect, the DL transmission(s) 232 , 234 may be configured to trigger simultaneous/concurrent UL transmission(s) 262 , 264 by a plurality of STAs (e.g., STA 1 114 , STA 2 116 ). In some aspects, such DL transmission(s) 232 , 234 may be referred to as an UL transmission request (ULTR). The term ‘ULTR’ may refer to a signal configured to trigger an UL transmission by at least one STA. In some aspects, the ULTR may be a signal configured to trigger simultaneous/concurrent UL transmissions by a plurality of STAs within a period of time after receiving the signal. The ULTR may be referred to by various other terms/phrases (e.g., UL transmission trigger, UL trigger frame, and/or various other suitable terms/phrases) without deviating from the scope of the present disclosure. An ULTR may be characterized as ‘cascading’ when another ULTR is planned, scheduled, and/or destined to follow that ULTR. Various aspects pertaining to such DL transmission(s) 232 , 234 are provided in greater detail herein (e.g., with reference to FIG. 4 ).
In some aspects, at time T vii , the simultaneous/concurrent UL transmissions 262 , 264 may include an UL transmission 262 from STA 1 114 to AP 1 112 simultaneously/concurrently with an UL transmission 264 from STA 2 116 to AP 1 112 . In some aspects, the UL transmission(s) 262 , 264 may be referred to as UL multiuser transmission(s). UL multiuser transmission(s) may refer to one or more transmissions that originate at different transmitters (e.g., apparatuses, STAs, users, etc.) and each include data and/or information destined/intended for a common/shared receiver (e.g., apparatus, AP 1 node, network, etc.), and such transmissions may at least in part occur during a common, concurrent, and/or simultaneous period of time. Various aspects pertaining to such simultaneous/concurrent UL transmission(s) 262 , 264 are provided in greater detail herein (e.g., with reference to FIG. 4 ).
In some aspects, prior to such simultaneous/concurrent UL transmissions 262 , 264 at time T vii , an STA (e.g., STA 1 114 , STA 2 116 ), at time T v , may enable various features, operations, functions, and/or aspects related to an allocation vector, such as a network/navigation allocation vector (NAV), as described in greater detail herein (e.g., with reference to FIG. 4 ). In some aspects, prior to such simultaneous/concurrent UL transmissions 262 , 264 at time T vii an STA (e.g., STA 1 114 , STA 2 116 ), at time T v , may enable various features, operations, functions, and/or aspects related to random access, as also described in greater detail herein (e.g., with reference to FIG. 4 ).
FIG. 3 illustrates non-limiting examples of diagrams 300 , 350 associated with various aspects of the present disclosure. In some aspects, a first diagram 300 illustrates non-limiting examples of possible relationships between a total number of space-time streams (STSs) (included in a frame, packet, and/or data unit) and various possible values in one or more fields (e.g., field values (FVs)) (that may be included in a frame, packet, and/or data unit). In some aspects, a second diagram 350 illustrates non-limiting examples of possible relationships between the number (e.g., quantity, numerical quantification, count, amount, size, extent, etc.) of STSs destined/intended for one or more STAs assigned/allocated various possible user position (UP) values in view of various possible FVs (that may be included in a frame, packet, and/or data unit). Many aspects pertaining to these diagrams 300 , 350 are provided in greater detail herein (e.g., with reference to FIG. 4 ).
FIG. 4 is a conceptual flow diagram 400 illustrating non-limiting examples of various features, operations, steps, methods, processes, and/or functions according to some aspects of the present disclosure. Such features, operations, steps, methods, processes, and/or functions may be enabled, performed by, reside in, executed by, configured for, and/or otherwise associated with any apparatus described herein, such an AP (e.g., AP 1 112 ) and/or an STA (e.g., STA 1 114 ).
At block 402 , an apparatus may enable aspects related to protecting DL communication(s). In some aspects, an AP may transmit and/or an STA may receive a transmission configured to cause a plurality of STAs to simultaneously transmit a signal/transmission that is configured to protect a DL multiuser transmission to the plurality of STAs. For example, referring to FIG. 2 , AP 1 112 may transmit a DL transmission 202 to STA 1 114 and/or a DL transmission 204 to STA 2 116 . Such DL transmission(s) 202 , 204 may be configured to request that STA 1 114 , STA 2 116 refrain from transmitting signals during a particular period of time (e.g., at least at time T iv ) using a certain channel or resource. In some aspects, in response to such a signal/transmission (e.g., DL transmission(s) 202 , 204 ) and simultaneously/concurrently with another STA of the plurality of STAs, a STA may transmit and/or an AP may receive a signal/transmission (e.g., UL transmission(s) 212 , 214 ) configured to protect a DL multiuser transmission (e.g., DL multiuser transmission(s) 222 ) to the plurality of STAs. For example, referring to FIG. 2 , STA 1 114 may transmit an UL transmission 212 at least in part simultaneously/concurrently with STA 2 116 transmitting an UL transmission 214 . Such UL transmission(s) 212 , 214 may inform AP 1 112 that STA 1 114 , STA 2 116 will not transmit during that particular period of time (e.g., at least at time T iv ) using that channel or resource, thereby protecting any DL multiuser transmission(s) (e.g., DL multiuser transmission(s) 222 from AP 1 112 to STA 1 114 , STA 2 116 ) during that particular period of time (e.g., at least at time T iv ). In some aspects, a time synchronization of the simultaneous transmission by the plurality of STAs is based on an end time of the received signal/transmission. For example, referring to FIG. 2 , the UL transmission(s) 212 , 214 may begin after a particular inter-frame spacing (e.g., in FIG. 2 , time T ii minus time T i ) after the communication of the DL transmission(s) 202 , 204 . In some aspects, a scrambling seed associated with the transmitted signal/transmission (e.g., UL transmission(s) 212 , 214 ) configured to protect the DL multiuser transmission (e.g., DL multiuser transmission(s) 222 ) is similar to or the same as a scrambling seed of the received signal/transmission (e.g., DL transmission(s) 202 , 204 ) that caused the plurality of STAs to simultaneously transmit the signal/transmission (e.g., UL transmission(s) 212 , 214 ) configured to protect the DL multiuser transmission (e.g., DL multiuser transmission(s) 222 ). The term ‘scrambler seed’ may refer to an initial value or state used for scrambling, randomization, and/or encoding an input value. For example, referring to FIG. 2 , an initial scrambler state of the DL transmission(s) 202 , 204 may be similar to or the same as an initial scrambler state of the UL transmission(s) 212 , 214 .
At block 404 , an apparatus may enable aspects related to performing DL communication(s). In some aspects, at time T iii , an AP may transmit and/or an STA may receive a DL transmission (e.g., DL multiuser transmission(s) 222 ) comprising a frame, packet, and/or data unit destined/intended for a plurality of STAs. In some aspects, the DL transmission (e.g., DL multiuser transmission(s) 222 ) comprising a frame, packet, and/or data unit destined/intended for a plurality of STAs may include a plurality of STSs. For example, one (or more) STS may be destined/intended for STA 1 114 and another one (or more) STS may be destined/intended for STA 2 116 .
The frame, packet, and/or data unit may include one or more fields. The term ‘field(s)’ may refer to any subset, portion, fraction, component, and/or bit of the frame, packet, and/or data unit. In some aspects, an STA may use a field included in the packet, frame, and/or data unit to determine a total number of STSs included in the packet, frame, and/or data unit. For example, as illustrated in a first diagram 300 of FIG. 3 , an STA may determine a total number of STSs (e.g., a, b, c, . . . z, which each may represent a non-negative integer value) (included in the packet, frame, and/or data unit) based on the FV (e.g., A, B, C, . . . Z, which may each represent one or more integer values, one or more complex numbers, one or more alphanumeric values, one or more bits, a bit string, one or more binary values, one or more hexadecimal values, and/or any other suitable set of one or more values). For instance, if FV=B, then the total number of STSs included in the frame, packet, and/or data unit is equal to b.
In some aspects, an STA may use the field to select a subset of values from a set of values indicating a number of STSs destined to each of at least some of the plurality of STAs. For example, as illustrated in a second diagram 350 of FIG. 3 , the number of STSs associated with each UP may vary based on the FV. An STA for/to which a packet, frame, and/or data unit, or at least a portion thereof, is intended/destined may be assigned a UP. A UP may be assigned to one or more STAs. For example, if FV=B, then the STA may select a subset of values (e.g., B 0 , B 1 , B 2 , B 3 , B 4 , B 5 , . . . , B N ) from a set of values (e.g., A 0 , A 1 , A 2 , A 3 , A 4 , A 5 , . . . , A N , B 0 , B 1 , B 2 , B 3 , B 4 , B5, . . . , B N , C 0 , C 1 , C 2 , C 3 , C 4 , C 5 , . . . , C N , . . . , Z 0 , Z 1 , Z 2 , Z 3 , Z 4 , Z 5 , . . . , Z N , wherein each of these value may have any non-negative integer value) indicating the number of STSs destined/intended for each of at least some of the plurality of STAs (e.g., STAs assigned UP 0 , UP 1 , UP 2 , UP 3 , UP 4 , UP 5 , . . . , UP N ). N may correspond to a last value in a series of values. Although the example described herein mentions five or more values (e.g., N being greater than 5) in each of the set of values, this is not a limitation of the present disclosure nor any aspect of the claims, because any of the set of values may have any plurality of values (e.g., two or more values, wherein N is simply greater than 1) without deviating from the scope of the present disclosure.
In some aspects, an STA may determine a value of a UP assigned to the STA. For example, STA 1 114 may determine that it is assigned/allocated a particular UP value, such as UP 3 (e.g., UP j , where j=3). Because the frame, packet, and/or data unit may contain a plurality of STSs, not all of which may be destined/intended for a single STA 1 each of the STAs for which that frame, packet, and/or data unit is destined/intended may wish to determine which of the plurality of STSs in the frame, packet, and/or data unit are destined/intended for that particular STA. In some aspects, an STA may select which of the plurality of STSs in the frame, packet, and/or data unit are destined to the STA by considering a number of STSs allocated to one or more other STAs each assigned a UP value that is different from the UP value assigned to the STA. If assigned/allocated UP 3 , STA 1 114 may determine that the number of STSs destined/intended for that particular STA is B 3 (e.g., B 3 -number of STSs are destined/intended for STA 1 114 ). However, because the frame, packet, and/or data unit may have more than B 3 -number of STSs, STA 1 114 may wish to determine exactly which of those more-than-B 3 -number of STSs is/are the specific B 3 -number of STSs destined/intended for STA 1 114 .
To do so, STA 1 114 may consider the number of STSs assigned/allocated to one or more other STAs assigned a UP value different from (e.g., higher/greater than and/or lower/lesser than) UP 3 (e.g., STA(s) assigned/allocated any one or more of UP 0 , UP 1 , UP 4 , UP 5 , . . . , and/or UP N ). For example, by considering (i) that B 0 -number of STSs are assigned/allocated to STA(s) assigned/allocated UP 0 , (ii) that B 1 -number of STSs are assigned/allocated to STA(s) assigned/allocated UP 1 , and/or (iii) that B 2 -number of STSs are assigned/allocated to STA(s) assigned/allocated UP 2 , STA 1 114 (if assigned/allocated UP 3 ) may determine that the starting stream index of the STS(s) destined/intended for it begin(s) after the sum of B 0 -, B 1 -, and B 2 -number of STSs (which are destined/intended for other STA(s) assigned/allocated to UP values different from the UP value assigned/allocated to STA 1 114 ).
One of ordinary skill in the art will understand that any one or more of A 0 -A N through Z 0 -Z N shown in FIG. 3 may have various values, characteristics, relationships, features, requirements, conditions, and/or other suitable attributes without necessarily deviating from the scope of the present disclosure. In some aspects, the number of STSs intended for every STA assigned a higher UP value may never exceed the number of STSs intended for the STA. For example, if STA 1 114 is assigned/allocated UP 3 , none of the individual values of B 4 , B 5 , . . . , nor B N may exceed the value of B 3 . In some aspects, a number of STSs intended for the STA may be greater than or equal to a number of STSs intended for every STA assigned a higher UP value than the UP assigned to the STA. For example, if STA 1 114 is assigned/allocated UP 3 , the value of B 3 is greater than or equal to the individual values of B 4 , B 5 , . . . , and B N .
In some aspects, at least one of A 0 -A N through Z 0 -Z N (shown in FIG. 3 ) may be variable (e.g., varying, adjustable, non-fixed, comprising a range of two or more possible values, etc.). In some aspects, at least one of the values in the selected subset is variable, and a determination of an exact value for the variable includes considering the determined total number of STSs included in the data frame, packet, and/or data unit. In some aspects, at least one of the values in the selected subset is variable, and a determination of an exact value for the variable includes subtracting at least some of the other values in the selected subset of values from the determined total number of STSs included in the data frame, packet, and/or data unit. For example, referring to FIG. 3 , if FV=B, the selected subset includes B 0 , B 1 , B 2 , B 3 , B 4 , B 5 , . . . , B N , and at least one of these values is variable. For the purpose of illustration but not limitation, it can be assumed that B 3 is variable. As described above, if FV=B, the number of STSs included in the frame, packet, and/or data unit is equal to b (e.g., a non-negative integer value). To determine the exact value for B 3 (e.g., a variable, in this example), the value of b is subtracted by the value of B 0 , B 1 , B 2 , B 4 , and B 5 . . . B N . For instance, if b=5, B 0 =3, B 1 =1, B 2 =0, B 4 =0, and B 5 . . . B N =0, then B 3 =5−3−1=1. In some aspects, at least one of the values in the selected subset is variable, and a determination of an exact value for the variable comprises eliminating a possible value if addition of that possible value to the other subset of values generates a sum that exceeds the total number of STSs included in the data frame, packet, and/or data unit. For example, referring to FIG. 3 , if FV=B, B 0 =3, B 1 =1, B 2 =0, B 4 =0, and B 5 . . . B N =0, and B 3 is variable, then the exact value of B 3 may be determined by eliminating possible values that cause the sum of the subset of values (e.g., sum of B 0 -B N ) to exceed b=5. For instance, the value of B 3 =2 can be eliminated because B 3 =2 would result in the sum of the subset of values (e.g., sum of B 0 -B N ) to equal to 6, which exceeds b=5.
At block 406 , an apparatus may enable aspects related to performing communications regarding UL communication(s). In some aspects, at time T iv , an AP may transmit and/or a STA may receive a signal/transmission (e.g., DL transmission(s) 232 , 234 ) configured to trigger simultaneous/concurrent UL transmission(s) (e.g., UL transmission(s) 262 , 264 ) by a plurality of STAs within a period of time after receiving that signal/transmission (e.g., DL transmission(s) 232 , 234 ). As indicated above, such a signal/transmission (e.g., DL transmission(s) 232 , 234 ) is sometimes referred to as an ULTR and/or various other suitable terms (as described in greater detail herein) without deviating from the scope of the present disclosure. The time duration between time T iv and time T vii may be represent the period of time between reception, by the STA(s), of the aforementioned DL transmission(s) 232 , 234 (e.g., ULTR(s)) and transmission, by the STA(s), of the simultaneous/concurrent UL transmission(s) 262 , 264 . In some aspects, the ULTR (e.g., DL transmission(s) 232 , 234 ) may be destined/intended for a plurality of STAs. In some aspects, the ULTR (e.g., DL transmission(s) 232 , 234 ) may include information for identifying the plurality of STAs for the simultaneous/concurrent UL transmissions (e.g., UL transmission(s) 262 , 264 ). For example, the ULTR (e.g., DL transmission(s) 232 , 234 ) may identify which of the STAs within the coverage area of the AP are intended to receive the ULTR and/or intended to perform the simultaneous/concurrent UL transmission(s) 262 , 264 . In some aspects, the ULTR (e.g., DL transmission(s) 232 , 234 ) may include an indication indicating whether to perform carrier sensing prior to initiating an UL transmission (e.g., UL transmission(s) 262 , 264 ).
In some aspects, the ULTR (e.g., DL transmission(s) 232 , 234 ) includes a first portion including a field common to the plurality of STAs and indicating a duration of at least a portion of the simultaneous/concurrent UL transmission(s) (e.g., UL transmission(s) 262 , 264 ). In some aspects, the ULTR (e.g., DL transmission(s) 232 , 234 ) includes a second portion including a plurality of user-specific fields indicating a description of resource allocation for the simultaneous/concurrent UL transmission(s) (e.g., UL transmission(s) 262 , 264 ) by the plurality of STAs. For example, the ULTR (e.g., DL transmission(s) 232 , 234 ) may identify, allocate, assign, and/or otherwise specific resource units (RUs) to be used by each the plurality of STAs that will be performing the simultaneous/concurrent UL transmission(s) (e.g., UL transmission(s) 262 , 264 ). In some aspects, the ULTR further comprises an indication indicating whether a subsequent ULTR is a cascading ULTR. For example, the ULTR (e.g., DL transmission(s) 232 , 234 ) may include a field, parameter, value, bit, portion and/or other suitable aspect indicating whether the ULTR will be followed by another, possibly unscheduled, ULTR.
In some aspects, the ULTR (e.g., DL transmission(s) 232 , 234 ) may include information corresponding to a target received signal strength, which may refer to the desired/targeted power of the signal(s) to be received by one or more of the antennas of the AP(s) (e.g., the desired/targeted power of the UL transmission(s) 262 , 264 ). In some aspects, the ULTR (e.g., DL transmission(s) 232 , 234 ) may include information corresponding to a power measurement of the transmitted ULTR, wherein the power measurement of the transmitted ULTR may refer to the power utilized to transmit the ULTR (e.g., DL transmission(s) 232 , 234 ) using one or more antennas of the AP(s). In some aspects, based on the information corresponding to the power measurement of the transmitted ULTR (as included in the ULTR), an STA (e.g., STA 1 114 , STA 2 116 ) may determine an amount of power loss during the DL transmission of the ULTR (e.g., DL transmission(s) 232 , 234 ) from an apparatus (e.g., AP 1 112 ) to the STA (e.g., STA 1 114 , STA 2 116 ). For example, the STA (e.g., STA 1 114 , STA 2 116 ) may consider the received information corresponding to the power measurement of the transmitted ULTR (e.g., DL transmission(s) 232 , 234 ) in relation to the measured signal strength of the received ULTR in order to determine the amount of power loss during the DL transmission of the ULTR.
In some aspects, prior to receiving the ULTR (e.g., DL transmission(s) 232 , 234 ), an AP may transmit and an STA may receive a signal/transmission indicating a start time associated with communication of an ULTR from the AP. Subsequently, the STA may enter a low-power mode until a time corresponding to the start time indicated in the received signal/transmission. By entering into the low-power mode, the STA can conserve power that might otherwise be expended prior to the approximate start time of the ULTR communication. In some aspects, the ULTR is further configured to assign at least one RU for random access. For example, DL transmission(s) 232 , 234 may be configured to assign at least one RU for random access for UL multiuser transmission(s) (e.g., UL transmission(s) 262 , 264 ).
At block 408 , an apparatus may enable aspects related to performing operations related to at least one NAV. In some aspects, in response to receiving the ULTR (e.g., DL transmission(s) 232 , 234 ), a STA may consider a NAV unless the NAV was set by a frame originating from the apparatus from which the ULTR was transmitted. In some aspects, in response to receiving the ULTR (e.g., DL transmission(s) 232 , 234 ), if/when the NAV was (previously) set by a frame originating from an AP (e.g., AP 1 112 ) from which the ULTR is transmitted, an STA (e.g., STA 1 114 , STA 2 116 ) may transmit a frame, packet, and/or data unit (e.g., UL transmission(s) 262 , 264 ) without considering the NAV. In some aspects, an STA (e.g., STA 1 114 , STA 2 116 ) may refrain from considering a NAV when the NAV was most recently set by an apparatus (e.g., AP 1 112 ) that transmitted the ULTR (e.g., DL transmission(s) 232 , 234 ). For example, referring to FIG. 2 , in response to receiving an ULTR (e.g., DL transmission(s) 232 , 234 ) from AP 1 112 , STA 1 114 may consider a NAV unless the NAV was most recently set by a frame originating from AP 1 112 . In some aspects, a STA (e.g., STA 1 114 ) may refrain from considering a NAV when an identifier of the apparatus that most recently set the NAV (e.g., of STA 1 114 ) is the same as an identifier of the apparatus (e.g., AP 1 112 , STA 2 116 ) that transmitted the ULTR (e.g., DL transmission(s) 232 , 234 ). If such an apparatus (e.g., AP 1 112 , STA 2 116 ) had most recently set the NAV of STA 1 114 , then the NAV (e.g., of STA 1 114 ) may already be configured with parameters and settings that are relatively less likely to result in interfering communications. Accordingly, refraining from considering the NAV in such circumstances can conserve time, power, and computations resources.
In some aspects, a STA (e.g., STA 1 114 ) may receive a frame (e.g., included in a transmission 130 ) from another STA (e.g., STA 2 116 ) and use that frame to set a NAV. In some aspects, the STA (e.g., STA 1 114 ) may refrain from considering the NAV of the STA (e.g., STA 1 114 ) in response to receiving the ULTR (e.g., DL transmission(s) 232 , 234 from AP 1 112 ) when an identifier (e.g., a BSS identifier (BSSID), a medium/media access control (MAC) address, etc.) of the BSS with which the STA (e.g., STA 1 114 ) is associated corresponds to the BSSID of the BSS with which the other STA (e.g., STA 2 116 ) is associated. In some aspects, the STA (e.g., STA 1 114 ) may refrain from considering a NAV of the STA (e.g., STA 1 114 ) in response to receiving the ULTR (e.g., DL transmission(s) 232 , 234 from AP 1 112 ) when the STA (e.g., STA 1 114 ) is in the same BSS as the other STA (e.g., STA 2 116 ). When the BSSIDs of the STAs are associated and/or when the STAs are in the same BSS, the communications of the STAs (STA 1 114 , STA 2 116 ) may be centrally managed and/or the likelihood of interference may be relatively low. Accordingly, refraining from considering a NAV in such circumstances can conserve time, power, and computations resources.
In some aspects, in response to receiving the ULTR (e.g., DL transmission(s) 232 , 234 ), if/when the UL response (e.g., UL transmission(s) 262 , 264 ) to the ULTR comprises an acknowledgement message having less than a threshold duration, an STA (e.g., STA 1 114 , STA 2 116 ) may transmit a frame (e.g., UL transmission(s) 262 , 264 ) without considering a NAV. For example, referring to FIG. 2 , in response to receiving a DL transmission 232 (e.g., ULTR) at time T iv , the STA (e.g., STA 1 114 ), at time T v , may refrain from considering a NAV when the UL transmission 262 , at time T vii , includes an acknowledgement message having a duration less than a threshold value. For relatively short transmissions that communicate acknowledgement information, the time, power, and computation resources utilized for considering the NAV (e.g., of STA 1 114 ) may not be warranted.
In some aspects, a STA may determine whether to update a NAV by using varying detection thresholds based on whether a received ULTR, signal, frame and/or data unit is communicated from a same BSS. In some aspects, an STA (e.g., STA 1 114 ) may refrain from updating one or more parameters of the NAV if (i) a received ULTR, signal, frame, and/or data unit is transmitted from an apparatus (e.g., AP 2 142 , STA 3 144 , STA 5 146 ) associated with a BSS different from a BSS with which the STA (e.g., STA 1 114 ) is associated and/or (ii) a strength of the received ULTR, signal, frame, and/or data unit is less than a first detection threshold value. The first detection threshold value may be greater than a second detection threshold value used if the received ULTR, signal, frame, and/or data unit is not transmitted by the apparatus (e.g., AP 2 142 ) associated with the BSS that is different from the BSS with which the STA (e.g., STA 1 114 ) is associated (e.g., if the received ULTR, signal, frame, and/or data unit is transmitted by an apparatus (e.g., AP 1 112 , STA 4 118 ) associated with the same BSS as the STA (e.g., STA 1 114 )). In such aspects, a relatively higher detection threshold is used when the received ULTR, signal, frame, and/or data unit is transmitted from an apparatus in a different BSS, and a relatively lower detection threshold is used when the received ULTR, signal, frame, or data unit is transmitted from an apparatus in the same BSS. By doing so, communications between apparatuses in the same BSS have a relatively higher likelihood of updating a NAV, and communications between apparatuses in different BSSs have a relatively lower likelihood of updating a NAV.
In some aspects, an STA (e.g., STA 1 114 ) may receive a frame from an apparatus (e.g., another STA or an AP), and the frame may include information indicating a duration of time used for updating a NAV of that STA (e.g., STA 1 114 ). Depending on a difference between the received information indicating the duration of time used for updating the NAV and an existing duration of time of the NAV, the STA (e.g., STA 1 114 ) may override the existing duration of time of the NAV with the received information indicating the duration of time used for updating the NAV. The aforementioned difference may be (i) a positive value when the duration indicated in the received frame is greater than existing duration, or (ii) a negative value when the duration indicated in the received frame is lesser than the existing duration. When the difference is a positive value, the STA (e.g., STA 1 114 ) may override the existing duration with the duration indicated in the received frame.
In some aspects, an STA (e.g., STA 1 114 ) may have more than just one NAV. In some aspects, an STA (e.g., STA 1 114 ) may maintain a plurality of NAVs, each configured for a particular purpose. In some aspects, an STA (STA 1 114 ) may maintain a plurality of NAVs configured to regulate whether the STA accesses a wireless medium during a period of time. The plurality of NAVs may include a first NAV adapted for frames originating from an apparatus (e.g., AP 1 112 , STA 2 116 , STA 4 118 ) in a BSS with which the STA (e.g., STA 1 114 ) is associated, and a second NAV adapted for frames originating from an apparatus (e.g., AP 2 142 , STA 4 146 , STA 3 144 ) in a BSS with which the STA (e.g., STA 1 114 ) is not associated. By using a plurality of NAVs, the STA (e.g., STA 1 114 ) can track the time durations and resources being utilized by not only apparatuses in its current BSS but also time durations and resources being utilized by other apparatuses in one or more overlapping BSSs, thereby enabling the STA (e.g., STA 1 114 ) to better manage potential interference, contention, and/or channel access.
In some aspects, an STA may update each of at least two of the plurality of NAVs based on various criteria without necessarily deviating from the scope of the present disclosure. In some aspects, an STA (e.g., STA 1 114 ) may receive a frame from an apparatus (e.g., another STA or an AP), and the frame may be configured to update one of a plurality of NAVs of the STA. If a BSSID of the BSS with which the STA (e.g., STA 1 114 ) is associated corresponds to a BSSID of a BSS with which the apparatus (e.g., STA 2 116 , AP 1 112 ) is associated, then an STA (e.g., STA 1 114 , STA 2 116 ) may update a first NAV (of a plurality of NAVs), wherein the first NAV is configured for frames communicated within a BSS with which the STA (e.g., STA 1 114 ) is associated. If the BSSID of the BSS with which the STA (e.g., STA 1 114 ) is associated does not corresponds to a BSSID of the BSS with which the apparatus (e.g., AP 2 142 , STA 3 144 , STA 5 146 ) is associated, then an STA (e.g., STA 1 114 , STA 2 116 ) may update a second NAV (of a plurality of NAVs), wherein the second NAV is configured for frames communicated outside of the BSS with which the STA (e.g., STA 1 114 ) is associated.
In some aspects, an STA (e.g., STA 1 114 , STA 2 116 ) may determine whether to perform carrier sensing prior to initiating an UL transmission (e.g., UL transmission(s) 262 , 264 ) in response to receiving the ULTR (e.g., DL transmission(s) 232 , 234 ). Carrier sensing may include signal detection and/or NAV(s) evaluation. Carrier sensing may occur during a time period that begins at/after receiving the ULTR (e.g., at/after time T iv ) and ends at/before transmission of the UL transmission(s) (e.g., at/before time T vii ). In some aspects, determining whether to perform carrier sensing depends on whether the ULTR includes information indicating whether to perform the carrier sensing prior to the initiating the UL transmission in response to receiving the ULTR.
As described above, in some aspects, the ULTR (e.g., DL transmission(s) 232 , 234 ) may include an indication indicating whether an STA (e.g., STA 1 114 , STA 2 116 ) is to perform carrier sensing prior to initiating an UL transmission (e.g., UL transmission(s) 262 , 264 ). When the indication in the ULTR indicates no requirement to perform carrier sensing prior to the UL transmission in response to the ULTR, then the STA may refrain from performing carrier sensing (for at least a subchannel allocated to the UL transmission). When the indication in the ULTR indicates a requirement to perform carrier sensing prior to the UL transmission in response to the ULTR, then the STA may perform carrier sensing (for at least the subchannel allocated to the UL transmission).
At block 410 , an apparatus may enable aspects related to random access. As described in greater detail above, the ULTR may be configured to assign/allocate RUs for random access (e.g., for simultaneous/concurrent UL transmissions by a plurality of STAs). In some aspects, after receiving an ULTR (e.g., DL transmission(s) 232 , 234 ), an STA (e.g., STA 1 114 ) may determine the number (e.g., quantity, amount, extent, size, and/or any other suitable measurement) of the RUs assigned by the ULTR for random access. For example, the STA (e.g., STA 1 114 ) may determine the number of RUs assigned to it by utilizing the above-described portion of the ULTR that includes a plurality of user-specific fields indicating a description of resource allocation for simultaneous/concurrent UL transmissions by the plurality of STAs. The STA (e.g., STA 1 114 ) may reduce a back-off counter based on the number of RUs assigned by the ULTR for random access. In some aspects, reducing the back-off counter based on the number of RUs assigned for random access by the ULTR includes reducing a value of the back-off counter by a predetermined amount for each of at least one resource for random access assigned by the ULTR and associated with a particular identifier. For example, if STA 1 114 is assigned three RUs and its back-off counter was initially set to a value of five, then the STA 1 114 may decrement its back-off counter by three units, resulting in its reduced back-off counter having a value of two.
Depending on a value of the reduced back-off counter, the STA (e.g., STA 1 114 ) may randomly select one or more of the RUs assigned for random access by the ULTR. When the value of the reduced back-off counter reaches or crosses a threshold value, then that STA may randomly select RUs assigned for random access. For example, if such a threshold value is two (or greater), then STA 1 114 may randomly select RUs assigned for random access; otherwise, STA 1 114 may refrain from randomly selecting RUs for random access. Depending on a value of the reduced back-off counter (e.g., if/when the value of the reduced back-off counter reaches or crosses a threshold value), the STA (e.g., STA 1 114 ) may transmit a frame, packet, and/or data unit (e.g., UL transmission(s) 262 , 264 ) using the randomly selected one or more RUs assigned by the ULTR for random access.
At block 412 , an apparatus may enable aspects related to performing UL communication(s). In some aspects, in response to receiving the ULTR (e.g., DL transmission(s) 232 , 234 ), a STA may transmit an UL transmission (e.g., UL transmission(s) 262 , 264 ) (at least partially) simultaneously/concurrently with one or more STAs of the plurality of STAs. That is, in response to transmitting the ULTR, an AP may receive UL transmission(s) simultaneously/concurrently from a plurality of STAs. For example, referring to FIG. 2 , at time T vii , in response to receiving an ULTR (e.g., DL transmission 232 , 234 ), STA 1 114 , STA 2 116 may simultaneously/concurrently transmit their respective UL transmission (e.g., UL transmission(s) 262 , 264 , respectively). In some aspects, receiving the DL multiuser transmission (e.g., DL multiuser transmission(s) 222 at time T iii ) and transmitting the simultaneous/concurrent UL transmissions (e.g., UL transmission(s) at time T vii ) by the plurality of STAs occur in the same transmission opportunity.
In some aspects, as described above, an STA may determine the amount of power loss during the DL transmission of the ULTR (e.g., DL transmission(s) 232 , 234 ) from an AP to the STA. As also described above, in some aspects, the ULTR (e.g., DL transmission(s) 232 , 234 ) may include information corresponding to the power measurement of the transmitted ULTR (e.g., DL transmission(s) 232 , 234 ). In some aspects, based on the determined amount of power loss during the DL transmission of the ULTR (e.g., DL transmission(s) 232 , 234 ) from the AP to the STA and/or based on the target received signal strength (as included in the ULTR), the STA may determine an amount of power (to be utilized by one or more antennas) for the UL transmission (e.g., UL transmission(s) 262 , 264 ) by the STA to the AP. In accordance with the determined amount of power for the UL transmission, the STA(s) may transmit the UL transmission(s) (e.g., UL transmission(s) 262 , 264 ) to the AP. In some aspects, the UL transmission(s) may include information corresponding to how much transmission power the STA(s) remains capable of using relative to a transmission power currently utilized. For example, an UL transmission 262 may include information indicating how much more power STA 1 114 is able of using relative to how much power STA 1 114 is currently using for that UL transmission 262 . In some aspects, how much transmission power the STA remains capable of using relative to the transmission power currently utilized refers to a difference between a maximum transmission power (of the STA(s)) and a currently utilized amount of power (by the STA) for the UL transmission(s) (UL transmission(s) 262 , 264 ).
In some aspects, an AP may transmit and/or an STA may receive a request for simultaneous transmission of an acknowledgement message by the plurality of STAs. For example, referring to FIG. 2 , in the DL transmission(s) 222 at time T iii or in the DL transmission(s) 232 , 234 at time T iv , AP 1 112 may transmit and/or STA 1 114 , STA 2 116 may receive a request for simultaneous transmission of an acknowledgement message by the plurality of STAs (e.g., STA 1 114 , STA 2 116 ). In response to the received request, an AP may receive and/or an STA may transmit an UL acknowledgement message simultaneously/concurrently with another STA of the plurality of STAs. For example, referring to FIG. 2 , in the UL transmission(s) 262 , 264 at time T vii , the plurality of STAs (e.g., STA 1 114 , STA 2 116 ) may simultaneously/concurrently transmit an UL acknowledgement message to AP 1 112 (e.g., in UL transmission(s) 262 , 264 ). In some aspects, in response to receiving the ULTR (e.g., DL transmission(s) 232 , 234 ), an STA may transmit and/or an AP may receive a feedback frame at a same time as a transmission of a feedback frame by another STA. For example, referring to FIG. 2 , at time T vii , in response to receiving a DL transmission 232 (e.g., ULTR) at time T iv , STA 1 114 may transmit an UL transmission 262 . The UL transmission 262 may include a feedback frame and may be transmitted simultaneously/concurrently with a transmission of a feedback frame in another UL transmission 264 by STA 2 116 to AP 1 112 .
It will be understood by one of ordinary skill in the art that the specific order or hierarchy of the processes disclosed herein is provided for illustrative and exemplary purposes. Based upon design preferences, the specific order or hierarchy of steps in the processes may be re-arranged and/or some processes may be combined or omitted without deviating from the scope of the present disclosure. The accompanying claims present elements of the various steps in a sample order, and are not meant to be limited to the specific order or hierarchy presented. The particular order, sequence, chronology, and/or combination of the aspects described herein are not intended to limit the scope of the present disclosure nor any aspect of the claims, unless explicitly required by the claims. Any of the aspects described herein may be configured or implemented in additional or alternative orders, sequences, chronologies, and/or combinations without deviating from the scope of the present disclosure. Each and every aspect described herein is not necessarily required in all configurations and embodiments of the present disclosure. Accordingly, any aspect not recited or otherwise required by the claims shall not be construed as limiting the scope of the claims. That is, the scope of the claims shall not be construed any more narrowly than required by the claims simply because there may exist a possibility of any additional and/or alternative aspects described throughout the present disclosure. The scope of the claims shall not be construed as limited to the examples provided herein, unless a corresponding feature is expressly recited in the claims.
FIG. 5 is a block diagram 500 illustrating a non-limiting example of an AP (e.g., AP 1 112 ) according to some aspects of the present disclosure. The AP may have various circuits, algorithms, hardware components, software modules, and/or computer-readable medium storing computer-executable instructions comprising various algorithms, any of the foregoing of which, individually or in some combination, may provide the structure corresponding to the means for performing any one or more of the functions, features, steps, elements, methods, and/or operations described throughout the present disclosure.
The AP may include a bus 506 . The bus 506 may include any number of interconnecting buses and/or bridges depending on the particular design of the AP. The bus 506 may provide a connection/link between various aspects of the AP 1 which may include one or more of the following: processor(s) 550 , computer-readable medium 540 , memory 530 , user interface 510 , bus interface 520 , transceiver 504 , and/or antenna(s) 502 . The bus 506 may enable a link between/to various other aspects, such as timing sources, peripherals, voltage regulators, and/or power management circuits. The user interface 510 may exchange data via the bus interface 520 . The bus interface 520 may provide an interface between the bus 506 and the transceiver 504 . The transceiver 504 may be connected to one or more antennas 502 . The transceiver 504 may provide a means for wirelessly communicating (e.g., receiving data and/or transmitting data) with various other apparatus over a wireless transmission medium. In some aspects, the transceiver 504 may receive a signal from the one or more antennas 502 , extract information from the received signal, and provide the extracted information to the processor(s) 550 . In some aspects, the transceiver 504 may receive information from the processor(s) 550 and, based on the received information, generate a signal to be applied to the one or more antennas 502 . The memory 530 may include various information/data 532 related to any one or more of the functions, features, steps, methods, processes, and/or operations described herein.
The processor(s) 550 may include one or more circuits configured to enable, may perform one or more algorithms related to, and/or may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein. In some aspects, the reception circuit/algorithm 551 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to receiving anything. In some aspects, the processing circuit/algorithm 552 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to using anything, determining anything, considering anything, refraining from considering anything, and/or randomly selecting anything. In some aspects, the control circuit/algorithm 553 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to updating anything, refraining from updating anything, eliminating anything, overriding anything, maintaining anything, and/or entering into any mode. In some aspects, the transmission circuit/algorithm 554 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to generating anything and/or transmitting anything. In some aspects, the other circuit(s)/algorithm(s) 555 may provide the structure (e.g., means for) corresponding to any one or more of the other functions, features, steps, methods, processes, and/or operations described throughout the present disclosure. The processor(s) 550 may be responsible for general processing, including the execution of software (e.g., instructions, code, algorithms, etc.) stored in/on the computer-readable medium 540 .
The computer-readable medium 540 may be used for storing data that is manipulated by the processor(s) 550 . The computer-readable medium 540 may be a non-transitory computer-readable medium. The computer-readable medium 540 may include one or more instructions (e.g., computer-executable code) configured to enable, may perform one or more algorithms related to, and/or may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein. In some aspects, the reception instructions/algorithm 541 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to receiving anything. In some aspects, the process instructions/algorithm 542 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to using anything, determining anything, considering anything, refraining from considering anything, and/or randomly selecting anything. In some aspects, the control instructions/algorithm 543 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to updating anything, eliminating anything, overriding anything, maintaining anything, and/or entering into any mode. In some aspects, the transmission instructions/algorithm 544 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to generating anything and/or transmitting anything. In some aspects, the other circuit(s)/algorithm(s) 545 may provide the structure (e.g., means for) corresponding to any one or more of the other functions, features, steps, methods, processes, and/or operations described throughout the present disclosure. Additional details related to the aspects described in FIG. 5 are provided throughout the present disclosure.
FIG. 6 is a block diagram 600 illustrating a non-limiting example of an STA (e.g., STA 1 114 ) according to some aspects of the present disclosure. The STA may have various circuits, algorithms, hardware components, software modules, and/or computer-readable medium storing computer-executable instructions comprising various algorithms, any of the foregoing of which, individually or in some combination, may provide the structure corresponding to the means for performing any one or more of the functions, features, steps, elements, methods, and/or operations described throughout the present disclosure.
The STA may include a bus 606 . The bus 606 may include any number of interconnecting buses and/or bridges depending on the particular design of the STA. The bus 606 may provide a connection/link between various aspects of the STA 1 which may include one or more of the following: processor(s) 650 , computer-readable medium 640 , memory 630 , user interface 610 , bus interface 620 , transceiver 604 , and/or antenna(s) 602 . The bus 606 may enable a link between/to various other aspects, such as timing sources, peripherals, voltage regulators, and/or power management circuits. The user interface 610 may exchange data via the bus interface 620 . The bus interface 620 may provide an interface between the bus 606 and the transceiver 604 . The transceiver 604 may be connected to one or more antennas 602 . The transceiver 604 may provide a means for wirelessly communicating (e.g., receiving data and/or transmitting data) with various other apparatus over a wireless transmission medium. In some aspects, the transceiver 604 may receive a signal from the one or more antennas 602 , extract information from the received signal, and provide the extracted information to the processor(s) 650 . In some aspects, the transceiver 604 may receive information from the processor(s) 650 and, based on the received information, generate a signal to be applied to the one or more antennas 602 . The memory 630 may include various information/data 632 related to any one or more of the functions, features, steps, methods, processes, and/or operations described herein.
The processor(s) 650 may include one or more circuits configured to enable, may perform one or more algorithms related to, and/or may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein. In some aspects, the reception circuit/algorithm 651 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to receiving anything. In some aspects, the processing circuit/algorithm 652 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to using anything, determining anything, considering anything, refraining from considering anything, and/or randomly selecting anything. In some aspects, the control circuit/algorithm 653 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to updating anything, refraining from updating anything, eliminating anything, overriding anything, maintaining anything, and/or entering into any mode. In some aspects, the transmission circuit/algorithm 654 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to generating anything and/or transmitting anything. In some aspects, the other circuit(s)/algorithm(s) 655 may provide the structure (e.g., means for) corresponding to any one or more of the other functions, features, steps, methods, processes, and/or operations described throughout the present disclosure. The processor(s) 650 may be responsible for general processing, including the execution of software (e.g., instructions, code, algorithms, etc.) stored in/on the computer-readable medium 640 .
The computer-readable medium 640 may be used for storing data that is manipulated by the processor(s) 650 . The computer-readable medium 640 may be a non-transitory computer-readable medium. The computer-readable medium 640 may include one or more instructions (e.g., computer-executable code) configured to enable, may perform one or more algorithms related to, and/or may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein. In some aspects, the reception instructions/algorithm 641 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to receiving anything. In some aspects, the process instructions/algorithm 642 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to using anything, determining anything, considering anything, refraining from considering anything, and/or randomly selecting anything. In some aspects, the control instructions/algorithm 643 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to updating anything, eliminating anything, overriding anything, maintaining anything, and/or entering into any mode. In some aspects, the transmission instructions/algorithm 644 may provide the structure (e.g., means for) corresponding to any one or more of the functions, features, steps, methods, processes, and/or operations described herein with relation to generating anything and/or transmitting anything. In some aspects, the other circuit(s)/algorithm(s) 645 may provide the structure (e.g., means for) corresponding to any one or more of the other functions, features, steps, methods, processes, and/or operations described throughout the present disclosure. Additional details related to the aspects described in FIG. 6 are provided throughout the present disclosure.
Several aspects of communication systems are presented herein with reference to various apparatuses, methods, and computer-readable medium, which are described herein and possibly illustrated in the accompanying drawings by various blocks, modules, components, circuits, steps, processes, algorithms, etc. (collectively, “elements”). Such elements may be implemented using electronic hardware, computer software, and/or any combination thereof. Whether such elements are implemented as hardware and/or software may depend upon the particular application and/or design constraints imposed on the overall communication system.
Examples of processors include microprocessors, microcontrollers, digital signal processors (DSPs), field programmable gate arrays (FPGAs), programmable logic devices (PLDs), state machines, gated logic, discrete hardware circuits, and other suitable hardware configured to perform the various functionality described throughout this disclosure. One or more processors in the processing system may execute software. Software shall be construed broadly to mean instructions, instruction sets, code, code segments, program code, programs, subprograms, software modules, applications, software applications, software packages, routines, subroutines, objects, executables, threads of execution, procedures, functions, etc., whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.
Accordingly, in one or more exemplary configurations, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or encoded as one or more instructions or code on a computer-readable medium. Computer-readable media includes computer storage media. Computer storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media may comprise a random-access memory (RAM), a read-only memory (ROM), an electrically erasable programmable ROM (EEPROM), compact disk ROM (CD-ROM) or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. Combinations of the foregoing may also be included within the scope of computer-readable media. Also, combinations of the foregoing may also be included within the scope of memory.
The terms and phrases utilized in the present disclosure may have various meanings, definitions, descriptions, characterizations, classifications, and/or other attributes that are understood by one of ordinary skill in the art and which are within the scope of the present disclosure. It would be impractical to explicitly elaborate upon every single term and/or phrase in the present disclosure, and one of ordinary skill in the art will understand the meanings, definitions, descriptions, characterizations, classifications, and/or other attributes of the terms and/or phrases in the present disclosure, even if not explicitly elaborated upon. Nevertheless, for purposes of illustration but not limitation, various non-limiting examples of some meanings, definitions, descriptions, characterizations, classifications, and/or other attributes are provided herein with reference to some of those terms and/or phrases in the present disclosure. None of these examples are intended to limit the scope of such terms and/or phrases; accordingly, such terms and/or phrases may have additional or alternative meanings, definitions, descriptions, characterizations, classifications, and/or other attributes without necessarily deviating from the scope of the present disclosure.
The term(s) ‘receive’ and/or ‘receiving’ (and similar terms) may include acquiring, obtaining, collecting, analyzing, reading, processing, decoding, demodulating, deciphering, and/or various other suitable operations, features, and/or functions. The term(s) ‘transmit’ and/or ‘transmitting’ (and similar terms) may include generating, modulating, addressing, designating, encoding, processing, sending, broadcasting, conveying, relaying, transferring, transporting, channeling, forwarding, propagating, routing, and/or various other suitable operations, features, and/or functions. The terms(s) ‘refrain’ and/or ‘refraining’ (and similar terms) may include abstaining, avoiding, resisting, forgoing, desisting, renouncing, restraining, forbearing, bypassing, withholding, omitting, not performing, and/or various other suitable operations, features, and/or functions. The term(s) ‘consider’ and/or ‘considering’ (and similar terms) may include reading, processing, analyzing, inspecting, acknowledging, looking at, reviewing, comparing, processing, checking, viewing, assessing, and/or various other suitable operations, features, and/or functions. The term(s) ‘determine’ and/or ‘determining’ (and similar terms) may include processing, calculating, electing, selecting, looking up, reading, computing, using, concluding, deciding, resolving, settling, deducing, inferring, deriving, obtaining, and/or various other suitable operations, features, and/or functions. The term(s) ‘use’ and/or ‘using’ (and similar terms) may include utilizing, employing, exploiting, applying, basing upon, leveraging, working with, using to look up, using to determine, using to/for reference, processing, analyzing, looking at, and/or various other suitable operations, features, and/or functions.
The term(s) ‘eliminate’ and/or ‘eliminating’ (and similar terms) may include excluding, not considering, refraining from considering, disqualifying, ignoring, and/or various other suitable operations, features, and/or functions. The term(s) ‘select’ and/or ‘selecting’ (and similar terms) may include choosing, electing, appointing, allocating, designating, determining, deciding on, picking, using, utilizing, performing an operation (e.g., transmission/reception) using, and/or various other suitable operations, features, and/or functions. The term(s) ‘random’ and/or ‘randomly’ (and similar terms) may include arbitrarily, indiscriminately, incidentally, by chance, without allocation/assignment, without designation, haphazardly, and/or various other suitable operations, features, and/or functions. The term(s) ‘override’ and/or ‘overriding’ (and similar terms) may include replacing, annulling, overwriting, superseding, canceling, replacing, and/or various other suitable operations, features, and/or functions. The term(s) ‘maintain’ and/or ‘maintaining’ (and similar terms) may include using, considering, managing, utilizing, employing, supporting, enabling, accommodating, processing, sustaining, and/or various other suitable operations, features, and/or functions. The term(s) ‘trigger’ and/or ‘cause’ may include elicit, activate, start, initiate, bring about, generate, produce, trigger, cause, prompt, provoke, lead to, result in, precipitate, evoke, incite, kickoff, motivate, make, and/or various other suitable operations, features, and/or functions. The term ‘in response to’ may refer to an indirect or direct causal relationship, an association, a correspondence, a temporal relationship or association, and/or various other suitable attributes. For example, X may be in response to Y if/when X is indirectly or directly caused by Y, if/when the occurrence/existence of X is associated with the occurrence/existence of Y, if/when the occurrence/existence of X corresponds to the occurrence/existence of Y, if/when the occurrence/existence of X is within a particular period of time relative to the occurrence/existence of Y, if/when X has various other suitable attributes in relation to Y.
In some aspects, a ‘NAV’ refers to a virtual carrier sensing mechanism that may be utilized in various wireless communication protocols. By using virtual carrier sensing, the need for (physical/actual) carrier sensing (e.g., energy detection or sensing on a channel or subchannel) may be minimized, reduced, and/or limited, which can contribute to power conservation. In some aspects, a NAV may be an indicator maintained by each STA 1 and the indicator may indicate time periods when transmission onto a wireless communication medium is not, will not be, or should not be initiated by the STA 1 even if the STA's clear channel assessment senses that the channel is may not be busy (e.g., is idle/available). In some aspects, a NAV may be configured to regulate whether the STA accesses a wireless communication medium, channel, and/or subchannel during a period of time. In some aspects, a NAV may be thought of as a counter that counts backwards, wherein the wireless communication medium, channel, and/or subchannel is busy anytime that the counter has a positive value, and wherein the wireless communication medium, channel, and/or subchannel is available (e.g., idle) anytime that the counter does not have a positive value (e.g., has a value of zero). An apparatus (e.g., STA) may receive, read, determine, obtain, recall, utilize, ascertain, and/or otherwise interface with such information. In some aspects, such information may be received in a frame, packet, and/or data unit, as described in greater detail herein. Based on such information, the apparatus (e.g., STA) may determine whether a wireless communication medium, channel, and/or subchannel is available or busy during a particular period/duration of time. The phrase ‘updating a NAV,’ ‘setting a parameter/setting of a NAV,’ ‘setting a NAV,’ and/or various other similar/related phrases may refer to various functions, features, and/or operations related to such information. For example, such phrases may generally refer to updating and/or setting the information related to the duration/period during which a wireless communication medium, channel, and/or subchannel is busy or available. Various additional and alternative aspects related to the NAV are readily understood by one of ordinary skill in the art and are within the scope of the present disclosure.
The term(s) ‘detection’ and/or ‘detecting’ may refer to the determination, conclusion, deduction, inference, and/or other suitable operation/function that the characteristics associated with a particular signal satisfy at least one criterion, threshold, requirement, condition, parameter, and/or setting. For example, at least a portion (e.g., a preamble) of a signal may be detected if the strength (e.g., power) of the received signal satisfies a particular criterion, threshold, requirement, condition, parameter, and/or setting. The term ‘time synchronization’ may refer to the temporal attribute, relationship, and/or correlation of certain occurrences. In some aspects, the time synchronization of simultaneous/concurrent transmissions (e.g., by a plurality of STAs) may refer to the attribute, relationship, and/or correlation that those simultaneous/concurrent transmissions begin at the same/similar time as, occur (at least in part) concurrently with, and/or end at the same/similar time relative to each other. In some aspects, the phrase ‘simultaneous UL transmissions’ may refer to ‘an UL transmission (by an STA) simultaneously/concurrently with another UL transmission (by at least one other STA).’ The term(s) ‘reduce’ and/or ‘reducing’ may include decreasing, subtracting, lessening, lowering, decrementing, scaling, scaling down, curtailing, adjusting, and/or various other suitable operations, features, and/or functions.
The term ‘plurality’ refers to ‘more than one’ (e.g., two or more). Although the term ‘plurality’ may refer to ‘all’ in some aspects, the term ‘plurality’ may refer to ‘some but not all’ or ‘some but fewer than all’ in some other aspects. Therefore, recitation of ‘plurality of STAs’ refers to ‘two or more STAs’ but such recitation does not necessarily require or necessitate each and every STA in every embodiment. Accordingly, in some aspects, ‘plurality’ may be interchangeable with ‘more than one but fewer than all/every.’
In some aspects, the term(s) ‘communication,’ ‘transmission,’ signal,‘frame,’ ‘packet,’ ‘data unit,’ and/or various other similar terms may be interchangeable with each other without deviating from the scope of the present disclosure. In some aspects, the term(s) ‘communication,’ ‘transmission,’ ‘signal,’ ‘frame,’ ‘packet,’ ‘data unit,’ ‘UL signal,’ ‘DL signal,’ ‘ULTR,’ ‘UL trigger,’ and/or various other similar terms may refer to any form, grouping, and/or encapsulation of one or more bits, signals, waveforms, and/or data. In some aspects, such terms may be interchangeable relative to each other without deviating from the scope of the present disclosure. Without deviating from the scope of the present disclosure, some of these terms may be referred to by various other terms, such as a protocol data unit (e.g., a physical layer convergence protocol (PLCP) protocol data unit (PPDU), a MAC protocol data unit (MPDU)), a service data unit (e.g., a physical layer service data unit (PSDU), a MAC service data unit (MSDU)), and/or various other suitable form, grouping, and/or encapsulation of one or more bits, signals, waveforms, and/or data.
In some aspects, the term ‘apparatus’ may refer to the singular form of the word (apparatus). In some aspects, the term ‘apparatus’ is not limited to the singular form of the word (apparatus) and, thus, ‘apparatus’ may refer to the singular form and/or the plural form of the word (apparatus) without deviating from the scope of the present disclosure. For example, in some aspects, ‘apparatus’ may be interchangeable with ‘apparatuses,’ ‘one or more apparatus,’ and/or ‘one or more apparatuses’ without deviating from the scope of the present disclosure. In some aspects, the term ‘medium’ may refer to the singular form of the word (medium). In some aspects, the term ‘medium’ is not limited to the singular form of the word (medium) and, thus, ‘medium’ may refer to the singular form and/or the plural form of the word (medium) without deviating from the scope of the present disclosure. For example, in some aspects, ‘medium’ may be interchangeable with ‘mediums,’ ‘media,’ ‘one or more mediums,’ and/or ‘one or more media’ without deviating from the scope of the present disclosure.
In some aspects, the terms ‘destined for’ and ‘intended for’ may be interchangeable without deviating from the scope of the present disclosure. In some aspects, the terms ‘destined/intended for’ and ‘destined/intended to’ may be interchangeable without deviating from the scope of the present disclosure. The coverage area of a particular transmitter (e.g., AP, STA) may include many receivers (e.g., AP(s), STA(s)); however, in some aspects, not all of those receivers are necessarily the intended receivers or destinations of every transmission from that transmitter. For example, in some aspects, the transmitter may transmit a transmission (e.g., signal, frame, packet, and/or data unit) that is destined/intended for no more than a subset (e.g., less than an entirety) of all receivers that happen to receive that transmission by virtue of being within the coverage area of that particular transmitter. In some aspects, a transmission is ‘intended for’ or ‘destined for’ one or more particular receivers when/if that transmitter intended for that transmission to include at least some data and/or information for that/those one or more particular receivers. For example, the transmitter may include some type of identifier in that transmission for that/those particular receivers to use in order to identify that they are the intended recipients or destinations of at least a portion of that transmission. Accordingly, in some aspects, the terms ‘destined for’ and ‘intended for’ shall not necessarily mean every receiver that happened to receive that particular transmission, unless every receiver was an intended recipient or destination of that particular transmission.
The term(s) ‘field’ and/or ‘portion’ (and similar terms) may refer to a subset (e.g., not an entirety) of all of the data and/or information contained in an encapsulation sometimes referred to as a frame, packet, or data unit. A frame, packet, and/or data unit may include one or more fields and/or one or more portions. Each field and/or each portion may be configured to include various types and forms of data and/or information without deviating from the scope of the present disclosure.
The term ‘STS’ may refer to spatial streams, bit streams, information streams, data streams, and/or streams of data and/or information that may have a time component and/or a frequency component. In some aspects, an STS may refer to a stream of modulated symbols created by applying a combination of spatial and temporal processing to one or more spatial streams of modulated symbols. In some aspects, an STS may refer to one of several streams of bits and/or modulated symbols that might be transmitted over multiple spatial dimensions that are created by the use of multiple antennas at both ends of a communication link. In some aspects, STS(s) may be generated using spatial multiplexing, which may refer to a transmission technique in which data streams are transmitted on multiple spatial channels that are provided through the use of multiple antennas at the transmitted and the receiver. In some aspects, a frame, packet, and/or data unit may include a plurality of STSs, and each STS may be independently and/or separately encoded. STSs may employ time multiplexing and/or frequency multiplexing.
The term ‘number’ (e.g., ‘number’ of STSs) may refer to the quantity, numerical quantification, count, amount, size, extent, and various other suitable measurements of the STSs. Because a frame, packet, and/or data unit may include a plurality of STS, not all of which may be destined/intended for a single STA, a STA that receives such a frame, packet, and/or data unit may select the STS(s) destined/intended for it. In some aspects, the term ‘variable’ refers to something that may be adjustable, changeable, configurable, flexible, and/or may consist of a range or set of potential, possible, or candidate values. The term(s) ‘selection’ and/or ‘selecting’ (e.g., ‘selecting’ of one or more STSs included in a frame, packet, and/or data unit) may refer to identifying, electing, picking, and/or choosing of the specific STSs destined/intended for a particular STS.
The term(s) ‘UP’ and/or ‘UP value’ may refer to an identifier, attribute, assignment, and/or allocation given to a particular user, STA, group of users, group of STAs, and/or other suitable destinations to which a frame, packet, and/or data unit may be destined/intended. A ‘user’ may be any intended destination or apparatus configured to utilize the information and/or data included in the frame, packet, and/or data unit. The UP of the STA(s)/user(s) may correspond to, may be associated with, and/or may correlate with a UP of the frame, packet, and/or data unit.
In some aspects, the terms ‘assign,’ ‘assignment,’ and/or ‘assigned’ may be interchangeable with ‘allocate,’ ‘allocation,’ and/or ‘allocated’ without deviating from the scope of the present disclosure. In some aspects, the terms ‘duration,’ ‘length,’ ‘size,’ ‘period,’ and similar terms may be interchangeable without deviating from the scope of the present disclosure. In some aspects, the terms ‘simultaneous,’ ‘concurrent,’ and similar terms may be interchangeable without deviating from the scope of the present disclosure. In the context of wireless communication (e.g., reception and/or transmission), two signals, frames, packets, and/or data units may be characterized as ‘simultaneous’ and/or ‘concurrent’ if they occur (at least in part) at the same or substantially similar (e.g., temporally similar or correlated) times (i.e., even if not at the exact same time) relative to each other.
In some aspects, the terms ‘resource(s)’ and ‘RU’ may be interchangeable without deviating from the scope of the present disclosure and may refer to a duration of time and/or a range of frequencies (e.g., bandwidth) assigned, allocated, dedicated, scheduled, and/or otherwise earmarked for use by one or more apparatuses. In some aspects, one or more resources/RUs may be configured for random access. Such resource(s)/RU(s) may refer to resources shared by a plurality of STAs. In some aspects, the STAs may randomly select one or more of such resource(s)/RU(s) for accessing the wireless communication channel or subchannel.
In some aspects, the phrase ‘backoff counter’ may refer to a timer or counter that counts or keeps track of an amount of time before an apparatus (e.g., STA) is allowed/permitted to perform an operation/function. For example, an STA may have a backoff counter that may count backwards from a particular value (e.g., Time X , X time-units, etc.) until another particular value (e.g., Time Y , Y time-units, etc., wherein Y<X in this example), at which time the STA may perform a particular operation/function (e.g., utilize certain resources of a wireless communication channel). The term ‘transmission opportunity’ may refer to an interval of time during which a STA is permitted/allowed to access the wireless medium and/or communicate using a particular wireless communication channel or subchannel. In some aspects, a transmission opportunity is defined by a starting time and a maximum duration.
In some aspects, the term(s) ‘acknowledgement’ and/or ‘acknowledgement message’ may include a positive acknowledgement message/signal and/or a negative acknowledgement message/signal, and/or may be a block acknowledgement message/signal. The phrase ‘feedback frame’ may refer to any signal, frame, packet, and/or data unit that includes at least some feedback information and/or data, such as a feedback matrix. A feedback matrix may include information about a signal received at a receiver/beamformee (e.g., STA), and such information may be communicated from the receiver/beamformee (e.g., STA) to a transmitter/beamformer (e.g., AP). In some aspects, the term ‘difference’ may refer to a subtraction between two values, fields, and/or other suitable aspects, but the ordering can be re-arranged without deviating from the scope of the present disclosure. In some aspects, a difference between X and Y can mean X minus Y. In some aspects, a difference between X and Y can mean Y minus X. In some aspects, the phrase ‘originating from’ may refer to the origin of a transmission (e.g., an AP/STA from which a transmission originated), without regard to any relays that may extend the coverage area, communication range, and/or propagation distance of that transmission from its origin.
The term(s) ‘protect’ and/or ‘protection’ may refer to maintaining a wireless communication channel or subchannel, idle, unencumbered, utilized, reserved, available and/or otherwise accessible for a particular communication during a particular duration or period of time. A transmission configured to cause a plurality of STAs to simultaneously transmit a signal/transmission that is configured to protect a DL multiuser transmission to the plurality of STAs may referred to as a request-to-send message/signal. A signal/transmission that is configured to protect a DL multiuser transmission may be referred to as a clear-to-send message/signal. The term(s) ‘transmission power’ and/or ‘transmit power’ may refer to the amount of power with which a signal, frame, packet, and/or data unit is transmitted. In some aspects, how much transmission power an apparatus (e.g., STA, AP, etc.) remains capable of using relative to the transmission power currently/recently utilized may be referred to as transmit power margin/headroom. The term ‘indication(s)’ may refer to a bit, a field, a parameter, a bitstream, a modulation, and/or any other suitable indicia. The terms ‘channel(s)’ and/or ‘subchannel(s)’ may include or refer to a carrier, a subcarrier, a bandwidth, a portion of a bandwidth, a frequency range, a set of frequency values, and/or various other characteristics and attributes known to one of ordinary skill in the art. The term ‘SS’ may refer to a set of one or more STAs. Such STAs may be synchronized some of their operations with one another, such as the timings of their transmissions, receptions, NAVs, and/or any other suitable aspects.
Without deviating from the scope of the present disclosure, any aspect described herein with respect to an AP may (or may not) apply to an STA and that the features described herein with respect to an STA may (or may not) apply to an AP. Aspects disclosed herein with respect to an AP and/or STA are hereby also disclosed with respect to any apparatus, method, and/or computer-readable medium that is configured in accordance with such aspects.
The word “example” or “exemplary” may be used herein to mean “serving as a non-limiting example, instance, or illustration.” Any aspect, embodiment, and/or configuration described herein as “exemplary” or an “example” shall not necessarily be construed as preferred or advantageous over other aspects, configurations, and/or configurations. The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any aspect described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects.” Unless specifically stated otherwise, the term “some” refers to one or more. Combinations such as “A, B, and/or C,” “at least A, B, or C,” “at least one of A, B, or C,” “at least one of A, B, and C,” and “A, B, C, or any combination thereof” include any combination of A, B, and/or C, which may include any one of the following possibilities: (i) one or more of A; (ii) one or more of B; (iii) one or more of C; (iv) one or more of A and one or more of B; (v) one or more of A and one or more of C; (vi) one or more of B and one or more of C; or (vii) one or more of A, one or more of B, and one or more of C.
The description set forth below in connection with the appended drawings is intended as a description of various configurations and is not intended to represent the only configurations in which the concepts described herein may be practiced. All structural and functional equivalents to the elements of the various aspects described throughout this disclosure that are known or later come to be known to those of ordinary skill in the art are expressly incorporated herein by reference and may be encompassed by the claims. Moreover, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is explicitly recited in the claims. No claim element is to be construed as a means plus function unless the element is expressly recited using the phrase “means for.” The description herein is provided to enable any person skilled in the art to practice the various aspects described herein. Without deviating from the scope of the present disclosure, various modifications to the foregoing aspects may be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects. Thus, the claims are not intended to be limited to the aspects described herein and/or shown in the accompanying drawings. In the claims, any reference to an element in the singular form is not intended to mean “one and only one” unless specifically so stated, but rather “one or more.”