Trust mechanism for peer station operation

Abstract

A method and device for a trust mechanism for peer STA operation. A method performed by a first STA associated with an AP comprises initiating a protocol between the first STA, a second STA, and the AP. The protocol is associated with coexistence constraints for the first STA and coexistence constraints for the second STA. The method further comprises indicating, to the AP, about the coexistence constraints for the first STA, and indicating, to the AP, about the coexistence constraints for the second STA on behalf of the second STA.

Description

TRUST MECHANISM FOR PEER STATION OPERATION

[0001] This disclosure relates generally to wireless communication, and more specifically to a trust mechanism for peer station (STA) operation.

[0002] Wireless Local Area Network (WLAN) technology allows devices to access the internet in the 2.4 GHz, 5GHz, 6GHz or 60 GHz frequency bands. WLANs are based on the Institute of Electrical and Electronic Engineers (IEEE) 802.11 standards. IEEE 802.11 family of standards aim to increase speed and reliability and to extend the operating range of wireless networks.

[0003] The demand of wireless data traffic is rapidly increasing due to the growing popularity among consumers and businesses of smart phones and other mobile data devices, such as tablets, "note pad" computers, net books, eBook readers, and machine type of devices. In order to address the issue of increasing bandwidth requirements that are demanded for wireless communications systems, different schemes are being developed to allow multiple user terminals to communicate with a single access point by sharing the channel resources while achieving high data throughputs. Multiple Input Multiple Output (MIMO) technology represents one such approach that has emerged as a popular technique. MIMO has been adopted in several wireless communications standards such 802.11ac, 802.11ax, etc.

[0004] The description set forth in the background section should not be assumed to be prior art merely because it is set forth in the background section. The background section may describe aspects or an embodiment of the present disclosure.

[0005] An embodiment of the present disclosure provides methods and apparatuses for trust mechanism for peer STA operation.

[0006] One aspect of the present disclosure provides a first station (STA) in a wireless network, the STA comprising: at least one processor including processing circuitry and memory storing instructions. The instructions, when executed by the at least one processor individually or collectively, cause the first STA to initiate a protocol between the first STA, a second STA, and an access point (AP) associated with the first STA. The protocol is associated with coexistence constraints for the first STA and coexistence constraints for the second STA. The instructions, when executed by the at least one processor individually or collectively, cause the first STA to generate an indication about the coexistence constraints for the first STA. The instructions, when executed by the at least one processor individually or collectively, cause the first STA to generate an indication about the coexistence constraints for the second STA on behalf of the second STA.

[0007] In some examples, the first STA has a mutual coexistence event scheduled with the second STA. To initiate the protocol between the first STA, the second STA, and the AP, the instructions, when executed by the at least one processor individually or collectively, further cause the first STA to generate a coexistence mode transition request to the AP that identifies the second STA as a coexistence peer STA of the first STA.

[0008] In some examples, the instructions, when executed by the at least one processor individually or collectively, further cause the first STA to receive a coexistence mode transition response from the AP. In some examples, the coexistence mode transition response confirms a coexistence mode transition of the first STA, but does not confirm a coexistence mode transition of the second STA if the second STA does not approve the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. In some examples, the coexistence mode transition response confirms the coexistence mode transition of the first STA, and also confirms the coexistence mode transition of the second STA if the second STA approves the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. In some examples, the coexistence mode transition response does not confirm the coexistence mode transition of the first STA, and also does not confirm the coexistence mode transition of the second STA if the second STA does not approve the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. In some examples, the coexistence mode transition response does not confirm the coexistence mode transition of the first STA, but confirm the coexistence mode transition of the second STA if the second STA approves the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA.

[0009] In some examples, the instructions, when executed by the at least one processor individually or collectively, further cause the first STA to receive a coexistence mode transition response from the AP. The coexistence mode transition response acknowledges the coexistence mode transition request and confirms a coexistence mode transition of the first STA.

[0010] In some examples, the coexistence mode transition response further confirms the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. The coexistence mode transition response further confirms a coexistence mode transition of the second STA.

[0011] In some examples, the first STA has a mutual coexistence event scheduled with the second STA. The instructions, when executed by the at least one processor individually or collectively, further cause the first STA to share a coexistence indication authentication key of the second STA.

[0012] In some examples, to initiate the protocol between the first STA, the second STA, and the AP, the instructions, when executed by the at least one processor individually or collectively, further cause the first STA to transmit a coexistence mode transition request to the AP that identifies the second STA as a coexistence peer STA of the first STA. The coexistence mode transition request includes the coexistence indication authentication key of the second STA. The instructions, when executed by the at least one processor individually or collectively, further cause the first STA to receive a coexistence mode transition response from the AP based on the coexistence indication authentication key of the second STA. The coexistence mode transition response confirms a coexistence mode transition of the first STA. The coexistence mode transition response further confirms the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. The coexistence mode transition response further confirms a coexistence mode transition of the second STA.

[0013] One aspect of the present disclosure provides an access point (AP) in a wireless network, the AP comprising: at least one processor including processing circuitry and memory storing instructions. The instructions, when executed by the at least one processor individually or collectively, cause the AP to receive, from a first station (STA) associated with the AP, information associated with initiating a protocol between the first STA, a second STA, and the AP. The protocol is associated with coexistence constraints for the first STA and coexistence constraints for the second STA. The instructions, when executed by the at least one processor individually or collectively, cause the AP to receive an indication from the first STA about the coexistence constraints for the first STA. The instructions, when executed by the at least one processor individually or collectively, cause the AP to receive an indication from the first STA about the coexistence constraints for the second STA on behalf of the second STA. The instructions, when executed by the at least one processor individually or collectively, cause the AP to transmit, to the first STA, signals associated with the protocol.

[0014] In some examples, the instructions, when executed by the at least one processor individually or collectively, cause the AP to identify that the first STA has a mutual coexistence event scheduled with the second STA. The instructions, when executed by the at least one processor individually or collectively, cause the AP to receive, from the first STA, a coexistence mode transition request that identifies the second STA as a coexistence peer STA of the first STA.

[0015] In some examples, the instructions, when executed by the at least one processor individually or collectively, cause the AP to transmit a coexistence mode transition response to the first STA. In some examples, the coexistence mode transition response confirms a coexistence mode transition of the first STA, but does not confirm a coexistence mode transition of the second STA if the second STA does not approve the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. In some examples, the coexistence mode transition response confirms the coexistence mode transition of the first STA, and also confirms the coexistence mode transition of the second STA if the second STA approves the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. In some examples, the coexistence mode transition response does not confirm the coexistence mode transition of the first STA, and also does not confirm the coexistence mode transition of the second STA if the second STA does not approve the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. In some examples, the coexistence mode transition response does not confirm the coexistence mode transition of the first STA, but confirm the coexistence mode transition of the second STA if the second STA approves the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA.

[0016] In some examples, the instructions, when executed by the at least one processor individually or collectively, further cause the AP to transmit a coexistence mode transition response to the first STA. The coexistence mode transition response acknowledges the coexistence mode transition request and confirms a coexistence mode transition of the first STA.

[0017] In some examples, the coexistence mode transition response confirms the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. The coexistence mode transition response confirms a coexistence mode transition of the second STA.

[0018] In some examples, the instructions, when executed by the at least one processor individually or collectively, further cause the AP to identify that the first STA has a mutual coexistence event scheduled with the second STA. The instructions, when executed by the at least one processor individually or collectively, cause the AP to receive a shared coexistence indication authentication key of the second STA. The instructions, when executed by the at least one processor individually or collectively, cause the AP to receive a coexistence mode transition request that identifies the second STA as a coexistence peer STA of the first STA, wherein the coexistence mode transition request includes the coexistence indication authentication key of the second STA. The instructions, when executed by the at least one processor individually or collectively, cause the AP to transmit, to the first STA, a coexistence mode transition response based on the coexistence indication authentication key of the second STA. The coexistence mode transition response confirms a coexistence mode transition of the first STA. The coexistence mode transition response confirms the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. The coexistence mode transition response confirms a coexistence mode transition of the second STA.

[0019] One aspect of the present disclosure provides a computer-implemented method for wireless communication by a first station (STA) in a wireless network. The method comprises initiating a protocol between the first STA, a second STA, and the AP, the protocol associated with coexistence constraints for the first STA and coexistence constraints for the second STA. The method comprises indicating, to the AP, about the coexistence constraints for the first STA. The method comprises indicating, to the AP, about the coexistence constraints for the second STA on behalf of the second STA.

[0020] In some examples, the first STA has a mutual coexistence event scheduled with the second STA. The initiating the protocol between the first STA, the second STA, and the AP comprises transmitting a coexistence mode transition request to the AP that identifies the second STA as a coexistence peer STA of the first STA.

[0021] In some examples, the method comprises receiving a coexistence mode transition response from the AP. In some examples, the coexistence mode transition response confirms a coexistence mode transition of the first STA, but does not confirm a coexistence mode transition of the second STA if the second STA does not approve the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. In some examples, the coexistence mode transition response confirms the coexistence mode transition of the first STA, and also confirms the coexistence mode transition of the second STA if the second STA approves the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. In some examples, the coexistence mode transition response does not confirm the coexistence mode transition of the first STA, and also does not confirm the coexistence mode transition of the second STA if the second STA does not approve the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. In some examples, the coexistence mode transition response does not confirm the coexistence mode transition of the first STA, but confirm the coexistence mode transition of the second STA if the second STA approves the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA.

[0022] In some examples, the method comprises receiving a coexistence mode transition response from the AP. The coexistence mode transition response acknowledges the coexistence mode transition request. The coexistence mode transition response confirms a coexistence mode transition of the first STA.

[0023] In some examples, the coexistence mode transition response confirms the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. The coexistence mode transition response confirms a coexistence mode transition of the second STA.

[0024] In some examples, the first STA has a mutual coexistence event scheduled with the second STA. The method comprises sharing a coexistence indication authentication key of the second STA.

[0025] In some examples, the initiating the protocol between the first STA, the second STA, and the AP comprises transmitting a coexistence mode transition request to the AP that identifies the second STA as a coexistence peer STA of the first STA, wherein the coexistence mode transition request includes the coexistence indication authentication key of the second STA, and receiving a coexistence mode transition response from the AP based on the coexistence indication authentication key of the second STA. The coexistence mode transition response confirms a coexistence mode transition of the first STA. The coexistence mode transition response confirms the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. The coexistence mode transition response confirms a coexistence mode transition of the second STA.

[0026] One aspect of the present disclosure provides a computer-implemented method for wireless communication by an access point (AP) in a wireless network. The method comprises receiving, from a first station (STA) associated with the AP, information associated with initiating a protocol between the first STA, a second STA, and the AP, the protocol associated with coexistence constraints for the first STA and coexistence constraints for the second STA. The method comprises receiving an indication from the first STA about the coexistence constraints for the first STA. The method comprises receiving an indication from the first STA about the coexistence constraints for the second STA on behalf of the second STA. The method comprises transmitting, to the first STA, signals associated with the protocol.

[0027] In some examples, the method comprises identifying that the first STA has a mutual coexistence event scheduled with the second STA. The method comprises receiving, from the first STA, a coexistence mode transition request that identifies the second STA as a coexistence peer STA of the first STA.

[0028] In some examples, the method comprises transmitting a coexistence mode transition response to the first STA. In some examples, the coexistence mode transition response confirms a coexistence mode transition of the first STA, but does not confirm a coexistence mode transition of the second STA if the second STA does not approve the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. In some examples, the coexistence mode transition response confirms the coexistence mode transition of the first STA, and also confirms the coexistence mode transition of the second STA if the second STA approves the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. In some examples, the coexistence mode transition response does not confirm the coexistence mode transition of the first STA, and also does not confirm the coexistence mode transition of the second STA if the second STA does not approve the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. In some examples, the coexistence mode transition response does not confirm the coexistence mode transition of the first STA, but confirm the coexistence mode transition of the second STA if the second STA approves the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA.

[0029] In some examples, the method comprises transmitting a coexistence mode transition response to the first STA. The coexistence mode transition response acknowledges the coexistence mode transition request. The coexistence mode transition response confirms a coexistence mode transition of the first STA.

[0030] In some examples, the coexistence mode transition response confirms the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. The coexistence mode transition response confirms a coexistence mode transition of the second STA.

[0031] In some examples, the method comprises identifying that the first STA has a mutual coexistence event scheduled with the second STA. The method comprises receiving a shared coexistence indication authentication key of the second STA. The method comprises receiving a coexistence mode transition request that identifies the second STA as a coexistence peer STA of the first STA. The coexistence mode transition request includes the coexistence indication authentication key of the second STA. The method comprises transmit, to the first STA, a coexistence mode transition response based on the coexistence indication authentication key of the second STA. The coexistence mode transition response confirms a coexistence mode transition of the first STA. The coexistence mode transition response confirms the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA. The coexistence mode transition response confirms a coexistence mode transition of the second STA.

[0032] One aspect of the present disclosure provides a non-statutory computer-readable storage medium storing one or more computer programs comprising instructions to perform a method for wireless communication by a first station (STA) in a wireless network. The method comprises initiating a protocol between the first STA, a second STA, and an access point (AP) associated with the first STA, the protocol associated with coexistence constraints for first STA and coexistence constraints for second STA. The method comprises generating an indication about the coexistence constraints for the first STA. The method comprises generating an indication about the coexistence constraints for second STA on behalf of the second STA.

[0033] One aspect of the present disclosure provides a non-statutory computer-readable storage medium storing one or more computer programs comprising instructions to perform a method for wireless communication by an access point (AP) in a wireless network. The method comprises receiving, from a first station (STA) associated with the AP, information associated with initiating a protocol between the first STA, a second STA, and the AP, the protocol associated with coexistence constraints for the first STA and coexistence constraints for the second STA. The method comprises receiving an indication from the first STA about the coexistence constraints for the first STA. The method comprises receiving an indication from the first STA about the coexistence constraints for the second STA on behalf of the second STA. The method comprises transmitting, to the first STA, signals associated with the protocol.

[0034] Other technical features may be readily apparent to one skilled in the art from the following figures, descriptions, and claims.

[0035] Before undertaking the DETAILED DESCRIPTION below, it may be advantageous to set forth definitions of certain words and phrases used throughout this patent document. The term "couple" and its derivatives refer to any direct or indirect communication between two or more elements, whether or not those elements are in physical contact with one another. The terms "transmit", "receive", and "communicate", as well as derivatives thereof, encompass both direct and indirect communication. The terms "include" and "comprise", as well as derivatives thereof, mean inclusion without limitation. The term "or" is inclusive, meaning and / or. The phrase "associated with", as well as derivatives thereof, means to include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicable with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, have a relationship to or with, or the like. The term "controller" means any device, system or part thereof that controls at least one operation. Such a controller may be implemented in hardware or a combination of hardware and software and / or firmware. The functionality associated with any particular controller may be centralized or distributed, whether locally or remotely. The phrase "at least one of" when used with a list of items, means that different combinations of one or more of the listed items may be used, and only one item in the list may be needed. For example, "at least one of: A, B, and C" includes any of the following combinations: A, B, C, A and B, A and C, B and C, and A and B and C.

[0036] Moreover, various functions described below can be implemented or supported by one or more computer programs, each of which is formed from computer readable program code and embodied in a computer readable medium. The terms "application" and "program" refer to one or more computer programs, software components, sets of instructions, procedures, functions, objects, classes, instances, related data, or a portion thereof adapted for implementation in a suitable computer readable program code. The phrase "computer readable program code" includes any type of computer code, including source code, object code, and executable code. The phrase "computer readable medium" includes any type of medium capable of being accessed by a computer, such as read only memory (ROM), random access memory (RAM), a hard disk drive, a compact disc (CD), a digital video disc (DVD), or any other type of memory. A "non-transitory" computer readable medium excludes wired, wireless, optical, or other communication links that transport transitory electrical or other signals. A non-transitory computer readable medium includes media where data can be stored and media where data can be stored and later overwritten, such as a rewritable optical disc or an erasable memory device.

[0037] Definitions for other certain words and phrases are provided throughout this patent document. Those of ordinary skill in the art should understand that in many if not most instances, such definitions apply to prior as well as future uses of such defined words and phrases.

[0038] For a more complete understanding of the present disclosure and its advantages, reference is now made to the following description taken in conjunction with the accompanying drawings, in which like reference numerals represent like parts:

[0039] FIG. 1 illustrates an example wireless network according to an embodiment of the present disclosure;

[0040] FIG. 2 illustrates an example access point (AP) according to an embodiment of the present disclosure;

[0041] FIG. 3 illustrates an example station (STA) according to an embodiment of the present disclosure;

[0042] FIG. 4 illustrates an example of a network where infrastructure traffic and non-infrastructure traffic coexist according to an embodiment of the present disclosure;

[0043] FIG. 5 illustrates an example for the need for trust between peer STAs and an access point (AP) for the purpose of a proxy coexistence indication according to an embodiment of the present disclosure;

[0044] FIG. 6 illustrates an example of a call flow for ensuring trust between peer STAs according to an embodiment of the present disclosure;

[0045] FIG. 7 illustrates an example of another call flow for ensuring trust between peer STAs according to an embodiment of the present disclosure;

[0046] FIG. 8 illustrates an example of yet another call flow for ensuring trust between peer STAs according to an embodiment of the present disclosure; and

[0047] FIG. 9 illustrates an example method for a trust mechanism for peer STA operation according to an embodiment of the present disclosure.

[0048] In one or more implementations, not all of the depicted components in each figure may be required, and one or more implementations may include additional components not shown in a figure. Variations in the arrangement and type of the components may be made without departing from the scope of the subject disclosure. Additional components, different components, or fewer components may be utilized within the scope of the subject disclosure.

[0049] The detailed description set forth below, in connection with the appended drawings, is intended as a description of various implementations and is not intended to represent the only implementations in which the subject technology may be practiced. Rather, the detailed description includes specific details for the purpose of providing a thorough understanding of the inventive subject matter. As those skilled in the art would realize, the described implementations may be modified in various ways, all without departing from the scope of the present disclosure. Accordingly, the drawings and description are to be regarded as illustrative in nature and not restrictive. Like reference numerals designate like elements.

[0050] The following description is directed to certain implementations for the purpose of describing the innovative aspects of this disclosure. However, a person having ordinary skill in the art will readily recognize that the teachings herein can be applied in a multitude of different ways. The examples in this disclosure are based on WLAN communication according to the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard, including IEEE 802.11be standard and any future amendments to the IEEE 802.11 standard. However, the described embodiments may be implemented in any device, system or network that is capable of transmitting and receiving radio frequency (RF) signals according to the IEEE 802.11 standard, the Bluetooth standard, Global System for Mobile communications (GSM), GSM / General Packet Radio Service (GPRS), Enhanced Data GSM Environment (EDGE), Terrestrial Trunked Radio (TETRA), Wideband-CDMA (W-CDMA), Evolution Data Optimized (EV-DO), 1xEV-DO, EV-DO Rev A, EV-DO Rev B, High Speed Packet Access (HSPA), High Speed Downlink Packet Access (HSDPA), High Speed Uplink Packet Access (HSUPA), Evolved High Speed Packet Access (HSPA+), Long Term Evolution (LTE), 5G NR (New Radio), AMPS, or other known signals that are used to communicate within a wireless, cellular or internet of things (IoT) network, such as a system utilizing 3G, 4G, 5G, 6G, or further implementations thereof, technology.

[0051] To meet the demand for wireless data traffic having increased since deployment of 4G communication systems, and to enable various vertical applications, 5G / NR communication systems have been developed and are currently being deployed. The 5G / NR communication system is implemented in higher frequency (mmWave) bands, e.g., 28 GHz or 60GHz bands, so as to accomplish higher data rates or in lower frequency bands, such as 6 GHz, to enable robust coverage and mobility support. To decrease propagation loss of the radio waves and increase the transmission distance, the beamforming, massive multiple-input multiple-output (MIMO), full dimensional MIMO (FD-MIMO), array antenna, an analog beam forming, large scale antenna techniques are discussed in 5G / NR communication systems.

[0052] In addition, in 5G / NR communication systems, development for system network improvement is under way based on advanced small cells, cloud radio access networks (RANs), ultra-dense networks, device-to-device (D2D) communication, wireless backhaul, moving network, cooperative communication, coordinated multi-points (CoMP), reception-end interference cancelation and the like.

[0053] The discussion of 5G systems and frequency bands associated therewith is for reference as certain an embodiment of the present disclosure may be implemented in 5G systems. However, the present disclosure is not limited to 5G systems, or the frequency bands associated therewith, and an embodiment of the present disclosure may be utilized in connection with any frequency band. For example, aspects of the present disclosure may also be applied to deployment of 5G communication systems, 6G, or even later releases which may use terahertz (THz) bands.

[0054] FIGS. 1-3 below describe various embodiments implemented in wireless communications systems and with the use of orthogonal frequency division multiplexing (OFDM) or orthogonal frequency division multiple access (OFDMA) communication techniques. The descriptions of FIGS. 1-3 are not meant to imply physical or architectural limitations to the manner in which different embodiments may be implemented. Different an embodiment of the present disclosure may be implemented in any suitably arranged communications system.

[0055] FIG. 1 illustrates an example wireless network according to an embodiment of the present disclosure. The embodiment of the wireless network shown in FIG. 1 is for illustration only. Other embodiments of the wireless network 100 could be used without departing from the scope of this disclosure.

[0056] The wireless network 100 includes access points (APs) 101 and 103. The APs 101 and 103 communicate with at least one network 130, such as the Internet, a proprietary Internet Protocol (IP) network, or other data network. The AP 101 provides wireless access to the network 130 for a plurality of stations (STAs) 111-114 within a coverage area 120 of the AP 101. The APs 101-103 may communicate with each other and with the STAs 111-114 using WI-FI or other WLAN communication techniques. The STAs 111-114 may communicate with each other using peer-to-peer protocols, such as Tunneled Direct Link Setup (TDLS).

[0057] Depending on the network type, other well-known terms may be used instead of "access point" or "AP", such as "router" or "gateway." For the sake of convenience, the term "AP" is used in this disclosure to refer to network infrastructure components that provide wireless access to remote terminals. In WLAN, given that the AP also contends for the wireless channel, the AP may also be referred to as a STA. Also, depending on the network type, other well-known terms may be used instead of "station" or "STA", such as "mobile station", "subscriber station", "remote terminal", "user equipment," "wireless terminal", or "user device". For the sake of convenience, the terms "station" and "STA" are used in this disclosure to refer to remote wireless equipment that wirelessly accesses an AP or contends for a wireless channel in a WLAN, whether the STA is a mobile device (such as a mobile telephone or smartphone) or is normally considered a stationary device (such as a desktop computer, AP, media player, stationary sensor, television, etc.).

[0058] Dotted lines show the approximate extents of the coverage areas 120 and 125, which are shown as approximately circular for the purposes of illustration and explanation only. It should be clearly understood that the coverage areas associated with gNBs, such as the coverage areas 120 and 125, may have other shapes, including irregular shapes, depending upon the configuration of the gNBs and variations in the radio environment associated with natural and man-made obstructions.

[0059] As described in more detail below, one or more of the APs may include circuitry and / or programming for facilitating a trust mechanism for peer STA operation. Although FIGURE 1 illustrates one example of a wireless network 100, various changes may be made to FIGURE 1. For example, the wireless network 100 could include any number of APs and any number of STAs in any suitable arrangement. Also, the AP 101 could communicate directly with any number of STAs and provide those STAs with wireless broadband access to the network 130. Similarly, each AP 101-103 could communicate directly with the network 130 and provide STAs with direct wireless broadband access to the network 130. Further, the APs 101 and / or 103 could provide access to other or additional external networks, such as external telephone networks or other types of data networks.

[0060] FIGURE 2 illustrates an example AP 101 according to various an embodiment of the present disclosure. The embodiment of the AP 101 illustrated in FIGURE 2 is for illustration only, and the AP 103 of FIGURE 1 could have the same or similar configuration. However, APs come in a wide variety of configurations, and FIGURE 2 does not limit the scope of this disclosure to any particular implementation of an AP.

[0061] The AP 101 includes multiple antennas 204a-204n and multiple transceivers 209a-209n. The AP 101 also includes a controller / processor 224, a memory 229, and a backhaul or network interface 234. The transceivers 209a-209n receive, from the antennas 204a-204n, incoming radio frequency (RF) signals, such as signals transmitted by STAs 111-114 in the network 100. The transceivers 209a-209n down-convert the incoming RF signals to generate IF or baseband signals. The IF or baseband signals are processed by receive (RX) processing circuitry in the transceivers 209a-209n and / or controller / processor 224, which generates processed baseband signals by filtering, decoding, and / or digitizing the baseband or IF signals. The controller / processor 224 may further process the baseband signals.

[0062] Transmit (TX) processing circuitry in the transceivers 209a-209n and / or controller / processor 224 receives analog or digital data (such as voice data, web data, e-mail, or interactive video game data) from the controller / processor 224. The TX processing circuitry encodes, multiplexes, and / or digitizes the outgoing baseband data to generate processed baseband or IF signals. The transceivers 209a-209n up-converts the baseband or IF signals to RF signals that are transmitted via the antennas 204a-204n.

[0063] The controller / processor 224 can include one or more processors or other processing devices that control the overall operation of the AP 101. The controller / processor 224 can include processing circuitry, which can be implemented by a circuit, for example a SoC (system on chip) or an IC (integrated circuit). The controller / processor 224 may include the combination of one or more processors such as a CPU, GPU, MPU, an application processor (AP), and a communication processor (CP). For example, the controller / processor 224 could control the reception of forward channel signals and the transmission of reverse channel signals by the transceivers 209a-209n in accordance with well-known principles. The controller / processor 224 could support additional functions as well, such as more advanced wireless communication functions. For instance, the controller / processor 224 could support beam forming or directional routing operations in which outgoing signals from multiple antennas 204a-204n are weighted differently to effectively steer the outgoing signals in a desired direction. The controller / processor 224 could also support OFDMA operations in which outgoing signals are assigned to different subsets of subcarriers for different recipients (e.g., different STAs 111-114). Any of a wide variety of other functions could be supported in the AP 101 by the controller / processor 224 including facilitating a trust mechanism for peer STA operation. In some examples, the controller / processor 224 includes at least one microprocessor or microcontroller. The controller / processor 224 is also capable of executing programs and other processes resident in the memory 229, such as an OS. The controller / processor 224 can move data into or out of the memory 229 as required by an executing process.

[0064] The controller / processor 224 is also coupled to the backhaul or network interface 234. The backhaul or network interface 234 allows the AP 101 to communicate with other devices or systems over a backhaul connection or over a network. The interface 234 could support communications over any suitable wired or wireless connection(s). For example, the interface 234 could allow the AP 101 to communicate over a wired or wireless local area network or over a wired or wireless connection to a larger network (such as the Internet). The interface 234 includes any suitable structure supporting communications over a wired or wireless connection, such as an Ethernet or RF transceiver. The memory 229 is coupled to the controller / processor 224. Part of the memory 229 could include a RAM, and another part of the memory 229 could include a Flash memory or other ROM.

[0065] As described in more detail below, the AP 101 may include circuitry and / or programming for facilitating a trust mechanism for peer STA operation. Although FIGURE 2 illustrates one example of AP 101, various changes may be made to FIGURE 2. For example, the AP 101 could include any number of each component shown in FIGURE 2. As a particular example, an access point could include a number of interfaces 234, and the controller / processor 224 could support routing functions to route data between different network addresses. Alternatively, only one antenna and transceiver path may be included, such as in legacy APs. Also, various components in FIGURE 2 could be combined, further subdivided, or omitted and additional components could be added according to particular needs.

[0066] FIGURE 3 illustrates an example STA 111 according to various an embodiment of the present disclosure. The embodiment of the STA 111 illustrated in FIGURE 3 is for illustration only, and the STAs 111-115 of FIGURE 1 could have the same or similar configuration. However, STAs come in a wide variety of configurations, and FIGURE 3 does not limit the scope of this disclosure to any particular implementation of a STA.

[0067] The STA 111 includes antenna(s) 305, transceiver(s) 310, a microphone 320, a speaker 330, a processor 340, an input / output (I / O) interface (IF) 345, an input 350, a display 355, and a memory 360. The memory 360 includes an operating system (OS) 361 and one or more applications 362.

[0068] The transceiver(s) 310 receives, from the antenna(s) 305, an incoming RF signal (e.g., transmitted by an AP 101 of the network 100). The transceiver(s) 310 down-converts the incoming RF signal to generate an intermediate frequency (IF) or baseband signal. The IF or baseband signal is processed by RX processing circuitry in the transceiver(s) 310 and / or processor 340, which generates a processed baseband signal by filtering, decoding, and / or digitizing the baseband or IF signal. The RX processing circuitry sends the processed baseband signal to the speaker 330 (such as for voice data) or is processed by the processor 340 (such as for web browsing data).

[0069] TX processing circuitry in the transceiver(s) 310 and / or processor 340 receives analog or digital voice data from the microphone 320 or other outgoing baseband data (such as web data, e-mail, or interactive video game data) from the processor 340. The TX processing circuitry encodes, multiplexes, and / or digitizes the outgoing baseband data to generate a processed baseband or IF signal. The transceiver(s) 310 up-converts the baseband or IF signal to an RF signal that is transmitted via the antenna(s) 305.

[0070] The processor 340 can include one or more processors and execute the basic OS program 361 stored in the memory 360 in order to control the overall operation of the STA 111. The controller / processor 340 can include processing circuitry, which can be implemented by a circuit, for example a SoC(system on chip) or an IC(integrated circuit). The controller / processor 340 may include the combination of one or more processors such as a CPU, GPU, MPU, an application processor (AP), and a communication processor (CP). In one such operation, the processor 340 controls the reception of forward channel signals and the transmission of reverse channel signals by the transceiver(s) 310 in accordance with well-known principles. The processor 340 can also include processing circuitry configured to facilitate a trust mechanism for peer STA operation. In some examples, the processor 340 includes at least one microprocessor or microcontroller.

[0071] The processor 340 is also capable of executing other processes and programs resident in the memory 360, such as operations for facilitating a trust mechanism for peer STA operation. The processor 340 can move data into or out of the memory 360 as required by an executing process. In some examples, the processor 340 is configured to execute a plurality of applications 362, such as applications for facilitating a trust mechanism for peer STA operation. The processor 340 can operate the plurality of applications 362 based on the OS program 361 or in response to a signal received from an AP. The processor 340 is also coupled to the I / O interface 345, which provides STA 111 with the ability to connect to other devices such as laptop computers and handheld computers. The I / O interface 345 is the communication path between these accessories and the processor 340.

[0072] The processor 340 is also coupled to the input 350, which includes for example, a touchscreen, keypad, etc., and the display 355. The operator of the STA 111 can use the input 350 to enter data into the STA 111. The display 355 may be a liquid crystal display, light emitting diode display, or other display capable of rendering text and / or at least limited graphics, such as from web sites. The memory 360 is coupled to the processor 340. Part of the memory 360 could include a random-access memory (RAM), and another part of the memory 360 could include a Flash memory or other read-only memory (ROM).

[0073] Although FIGURE 3 illustrates one example of STA 111, various changes may be made to FIGURE 3. For example, various components in FIGURE 3 could be combined, further subdivided, or omitted and additional components could be added according to particular needs. In particular examples, the STA 111 may include any number of antenna(s) 305 for MIMO communication with an AP 101. In another example, the STA 111 may not include voice communication or the processor 340 could be divided into multiple processors, such as one or more central processing units (CPUs) and one or more graphics processing units (GPUs). Also, while FIGURE 3 illustrates the STA 111 configured as a mobile telephone or smartphone, STAs could be configured to operate as other types of mobile or stationary devices.

[0074] An embodiment of the present disclosure recognizes that a next generation WLAN system needs to provide better support for low-latency applications. Today it is not uncommon to observe numerous devices operating on the same network. Many of such devices may be latency-tolerant but still contend with the devices with low-latency applications for the same time and frequency resources. In some cases, the access point (AP) as the network controller may not have enough control over the unregulated / unmanaged traffic that contends with the low-latency traffic within the infrastructure BSS. Some of the unmanaged traffic that interfere with the AP's BSS' latency sensitive traffic may be coming from uplink (UL) / downlink (DL) or direct link communications within the infrastructure BSS that the AP manages; others may be due to transmission in the neighboring infrastructure BSS (OBSS); yet others may be coming from neighboring independent BSS or P2P networks. The next generation WLAN system needs mechanisms to better handle the unmanaged traffic in order to prioritize the low-latency traffic in the network.

[0075] An embodiment of the present disclosure recognizes that in-device coexistence (coex) is an issue that the IEEE 802.11bn is considering addressing. A first STA can inform the associated AP about the first STA's possible coexistence (coex) events so that the AP can be aware of the first STA's coex constraints. For example, if the AP is made aware of such possible coex situation of the first STA, then the AP may avoid transmitting frames to the first STA during the coex event. Also, upon transmitting frames to the first STA, if the AP does not receive any corresponding Ack frames from the first STA, then the AP may not take any punitive action against STA1 such as reducing rate or reducing MCS for the first STA.

[0076] An embodiment of the present disclosure also recognizes that when the first STA has coex events, it often involves a second STA with which the first STA has the coex event. Many of the constraints that are applicable to the coex events for the first STA may also be applicable to the coex events for the second STA. While the first STA can inform the associated AP about its own upcoming coex event and corresponding constraints, the first STA may also identify the second STA as the coex peer STA corresponding to the coex event. In this way, the AP can be aware of the second STA's coex event constraints along with the first STA coex event constraints. However, currently there is no mechanism to establish mutual trust between the peer STA to allow the first STA to indicate the coex event for the second STA.

[0077] Accordingly, various an embodiment of the present disclosure can provide methods and apparatuses for a trust mechanism for peer STA operation so that a first STA is able to indicate to an associated AP about coex event constraints for a second STA.

[0078] FIG. 4 illustrates an example of a network 400 where infrastructure traffic and non-infrastructure traffic coexist according to an embodiment of the present disclosure. The embodiment of the example network 400 where infrastructure traffic and non-infrastructure traffic coexist shown in FIG. 4 is for illustration only. Other embodiments of the example network 400 where infrastructure traffic and non-infrastructure traffic coexist could be used without departing from the scope of this disclosure.

[0079] As illustrated in FIG. 4, the AP 402 as the network controller may not have enough control over the unregulated / unmanaged traffic that contends with the low-latency traffic within the infrastructure BSS. Some of the unmanaged traffic that interfere with the AP's BSS' latency sensitive traffic may be coming from uplink (UL) / downlink (DL) or direct link communications within the infrastructure BSS that the AP manages; others may be due to transmission in the neighboring infrastructure BSS (OBSS); yet others may be coming from neighboring independent BSS or P2P networks. FIG. 4 illustrates this kind of network.

[0080] FIG. 5 illustrates an example 500 for the need for trust between peer STAs and an access point (AP) for the purpose of a proxy coexistence indication according to an embodiment of the present disclosure. The embodiment of the example 500 for the need for trust between peer STAs and an access point (AP) for the purpose of a proxy coexistence indication shown in FIG. 5 is for illustration only. Other embodiments of the example 500 for the need for trust between peer STAs and an access point (AP) for the purpose of a proxy coexistence indication could be used without departing from the scope of this disclosure.

[0081] According to some examples, in order for a first STA to be able to indicate to the associated AP about coex event constraints for a second STA, the first STA may set up a trust protocol among the first STA, the second STA, and the AP. This is illustrated in FIG. 5.

[0082] According to some examples, the first STA may set up the trust protocol before the first STA indicates to the associated AP about the coex constraints of the second STA. According to some examples, the first STA may set up the trust protocol after the first STA indicates to the associated AP about the coex constraints of the second STA.

[0083] According to some examples, in order for the first STA to set up the trust protocol for the purpose of coex event indication for a second STA, both the first STA and the second STA may need to be associated with the same AP. According to some examples, the second STA may not need to be associated with the AP with which the first STA is associated.

[0084] FIG. 6 illustrates an example of a call flow 600 for ensuring trust between peer STAs according to an embodiment of the present disclosure. The embodiment of the example of a call flow 600 for ensuring trust between peer STAs shown in FIG. 6 is for illustration only. Other embodiments of the example of a call flow 600 for ensuring trust between peer STAs could be used without departing from the scope of this disclosure.

[0085] According to some examples, for the scenario where a first STA has a mutual coex event or P2P transmission event scheduled with a second STA, if the first STA intends to inform the associated AP (or a third STA) about the coex event and the corresponding constraints for the second STA, the first STA may send a Coex Mode Transition Request frame to the AP. The Coex Mode Transition Request frame may contain the identifier for the second STA. The second STA may also include other parameters or constraints information of the second STA pertaining to the coex event.

[0086] According to one embodiment, upon receiving a Coex Mode Transition Request frame from a first STA that includes identification and other information related to a second STA, the AP (or the third STA) may send a message to the second STA to verify whether the second STA authorizes the first STA for the coex event indication for the second STA. For this purpose, the AP can send a Co-ex peer STA verification Request frame to the second STA.

[0087] According to one embodiment, upon reception of the Co-ex Peer STA Verification Request frame from the AP that identifies the first STA as the authorization seeking STA for coex indication on behalf of the second STA, the second STA may send a Co-ex Peer STA Verification Response frame to the AP. The response frame may indicate whether or not the second STA approves the first STA to indicate the second STA's coex event and corresponding constraints to the AP on behalf of the second STA.

[0088] According to one embodiment, upon reception of the Co-ex Peer STA Verification Response frame from the second STA, the AP can send a Co-ex Mode Transition Response frame to the first STA. This response frame may -

[0089] - Confirm the first STA's coex mode transition, but does not confirm the second STA's coex mode transition if the second STA does not approve the first STA to indicate the second STA's coex event and corresponding constraints to the AP on behalf of the second STA.

[0090] - Confirm the first STA's coex mode transition, and also confirm the second STA's coex mode transition if the second STA approves the first STA to indicate the second STA's coex event and corresponding constraints to the AP on behalf of the second STA.

[0091] - Does not confirm the coex transition mode for the first STA, and also does not confirm the second STA's coex mode transition if the second STA does not approve the first STA to indicate the second STA's coex event and corresponding constraints to the AP on behalf of the second STA.

[0092] - Does not confirm the coex transition mode for the first STA, but confirms the confirms the second STA's coex mode transition if the second STA approves the first STA to indicate the second STA's coex event and corresponding constraints to the AP on behalf of the second STA.

[0093] The call flow is illustrated in FIG. 6.

[0094] FIG. 7 illustrates an example of another call flow 700 for ensuring trust between peer STAs according to an embodiment of the present disclosure. The embodiment of the example of a call flow 700 for ensuring trust between peer STAs shown in FIG. 7 is for illustration only. Other embodiments of the example of a call flow 700 for ensuring trust between peer STAs could be used without departing from the scope of this disclosure.

[0095] According to some examples, another variation of the call flow illustrated in FIG. 6 can be such that after receiving the coex mode transition request from the first STA that identifies the second STA as the coex peer STA, the AP can first send the response to the first STA, and then send a verification request to the second STA and receive the verification response from the second STA. After successful coex transition request-response exchanges, the STA1's transitioning into the coex mode can be confirmed. After successful verification request-response exchanges, the second STA's transitioning into the coex mode can be confirmed and the first STA's coex indication authority on behalf of the second STA can also be confirmed. Upon receiving the verification response from the second STA, the AP can inform the first STA about whether the second STA's verification has been successful or not. The call flow corresponding to this embodiment is illustrated in FIG. 7.

[0096] FIG. 8 illustrates yet another example of a call flow 800 for ensuring trust between peer STAs according to an embodiment of the present disclosure. The embodiment of the example of a call flow 800 for ensuring trust between peer STAs shown in FIG. 8 is for illustration only. Other embodiments of the example of a call flow 800 for ensuring trust between peer STAs could be used without departing from the scope of this disclosure.

[0097] According to some examples, for the scenario where a first STA and a second STA have an expected P2P / Co-ex event, the first STA and the second STA can share their exclusive keys with each other. Such keys can be referred to as the Co-ex indication authentication key (CIAK). According to one embodiment the first STA and the second STA may also share their respective CIAK with the associated AP.

[0098] According to one embodiment, when the first STA intends to indicate the coex event on behalf of the second STA, the first STA can first send the second STA's CIAK to the AP by including the CIAK in the Co-ex Mode Transition Request frame that identifies the second STA. The AP can then match the second STA's CIAK received from the first STA and the second STA's CIAK received from the second STA. If they match, then the AP can confirm that the first STA is authorized to indicate the coex event on behalf of the second STA. After the authentication, the AP can then respond to the Co-ex Mode Transition Request frame to the first STA by sending a Co-ex Mode Transition Response frame to the first STA. The response frame may indicate whether the first STA's authority to indicate the coex event for the second STA is confirmed or not. The call flow corresponding to this embodiment is shown in FIG. 8.

[0099] FIG. 9 illustrates an example method 900 performed by the first STA in a wireless communication system according to an embodiment of the present disclosure. The method 900 of FIG. 9 can be performed by any of the STAs 111-114 of FIG. 1, such as the STA 111 of FIG. 3, and a corresponding method can be performed by any of the APs 102-103 of FIG. 1, such as AP 102 of FIG. 2. The method 900 is for illustration only and other embodiments can be used without departing from the scope of the present disclosure.

[0100] As illustrated in FIG. 9, the method 900 begins at step 902, where the first STA associated with an AP initiates a protocol between the first STA, a second STA, and the AP. The protocol may be associated with coexistence constraints for the first STA and coexistence constraints for the second STA. At step 904, the first STA indicates, to the AP, about the coexistence constraints for the first STA. At step 906, the first STA indicates, to the AP, about the coexistence constraints for the second STA on behalf of the second STA.

[0101] In some examples, the first STA has a mutual coexistence event scheduled with the second STA; and to initiate the protocol between the first STA, the second STA, and the AP, the first STA transmits a coexistence mode transition request to the AP that identifies the second STA as a coexistence peer STA of the first STA.

[0102] In some examples, the first STA receives a coexistence mode transition response from the AP, where the coexistence mode transition response: confirms a coexistence mode transition of the first STA, but does not confirm a coexistence mode transition of the second STA if the second STA does not approve the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA; or confirms the coexistence mode transition of the first STA, and also confirms the coexistence mode transition of the second STA if the second STA approves the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA; or does not confirm the coexistence mode transition of the first STA, and also does not confirm the coexistence mode transition of the second STA if the second STA does not approve the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA; or does not confirm the coexistence mode transition of the first STA, but confirm the coexistence mode transition of the second STA if the second STA approves the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA.

[0103] In some examples, the first STA receives a coexistence mode transition response from the AP, wherein the coexistence mode transition response: acknowledges the coexistence mode transition request; and confirms a coexistence mode transition of the first STA.

[0104] In some examples, the coexistence mode transition response further: confirms the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA; and confirms a coexistence mode transition of the second STA.

[0105] In some examples, the first STA has a mutual coexistence event scheduled with the second STA; and the first STA shares a coexistence indication authentication key of the second STA.

[0106] In some examples, the first STA transmits a coexistence mode transition request to the AP that identifies the second STA as a coexistence peer STA of the first STA, wherein the coexistence mode transition request includes the coexistence indication authentication key of the second STA; and receives a coexistence mode transition response from the AP based on the coexistence indication authentication key of the second STA, wherein the coexistence mode transition response: confirms a coexistence mode transition of the first STA; confirms the first STA to indicate the coexistence constraints for the second STA on behalf of the second STA; and confirms a coexistence mode transition of the second STA.

[0107] The flowcharts herein illustrate example methods or processes that can be implemented in accordance with the principles of the present disclosure and various changes could be made to the methods or processes illustrated in the flowcharts.　For example, while shown as a series of steps, various steps could overlap, occur in parallel, occur in a different order, or occur multiple times. In another example, steps may be omitted or replaced by other steps.

[0108] Various embodiments as set forth herein may be implemented as software (e.g., the program) including one or more instructions that are stored in a storage medium (e.g., memory 229, 260) that is readable by a machine (e.g., the AP 101, the station 111). For example, a processor (e.g., the processor 224, 240) of the machine (e.g., the AP 101, the station 111) may invoke at least one of the one or more instructions stored in the storage medium and execute it. This allows the machine to be operated to perform at least one function according to the at least one instruction invoked. The one or more instructions may include code generated by a compiler or code executable by an interpreter. The machine-readable storage medium may be provided in the form of a non-transitory storage medium. Here, the "non-transitory" storage medium is a tangible device, and may not include a signal (e.g., an electromagnetic wave), but this term does not differentiate between where data is semi-permanently stored in the storage medium and where the data is temporarily stored in the storage medium.

[0109] According to various an embodiment of the present disclosure, a method described herein may be included and provided in a computer program product. The computer program product may be traded as a product between a seller and a buyer. The computer program product may be distributed in the form of a machine-readable storage medium (e.g., a compact disc read-only memory (CD-ROM)), or be distributed (e.g., downloaded or uploaded) online via an application store, or between two user devices (e.g., smartphones) directly. If distributed online, at least part of the computer program product may be temporarily generated or at least temporarily stored in the machine-readable storage medium, such as a memory of the manufacturer's server, a server of the application store, or a relay server.

[0110] According to various embodiments, each component (e.g., a module or a program) of the above-described components may include a single entity or multiple entities, and some of the multiple entities may be separately disposed in different components. According to various embodiments, one or more of the above-described components may be omitted, or one or more other components may be added. Alternatively or additionally, a plurality of components (e.g., modules or programs) may be integrated into a single component. In such a case, according to various embodiments, the integrated component may still perform one or more functions of each of the plurality of components in the same or similar manner as they are performed by a corresponding one of the plurality of components before the integration. According to various embodiments, operations performed by the module, the program, or another component may be carried out sequentially, in parallel, repeatedly, or heuristically, or one or more of the operations may be executed in a different order or omitted, or one or more other operations may be added.

[0111] The embodiments described herein may be implemented using hardware components, software components and / or combinations thereof. A processing device may be implemented using one or more general-purpose or special purpose computers, such as, for example, a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable gate array (FPGA), a programmable logic unit (PLU), a microprocessor, or any other device capable of responding to and executing instructions in a defined manner. The processing device may run an operating system (OS) and one or more software applications that run on the OS. The processing device also may access, store, manipulate, process, and create data in response to execution of the software. For the purpose of simplicity, the description of a processing device is used as singular; however, one skilled in the art will appreciate that a processing device may include multiple processing elements and multiple types of processing elements. For example, a processing device may include multiple processors or a processor and a controller. In addition, different processing configurations are possible, such as parallel processors.

[0112] The software may include a computer program, a piece of code, an instruction, or some combination thereof, to independently or collectively instruct and / or configure the processing device to operate as desired. The software and / or data may be embodied permanently or temporarily in any type of machine, component, physical or virtual equipment, computer storage medium or device, or in a propagated signal wave capable of providing instructions or data to or being interpreted by the processing device. The software also may be distributed over network-coupled computing systems so that the software is stored and executed in a distributed fashion. The software and data may be stored by one or more non-transitory computer-readable recording mediums.

[0113] The methods according to the embodiments described above may be recorded in non-transitory computer-readable media including program instructions to implement various operations of the above-described examples. The media may also include, alone or in combination with the program instructions, data files, data structures, and the like. The program instructions recorded in the media may be specially designed and constructed for the purposes of examples, or they may be of the kind well-known and available to a person of ordinary skill in the computer software arts. Examples of non-transitory computer-readable media include magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROM discs, DVDs, and / or Blue-ray discs; magneto-optical media such as optical discs; and hardware devices that are specially configured to store and perform program instructions, such as ROM, RAM, flash memory (e.g., USB flash drives, memory cards, memory sticks, etc.), and the like. Examples of program instructions include both machine code, such as produced by a compiler, and files containing higher-level code that may be executed by the computer using an interpreter.

[0114] Although the present disclosure has been described with an exemplary embodiment, various changes and modifications may be suggested to one skilled in the art. It is intended that the present disclosure encompasses such changes and modifications as fall within the scope of the appended claims. None of the description in this application should be read as implying that any particular element, step, or function is an essential element that must be included in the claims scope. The scope of patented subject matter is defined by the claims.

Claims

1.A first station (STA) (111), comprising:at least one processor (340) including processing circuitry; andmemory (360) storing instructions that, when executed by the at least one processor (340) individually or collectively, cause the first STA (111) to:initiate a protocol between the first STA (111), a second STA, and an access point (AP) (102) associated with the first STA (111), the protocol associated with coexistence constraints for the first STA (111) and coexistence constraints for the second STA;generate an indication about the coexistence constraints for the first STA (111); andgenerate an indication about the coexistence constraints for the second STA on behalf of the second STA.2.The first STA of Claim 2, wherein:the first STA (111) has a mutual coexistence event scheduled with the second STA; andto initiate the protocol between the first STA (111), the second STA, and the AP (102), the instructions, when executed by the at least one processor (340) individually or collectively, further cause the first STA (111) to generate a coexistence mode transition request to the AP (102) that identifies the second STA as a coexistence peer STA of the first STA (111).3.The first STA of Claim 2, wherein:the instructions, when executed by the at least one processor (340) individually or collectively, further cause the first STA (111) to receive a coexistence mode transition response from the AP (102); andthe coexistence mode transition response:confirms a coexistence mode transition of the first STA (111), but does not confirm a coexistence mode transition of the second STA if the second STA does not approve the first STA (111) to indicate the coexistence constraints for the second STA on behalf of the second STA; orconfirms the coexistence mode transition of the first STA (111), and also confirms the coexistence mode transition of the second STA if the second STA approves the first STA (111) to indicate the coexistence constraints for the second STA on behalf of the second STA; ordoes not confirm the coexistence mode transition of the first STA (111), and also does not confirm the coexistence mode transition of the second STA if the second STA does not approve the first STA (111) to indicate the coexistence constraints for the second STA on behalf of the second STA; ordoes not confirm the coexistence mode transition of the first STA (111), but confirm the coexistence mode transition of the second STA if the second STA approves the first STA (111) to indicate the coexistence constraints for the second STA on behalf of the second STA.4.The first STA of Claim 2 or Claim 3Claim , wherein:the instructions, when executed by the at least one processor (340) individually or collectively, further cause the first STA (111) to receive a coexistence mode transition response from the AP (102); andthe coexistence mode transition response:acknowledges the coexistence mode transition request; andconfirms a coexistence mode transition of the first STA (111).5.The first STA of Claim 4, wherein the coexistence mode transition response further:confirms the first STA (111) to indicate the coexistence constraints for the second STA on behalf of the second STA; andconfirms a coexistence mode transition of the second STA.6.The first STA of any one of the preceding claims, wherein:the first STA (111) has a mutual coexistence event scheduled with the second STA; andthe instructions, when executed by the at least one processor (340) individually or collectively, further cause the first STA (111) to share a coexistence indication authentication key of the second STA.7.The first STA of Claim 6, wherein to initiate the protocol between the first STA (111), the second STA, and the AP (102), the instructions, when executed by the at least one processor (340) individually or collectively, further cause the first STA (111) to:transmit a coexistence mode transition request to the AP (102) that identifies the second STA as a coexistence peer STA of the first STA (111), wherein the coexistence mode transition request includes the coexistence indication authentication key of the second STA; andreceive a coexistence mode transition response from the AP (102) based on the coexistence indication authentication key of the second STA, wherein the coexistence mode transition response:confirms a coexistence mode transition of the first STA (111);confirms the first STA (111) to indicate the coexistence constraints for the second STA on behalf of the second STA; andconfirms a coexistence mode transition of the second STA.8.An access point (AP) (102), comprising:at least one processor (225) including processing circuitry; andmemory (230) storing instructions that, when executed by the at least one processor (225) individually or collectively, cause the AP (102) to:receive, from a first station (STA) (111) associated with the AP (102), information associated with initiating a protocol between the first STA (111), a second STA, and the AP (102), the protocol associated with coexistence constraints for the first STA (111) and coexistence constraints for the second STA;receive an indication from the first STA (111) about the coexistence constraints for the first STA (111);receive an indication from the first STA (111) about the coexistence constraints for the second STA on behalf of the second STA; andtransmit, to the first STA (111), signals associated with the protocol.9.The AP of Claim 8, wherein:the instructions, when executed by the at least one processor (225) individually or collectively, further cause the AP (102) to identify that the first STA (111) has a mutual coexistence event scheduled with the second STA; andthe instructions, when executed by the at least one processor (225) individually or collectively, further cause the AP (102) to receive, from the first STA (111), a coexistence mode transition request that identifies the second STA as a coexistence peer STA of the first STA (111).10.The AP of Claim 9, wherein:the instructions, when executed by the at least one processor (225) individually or collectively, further cause the AP (102) to transmit a coexistence mode transition response to the first STA (111); andthe coexistence mode transition response:confirms a coexistence mode transition of the first STA (111), but does not confirm a coexistence mode transition of the second STA if the second STA does not approve the first STA (111) to indicate the coexistence constraints for the second STA on behalf of the second STA; orconfirms the coexistence mode transition of the first STA (111), and also confirms the coexistence mode transition of the second STA if the second STA approves the first STA (111) to indicate the coexistence constraints for the second STA on behalf of the second STA; ordoes not confirm the coexistence mode transition of the first STA (111), and also does not confirm the coexistence mode transition of the second STA if the second STA does not approve the first STA (111) to indicate the coexistence constraints for the second STA on behalf of the second STA; ordoes not confirm the coexistence mode transition of the first STA (111), but confirm the coexistence mode transition of the second STA if the second STA approves the first STA (111) to indicate the coexistence constraints for the second STA on behalf of the second STA.11.The AP of Claim 9 or claim 10, wherein:the instructions, when executed by the at least one processor (225) individually or collectively, further cause the AP (102) to transmit a coexistence mode transition response to the first STA (111); andthe coexistence mode transition response:acknowledges the coexistence mode transition request; andconfirms a coexistence mode transition of the first STA (111).12.The AP of Claim 11, wherein the coexistence mode transition response further:confirms the first STA (111) to indicate the coexistence constraints for the second STA on behalf of the second STA; andconfirms a coexistence mode transition of the second STA.13.The AP of any one of Claims 8 to 12, wherein:the instructions, when executed by the at least one processor (225) individually or collectively, further cause the AP (102) to identify that the first STA (111) has a mutual coexistence event scheduled with the second STA; andthe instructions, when executed by the at least one processor (225) individually or collectively, further cause the AP (102) to:receive a shared coexistence indication authentication key of the second STA;receive a coexistence mode transition request that identifies the second STA as a coexistence peer STA of the first STA (111), wherein the coexistence mode transition request includes the coexistence indication authentication key of the second STA; andtransmit, to the first STA (111), a coexistence mode transition response based on the coexistence indication authentication key of the second STA, wherein the coexistence mode transition response:confirms a coexistence mode transition of the first STA (111);confirms the first STA (111) to indicate the coexistence constraints for the second STA on behalf of the second STA; andconfirms a coexistence mode transition of the second STA.14.A computer-implemented method of wireless communication performed by a first station (STA) (111) associated with an access point (AP) (102), the method comprising:initiating a protocol between the first STA (111), a second STA, and the AP (102), the protocol associated with coexistence constraints for the first STA (111) and coexistence constraints for the second STA;indicating, to the AP (102), about the coexistence constraints for the first STA (111); andindicating, to the AP (102), about the coexistence constraints for the second STA on behalf of the second STA.15.The method of Claim 14, wherein:the first STA (111) has a mutual coexistence event scheduled with the second STA; andthe initiating the protocol between the first STA (111), the second STA, and the AP (102) comprises transmitting a coexistence mode transition request to the AP (102) that identifies the second STA as a coexistence peer STA of the first STA (111).

Images