DE112022000071T5 - PROTOCOL FOR WI-FI BASED FIXED WIRELESS ACCESS - Google Patents

Abstract

A method may include determining, by an access point, which stations among multiple stations are allowed access to a wireless communication medium in a subsequent uplink frame. The method may also include broadcasting an uplink map to the stations, the uplink map identifying a first station of the plurality of stations as authorized to access the wireless communication medium. The uplink map may also identify an assignment of the subsequent uplink frame for the first station. The method may also include, while allocating the subsequent uplink frame allocated to the first station, receiving: an acknowledgment (ACK) of the downlink data transmitted to the first station, uplink data, a resource allocation request from the first Station requesting access to a second subsequent uplink frame, and/or combinations thereof.

Description

AREA

The implementations discussed here refer to a fixed wireless access protocol.

BACKGROUND

Unless otherwise indicated herein, the materials described herein do not constitute prior art to the claims in the present application and are not admitted to be prior art by inclusion in this section.

Home, office, stadium, and outdoor networks, also known as wireless local area networks (WLAN), are set up using a device called a wireless access point (WAP). The WAP may include a router. The WAP wirelessly couples all devices of the local network, e.g. B. wireless stations such as computers, printers, televisions, digital

Video players (DVD players), security cameras and smoke detectors, together and to the cable or subscriber line through which Internet, video and television are delivered to the local area network. Most WAPs implement the IEEE 802.11 standard, which is a contention-based standard for handling communications between multiple competing devices for a shared wireless communications medium on a selected one of a plurality of communications channels. The frequency range of each communication channel is specified in the appropriate one of the IEEE 802.11 protocols implemented, e.g. "a", "b", "g", "n", "ac", "ad", "ax", "ay", "be". The communications follow a hub and spoke model with a WAP at the hub and spokes corresponding to the wireless connections to each "client" device or station (STA) using the WLAN.

The subject matter claimed herein is not limited to implementations that solve any disadvantages or that only operate in environments like those described above. Rather, this background is provided only to illustrate an example area of technology in which some embodiments described herein may be practiced.

EXECUTIVE SUMMARY

This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential characteristics of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.

Some example implementations described herein generally relate to the use of a new wireless communication reference framework that includes Fixed Wireless Access (FWA) technology. FWA uses an uplink frame and a downlink frame (which together form a superframe) to determine the direction of traffic for specific periods of time.

One or more implementations may include an example method or system that includes determining, by an access point, which stations among multiple stations are allowed to access a wireless communication medium in a subsequent uplink frame. The method or system may also include broadcasting an uplink map to the stations, the uplink map identifying a first station of the plurality of stations as authorized to access the wireless communication medium. The uplink map may also identify an assignment of the subsequent uplink frame for the first station.

One or more implementations may include an example method or system that includes receiving, by a station and from an access point, an uplink map identifying an assignment within a subsequent uplink frame within which the station has access to a wireless medium. wherein the uplink map includes a start time and an end time for the assignment. The method may also include, based on the start time of the assignment, the coincides with a current time, information is transmitted to the access point so that the transmission of information is completed before the end time.

The present disclosure can be implemented in hardware, firmware, or software. Associated devices and circuits are also claimed. Additional features and advantages of the present disclosure will be set forth in the following description and in part will be apparent from the present disclosure or may be learned through practice of the present disclosure. The features and advantages of the present disclosure may be realized and attained by means of instruments and combinations recited in the appended claims. These and other features of the present disclosure will be more fully apparent from the following description and the appended claims, or may be learned by practice of the present disclosure as set forth hereinafter.

character list

• 1 veranschaulicht ein Beispiel eines Superframes, der in einer Technologie für festen drahtlosen Zugang (FWA) verwendet wird, beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.
• 2 veranschaulicht ein beispielhaftes System für die Kommunikation mittels FWA, beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.
• 3 veranschaulicht ein beispielhaftes Diagramm 300 einer Reihe von Kommunikationen mittels FWA, beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.
• 4 veranschaulicht einen beispielhaften Uplink-Map-Frame (UL-Map-Frame), beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.
• 5 veranschaulicht einen beispielhaften Ressourcenzuweisungsanforderungsframe, beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.
• 6 veranschaulicht eine beispielhafte Visualisierung potenzieller Kollisionen in einem Konkurrenzschlitz eines Uplink-Frames, beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.
• 7 veranschaulicht ein Flussdiagramm eines beispielhaften Verfahrens zur Kommunikation mittels FWA, beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.
• 8 veranschaulicht ein Flussdiagramm eines beispielhaften Verfahrens zum Koordinieren von FWA-Superframes über mehrere Zugangspunkte, das gemäß mindestens einer Implementierung der vorliegenden Offenbarung beschrieben wird.
• 9 veranschaulicht ein Flussdiagramm eines beispielhaften Verfahrens zum Koordinieren von Zeitsteuerungsinformationen, um die Kommunikation mittels FWA zu erleichtern, beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.
• 10 veranschaulicht ein Flussdiagramm eines beispielhaften Verfahrens zum Berücksichtigen von Latenzzeiten, um die Kommunikation mittels FWA zu erleichtern, beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.
• 11 veranschaulicht ein Flussdiagramm eines beispielhaften Verfahrens zum Priorisieren oder Planen von Daten für die Kommunikation mittels FWA, beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.
• 12 veranschaulicht ein Flussdiagramm eines beispielhaften Verfahrens zum Kommunizieren von ACKs an einen Zugangspunkt unter Verwendung von orthogonalem Frequenzmultiplex-Mehrfachzugriff (OFDMA), beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.
• 13 veranschaulicht ein Flussdiagramm eines beispielhaften Verfahrens zum Berücksichtigen von Latenzzeiten, um die Kommunikation mittels FWA zu erleichtern, beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.
• 14 veranschaulicht eine schematische Darstellung einer Maschine in der Beispielform einer Rechenvorrichtung, beschrieben gemäß mindestens einer Implementierung der vorliegenden Offenbarung.

Example implementations are described and explained with additional specificity and detail through the use of the accompanying drawings, to which:

• 1 FIG. 11 illustrates an example of a superframe used in fixed wireless access (FWA) technology, described in accordance with at least one implementation of the present disclosure.
• 2 12 illustrates an example system for communicating using FWA, described in accordance with at least one implementation of the present disclosure.
• 3 FIG. 30 illustrates an example diagram 300 of a series of communications via FWA described in accordance with at least one implementation of the present disclosure.
• 4 12 illustrates an exemplary uplink (UL) map frame described in accordance with at least one implementation of the present disclosure.
• 5 illustrates an example resource allocation request frame described in accordance with at least one implementation of the present disclosure.
• 6 12 illustrates an example visualization of potential collisions in a contention slot of an uplink frame, described in accordance with at least one implementation of the present disclosure.
• 7 12 illustrates a flowchart of an example method for communicating using FWA, described in accordance with at least one implementation of the present disclosure.
• 8th 12 illustrates a flow diagram of an example method for coordinating FWA superframes across multiple access points, described in accordance with at least one implementation of the present disclosure.
• 9 12 illustrates a flowchart of an example method for coordinating timing information to facilitate communication via FWA, described in accordance with at least one implementation of the present disclosure.
• 10 12 illustrates a flow chart of an example method for accounting for latencies to facilitate communication via FWA, described in accordance with at least one implementation of the present disclosure.
• 11 12 illustrates a flowchart of an example method for prioritizing or scheduling data for communication using FWA, described in accordance with at least one implementation of the present disclosure.
• 12 12 illustrates a flow diagram of an example method for communicating ACKs to an access point using orthogonal frequency division multiple access (OFDMA), described in accordance with at least one implementation of the present disclosure.
• 13 12 illustrates a flow chart of an example method for accounting for latencies to facilitate communication via FWA, described in accordance with at least one implementation of the present disclosure.
• 14 12 illustrates a schematic representation of a machine, in example form of a computing device, described in accordance with at least one implementation of the present disclosure.

DETAILED DESCRIPTION OF SOME EXEMPLARY EMBODIMENTS

The aspects described herein include improvements to Wi-Fi channel access protocols and frame sequences to enable Wi-Fi to be deployed as Fixed Wireless Access (FWA) technology. When using FWA, an access point (AP) can specify a superframe with a specific downlink frame and a specific uplink frame, which together form the superframe. Communication generally or exclusively flows in one direction during the downlink frame and the uplink frame, for example from AP to stations (STAs) during the downlink frame and from STAs to AP during the uplink frame.

A challenge with using Wi-Fi in the mmWave bands (e.g. between 24.25 GHz and 29.5 GHz) is that uplink and downlink transmissions are sent in separate, alternating time slots (eg, to comply with regulations, standards, requirements, government restrictions, among other reasons). An exemplary reason for this includes aligning Wi-Fi signals with time-slotted LTE/5G systems operating in the same band. For example, these technologies can use specific time slots for uplink communication and a separate and distinct time for downlink communication. Often cellular base stations (BS) are located in a tower with three BS, each pointing in a different direction and covering 120°, so that the three BS together cover a full 360° area. However, due to the proximity of the BS to each other, when one of the BSs is broadcasting, the other BSs are unable to accurately identify signals being sent to the BS. For this reason, the BSs on a tower can coordinate with each other (and/or with other BSs) so that all BSs receive signals at the same time and send signals at the same time. Additionally, using the Wi-Fi Clear Channel Assessment (Wi-Fi CCA) mechanism (e.g. physical layer eavesdropping on radio frequency (RF) transmissions) may be ineffective because the STAs are unable to hear the other STAs' signals when they are competing for the medium due to the high directional nature of transmissions. This high directional dependency creates many more hidden nodes than a typical Wi-Fi installation.

1 1 illustrates an example of a superframe 100 used in fixed wireless access (FWA) technology, described in accordance with at least one implementation of the present disclosure. The superframe 100 can include a downlink frame 110 and an uplink frame 120 .

FWA technology can represent an architecture and protocol in which transmissions are generally unidirectional. For example, an AP can broadcast some information in general and can transmit data to specific STAs in the downlink frame 110 . During the downlink frame 110, the AP may not be expecting or even listening for transmissions directed to the AP. Similarly, during uplink frame 120, the AP may listen for transmissions (including those from specific STAs at specific times) and may not transmit data during uplink frame 120. For example, all confirmations (e.g. ACKs for QoS frames) cannot be sent immediately, but only in a later transmission frame. For example, ACKs for received downlink data are delayed and sent in a subsequent uplink slot, and ACKs for received uplink data are delayed and sent in a subsequent downlink slot. For all transmissions in a system using FWA (whether uplink or downlink), the transmissions can operate with a delayed ACK configuration.

To simplify the architecture, the AP can designate specific slots within the uplink frame 120 for specific STAs. When an STA is assigned an uplink slot in uplink frame 120, the STA can use that slot to send ACKs, data, management frames, or resource allocation requests, or a mixture thereof. ACKs and other high-priority information can be prioritized and sent first to minimize or reduce latency and buffering. In some implementations, STAs can request access to the uplink frame 120 via a resource allocation request to the AP. The resource allocation request may indicate to the AP that the STA has data to transmit to the AP and what amount of data/transmission time is requested. Such requests may be made during a contention period or during an assignment specific to the STA be sent. An example of a resource allocation request is provided with reference to 5 described in more detail.

In some implementations, FWA can use Multi-User-Multi-Input-Multi-Output (MU-MIMO) for downlink (and uplink) data transmissions and leverage UL Orthogonal Frequency-Division Multiple Access (OFDMA) to reduce the overhead of the UL - Reduce ACKs.

In a first example implementation, the duration of the UL frame 120 and the DL frame 110 may be variable depending on the planned uplink and downlink throughput, the number of deployed STAs, and/or usage scenarios. For example, an AP that manages or coordinates the superframe 100 can be programmed with a specific downlink frame 110 and uplink frame 120 duration. In some implementations, the DL frame 110 may be longer than the UL frame 120, e.g. B. between 1.5 times and 5 times the length. In some implementations, DL frame 110 may be approximately twice as long as UL frame 120. In some implementations, DL frame 110 may be 13 msec and UL frame 120 may be 7 msec (which is useful for maximizing throughput of may be an advantage, but may increase latency). In another example, the DL frame 110 may be 7 msec and the UL frame 120 may be 3 msec (which may be a balance between throughput and latency). As another example, DL frame 110 may be 464 µsec and UL frame 120 may be 143 µsec (which may be compatible with 5G networks). In these and other embodiments, when selecting a size and/or ratio between the DL frame 110 and the UL frame 120 in the superframe 100, the selected size and/or ratio may be used consistently throughout network operation.

In some examples, the duration of the downlink frame 110 and the uplink frame 120 can be chosen to match the UL and DL slots used by 5G systems in the same band. In these and other implementations, there may be some flexibility in the sense that FWA-UL transmissions may be allowed in the 5G downlink slot. This can be allowed, or a fixed UL/DL ratio can be chosen. In these and other implementations, a priori UL/DL assignments can be selected and used, e.g. B. Based on synchronization with 5G New Radio (NR) transmission slots (assuming 120 KHz subcarrier spacing and 0.125 ms time slots). In these and other implementations, the 5G implementation may include a gap between the DL frame 110 and the UL frame 120 . For example, DL frame 110 may be 464 µsec long, followed by an 18 µsec gap, and UL frame 120 may be 143 µsec long, resulting in superframe 100 that is 625 µsec long overall. If part of the DL frame 110 is used for uplink transmissions, the final UL/DL ratio may be different or slightly different than e.g. B. at the 5G NR transmission slots.

In order to use FWA, both APs and STAs must operate with a common understanding of the time slots and the time intervals within them. There are a number of ways to establish such a general understanding of the bar. For example, both the AP and STAs may have access to a shared external clock (e.g., pulse-per-second (PPS) clock provided by GPS). The start times of the superframes 100 can be fixed in relation to the common external clock. In these and other implementations, both the AP and STAs may include some interface to the shared external clock. For example, a given tower may include three cellular BSs (acting as APs) each covering 120°. The three BSs can be synchronized with each other via PPS signals. Various wireless network devices (such as routers, etc.) can be in communication with the three BSs as the STAs. The STAs can coordinate their timing with the BSs and/or with the PPS signals.

As another example, there may not be a shared external clock between the AP and STAs. In such an implementation, the AP can act as the master of the clock. The STAs can operate on free running clocks that can be periodically adjusted to track the master clock from the AP. One possible implementation is to use the Time Synchronization Function (TSF) mechanism defined in 802.11. For example, under 802.11, each STA maintains a local 64-bit TSF timer. The AP may broadcast (e.g. in a beacon) the value of its TSF timer at the time the communication is broadcast. STAs can compare the received TSF of the broadcast with their local TSF and can adjust their timing accordingly (e.g. if the STA's clock is off by 5 µsec, the STA can offset its timing by 5 µsec. Additionally or alternatively, the STA can adjust its update its own local TSF to match that of the AP In these and other embodiments, a combination of the AP's synchronization with an external clock (e.g. via the PPS signal) and the synchronization of the STAs with the AP (e.g. via the TSF signals in beacons).

In some implementations (e.g., those compliant with 802.11), devices such as APs and STAs may include a TSF timer with modulus 2 ⁶⁴ that counts in microsecond increments. In such an implementation, a STA sending a beacon frame may set the value of the timestamp of the beacon frame to match the value of the STA's TSF timer at the time the data symbol containing the first bit of the timestamp, is transmitted to the physical layer (PHY) plus the delays of the transmitting STA through its local physical layer (PHY) from the Media Access Control (MAC) PHY interface to its interface with the wireless medium. Upon receiving a beacon, a STA may update its TSF timer according to the following algorithm: The value of the received timestamp may be adjusted by adding an amount equal to the receiving STA's delay through its local PHY components plus the time since reception of the first bit of the timestamp on the MAC-PHY interface. For an Infrastructure Basic Service Set (BSS), the STA's TSF timer can then be set to the adjusted value of the timestamp. In other words, in such implementations, the STA can compare its TSF counter with the AP's TSF counter each time it receives a timestamp value (e.g., in the beacon).

In some implementations, a TSF timer of the STA can be accurate to ±100 parts per million (ppm). Assuming a beacon period of e.g. B. 100 msec and a maximum relative timing offset of 200 ppm between AP and STA, the maximum clock slip between two beacons would be: (100 × 10 ^-3 ) × (200 × 10 ^-3 ) = 200 µsec in these and other implementations this accuracy is sufficient to determine the boundaries of the superframe 100, including the downlink frame 110, the uplink frame 120, and the transmission capabilities within the superframe 100. If higher accuracy is required or desired, the periodicity with which the timing information is transmitted between the AP and the STAs (e.g. the beacon) can be increased.

In some implementations, e.g. in the context of superframes 100 used in connection with 5G systems, the boundaries of the superframe 100 can be aligned with the boundaries of other transmitting devices, other APs, base stations (BSs) and other such devices, e.g. B. by aligning with previously established 5G superframes. In these and other implementations, the AP can interface to an external synchronization reference to verify that the TSF clock conforms to these limits. For example, the AP can periodically compare its free running TSF clock to the external clock.

In some implementations, there may be no Carrier Sense Multiple Access (CSMA) backoff channel contention between consecutive frames in the downlink (or uplink if a STA transmits multiple frames in its allocated slot). Instead, the AP and STA can use a minimum time between consecutive transmitted packets. This time may be configurable and may be referred to as FWA_IFS.

The final value of FWA_IFS can be determined based on the capabilities of the AP and STAs, e.g. B. how long it takes for a device to receive a new frame after the completion of the previous frame.

Table 1 summarizes some sample parameters for configuring the FWA protocol. Table 1: FWA parameters parameter Meaning DL_FRAME Duration of the downlink frame in each superframe UL_FRAME Uplink frame duration in each superframe SLOT_PERIOD Duration of the entire superframe - equal to DL_FRAME + UL_FRAME UL_MAP_PERIOD The periodicity with which the UL MAP frame is sent by the AP (or in some implementations, the periodicity with which the frame is added to the management buffer) ACK_PERIOD Outstanding ACK requests can be updated with a period of ACK_PERIOD. ACK_OFFSET The timing of the updates to the outstanding ACK requests is offset relative to the UL_MAP _PERIOD BEACON_PERIOD The periodicity with which the beacon frame is sent by the AP (or in some implementations, the periodicity with which the frame is added to the management buffer) FWA_IFS The minimum interframe distance between consecutive transmissions

2 12 illustrates an example system 200 for communicating using FWA, described in accordance with at least one implementation of the present disclosure. The system 200 can include one or more access points (APs) 210 and 211 that can manage or control the use of the FWA. In these and other embodiments, multiple stations (STAs) (e.g., a first STA 221 and/or second STA 222, third STA 223, fourth STA 224, fifth STA 225, and/or sixth STA 226) can communicate wirelessly with the APs 210 and 211 communicate. Although reference may be made to AP 210, it is understood that AP 211 operates in the same or a similar manner.

The AP 210 can control when downlink and uplink data is transmitted (e.g., the timing and superframe splitting) and determines which stations of the STAs 221-226 can transmit in a given uplink frame. The AP 210 and STAs 221-226 can communicate with each other via FWA. An example of the different communications is in 3 illustrated.

For each superframe, the AP 210 can send an assignment that specifies which STAs are allowed to send in a subsequent uplink frame and at what times they are allowed access to the medium.

Although illustrated as various access points or routers, any type of electronic device that communicates wirelessly with the AP 210 is contemplated. An example AP 210 may be a multiple input/multiple output (MIMO) device that supports up to NxN discrete communication streams over N antennas. In an example, the AP 210 can be implemented as a signal processing unit of the MIMO device as NxN. In various implementations, the value of N can be 4, 6, 8, 12, 16, and so on. Extended MIMO operation allows the use of up to 2N antennas in communication with another similarly equipped wireless system.

3 FIG. 30 illustrates an example diagram 300 of a series of communications via FWA described in accordance with at least one implementation of the present disclosure. The 3 may be described using system 200 as an example of the various physical devices included in 3 perform illustrated communications. Diagram 300 illustrates a superframe 305 that includes a first downlink frame 310a and an uplink frame 320, and the first part of the next superframe with its associated second downlink frame 310b.

The first downlink frame 310a may include a beacon 330a, one or more ACKs 335a for uplink data received during the previous uplink frame, an uplink map 340a, and one or more downlink slots 345 for different stations, such as e.g. B. a first downlink slot 345a that sends data to a first station (such as first station 221 of the 2 ) transmits a second downlink slot 345b, which transmits data to a second station (such as second station 222 in 2 ) transmits, a third downlink slot 345c that carries data to a third station (such as third station 223 in 2 ) and a fourth downlink slot 345d carrying data to a fourth station (such as fourth station 224 in 2 ) transmits.

The beacon 330a may include one or more information describing aspects of a wireless network and may be referred to as a management frame. In some implementations, beacon 330a may include some or all of the information that 802.11 beacons may include. For example, the beacon 330a may include timestamp information (e.g., the TSF AP 210 information), a beacon interval (e.g., the periodicity with which the AP 210 can send the beacon 330a), capability information regarding the network and/or the AP 210, a service set identifier (SSID) of the network and/or include other information. With traditional Wi-Fi, a beacon may contain information not relevant to FWA (e.g. Enhanced Distributed Channel Access (EDCA) information, Delivery Traffic Indication (DTIM) information), supported rates, HT capabilities, HT information, WME (Wireless Multimedia Extensions), WMM (Wi-Fi Multimedia), advanced capabilities and others). To increase efficiency, in example implementations, the beacon 330a may include limited content compared to a conventional Wi-Fi beacon.

The ACKs 335a during the downlink frame 310a may include any acknowledgments from the AP 210 of previously received data received in a previous uplink frame. The acknowledgments can be similar to the ACK format used in Wi-Fi, such as B. Block ACK and Multi-STA Block ACK. The Multi-STA Block ACK can be used in the downlink to acknowledge in the previous superframe some or all of the uplink subframes that were correctly received during the previous uplink subframe. In these and other implementations, the transmission of ACKs 335a may be delayed compared to conventional Wi-Fi.

The uplink map 340a may include information on various aspects of one or more upcoming uplink frames, such as: B. the uplink frame 320 or the uplink frame 320 and one or more future uplink frames (not illustrated). Such information may include, among other information, the start time, which STAs are allowed to transmit data during the UL frame 320 (e.g., a list of all STAs that receive a wireless medium allocation during the UL frame 320), what kind of Data are allowed to identify when the various assignments of STAs begin and/or end when a contention period may be open to unscheduled transmissions. In some implementations, uplink map 340a may have a consistent structure or format for all devices utilizing FWA. An example of this is in 4 illustrated. In some implementations, the uplink map 340a may be treated, encapsulated, and/or otherwise processed as a management frame or packet.

In some implementations, the uplink map 340a can be broadcast so that it can be received by all STAs. For example, the AP 210 can broadcast the uplink map 340a so that all STAs 221-226 can receive the uplink map 340a.

As in 3 As illustrated, the uplink map 340a is transmitted at the beginning of the downlink frame 310a. In some implementations, the uplink map 340a may include, among other things, the ACK information for the subsequent uplink slot (e.g., identifying slots 362, 364, and 366 within an administrative portion 360 of the uplink frame 320). Exemplary implementations include the acknowledgments for downlink data transmissions (e.g., DL data transmissions in slots 345a, 345b, 345c, and 345d) in the current downlink frame (310a) sent in the immediately following uplink frame 320 are to be, a. If the uplink map 340a is sent at the beginning of the downlink frame 310a, this implies that the AP needs to know what traffic is scheduled for the entire slot at the beginning of the downlink frame 310a.

In some implementations, the uplink map 340a may be delayed until later in the downlink frame 310a, e.g. B. after one or more DL data transmissions 345a-345d to get more detailed information about which transmissions were sent in the downlink and to which STAs they were sent. In this way, the information about which DL data transmissions 345a-345d were sent need not be available before or at the beginning of the downlink frame 310a. In these and other implementations, between delaying the transmission of the uplink map 340a until later in the downlink frame 310a to obtain more accurate information, and allowing time for the STAs to view the contents of the uplink map 340a to receive and analyze, a balance to be achieved. For example, the AP 210 may delay broadcasting the uplink map 340a until a certain threshold number of DL data transmissions have occurred, until the downlink frame 310a is fully allocated for transmissions, or until other times. In addition, there may be other limitations on the delay, e.g. B. by the delay until the end of the downlink frame 310a must not exceed a certain amount of time (e.g. 100 µsec) or that a certain number of DL data transmissions must remain, just to name a few. Example implementations include sending the uplink map 340a later in the downlink frame 310a, with enough time until the end of the downlink frame 310a to ensure that all STAs can conveniently decode the uplink map 340a and prepare for the allocated transmission times in the uplink frame 320.

In example implementations where the uplink map 340a may be broadcast at the beginning of the downlink frame 310a, an estimate or prediction by the AP 210 of which downlink data transmissions 345a-345d would be sent and which STAs would therefore receive an ACK may be included - Expect slot in the following uplink frame 320. Even if the AP 210 gets the guess wrong, it doesn't have to cause major problems. For example, allocating an ACK slot (e.g., administrative slot 366) to a STA that has no data to acknowledge may result in a slight decrease in efficiency. As another example, the lack of an ACK slot for a STA that has received data via one of the DL communications 345a-345d may result in the ACK being signaled in the next uplink frame (not shown). This can lead to an additional delay, but also cannot create any functional problems.

The DL data transfers 345a-345d may represent transfers of data from the AP 210 to one or more of the STAs 221-226. The DL data transmissions 345a-345d may include the transmission of any type of data, and the allocation and duration of the DL data transmissions may be determined by the AP 210. In some implementations, the DL data transmissions 345a-345d may or may not include MU-MIMO transmissions. Such transmissions may be comparable or similar to such communications in conventional Wi-Fi systems.

In some implementations, the scheduling of DL data transfers 345a-345d may be based on buffer fullness and recently transferred traffic. For example, a proportional fair scheduling mechanism can be used that balances pending traffic and traffic recently sent to an STA to achieve a fair allocation of resources to the different links. In some examples, the STAs that are scheduled to receive traffic during the downlink frame 310 may not be fully known at the beginning of the downlink frame 310 due to changing traffic conditions (e.g., incoming data and other changes in traffic conditions) may change over the course of the downlink frame 310 . While this may be more natural for a traditional Wi-Fi based system, such a circumstance may mean that knowledge of the STAs for which ACKs should be requested is also not available at the beginning of the downlink frame 310 . However, the identification of the STAs that should be granted access to the medium to send ACKs to the DL communications 345a-345d is to be included in the uplink map 340a.

To address this variation, some example implementations include either sending the uplink map 340a later in the downlink frame 310 (eg, later than in the in 3 illustrated case), or any ACKs can be requested in the uplink map of the subsequent downlink slot.

To determine its channel access capabilities, a particular STA (eg, STA 221) may analyze uplink map 340a. From the uplink map 340a, the STA 221 may extract various pieces of data associated with the STA 221 (such as those corresponding to the STA 221's unique STA ID).

In some implementations, extracted start and end time data can be used to find the time intervals that the STA 221 is allowed to access the media (such as the start time and end time for the second STA-specific section 380 that is determined for the STA 221 became). Each STA can receive a single interval allocated during an uplink frame 320 . For example, the first station 221 can be assigned the second STA-specific section 380, the second STA 222 can be assigned the first slot 362 in the administrative section 360, the third STA 223 can be assigned the second slot 364 in the administrative section 360, the fourth STA 224 may be assigned third slot 366 in administrative section 360, and fifth STA 225 may be assigned first STA-specific section 370.

The uplink frame 320 may include multiple sections, including an administrative section 360, a first STA-specific section 370, a second STA-specific section 380, and a contention period 390. The administrative section 360 may include assignments for one or more STAs to transmit ACKs, resource allocation requests, and/or other network management communications. In these and other implementations, such administrative allocations are used exclusively for administrative frames such as ACKs and resource allocation requests. Slots 362, 364, and 366 in administrative section 360 may be shorter than data communication allocations (such as STA-specific sections 370 and 380) since administrative allocations may be dedicated to management frames. Uplink traffic is essentially under the control of the AP 210. For example, the AP must decide which STAs should have airtime and how much airtime should be allocated to each STA. Within the allocated airtime (and possible access categories), the STA is free to do its own prioritization and scheduling.

In example implementations, only administrative frames such as ACKs may be sent during administrative slot 362, 364, and/or 366 assignments. However, data slots (such as STA-specific sections 370 and/or 380) can be used more flexibly. In particular, ACKs and/or resource allocation requests can be sent in the data slot as well as regular data. Each STA can implement a similar priority mechanism as described for downlink channel access.

In some implementations, STA 221 may have management communications at the beginning of its intended assignment, such as: B. Channel Sounding Feedback. When such management communications are in place, such frames may be sent on the medium with higher priority than regular data transmission. Similarly, any ACKs not transmitted in the ACK slot may be sent first. For example, an ACK buffer and/or overhead buffer may be used to store ACK and/or overhead frames to be transmitted with a highest priority once the STA has access to the wireless medium. Continuing the example, one or more regular data data buffers may be used to store the regular data until the higher priority management communications have been transmitted. In some implementations, the regular data can be sorted into different buffers based on priority or class, such as: B. in different access categories (AC) of data.

In some implementations, a combination of management frames may be transmitted as a single combined packet with a single overhead and multiple portions of management or management data within the packet, such as ACKs and resource allocation requests.

In the uplink direction (eg, when the STA 221 sends an ACK to the AP 210 regarding the data received in the downlink slot 345a), a regular block ACK can be used. The bitmap of a block ACK packet can be limited to 128 bits. Since data traffic in an FWA implemented system can include more bursts, it is possible for the STA 221 to receive more than 128 subframes before it has a chance to send an acknowledgment. In such a case, either the bitmap can be enlarged or the ACK block can be split into multiple transmissions. Since this is a delayed acknowledgment, the example implementations include an extended bitmap.

The first STA-specific portion 370 may be a wireless medium allocation during the uplink frame 320 during which the designated STA (e.g., the STA 225) may be transmitting to the AP 210 . During the STA-specific portion 370, the STA 225 can use any combination of ACKs responsive to data received during the previous downlink frame 310a (or a previous downlink frame if the STA 225 before the STA-specific portion 370 no medium has been allocated), regular data and/or resource allocation requests. For example, the first STA-specific portion 370 may include an ACK slot 372, a data slot 374, and a resource allocation request 376 slot. Similarly, the second STA-specific portion 380 may include an ACK slot 382, a data slot 384, and a resource allocation request 386 slot. Some implementations include aggregating these different data sources into a single payload (as opposed to sending them as separate frames) so MAC overhead can be reduced. Example implementations include various implementations for combined ACK, data frames, and/or resource allocation requests. In these and other implementations, the entire first STA-specific portion 370 can be treated as a single slot for the aggregated payload, and the second STA-specific portion 380 can be treated in a similar manner.

ACKs can be sent during ACK slots (such as slots 362, 364, and/or 366), but also during data slots (such as data slots 374 and/or 384).

In some implementations, the uplink frame 320 can include a contention period 390 . The purpose of the contention period 390 is to allow STAs that have not been allocated a data transmission slot in the administrative section 360 or in the STA-specific sections 370, 380 to transmit short control or management packets for urgent communications. Examples of such communications may include specifying resource assignment requests, association requests, or other similar communications.

The protocol for the contention period 390 under FWA can account for the fact that different STAs are likely to be hidden from each other and therefore cannot rely on carrier probing to avoid collisions. The occurrence of collisions can significantly reduce the efficiency of the slot. In some implementations, its use can be reserved for urgent, high-priority communications and/or packets can be kept as short as possible, under a threshold length, or other constraints to reduce collisions.

Several possible implementations are included for managing the contention period 390 or resource allocation requirements in general, such as: B. randomized transmission start times within the contention period 390, request to send (RTS)/clear to send (CTS) with random start times within the contention period 390, use of feedback null data packets (NDP) and/or complete elimination of the contention period 390. Such example implementations address this One that many STAs want to use the contention period 390 to send resource allocation requests. To reduce or avoid the need for transmissions in the contention period 390, STAs can be configured to send their resource allocation requests during any period that they have been granted access to the medium. This includes e.g. e.g., administrative slots 362, 364, 366 and/or STA-specific sections 370 and 380, provided that this does not affect the AP 210's request (if, e.g., AP 210 assigns STA 222 an administrative slot 362, all available STA 222 ACKs can be sent first before the administrative slot 362 is used for other purposes).

When using a randomized start time within the contention period, each STA can select a random start time anywhere within the contention period 390 (as signaled in the uplink map 340a - see e.g. 4 ). The start time can be chosen so that the transmitted frame is completed before the end time of the contention period 390 .

The collision probability depends on the number of STAs attempting to access the medium during the contention period 390, the duration of the contention period 390, and the duration of each transmitted packet. In general, even with the very short frames, the probability of collisions is quite high. The probability of collisions is given with reference to 6 shown and discussed.

As an alternative to fully randomized start times, a given STA can select two random numbers: a random start time within the competition period 390 and a countdown parameter N _CD that can determine which slot within the competition period 390 the random start time relates to. A value N _CD = 0 refers to the current time slot. If N _CD >0, the STA may decrement the value with each uplink slot within the contention period 390 until N _CD =0. The STA must refrain from transmitting anything in the contention period 390 until _NCD =0. The range of N _CD can be changed by the AP 210 to accommodate different levels of contention.

Information about N or N _CD may be included in the uplink map 340a. For example, the "CP Info" field (see 4 ) can be expanded to include an additional parameter "CP Period". The CP Period data field can convey information about N or N _CD . In these and other implementations, the AP 210 can select the value of "CP Period". The AP 210 may have an indication of the number of collisions in the contention period 390 . For example, if the AP 210 detects one or more packet preambles during the contention period 390, but the content is systematically corrupted, it may decide to increase the CP Period to see if the situation improves.

Another way to randomize access to the contention period 390 is to use some version of RTS/CTS. Any STA attempting to access the contention period 390 may first send an RTS. The AP 210 can respond with CTS if the RTS is successfully received. This is not too different from the randomized ones described above Transmission times, except that it provides an explicit immediate indication that the RTS was correctly received. This allows the STA to attempt access again if a first attempt was unsuccessful. However, such a configuration may leverage the entitlement of transmissions from the AP to the STAs during the uplink frame 320 and particularly within the contention period 390 of the uplink frame 320. FIG.

In high load cases, the RTS transmissions can be distributed using a mechanism similar to that described using the CP-Period information field.

In some implementations, a modified RTS that already contains the buffering information that the STA is trying to communicate to the AP can be used to reduce transmission times. Otherwise, a successful RTS/CTS would still be followed by the actual resource allocation request, which may increase the time for each resource allocation request to successfully complete and/or increase the likelihood of collision with additional transmissions during the contention period 390 .

Another approach to handling the contention period 390 involves using a special UL trigger-based frame to collect the buffer status indication from many different STAs, such as e.g. B. the High Efficiency (HE) Trigger Based (TB) Feedback Null Data Packet (NDP). For example, in 802.1 1ax, the HE TB Feedback NDP is sent by the AP 210 in response to an NDP Feedback Report Poll (NFRP) trigger frame. For use in FWA, the timing of the HE TB Feedback NDP would be relative to an agreed time reference, e.g. B. at a certain time during the contention period 390 and/or in response to an NFRP transmitted during the downlink frame 310a.

Using the HE TB Feedback NDP, STAs can respond with a binary indication of their buffer status. In such an implementation, each STA may be assigned a tone set (e.g. 12 tones) to perform signaling. Since up to 19 tone sets are defined at 20MHz each, multiple STAs can respond within a given contention period 390 . Such an approach can use bandwidth for a full resource allocation request, as in 5 shown, and/or provide details regarding the data in the buffers of the STAs or not. However, the AP 210 can use the status of the buffers to allocate STAs with data in their buffers for an allocation in the next uplink frame (or a subsequent uplink frame).

Given that the AP 210 is able to schedule each STA with some regularity, the STAs may be able to display their resource needs during scheduled intervals. Resource allocation requests may be allowed in other scheduled slots (such as management slots 362, 362, 366 and/or STA specific sections 370 and 380). Such an approach can eliminate the 390 competition period.

If the contention period 390 experiences an excessive number of collisions or the AP 210 repeatedly receives corrupted data due to a large number of STAs, the AP 210 may instead decide to allocate specific slots to replace the contention period 390 to allow the STAs to send the resource allocation requests. In these and other implementations, there may be multiple superframes 305 before each STA is assigned a slot within the contention period 390 (and/or the other portions of the superframe 305).

while the in 3 While the diagram shown shows strict timing of slots in downlink frame 310a and in uplink frame 320, example implementations may not rely on knowledge of strict timing of transmission and reception times for receiving packets. For example, the use of TSF as a mechanism for sharing clocks between the AP 210 and STAs 221-225 may also prevent strict (e.g., accurate to the microsecond (µsec) level) timing of events.

In another implementation, packet detection may be based on detecting an 802.11 preamble. The receiving STA 221 can use knowledge of the overall structure of the downlink frame 310a and the uplink frame 320 of the superframe 305 to disable the receiving antenna or other receiving device during times when no packets are expected. In addition, the receiving STA 221 may not be able to rely on the exact expected start time of a packet as communicated in the uplink map 340a. For example, the antenna of the receiv the receiving STA 221 must be switched on +/- 5 µsec before a specific assignment for the receiving STA 221.

Likewise, for STA 221 to AP 210 transmissions, uplink map 340a may not dictate the exact start times or number of packets STA 221 is expected to receive. Instead, each STA 221-225 can be given a specific time interval in which it has access to the medium. The STA 221 can use its allotted interval in any way. In such an implementation, transmissions are not required or expected to fill the entire interval, and the number of packets and their transmission times within the interval are at the discretion of the STA 221.

The AP 210 can allocate slots such that the slots exactly match the requirements of the STAs 221-225. For example, the frequency and/or duration of slots allocated to STAs 221-225 may be based on previously sent resource allocation requests. In these and other implementations, over-allocation can mean that some airtime is wasted, leading to inefficiencies.

Example implementations include the AP 210 actively monitoring how efficiently the STAs 221-225 are using the allocated time slots. In response to inefficient usage, the duration and/or frequency of assignments of a given STA may be reduced.

In this less rigid implementation, the transmitting and receiving devices can continue to operate much as they did in other Wi-Fi systems. Some differences may include: (1) no need to perform a Clear Channel Assessment (CCA) when transmitting as the STA can detect that it is within its assigned slot, (2) transmissions can be on predefined time intervals be limited; (3) reception may optionally be limited to predetermined time intervals. To save resources, the receiver of the AP 210 can be turned off during the downlink frames 310a/310b and the receivers of the STAs 221-225 can be turned off during the uplink frame 320. In addition, the transmitter of a given STA may be turned off during any portion of the uplink frame 320 that it does not have permission to transmit.

In some examples, this facilitates the receipt of data frames, but FWA technology may also include certain management frames (e.g., uplink map 340a, beacon 330, and/or various ACKs, among others) that occur at relatively well-defined intervals be sent. However, even for these management frames, it can be beneficial not to rely on strictly timed access. For example, although the management frames in 3 at the start of downlink frame 310a, FWA would work properly if the management frames were sent at different times and even in different order, as long as the management frames are received by STAs 221-225 on time. As such, imposing overly rigid timing may be unnecessary.

To achieve regular transmission of management frames, example implementations include assigning them to a high priority send buffer. The transmitting device is expected to transmit frames from the high priority buffer if it is not empty. An independent process can write to the buffer at regular intervals (e.g. a beacon every 100 msec). The presence of frames in the buffer may trigger the transmitting device to send the high priority frame(s) in the buffer at the earliest possible opportunity.

Although the term "priority" is used, it does not refer to access category or user priority. Rather, it conveys that the content of the buffer buffer should be treated with high priority over the "regular" data. In other words, if packets are available in the high-priority buffer, they should be sent first, before other traffic types.

ACKs can share the buffer with management frames or be stored in a separate buffer with equal or lower priority (but higher priority than data). Again, an independently running process can write the pending ACKs to the buffer at regular intervals. This can lead to the in 3 demonstrated behavior.

The periodicity with which the management and ACK processes write to their respective buffers may be configurable. In some implementations this may be tied to the periodicity of the uplink/downlink frame sequence (e.g. sending packets to the buffer every 20ms for a superframe that is 20ms long). Alternatively, the periodicity may be decoupled from the periodicity of the uplink frame/downlink frame sequence (e.g. maintaining a 20 ms periodicity even if the superframe is 625 µs).

For simplicity, the periodicity of the uplink map 340a and the generation of ACK frames (e.g., how often those frames are written to the respective buffers) may use the same periodicity for the reference time as used within the uplink map 340a becomes. In some implementations, the STA may be configured to send all of its available traffic (provided network resources are not exhausted). During traffic spikes, the STA may be temporarily unable to fully flush all buffers. This is the case where priority should be given to the ACKs and/or management frames.

Besides sending data, other packet exchanges can also be supported within the FWA protocol framework described herein.

For example, for sounding and sounding feedback, traditional Wi-Fi sounding and sounding feedback includes a series of announcements, NDP, beamforming feedback, and report queries. Such an alternating sequence of uplink and downlink transmissions cannot be supported in FWA since uplink and downlink transmissions take place in separate time slots.

At any point during the downlink frame 310, to be compliant with FWA, the AP 210 may send a null data packet advertisement (NDPA) and a null data packet (NDP). The NDPA can identify the STAs that should prepare the sounding feedback (eg, STAs 221 and 222). The AP 210 can assign the STAs 221 and 222 data time slots. The STAs identified in the NDPA (eg, STAs 221 and 222) may prepare and store sounding feedback frames in their respective management buffers. The sounding feedback may be sent during a time slot allocated to STAs 221 and 222. In these and other implementations, when used in conjunction with the management buffer, the sounding feedback may be sent to the AP 210 before any regular STAs 221 and/or 222 data.

In these and other example implementations, it may not be necessary to specify specific times for transmission of sounding feedback (or other management frames in general) in the uplink map 340a. Rather, the STAs can be configured to send the management data when there is management data to send and when the STA has access to the media.

Other request and response sequences (e.g. radio resource management) can be implemented in a similar manner. The request can be sent by the AP 210 at any time during the downlink frame 310 . The response can be sent by the STA in a time slot allocated to the STA for uplink data transmission.

Modifications, additions, or omissions may be made to the system 200 and/or the chart 300 without departing from the scope of the present disclosure. The naming of the various elements as described is intended to be illustrative of the concepts described herein and is not limiting. Furthermore, the system 200 and/or diagram 300 may include any number of other elements or be implemented in systems or contexts other than those described. For example, any number of APs 210 and/or STAs 221-225 may be included.

Also, the order, duration, spacing between communications, etc. of the communications in diagram 300 are illustrative only.

4 12 illustrates an example uplink map (UL map) 400 described in accordance with at least one implementation of the present disclosure. For example, the UL Map 400 payload may have an ID 405, a Version 410, a Length 415, CP Info 420 (which may include a Start Time 425 and an End Time 430), a Number of Data Slots 435, Data Info 440 for a given slot (the one STA ID 445, a countdown 450, a start time 455, an end time 460, AC info 465, and data info for the M th data slot. This payload can be carried in a Wi-Fi management frame.

The various fields in the UL Map 400 payload are described in Table 2. Table 2: Fields in UL Map 400 Area interpretation ID 405 Unique ID that identifies the frame as a UL-MAP Version 410 Version number identifying the UL-MAP definition By using a version indicator, different definitions of the UL-MAP with additional content can be allowed. Length 415 Total number of bytes in the UL MAP payload In some implementations, if the length is greater than the number of bytes expected based on the number of ACK and Data Info fields signaled, additional information may be attached to the in 4 shown frame have been attached. The additional information can be ignored and not considered an error. Such response to additional data may allow for future expansion of the UL-MAP with different versions while maintaining compatibility with older versions of STAs. CP Info 420 Information on the start and end times of the competition period. The structure of this field may include two subfields that indicate a start and stop time of the contest period. # Data 435 Specifies the number of Data Info fields included in the UL-MAP 400 (if any). In 3 for example, this value would be 2 (relative to STA specific sections 370 and 370). Data Info (#1 - #M) 440, 470 A field for each of the data transmissions allocated in the uplink frame. The structure of the Data Info field is described in Table 3. These fields follow the # Data field. Example implementations cannot include more than one entry for each STA. For example, the time slot for permitted transmissions for a particular STA may be a single contiguous period of time even if the STA is ready to transmit an ACK, a resource allocation request, and various amounts of regular data. #ACK info 475 Indicates the number of ACK Info fields included in the UL-MAP 400 (if any). For example, referring to would be 3 this value 3 (related to administrative slots 362, 364 and 366). ACK Info (#1 - #N) 480, 485 A field for each of the administrative slots allocated in the uplink frame. The structure of the ACK Info field includes a start time and an end time, and may optionally include an indication that the slot is for management frames. Example implementations cannot include more than one entry for each STA, even between the ACK Info and Data Info fields. For example, the time slot for permitted transmissions for a particular STA may be a single contiguous period of time even if the STA is ready to transmit an ACK, a resource allocation request, and various amounts of regular data.

The Data Info field includes three subfields as shown in Table 3. The meaning of the various subfields in the Data Info field is given in Table 3. Table 3: Subfields in the field "Data Info" subfield interpretation STA ID Unique identifier of the STA. This may include the Association ID (AID) or other unique identifier. countdown The countdown field can optionally indicate that the times relate to a future UL_MAP_PERIOD and not the one associated with the current UL-MAP. The AP may be responsible for decrementing the countdown sub-field accordingly so that the information communicated to the STAs remains consistent from one UL-MAP to the next. By providing the countdown, a STA can be aware that it has been allocated an allocation in a future uplink frame and refrain from sending additional resource allocation requests until the allocated slot has elapsed. start time Beginning of the interval in which the identified STA is allowed to send data frames. All data (or management) transfers can begin after this time. In some implementations, the STA may be prevented from beginning transmissions before this time has elapsed. Example implementations may include start and end times, given in µsec relative to the start of a given reference (such as the start of the uplink frame within the superframe). end times End of the interval in which the identified STA is allowed to send data frames. All data (or management) transfers may be completed before this time. In some implementations, the STA may be required to terminate all transmissions prior to this time. AC info Provides information about the Access Categories (ACs) allowed within the allotted time interval. The AC Info can be implemented as a 4-bit bitmap, with one bit corresponding to each of the ACs. Multiple ACs may be allowed within the same time period. If more than one AC is allowed, the STA can use its discretion to decide which one(s) to broadcast to.

The various fields in the UL MAP payload may include timestamps to identify specific transmission intervals. These timestamps can be determined relative to a given reference time. This reference time is reset to zero after each UL_MAP_PERIOD. Additionally or alternatively, the reference times may be based on the AP's TSF synchronized with the STAs.

In some implementations, the over-the-air latency can be addressed by the AP and/or the STA. Transmissions can be implemented to meet the specified time intervals at the AP receiver. One approach may include introducing an additional delay between the actual transmission at the STA and the time the transmission is received at the AP. If the delays for different STAs are different (e.g. due to different distances from the AP), collisions can occur. Therefore, it can be beneficial to know about the over-the-air delays experienced by the various STAs. The correction can be done either by the AP or by the STAs.

When applied to the AP, the AP can adjust the timestamps in the ACK Info or Data Info fields. For example, a remote STA can be instructed to transmit earlier to achieve the same receive window at the AP.

If a correction is made by the STA, the STA can understand that all communicated timestamps in the ACK Info or Data Info fields can be expected to be advanced by an amount equal to the known over-the-air delay between this STA and the STA. An STA can perform “ranging” during association, which can help determine latency. Exemplary implementations use OFDM Rx PHY latency registers that do the adjustment in HW, eliminating the need for SW handling.

Example implementations may also include any other ranging algorithm and/or compensation mechanism.

Additional field types can be added to the UL map 400. These new field types can be added at the end of the in 4 structure shown can be added. This approach can allow older versions of STAs to parse the known content while storing any additional information in of the UL map 400, which are unknown to the STA, are ignored. To allow for quick identification of the different versions of the UL map, a version field 410 may be provided.

Example implementations may use additional signaling in the UL map 400 for multi-user (MU) transmissions in the uplink. For example, 802.1 1ax provides several MU formats for uplink transmission such as UL-OFDMA and UL-MU-MIMO. These formats include synchronized transmissions from multiple channels. In 802.1 1ax, synchronization is achieved by having all transmitters start their transmissions relative to a trigger frame sent by the AP. When using FWA, it is expected that no (downlink) trigger frame is sent during the uplink frame of the superframe. Thus, the 802.11ax UL MU trigger synchronization mechanism can be replaced with a new mechanism that is compatible with the FWA time-slotted approach described in the present disclosure.

In exemplary implementations where the timing reference used by the AP and STAs is sufficiently well synchronized, the UL-MU transmission times can be used as a start time relative to e.g. B. The "UL MAP PERIOD" can be specified, similar to the start and end times specified in the ACK Info and/or Data Info fields. In this example, the start time can be interpreted as the actual start of the packet and not the start of a transmission opportunity since multiple frames in a MU transmission start at exactly the same time. In 802.1 1ax, this is accomplished by having all STAs synchronize relative to a trigger frame sent by the AP. With FWA, no trigger frame may be sent in the uplink frame of the superframe. The time reference must therefore be established in a different way, e.g. B. by reference to the UL MAP PERIOD. In this and other implementations, all participating STAs can closely synchronize their time so that the start time is within 0.4 µsec of the specified reference time.

In some implementations, UL-MU (either OFDMA or MU-MIMO) can be achieved by defining an additional type of Data Info field in the uplink map 340a. Such an info field can contain the STA IDs of all STAs in the UL-MU transmission, the timing of the transmission (e.g. the start time as the exact time when the preamble transmission should start) and the relevant transmission parameters (e.g. modulation coding scheme (MCS), frequency allocation, etc.). Modifications, additions, or omissions can be made to the uplink map 400 without departing from the scope of the present disclosure. The naming of the various elements as described is intended to be illustrative of the concepts described herein and is not limiting. In addition, the uplink map 400 may include any number of other elements or be implemented in different systems or contexts than those described. For example, any number of additional data fields can be included. Additionally, the order, size, title, and/or labels in the uplink map 400 are merely illustrative. 5 illustrates an exemplary resource allocation request frame 500 described in accordance with at least one implementation of the present disclosure. The resource allocation request frame 500 may represent an indication from a STA to an AP that the STA has data to upload to the AP and is looking for airtime (eg, requesting a slot within an upcoming uplink frame to upload its data). The resource allocation request frame 500 can be treated as a management frame. The resource allocation request frame 500 may include an ID 510, a length 520, a STA ID 530, bytes in AC1 540, bytes in AC2 550, bytes in AC3 560, and bytes in AC4 570.

The meaning of the various fields within the resource allocation request frame 500 is given in Table 4. Table 4: Content of the resource allocation request Area interpretation ID 510 Unique ID that identifies the frame as a resource allocation request frame Length 520 Total number of bytes in the resource allocation request STA ID 530 Unique identifier of the STA. This may include the Association ID (AID) or other unique identifier and may be similar or comparable to the STA ID field 445 of FIG 4 be. bytes in AC1 540 Number of bytes available in access category 1. This value can be expressed as a requested transmit time unit (e.g. 4 µsec). For example, the requested transmission time may correspond to an expected amount of time required for the transmission of the bytes in question, using an appropriate combination of modulation coding scheme (MCS) and number of spatial streams (NSS) (e.g. the one used in the last transmission or a conservative ratio if no previous MCS/NSS is known). bytes in AC2 550 Number of bytes available in access category 2, expressed in a similar or comparable way as the value in bytes in AC1 540. bytes in AC3 560 Number of bytes available in access category 3, expressed in a similar or comparable way as the value in bytes in AC1 540. bytes in AC4 570 Number of bytes available in access category 4, expressed in a similar or comparable way as the value in bytes in AC1 540.

The resource allocation request frame 500 can be sent any time the STA has gained access to the medium or during the contention period. With reference to 3 For example, resource allocation request frame 500 may be sent during slots 362, 364, 366, during resource allocation request slots 376 or 386, and/or during contention period 390.

In an example implementation, the resource allocation request frame 500 can be kept as short as possible. For example, the format for the bytes in AC1-AC4 fields 540-570 may be in a standardized format with a limited number of bits specifying a particular time or range of times.

In some implementations, the resource allocation request frame 500 is not explicitly acknowledged (e.g., no ACK message is sent in response to the AP receiving the resource allocation request frame 500 from a STA). The AP may respond inferentially to receipt of the resource allocation request frame 500 by including the requesting STA in a subsequent UL MAP frame.

In some implementations, the resource allocation request information can be transmitted between the STA and the AP in other formats. For example, certain fields of other communications or packets may be overridden or otherwise used to convey the resource allocation request information.

In some implementations, the A-Control field in the MAC header can be used to convey the resource allocation request information. For example, 802.1 1ax (equivalent to HE packets) redefines the High Throughput Control Field (HT Control Field) in the MAC header to allow for the transmission of a variety of information. The definition of HT Control depends on whether the frame is designed for HT/VHT/HE. The A control field is present in the HE frames, is 30 bits in length, and includes one or more control subfields, including Control ID and Control Information. The Control ID subfield may indicate the type of information contained in the Control Information subfield. The length of "Control Information" depends on the "Control ID". Several types of Control ID have already been defined. An example includes "BSR Control" which can be used by 802.11ax STAs to report specific buffer status information for UL-MU operation. The BSR Control represents a similar concept and implementation as found in traditional Wi-Fi standards. In some implementations, the BSR Control or a variation thereof may be used as the resource allocation request 500.

In some example implementations, the FWA protocol may include a new proprietary control ID for the A control field that may be defined. In some implementations, the values 7-14 may be currently reserved and therefore may or may not be used in definition and/or messaging. Example implementations include using the A control field for UL allocation requests. In these and other circumstances, the A-Control can be used in circumstances where the STA sends a frame to the AP, since the A-Control is within of the MAC header will be located. If no data is available or ready to be transmitted, the CPE can send a dummy payload to accomplish this.

The amount of information that can be carried in the A-Control field may be limited (e.g. to 30 bits). Exemplary implementations may allow the A control field to suffice (e.g., by limiting the request to specific time values), or alternative implementations may include a fully defined uplink allocation frame payload (e.g., as in 5 shown) which can be retained.

6 6 illustrates an example visualization 600 of potential collisions in a contention period of an uplink frame, described in accordance with at least one implementation of the present disclosure. The visualization 600 includes collision probabilities for a contention period of 500 µsec duration with varying packet lengths and with a number of STAs accessing the medium varying between 2 and 5 (where representation 610 is 2 STAs, representation 620 is 3 STAs, representation 630 corresponds to 4 STAs and representation 640 corresponds to 5 STAs).

Assuming pure random access with a contention period of T _C and a packet duration of T _P , the collision probability for two transmissions attempting to access the medium is given by: $$1-{\left(1-\frac{T_P}{T_C-T_P}\right)}^2$$

The equation shows that larger values of _TC and smaller values of _TP reduce the collision probability.

With short contention periods, it can be difficult to avoid collisions when multiple STAs want to use the contention period. Example implementations include expanding the range of randomly selected start times. For example, instead of each STA choosing its value within the interval [Contest Period Start Time (CP Start Time), Contest Period End Time (CP End Time)], the value may be in an interval CP Start Time + [0, N × (CP End Time - CP Start Time )] can be chosen for a value of N. Any values outside the current interval [CP start time, CP end time] may refer to start times in subsequent uplink frames. In these and other implementations, one or more STAs may be moved to a different contention period in a later uplink frame such that a smaller number of STAs operate within a given uplink frame. In this way, only a small number of STAs may attempt to advertise their resource requirements at any given time.

7 FIG. 7 illustrates a flowchart of an exemplary method 700 for communicating using FWA, described in accordance with at least one implementation of the present disclosure.

At block 705, a beacon may be broadcast from an AP to one or more STAs during a downlink frame. The downlink frame may be part of a superframe that includes the downlink frame and an uplink frame. The beacon can include timing information for synchronizing the STAs with the AP. Additionally or alternatively, the beacon may include information regarding the AP's capabilities, the parameters of the AP's supported network, or other information. In some implementations, the STAs associated with the AP can receive the beacon. Additionally or alternatively, one or more STAs that wish to be associated with the AP and/or are in communication range of the AP may receive the beacon.

In block 710, the AP may transmit ACKs for uplink data. For example, the AP may have received data during a previous uplink frame and may transmit ACKs to the UL data during the downlink frame.

At block 715, the AP may make a determination as to which stations will receive assignments in an upcoming uplink frame. For example, the AP may allocate a slot in the next (or a subsequent) uplink frame to some or all STAs that have sent resource allocation requests to the AP. The AP may designate the duration, purpose (e.g. administrative purposes, data transfer or other purposes) or other identifiers if the determination is made. In some implementations, these determinations can be combined into an uplink map.

In block 720, an uplink map (UL map) may be broadcast by the AP. For example, the AP can broadcast a UL map reflecting the determination of STAs with slots within an upcoming uplink frame and the start and end times of those respective slots. The UL map may include any other information as described in the present disclosure. In some implementations, the UL map can be sent early in the downlink frame, such as immediately after the beacon and/or ACKs. Alternatively, the UL map may be sent later in the downlink frame, such as after the transmission of one or more DL data transmissions, as described in block 725.

At block 725, the AP may transmit downlink data (DL) during the downlink frame. For example, the AP can transmit DL data to one or more STAs.

At block 730, the AP may receive ACKS and/or resource allocation requests during designated administrative allocations of the uplink frame. For example, the STAs that received data during the DL data transmissions of block 725 (and without an assigned UL data slot in the uplink frame) may be assigned an administrative slot to send ACKs to the AP indicating receipt of the confirm data. Additionally or alternatively, such STAs may transmit a resource allocation request indicating that the STA has data to transmit to the AP and is requesting airtime to do so.

At block 735, the AP may receive information from STAs within their specified assignments during the uplink frame. For example, an STA can be referred to as an STA-specific portion of the uplink frame and can transmit any ACKs, resource allocation requests, other management frames (such as sounding feedback), and/or regular data. In some implementations, the different data types can be combined into a single payload, or different types of packets can be sent. In some implementations, an STA can use a management buffer and a data buffer, and the STA can flush the management buffer before then transferring data from the regular data buffer.

In block 740, the AP may delay sending ACKs in response to the uplink data until a next downlink frame. For example, the AP may receive the management data and/or other data at block 735, but delay sending any ACKs to the data until the subsequent downlink frame in the superframe.

At block 745, a resource allocation request may be received from the AP during a contention period. For example, a given STA may transmit a resource allocation request with no administrative slot and no STA-specific portion of the uplink frame during the contention period.

At block 750, an association request may be received from the AP during the contention period. For example, a STA trying to associate with the AP may send an association request during the contention period.

8th 8 illustrates a flow diagram of an exemplary method 800 for coordinating FWA superframes across multiple access points, described in accordance with at least one implementation of the present disclosure.

In block 810, a superframe can be coordinated with other access points. For example, in some implementations, the various APs may have communication with an external time source to which the various timing mechanisms are aligned. Additionally or alternatively, a third party may determine the timing and relationship of the superframes. This may include designation by a standards body or other organization as a standard or schedule that the AP can adhere to, e.g. B. for 5G communication. In some implementations, the external time source may also include information related to the superframes (e.g., start time, size, and/or ratio of downlink and uplink frames).

At block 820, the AP may broadcast or transmit data during a downlink frame of the superframe. The downlink frame can be coordinated in time and size with other APs as described in block 810 .

At block 830, the AP may receive information during an uplink frame without broadcasting or transmitting information during the uplink frame. The uplink frame can be coordinated in time and size with other APs as described in block 810 .

9 9 illustrates a flow diagram of an example method 900 for coordinating timing information to facilitate communication via FWA, described in accordance with at least one implementation of the present disclosure.

At block 905, timing information in a beacon may be adjusted based on an internal clock of the access point. For example, a TSF value can be specified in the beacon for transmission.

In block 910, the beacon may be broadcast to STAs. Block 910 may be similar or comparable to block 705 of FIG 7 be.

At block 915, each station may adjust its internal clock based on the beacon's timing information. For example, each STA can update its TSF value to match that of the AP sent in the beacon.

10 10 illustrates a flow chart of an example method 1000 for accounting for latencies to facilitate communication via FWA, described in accordance with at least one implementation of the present disclosure.

In block 1010, a station receives timing information from an access point. For example, a beacon can be received from the STA with a TSF.

In block 1020, corrections can be made by the station based on the latency. For example, the over-the-air latency can be determined by the STA during an association with the AP, and the STA can use this information to determine an acceleration or deceleration in the transmission that is associated with other transmissions in the network served by the AP AP enabled network is matched.

In block 1030, the station may transmit information to the access point during an assignment that begins at a start time. The transmission may be timed based on the timing and block 1020 corrections. For example, an assignment can signal the start of transmission for the STA, and the start time can be determined based on the timing information received in block 1010 . The start of transmission may also be delayed or sped up based on the block 1020 corrections.

11 11 illustrates a flowchart of an example method 1100 for prioritizing or scheduling data for communication via FWA, described in accordance with at least one implementation of the present disclosure.

In block 1110, packets may be transferred from a management buffer. For example, a STA can start transmissions when its assigned slot arrives during an uplink frame and first transmit the packets in a maintenance buffer of the STA.

In block 1120, packets may be transmitted from an ACK buffer. For example, the ACKs for received DL data can be transmitted after the data in the management buffer.

In block 1130, packets may be transferred from a data buffer. For example, UL data may be transmitted after data in the management and ACK buffers. In some implementations, block 1130 may include labels for each level of AC data, such as: B. first the transmission of AC1 data, followed by the AC2, AC3 and AC4 data in sequence. In some implementations, blocks 1110, 1120, and 1130 may represent the order in which data is accumulated for transmission into a single payload. For example, the administrative data, followed by the ACK data, followed by the UL data are compiled into a single payload sized to fit in the slot allocated to the STA during the uplink frame.

12 12 illustrates a flow diagram of an exemplary method 1200 for transmitting ACKs to an access point using orthogonal frequency division multiple access (OFDMA), described in accordance with at least one implementation of the present disclosure.

At block 1210, a beacon may be broadcast to synchronize the time of multiple stations. For example, an AP may broadcast a beacon to multiple stations, where the beacon may include the AP's TSF. In some implementations, other timing information or synchronization techniques can be used to synchronize the STAs with the AP to within 0.4 µsec.

At block 1220, an uplink map may be broadcast that includes indications of the UL OFDMA for the multiple stations at a particular assignment within an uplink frame of a superframe. For example, the uplink map can show the STA IDs of all STAs in the UL OFDMA transmission, the timing of the transmission (e.g. the start time as the exact time when the preamble transmission should start) and the relevant transmission parameters (e.g. B. transmit power, frequency allocation, etc.).

In block 1230, given the assignment, the multiple stations can transmit their ACKs to the AP using the UL-OFDMA as specified in the uplink map. The timing of the UL OFDMA can be based on the synchronization of the multiple stations and the UL OFDMA indication in the uplink map.

13 13 illustrates a flow chart of an example method 1300 for accounting for latencies to facilitate communication via FWA, described in accordance with at least one implementation of the present disclosure.

In block 1310, a station may randomly select a start time for transmission of a resource allocation request or an association request. For example, during a contention period, the station may select the random start time to reduce the likelihood of collisions with other transmitting devices.

In block 1320, the station may send the resource allocation request or the association request at the random start time.

Modifications, additions, or omissions may be made to any of the methods 700-1300 without departing from the scope of the present disclosure. In addition, the operations can be performed in any order. Additional blocks can be added, some can be removed, and others can be split into multiple operations. In some implementations, the operations of methods 700-1300 may be performed by one or more devices, such as AP 210 and/or one or more STAs 221-225, or combinations thereof.

The teachings contained herein are applicable to any type of wireless communication system or other digital communication system. For example, while stations and access points are described for a wireless communications context, the teachings on the use of prequalification are also applicable to other wireless communications such as Bluetooth®, Bluetooth Low Energy, Zigbee®, Thread, mmWave, and so on.

Those skilled in the art will recognize that in these and other processes and methods disclosed herein, the functions performed in the processes and methods can be implemented in different orders, concurrently, and so on. Furthermore, the steps and acts outlined are provided only as examples, and some of the steps and acts may be optional, combined into fewer steps and acts, or expanded to additional steps and acts without detracting from the spirit of the disclosed implementations.

The subject technology of the present invention is illustrated, for example, according to various aspects described below. Various examples of aspects of the subject technology are presented as numbered examples (1, 2, 3 etc.) described. These are provided as examples and do not limit the subject technology. Aspects of the various implementations described herein may be omitted, replaced with aspects from other implementations, or combined with aspects from other implementations unless the context dictates otherwise. For example, one or more aspects of Example 1 below may be omitted, replaced with one or more aspects of another example (e.g., Example 2) or other examples, or combined with aspects of another example. The following is a non-limiting summary of some example implementations presented herein.

In one example, a method includes determining, by an access point, which stations among multiple stations are allowed access to a wireless communication medium in a subsequent uplink frame. The method or system may also include broadcasting an uplink map to the stations, the uplink map identifying a first station of the plurality of stations as authorized to access the wireless communication medium. The uplink map may also identify an assignment of the subsequent uplink frame for the first station.

In one or more of the methods of the present disclosure, while assigning the subsequent uplink frame assigned to the first station, the method may include receiving an acknowledgment of the downlink data transmitted to the first station, uplink data from a resource allocation request from the first station requesting access to a second subsequent uplink frame, or combinations thereof. In one or more of the methods of the present disclosure, the method may also include where transmission of an acknowledgment is delayed in response to the received uplink data until after the subsequent uplink frame. In one or more of the methods of the present disclosure, the combinations of the acknowledgment, the uplink data, or the resource allocation request are received with a single header and a combined payload. In one or more of the methods of the present disclosure, the uplink map also identifies a contention period during the subsequent uplink frame.

In one or more of the methods of the present disclosure, the method may also include during the contention period of the subsequent uplink frame receiving a resource allocation request from a second station requesting access to a second subsequent uplink frame, the second station in the uplink map of the subsequent uplink frame has no assignment. In one or more of the methods of the present disclosure, the method may also include receiving, during the contention period, an association request from a new station requesting to communicate with the access point. In one or more of the methods of the present disclosure, the method may also include making at least one assignment to each of the plurality of stations within a specified period of time. In one or more of the methods of the present disclosure, the threshold amount of time spans multiple uplink frames. In one or more of the methods of the present disclosure, the uplink map is transmitted during a downlink frame, with the subsequent uplink frame and downlink frame together forming a superframe. In one or more of the methods of the present disclosure, the method may also include coordinating the superframe of the access point with at least one other access point.

In one or more of the methods of the present disclosure, the method may also include transmitting downlink data to the first station prior to the subsequent uplink frame, wherein the uplink map is broadcast prior to transmitting the downlink data to the first station. In one or more of the methods of the present disclosure, the method may also include transmitting downlink data to the first station prior to the subsequent uplink frame, wherein the uplink map is broadcast after transmitting the downlink data to the first station. In one or more of the methods of the present disclosure, the uplink map further identifies an administrative assignment for a third station, the third station receiving downlink data from the access point prior to the subsequent uplink frame, the third station in the subsequent uplink Frame does not receive any further assignment. In one or more of the methods of the present disclosure, the administrative allocation is a duration to accommodate an acknowledgment packet, a resource allocation request, or both. In one or more of the methods of the present disclosure, the method may also include broadcasting a beacon to the plurality of stations, the beacon including timing information from the access point, where the timing information may be used by the stations to synchronize with the access point. In one or more According to the methods of the present disclosure, the assignment includes a start time and an end time, where the start time is based on the access point's timing information.

A method includes receiving, by a station and from an access point, an uplink map identifying an assignment within a subsequent uplink frame within which the station has access to a wireless medium, the uplink map having a start time and includes an end time for the assignment. The method may also include transmitting information to the access point based on the start time of the assignment matching a current time such that the transmission of information is completed prior to the end time.

In one or more of the methods of the present disclosure, the method may also include determining the current time based on access point timing information received in a beacon broadcast by the access point. In one or more of the methods of the present disclosure, the method may also include receiving an audible trigger from the access point; and delaying transmission of a sounding response to the sounding trigger pending assignment. In one or more of the methods of the present disclosure, the information transmitted by the station includes acknowledgments for received downlink data, resource allocation requests, management information, uplink data, or combinations thereof.

14 12 illustrates a block diagram of an example computing system 2002 that may be used to perform or direct the performance of one or more operations described in accordance with at least one implementation of the present disclosure. The computing system 2002 may include a processor 2050, memory 2052, and data storage 2054. The processor 2050, memory 2052, and data storage 2054 may be communicatively coupled.

In general, the processor 2050 may include any suitable special purpose or general purpose computer, computing entity, or processing device, including various computer hardware or software modules, and may be configured to execute instructions encoded on any applicable computer-readable storage medium are stored. For example, processor 2050 may include a microprocessor, microcontroller, digital signal processor (DSP), application specific integrated circuit (ASIC), field programmable gate array (FPGA), or any other digital or analog circuitry for interpreting and/or executing computer-executable instructions and/or for processing data. Although illustrated as a single processor, processor 2050 may include any number of processors configured to perform or direct the performance of any number of acts described in the present disclosure, individually or collectively.

In some implementations, processor 2050 may be configured to interpret and/or execute computer-executable instructions and/or process data stored in memory 2052, data storage 2054, or memory 2052 and data storage 2054. In some implementations, processor 2050 may retrieve computer-executable instructions from data storage 2054 and load the computer-executable instructions into memory 2052. After the computer-executable instructions are loaded into memory 2052, processor 2050 may execute the computer-executable instructions.

Memory 2052 and data storage 2054 may include computer-readable storage media to contain or store on computer-executable instructions or data structures. Such computer-readable storage media may include any available media that can be accessed by a general purpose or special purpose computer, such as the 2050 processor. By way of example, and not limitation, such computer-readable storage media may be tangible or non-transitory computer-readable storage media, including random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM), or other optical disk, magnetic disk or other magnetic storage devices, flash memory devices (e.g., semiconductor memory devices), or any other storage medium that can be used to contain or store specific program code in the form of computer-executable instructions or data structures, and accessible by a general purpose or special purpose computer. Combinations of the above may also be included within the scope of computer-readable storage media. Computer-executable instructions may include instructions and data, for example cesses configured to cause processor 2050 to perform a particular operation or group of operations.

Some sections of the detailed description refer to various modules configured to perform operations. One or more of the modules may include code and routines configured to enable a computing system to perform one or more of the operations described therein. Additionally or alternatively, one or more of the modules may be implemented using hardware, including any number of processors, microprocessors (e.g., to perform or control the performance of one or more operations), DSPs, FPGAs, ASICs, or any suitable one Combination of two or more of them can be implemented. Alternatively or additionally, one or more of the modules may be implemented using a combination of hardware and software. Throughout this disclosure, operations described as performed by a particular module may include operations that the particular module may direct a corresponding system (e.g., a corresponding computing system) to perform. Furthermore, the distinction between the different modules is intended to facilitate explanation of the concepts described in the present disclosure and is not limiting. Furthermore, one or more of the modules may be configured to perform more, fewer, and/or different operations than those described, such that the modules may be combined or differentiated differently than described.

Some portions of the detailed description are presented in terms of algorithms and symbolic representations of operations within a computer. These algorithmic descriptions and symbolic representations are the means used by those skilled in the data processing arts to convey the essence of their innovations to others skilled in the art. An algorithm is a set of configured operations that lead to a desired end state or outcome. In example implementations, the operations performed require physical manipulations of tangible magnitude to achieve a tangible result.

Unless expressly stated otherwise, as is apparent from the discussion, it is to be understood that throughout this specification, discussions in which terms such as recognizing, determining, analyzing, identifying, scanning or the like are used are construing the actions and processes of one computer system or another

information processing apparatus that manipulates and converts data represented as physical (electronic) quantities within the computer system's registers and memories into other data that are also represented as physical quantities within the computer system's memories or registers or other information storage, transmission or or display devices are shown.

Example implementations may also refer to an apparatus for performing the operations herein. This facility may be specially constructed for the purposes required, or it may include one or more general purpose computers which are selectively activated or reconfigured by one or more computer programs. Such computer programs may be stored on a computer-readable medium, such as a computer-readable storage medium or a computer-readable signal medium. Computer-executable instructions may include, for example, instructions and data that cause a general purpose computer, special purpose computer, or special purpose processing device (e.g., one or more processors) to perform or control the performance of a particular function or group of functions.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter configured in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.

An example device may include a wireless access point (WAP) or station and include a VLSI processor and program code to be supported. An exemplary transceiver couples via an on-board modem to one of a cable, fiber, or backbone connection for a digital subscriber to the Internet in support of wireless communications, e.g. B. an IEEE 802.11 compatible communication, in a wireless local area network (WLAN). The WiFi stage includes a baseband stage and the analog front-end stage (AFE stage) and radio frequency stage (RF stage). In the baseband section, wireless communications sent to and received by each user/client/station are processed. The AFE and RF section handles the upconversion on each of the transmission paths of wireless transmissions initiated in the baseband. The RF section also down-converts the signals received on the receive paths and passes them to baseband for further processing.

An exemplary device may be a multiple input multiple output (MIMO) device supporting up to NxN discrete communication streams over N antennas. In an example, the signal processing units of the MIMO device can be implemented as NxN. In various implementations, the value of N can be 4, 6, 8, 12, 16, and so on. An advanced MIMO process enables the use of up to 2N antennas in communication with another similarly equipped wireless system. It should be noted that advanced MIMO systems can communicate with other wireless systems even if the systems do not have the same number of antennas; however, some of the antennas of one of the stations may not be used, reducing optimal performance.

Channel state information (CSI) from any of the devices described herein can be extracted independent of changes in channel state parameters and used for network spatial diagnostic services such as motion detection, proximity detection, and location used in, for example, WLAN diagnostics, home security, health monitoring, smart home utility control, Elderly care, vehicle tracking and monitoring, home or mobile entertainment, vehicle infotainment, and the like.

Unless specific arrangements described herein are mutually exclusive, the various implementations described herein may be combined in whole or in part to enhance system functionality and/or to create supplemental functionality. Likewise, aspects of the implementations may be implemented in independent devices. Thus, the above description has been provided by way of example only, and modifications of detail can be made within the scope of the present invention.

With respect to the use of substantially all plural or singular terms herein, those skilled in the art may change from plural to singular or from singular to plural as appropriate to the context or application. The various singular/plural conversions may be expressly set forth herein for the sake of clarity. A reference to an element in the singular is not intended to mean "one and only one" unless specifically stated, but rather "one or more." Furthermore, nothing disclosed herein is intended to be in the public domain, regardless of whether such disclosure is expressly made in the foregoing specification.

In general, terms used herein, and particularly in the appended claims (e.g., the body of the appended claims), are generally defined as "open-ended" terms (e.g., the term "including" should be construed as "including, but not limited to") the term "with" should be construed as "at least", the term "includes" should be construed as "includes but is not limited to", etc.). Furthermore, where a convention analogous to "at least one of A, B, and C, etc." is used, such construction is generally intended in the sense in which one skilled in the art would understand that convention (e.g., B. "A system having at least one of A, B, and C" would include, but would not be limited to, systems having A alone, B alone, C alone, A and B together, A and C together, B and C together or A, B and C together etc.). Also, a phrase representing two or more alternative terms, whether in the specification, claims, or drawings, should be understood to include one of the terms, either one of the terms, or both terms. For example, the phrase "A or B" is understood to include the possibilities of "A" or "B" or "A and B".

Furthermore, the terms "first,""second,""third," etc. are not necessarily used herein to denote a specific order or number of elements. In general, the terms "first", "second", "third", etc. are used to distinguish between different elements as generic identifiers. Unless the terms "first", "second", "third", etc. are shown to denote a specific order, such terms are not to be construed as denoting a specific order indicate order. Furthermore, if it is not shown that the Terms “first”, “second”, “third”, etc. denote a specific number of elements, such terms are not to be construed as denoting a specific number of elements.

The present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. The described implementations are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

Claims (21)

Method comprising: determining, by an access point, which stations among a plurality of stations are permitted to access a wireless communication medium in a subsequent uplink frame; and broadcasting an uplink map to the plurality of stations, the uplink map identifying a first station of the plurality of stations as permitted for access to the wireless communication medium, the uplink map further including an assignment of the subsequent uplink frame for the first station identified. procedure after claim 1 , further comprising, while allocating the subsequent uplink frame allocated to the first station, receiving an acknowledgment of downlink data transmitted to the first station, uplink data, a resource allocation request from the first station accessing for a second subsequent uplink frame, or combinations thereof. procedure after claim 2 , further comprising delaying transmission of an acknowledgment in response to the received uplink data until after the subsequent uplink frame. procedure after claim 2 , wherein the combinations of the acknowledgment, the uplink data or the resource allocation request are received with a single header and a combined payload. procedure after claim 1 , the uplink map further identifying a contention period during the subsequent uplink frame. procedure after claim 5 , further comprising, during the contention period of the subsequent uplink frame, receiving a resource allocation request from a second station requesting access to a second subsequent uplink frame, wherein the second station has no allocation in the uplink map of the subsequent uplink frame . procedure after claim 5 , further comprising receiving, during the contention period, an association request from a new station requesting to communicate with the access point. procedure after claim 1 , further comprising making at least one assignment to each of the plurality of stations within a threshold amount of time. procedure after claim 8 , where the threshold amount of time spans multiple uplink frames. procedure after claim 1 , wherein the uplink map is transmitted during a downlink frame, the subsequent uplink frame and the downlink frame together forming a superframe. procedure after claim 10 , further comprising coordinating the superframe of the access point with at least one other access point. procedure after claim 1 , further comprising transmitting downlink data to the first station prior to the subsequent uplink frame, wherein the uplink map is broadcast prior to transmitting the downlink data to the first station. procedure after claim 1 , further comprising transmitting downlink data to the first station prior to the subsequent uplink frame, wherein the uplink map is broadcast after transmitting the downlink data to the first station. procedure after claim 1 wherein the uplink map further identifies an administrative assignment for a third station, the third station receiving downlink data from the access point prior to the subsequent uplink frame, the third station receiving no further assignment in the subsequent uplink frame. procedure after Claim 14 , where the administrative assignment lasts long enough to accommodate an acknowledgment packet, a resource assignment request, or both. procedure after claim 1 , further comprising broadcasting a beacon to the plurality of stations, the beacon including timing information from the access point, the timing information being useable by the stations to synchronize with the access point. procedure after Claim 16 wherein the assignment includes a start time and an end time, the start time being based on the access point's timing information. Method comprising: receiving, by a station and from an access point, an uplink map identifying an allocation within a subsequent uplink frame within which the station has access to a wireless medium, wherein the uplink map includes a start time and an end time for the assignment; and based on the assignment start time that coincides with a current time, transmitting information to the access point so that transmission of the information is completed before the end time. procedure after Claim 18 , further comprising determining the current time based on access point timing information received in a beacon broadcast by the access point. procedure after Claim 18 , further comprising: receiving a sounding trigger from the access point; and delaying transmission of a sounding response to the sounding trigger pending assignment. procedure after Claim 18 wherein the information transmitted by the station includes acknowledgments for received downlink data, resource allocation requests, management information, uplink data, or combinations thereof.

Images