Coexistence management in wireless networks

Abstract

A station (STA) in a wireless network. The STA has a memory; and a processor coupled to the memory. The STA sends a frame to an access point (AP) indicating an upcoming coexistence event schedule. The STA performs peer-to-peer communication with one or more peer STAs during the upcoming coexistence event schedule.

Description

Technical Field

[0001] This disclosure generally relates to wireless communication systems, and more specifically to peer-to-peer communication, such as, but not limited to, wireless networks. Background Technology

[0002] Since the late 1990s, Wireless Local Area Network (WLAN) technology has evolved towards increasing data rates and continues to grow in various markets such as homes, businesses, and hotspots. WLAN allows devices to access the Internet in the 2.4 GHz, 5 GHz, 6 GHz, or 60 GHz frequency bands. WLAN is based on the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard. The IEEE 802.11 series of standards aims to improve speed and reliability and extend the operational range of wireless networks.

[0003] WLAN devices increasingly need to support a variety of latency-sensitive or real-time applications, such as augmented reality (AR), robotics, artificial intelligence (AI), cloud computing, and autonomous vehicles. To achieve the extremely low latency and extremely high throughput required for such applications, Multi-Link Operation (MLO) has been proposed for WLANs. A WLAN is formed by WLAN devices within a limited area such as a home, school, apartment, or office building. Each WLAN device can have one or more Stations (STAs), such as Access Point (AP) STAs and Non-Access Point (Non-AP) STAs.

[0004] MLO enables non-AP multi-link devices (MLDs) to establish multiple links with AP MLDs. Each of these links can independently enable channel access and frame switching between the non-AP MLD and the AP MLD, which can reduce latency and increase throughput.

[0005] The descriptions set forth in the Background section should not be assumed to be prior art simply because they are set forth in the Background section. The Background section may describe aspects or embodiments of this disclosure. Summary of the Invention

[0006] This disclosure may relate to improvements to wireless communication systems, and more specifically, to mechanisms and protocols by which a providing station (STA) notifies an access point (AP) of coexistence events of next-generation WLAN devices.

[0007] One aspect of this disclosure provides a STA in a wireless network. The STA includes at least one processor, which includes processing circuitry. The STA includes a memory storing instructions that, when executed individually or jointly by the at least one processor, cause the STA to send a frame to an AP indicating an upcoming coexistence event scheduling. The instructions, when executed individually or jointly by the at least one processor, also cause the STA to perform peer-to-peer communication with one or more peer STAs during the upcoming coexistence event scheduling.

[0008] In some examples, the frame indicates that the STA is not available for communication with the AP during an upcoming coexistence event scheduling.

[0009] In some examples, when the instruction is executed individually or jointly by at least one processor, it also causes the STA to perform communication with the AP after sending a frame, wherein the communication with the AP ends before the start of an upcoming coexistence event scheduling.

[0010] In some examples, the frame includes a TWT element that indicates one or more Target Wake Time (TWT) service periods.

[0011] In some examples, the frame includes information indicating the duration for which an upcoming coexistence schedule will remain valid.

[0012] In some examples, the frame includes information associated with one or more peer STAs.

[0013] In some examples, the frame indicates information associated with the identity, characteristics, or capabilities of one or more peer STAs.

[0014] In some examples, when executed individually or jointly by at least one processor, the instruction also causes the STA to receive a control frame from the AP indicating the duration of a transmission opportunity (TXOP). When executed individually or jointly by at least one processor, the instruction also causes the STA to send a frame in response to the control frame, wherein the frame indicates a time period associated with an upcoming coexistence event scheduling during which the STA is unavailable.

[0015] One aspect of this disclosure provides an access point (AP) in a wireless network. The AP includes at least one processor that includes processing circuitry. The AP includes a memory storing instructions that, when executed individually or jointly by the at least one processor, cause the AP to receive a frame from a standby node (STA) indicating an upcoming coexistence event scheduling. The instructions, when executed individually or jointly by the at least one processor, also cause the AP to abstain from communication with the STA during the upcoming coexistence event scheduling.

[0016] In some examples, the frame indicates that the STA is not available for communication with the AP during an upcoming coexistence event scheduling.

[0017] In some examples, when executed individually or jointly by at least one processor, the instruction also causes the AP to initiate communication with the STA after receiving a frame. When executed individually or jointly by at least one processor, the instruction also causes the AP to terminate communication with the STA before the start of an upcoming coexistence event scheduling.

[0018] In some examples, the frame includes a TWT element indicating one or more TWT service periods.

[0019] In some examples, the frame includes information indicating the duration for which an upcoming coexistence schedule will remain valid.

[0020] In some examples, the frame includes information associated with one or more peer STAs, wherein the one or more peer STAs perform communication with the STA during an upcoming coexistence scheduling event. The instruction, when executed individually or jointly by at least one processor, also causes the AP to avoid performing communication with one or more peer STAs during an upcoming coexistence event scheduling event.

[0021] In some examples, the frame indicates information associated with the identity, characteristics, or capabilities of one or more peer STAs.

[0022] In some examples, when executed individually or jointly by at least one processor, the instruction also causes the AP to send a control frame to the STA indicating the duration of the TXOP. When executed individually or jointly by at least one processor, the instruction also causes the AP to receive a frame in response to the control frame, wherein the frame indicates a time period associated with an upcoming coexistence event scheduling during which the STA is unavailable.

[0023] One aspect of this disclosure provides a method performed by a STA. The method includes sending a frame to an AP indicating an upcoming coexistence event scheduling. The method also includes performing peer-to-peer communication with one or more peer STAs during the upcoming coexistence event scheduling.

[0024] In some examples, the frame indicates that the STA is not available for communication with the AP during an upcoming coexistence event scheduling.

[0025] In some examples, the method further includes performing communication with the AP after the frame is sent. Communication with the AP ends before the upcoming coexistence event scheduling begins.

[0026] In some examples, the frame includes a TWT element indicating one or more TWT service periods.

[0027] In some examples, the frame includes information indicating the duration for which an upcoming coexistence schedule will remain valid.

[0028] In some examples, the frame includes information associated with one or more peer STAs.

[0029] In some examples, the frame indicates information associated with the identity, characteristics, or capabilities of one or more peer STAs.

[0030] In some examples, when executed individually or jointly by at least one processor, the instruction also causes the AP to receive a control frame from the AP indicating the duration of a transmission opportunity (TXOP). When executed individually or jointly by at least one processor, the instruction also causes the AP to send a frame in response to the control frame, wherein the frame indicates a time period associated with an upcoming coexistence event scheduling during which the STA is unavailable.

[0031] One aspect of this disclosure provides a method performed by an AP. The method includes a slave station (STA) receiving a frame indicating an upcoming coexistence event scheduling. The method also includes avoiding communication with the STA during the upcoming coexistence event scheduling.

[0032] In some examples, the frame indicates that the STA is not available for communication with the AP during an upcoming coexistence event scheduling.

[0033] In some examples, the method also includes performing communication with the STA after receiving a frame. The method also includes terminating communication with the STA before the start of an upcoming coexistence event scheduling.

[0034] In some examples, the frame includes a TWT element that indicates one or more Target Wake Time (TWT) service periods.

[0035] In some examples, the frame includes information indicating the duration for which an upcoming coexistence schedule will remain valid.

[0036] In some examples, the frame includes information associated with one or more peer STAs. One or more peer STAs perform communication with the STA during an upcoming coexistence schedule. The method also includes avoiding communication with one or more peer STAs during an upcoming coexistence event schedule.

[0037] In some examples, the frame indicates information associated with the identity, characteristics, or capabilities of one or more peer STAs.

[0038] In some examples, the method also includes sending a control frame to the STA indicating the duration of a transmission opportunity (TXOP). The method also includes receiving a frame in response to the control frame, wherein the frame indicates a time period associated with an upcoming coexistence event scheduling during which the STA is unavailable. Attached Figure Description

[0039] Figure 1 An example of a wireless network according to an embodiment is shown.

[0040] Figure 2a An example of an AP according to an embodiment is shown.

[0041] Figure 2b An example of a STA according to an embodiment is shown.

[0042] Figure 3 An example of multi-link communication operation according to an embodiment is shown.

[0043] Figure 4 An example network according to an embodiment is shown.

[0044] Figure 5 An example indication of a coexistence event according to an embodiment is shown.

[0045] Figure 6 Another example indication of a coexistence event according to an embodiment is shown.

[0046] Figure 7 Another example indication of a coexistence event according to an embodiment is shown.

[0047] Figure 8 An example of coexistence event management according to an embodiment is shown.

[0048] Figure 9 An example of coexistence event management according to an embodiment is shown.

[0049] Figure 10 An example process for managing coexistence events according to an embodiment is shown.

[0050] Figure 11 An example process for managing coexistence events according to an embodiment is shown.

[0051] In one or more embodiments, not all components depicted in each figure are necessary, and one or more embodiments may include additional components not shown in the figures. Variations in the arrangement and type of components may be made without departing from the scope of this subject matter disclosure. Additional components, different components, or fewer components may be utilized within the scope of this subject matter disclosure. Detailed Implementation

[0052] The detailed description set forth below in conjunction with the accompanying drawings is intended to describe various embodiments and is not intended to represent the only embodiments in which the subject matter can be practiced. Rather, this detailed description includes specific details to provide a thorough understanding of the subject matter of the invention. As those skilled in the art will recognize, the described embodiments can be modified in various ways without departing from the scope of this disclosure. Therefore, the drawings and description are to be considered illustrative rather than restrictive in nature. The same reference numerals denote the same elements.

[0053] This disclosure relates to wireless communication systems, and more specifically, to wireless local area network (WLAN) technology. WLAN allows devices to access the Internet in the 2.4 GHz, 5 GHz, 6 GHz, or 60 GHz frequency bands. WLAN is based on the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard. The IEEE 802.11 series of standards is designed to improve speed and reliability and extend the operational range of wireless networks.

[0054] The demand for wireless data services is rapidly increasing due to the growing popularity of smartphones and other mobile data devices (such as tablets, notepad computers, netbooks, e-book readers, and machine-type devices) among consumers and businesses. To address the ever-increasing bandwidth requirements of wireless communication systems, various solutions are being developed to allow multiple user terminals to communicate with a single access point while sharing channel resources, achieving high data throughput. Multiple-input multiple-output (MIMO) technology represents one such approach and has become a popular technology. MIMO has been adopted in several wireless communication standards such as 802.11ac and 802.11ax.

[0055] Before proceeding with the detailed description below, it may be advantageous to define certain words and phrases used throughout this patent document. The term “coupled” and its derivatives refer to any direct or indirect communication between two or more elements, regardless of whether these elements are physically in contact with each other. The terms “transmit,” “receive,” and “communicate,” and their derivatives include both direct and indirect communication. The terms “comprising” and “including,” and their derivatives, mean including but not limited to. The term “or” is inclusive, meaning and / or. The phrase “associated with,” and its derivatives, mean including, being included in, interconnected with, containing, being contained within, connected to or connected to, coupled to or coupled with, able to communicate with, cooperate with, interleaved, juxtaposed, proximate, bound to or bound to, having, possessing the properties of, having a relationship to or with, etc. 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, local or remote. When used with a list of items, the phrase "at least one" means that different combinations of one or more of the listed items may be used, and it may be necessary to use only one item from the list. 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.

[0056] Furthermore, the various functions described below can be implemented or supported by one or more computer programs, each computer program being formed by 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, instruction sets, procedures, functions, objects, classes, instances, associated data, or portions thereof suitable for implementation in appropriate 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 accessible by a computer, such as read-only memory (ROM), random access memory (RAM), hard disk drive, optical disc (CD), digital video disc (DVD), or any other type of storage. "Non-transitory" computer-readable media does not include wired, wireless, optical, or other communication links that transmit transient electrical or other signals. Non-transitory computer-readable media includes media in which data can be permanently stored and media in which data can be stored and later rewritten, such as rewritable optical discs or erasable memory devices.

[0057] Definitions of certain other words and phrases are provided throughout this patent document. Those skilled in the art will understand that, in many cases (if not most), such definitions apply to the prior and future use of the words and phrases defined in this way.

[0058] The accompanying drawings and various embodiments used to describe the principles of this disclosure are for illustrative purposes only and should not be construed as limiting the scope of this disclosure in any way. Those skilled in the art will understand that the principles of this disclosure can be implemented in any suitably arranged system or device.

[0059] Figure 1 An example wireless network 100 according to this disclosure is shown. Figure 1 The embodiment of the wireless network 100 shown is for illustrative purposes only. Other embodiments of the wireless network 100 may be used without departing from the scope of this disclosure.

[0060] like Figure 1 As shown, the wireless network 100 includes access points (APs) 101 and 103. 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. AP 101 provides wireless access to network 130 to multiple stations 111-114 within its coverage area 120. APs 101-103 can communicate with each other and with STAs 111-114 using WiFi or other WLAN communication technologies.

[0061] Depending on the network type, other well-known terms may be used instead of "access point" or "AP," such as "router" or "gateway." For convenience, the term "AP" is used in this patent document to refer to a network infrastructure component that provides wireless access to remote terminals. In a WLAN, assuming that the AP also contends for the wireless channel, the AP may also be referred to as a STA. Furthermore, 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 convenience, the terms "station" and "STA" are used in this patent document to refer to a remote wireless device 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 phone or smartphone) or is generally considered a fixed device (such as a desktop computer, AP, media player, fixed sensor, television, etc.).

[0062] exist Figure 1In the diagram, the dashed lines indicate the approximate extent of coverage areas 120 and 125. For illustrative and explanatory purposes only, coverage areas 120 and 125 are shown as approximately circular. It should be clearly understood that coverage areas associated with an AP (such as coverage areas 120 and 125) can have other shapes, including irregular shapes, depending on the AP's configuration and variations in the radio environment associated with natural and man-made obstacles.

[0063] As described in more detail below, one or more APs in an AP may include circuitry and / or programming for the management of MU-MIMO and OFDMA channel detection in a WLAN. Although Figure 1 An example of a wireless network 100 is shown, but more details can be found on other wireless networks. Figure 1 Various modifications can be made. For example, wireless network 100 can include any number of APs and any number of STAs in any suitable arrangement. Furthermore, AP 101 can communicate directly with any number of STAs and provide them with wireless broadband access to network 130. Similarly, each AP 101-103 can communicate directly with network 130 and provide STAs with direct wireless broadband access to network 130. Additionally, AP 101 and / or 103 can provide access to other or additional external networks, such as external telephone networks or other types of data networks.

[0064] Figure 2a Example AP 101 according to this disclosure is shown. Figure 2a The embodiment of AP 101 shown is for illustrative purposes only, and Figure 1 AP 103 can have the same or similar configurations. However, APs come in a wide variety of configurations, and Figure 2a This disclosure is not intended to limit the scope of any particular implementation of AP.

[0065] like Figure 2a As shown, AP 101 includes multiple antennas 204a-204n, multiple RF transceivers 209a-209n, transmit (TX) processing circuitry 214, and receive (RX) processing circuitry 219. AP 101 also includes a controller / processor 224, a memory 229, and a backhaul or network interface 234. RF transceivers 209a-209n receive incoming RF signals from antennas 204a-204n, such as signals transmitted by STAs in network 100. RF transceivers 209a-209n down-convert the incoming RF signals to generate IF or baseband signals. The IF or baseband signals are sent to RX processing circuitry 219, which generates processed baseband signals by filtering, decoding, and / or digitizing the baseband or IF signals. RX processing circuitry 219 sends the processed baseband signals to controller / processor 224 for further processing.

[0066] TX processing circuit 214 receives analog or digital data (such as voice data, network data, email, or interactive video game data) from controller / processor 224. TX processing circuit 214 encodes, multiplexes, and / or digitizes the outgoing baseband data to generate a processed baseband or IF signal. RF transceivers 209a-209n receive the outgoing processed baseband or IF signal from TX processing circuit 214 and up-convert the baseband or IF signal into an RF signal transmitted via antennas 204a-204n.

[0067] [delete]

[0068] The controller / processor 224 may include one or more processors or other processing devices that control the overall operation of the AP 101. The controller / processor 224 may include processing circuitry. For example, the controller / processor 224 may control the reception of forward channel signals and the transmission of reverse channel signals by the RF transceivers 209a-209n, the RX processing circuitry 219, and the TX processing circuitry 214, according to well-known principles. The controller / processor 224 may also support additional functions, such as more advanced wireless communication capabilities.

[0069] For example, controller / processor 224 can support beamforming or directional routing operations, where outgoing signals from multiple antennas 204a-204n are weighted differently to effectively guide the outgoing signals to the desired direction. Controller / processor 224 can also support OFDMA operations, where outgoing signals are assigned to different subsets of subcarriers for different receivers (e.g., different STAs 111-114). Controller / processor 224 can support various other functions in AP 101, including combining DL MU-MIMO and OFDMA in the same transmission opportunity. In some examples, controller / processor 224 includes at least one microprocessor or microcontroller. Controller / processor 224 is also capable of executing programs and other processes, such as an operating system, residing in memory 229. Controller / processor 224 can move data into or out of memory 229 as needed for the execution process.

[0070] The controller / processor 224 is also coupled to a backhaul or network interface 234. The backhaul or network interface 234 allows the AP 101 to communicate with other devices or systems via a backhaul connection or over a network. Interface 234 can support communication via any suitable wired or wireless connection. For example, interface 234 can allow the AP 101 to communicate with a larger network (such as the Internet) via a wired or wireless local area network or via a wired or wireless connection. Interface 234 includes any suitable architecture supporting communication via a wired or wireless connection, such as an Ethernet or RF transceiver. Memory 229 is coupled to the controller / processor 224. A portion of memory 229 may include RAM, and another portion of memory 229 may include flash memory or other ROM.

[0071] As described in more detail below, AP 101 may include circuitry and / or procedures for managing the channel detection process in a WLAN. Although Figure 2a An example of AP 101 is shown, but it is possible to compare it with other versions. Figure 2a Various changes can be made. For example, AP101 can include any number of... Figure 2a Each component shown. As a specific example, an access point may include multiple interfaces 234, and the controller / processor 224 may support routing functionality to route data between different network addresses. As another specific example, although shown as a single instance including TX processing circuitry 214 and a single instance including RX processing circuitry 219, AP 101 may include multiple instances of each (such as one per RF transceiver). Alternatively, only one antenna and RF transceiver path may be included, as in a conventional AP. Moreover, Figure 2a The various components can be combined, further subdivided, or omitted, and additional components can be added as needed.

[0072] Figure 2b Example STA 111 according to this disclosure is shown. Figure 2b The embodiment of STA 111 shown is for illustrative purposes only, and Figure 1 STAs 111-115 can have the same or similar configurations. However, STAs appear in a wide variety of configurations, and Figure 2b This disclosure is not intended to limit the scope of any particular implementation of STA.

[0073] like Figure 2bAs shown, STA 111 includes an antenna 205, a radio frequency (RF) transceiver 210, a TX processing circuit 215, a microphone 220, and a receive (RX) processing circuit 225. STA 111 also includes a speaker 230, a controller / processor 240, an input / output (I / O) interface (IF) 245, a touchscreen 250, a display 255, and a memory 260. The memory 260 includes an operating system (OS) 261 and one or more applications 262.

[0074] RF transceiver 210 receives incoming RF signals transmitted by the AP of network 100 from antenna 205. RF transceiver 210 down-converts the incoming RF signals to generate intermediate frequency (IF) or baseband signals. The IF or baseband signal is sent to RX processing circuitry 225, which generates a processed baseband signal by filtering, decoding, and / or digitizing the baseband or IF signal. RX processing circuitry 225 sends the processed baseband signal to speaker 230 (e.g., for voice data) or to controller / processor 240 for further processing (e.g., for web browsing data).

[0075] TX processing circuitry 215 receives analog or digital voice data from microphone 220, or other outgoing baseband data (such as web data, email, or interactive video game data) from controller / processor 240. TX processing circuitry 215 encodes, multiplexes, and / or digitizes the outgoing baseband data to generate a processed baseband or IF signal. RF transceiver 210 receives the outgoing processed baseband or IF signal from TX processing circuitry 215 and up-converts the baseband or IF signal into an RF signal transmitted via antenna 205.

[0076] The controller / processor 240 may include one or more processors and executes a basic OS program 261 stored in memory 260 to control the overall operation of STA 111. The controller / processor 240 may include processing circuitry. In one such operation, the main controller / processor 240 controls the reception of forward channel signals and the transmission of reverse channel signals by the RF transceiver 210, RX processing circuitry 225, and TX processing circuitry 215 according to well-known principles. The main controller / processor 240 may also include processing circuitry configured to provide management of the channel detection process in the WLAN. In some examples, the controller / processor 240 includes at least one microprocessor or microcontroller.

[0077] The controller / processor 240 is also capable of executing other processes and programs residing in the memory 260, such as operations for managing channel sensing processes in the WLAN. The controller / processor 240 can move data into or out of the memory 260 as needed for the execution of processes. In some examples, the controller / processor 240 is configured to execute multiple applications 262, such as applications for channel sensing, including feedback calculations based on received Null Data Packet Advertisements (NDPA) and Null Data Packets (NDP), and sending beamforming feedback reports in response to Triggered Frames (TF). The controller / processor 240 can operate the multiple applications 262 based on the OS program 261 or in response to signals received from the AP. The main controller / processor 240 is also coupled to an I / O interface 245, which provides the STA 111 with the ability to connect to other devices such as laptops and handheld computers. The I / O interface 245 is the communication path between these accessories and the main controller 240.

[0078] The controller / processor 240 is also coupled to the touchscreen 250 and the display 255. The operator of STA 111 can use the touchscreen 250 to input data into STA 111. The display 255 may be a liquid crystal display, a light-emitting diode display, or other display capable of displaying text and / or at least limited graphics (such as from a website). Memory 260 is coupled to the controller / processor 240. A portion of memory 260 may include random access memory (RAM), and another portion of memory 260 may include flash memory or other read-only memory (ROM).

[0079] although Figure 2b An example of STA 111 is shown, but it is possible to compare it with other models. Figure 2b Make various changes. For example, Figure 2b The various components can be combined, further subdivided, or omitted, and additional components can be added as needed. In a specific example, STA 111 may include any number of antennas 205 for MIMO communication with AP 101. In another example, STA 111 may not include voice communication, or the controller / processor 240 may be divided into multiple processors, such as one or more central processing units (CPUs) and one or more graphics processing units (GPUs). Furthermore, although... Figure 2b The STA 111 is shown configured as a mobile phone or smartphone, but the STA can be configured to operate as other types of mobile or fixed devices.

[0080] like Figure 2bAs shown, in some examples, STA 111 may be a non-AP MLD comprising multiple STAs 203A-203N. Each STA 203a-203n is attached to the non-AP MLD 111 and includes an antenna 205, an RF transceiver 210, a TX processing circuit 215, and an RX processing circuit 225. Each STA 203a-203n can independently communicate with the controller / processor 240 and other components of the non-AP MLD 111. Figure 2b It is shown that each STA 203a-203n has a separate antenna, but each STA 203a-203n can share antenna 205 without requiring a separate antenna. Each STA 203a-203n can represent the physical (PHY) layer and the lower media access control (MAC) layer.

[0081] Figure 3 An example of multi-link communication operation according to an embodiment is shown. Multi-link communication operation can be used in the IEEE 802.11be standard and any future revisions of the IEEE 802.11 standard. Figure 3 In the middle, AP MLD 310 can be Figure 1 Wireless communication devices 101 and 103, and non-AP MLD 220 can be Figure 1 One of the wireless communication devices 111-114 in the series.

[0082] like Figure 3 As shown, AP MLD 310 may include multiple auxiliary APs, such as AP 1, AP 2, and AP 3. Each auxiliary AP may include a PHY interface to the wireless medium (Link 1, Link 2, or Link 3). AP MLD 310 may include a single MAC Service Access Point (SAP) 318 through which the auxiliary APs of AP MLD 310 communicate with higher layers (Layer 3 or network layer). Each auxiliary AP of AP MLD 310 may have a different MAC address (lower-layer MAC address) than any other auxiliary AP of AP MLD 310. AP MLD 310 may have an MLD MAC address (upper-layer MAC address), and the auxiliary APs share a single MAC SAP 318 to Layer 3. Therefore, the auxiliary APs share a single IP address, and Layer 3 identifies AP MLD 310 by assigning a single IP address.

[0083] A non-AP MLD 320 may include multiple affiliated STAs, such as STA 1, STA 2, and STA 3. Each affiliated STA may include a PHY interface to the wireless medium (Link 1, Link 2, or Link 3). A non-AP MLD 320 may include a single MAC SAP 328, through which affiliated STAs communicate with higher layers (Layer 3 or network layer). Each affiliated STA of a non-AP MLD 320 may have a different MAC address (lower-layer MAC address) than any other affiliated STA of the non-AP MLD 320. A non-AP MLD 320 may have an MLD MAC address (upper-layer MAC address), and the affiliated STAs share the single MAC SAP 328 at Layer 3. Therefore, affiliated STAs share a single IP address, and Layer 3 identifies the non-AP MLD 320 by assigning this single IP address.

[0084] AP MLD 310 and non-AP MLD 320 can establish multiple links between their associated APs and STAs. In this example, AP 1 and STA 1 can establish Link 1, operating in the 2.4 GHz band. Similarly, AP 2 and STA 2 can establish Link 2, operating in the 5 GHz band, and AP 3 and STA 3 can establish Link 3, operating in the 6 GHz band. Each link can independently enable channel access and frame exchange between AP MLD 310 and non-AP MLD 320, which can increase data throughput and reduce latency. When associated with an AP MLD on a set of links (link establishment), each non-AP device is assigned a unique Association Identifier (AID).

[0085] The following documents are incorporated herein by reference in their entirety, as if fully set forth herein: i) IEEE 802.11-2020, “Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications”; ii) IEEE 802.11ax-2021, “Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications”; and iii) IEEE P802.11be / D3.0, “Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications”.

[0086] Figure 4 An example network according to an embodiment is shown. Figure 4 The network depicted is for illustrative and explanatory purposes. Figure 4 This disclosure is not intended to limit the scope to any particular implementation.

[0087] exist Figure 4 In this diagram, multiple STAs 410 can be non-AP STAs associated with AP 430, and multiple STAs 420 can be non-AP STAs not associated with AP 430. Furthermore, solid lines between STAs represent uplinks or downlinks to AP 430, while dashed lines between STAs represent direct links between STAs.

[0088] Some unmanaged traffic interfering with the AP 430's Basic Service Set (BSS) latency-sensitive services may originate from uplink (UL) / downlink (DL) or direct link communications within the infrastructure BSS managed by the AP 430. Some may be due to transmissions in adjacent infrastructure BSSs (overlapping basic service sets). Some may originate from adjacent independent BSSs or P2P networks.

[0089] Next-generation WLAN systems need to provide improved support for low-latency applications. Currently, it is commonly observed that many devices operating on the same network, such as... Figure 4As shown. Many of these devices may be latency-tolerant, but still compete for the same time and frequency resources as devices running low-latency applications. In some cases, the AP 430, acting as the network controller, may not have sufficient control over unregulated or unmanaged traffic that competes with low-latency traffic within the Infrastructure Basic Service Set (BSS). In some examples, the Infrastructure BSS is a BSS that includes the AP 430 and one or more non-AP STA410s, while a Standalone BSS is a BSS in which non-AP STA 420s communicate with each other without requiring a centralized AP. Some unregulated or unmanaged traffic that interferes with latency-sensitive traffic in the AP's BSS may originate from uplink, downlink, or direct link communications within the AP-managed Infrastructure BSS. Another source of interference could be transmissions from adjacent Infrastructure OBSSs (Overlapping Basic Service Sets), while other sources could be from adjacent Standalone BSSs or P2P networks. Therefore, next-generation WLAN systems need mechanisms to handle unmanaged traffic more effectively while prioritizing low-latency traffic in the network.

[0090] A STA may experience coexistence events while communicating with its associated AP. A coexistence event occurs when a STA is busy sending to or receiving from another STA. Typically, coexistence events are associated with peer-to-peer (P2P) communication with its counterpart STA. The result of a coexistence event is that the STA becomes busy and therefore unavailable to communicate with its associated AP. This creates a need for the STA to send this unavailability message to the associated AP. However, currently, there is no mechanism for a STA to notify the AP of a coexistence event between two P2P STAs.

[0091] This disclosure provides a mechanism for a STA to notify an AP of a coexistence event between two P2P STAs, which may be referred to as a Proxy Co-ex Indication (PCI) procedure. In some examples, a first STA may send a frame including an indication to the associated AP. This indication notifies the AP of an upcoming coexistence event involving the first STA. The coexistence event can occur between the first STA and a second STA. The second STA may be a peer STA of the first STA.

[0092] Figure 5 An example indication of a coexistence event according to an embodiment is shown. Figure 5 The examples depicted are for illustrative and explanatory purposes. Figure 5 This disclosure is not intended to limit the scope to any particular implementation.

[0093] refer to Figure 5The AP is associated with STA 1 and STA 2. STA 1 and STA 2 have a P2P link. STA 1 has P2P communication with STA 2, which is a peer STA, known as a co-exindication event. STA 1 sends a frame to the AP that includes a co-exindication. The co-exindication notifies the AP of the upcoming co-exindication event, letting the AP know that STA 1 and STA 2 are busy. A co-exindication event can occur between the first STA and the second STA, where the second STA is a peer STA of the first STA.

[0094] In some examples, the AP may assume that after receiving a frame from the STA indicating that the STA has an upcoming coexistence event involving the STA within a certain time period, the STA may be unavailable to communicate with the AP for that time period. In some examples, the AP may not send any frames to STAs from which it has already received frames indicating a coexistence event involving the STA, until that time period expires. In some examples, the AP may not expect to receive any frames from STAs from which it has already received frames indicating a coexistence event involving the STA, until that time period expires.

[0095] In some examples, the STA, acting as a TXOP holder, may send a frame to the associated AP to indicate a coexistence event. This frame may include an indication of a period of time during which the STA may not be available to communicate with the AP. In some examples, the frame may be a control frame or a management frame.

[0096] In some examples, the STA can act as a TXOP responder and send a first frame to the associated AP to indicate an upcoming coexistence event. The first frame may include information associated with the coexistence event, such as the duration of the coexistence event or other parameters related to it. The AP may send a second frame before receiving the first frame indicating the initial TXOP. The second frame may be a Request to Send (RTS). The first frame may be a Clear Send (CTS).

[0097] In some examples, the first STA may indicate to the AP information associated with an upcoming coexistence event between the first STA and the second STA (the first STA's peer STA). The information associated with the coexistence event may include information about the second STA, such as its identification information or other characteristics and capabilities. In some examples, both the first and second STAs may be associated with the AP. In some examples, the first STA may be associated with the AP, while the second STA may not be associated with the AP.

[0098] Figure 6 Another example indication of a coexistence event according to an embodiment is shown. Figure 6The examples depicted are for illustrative and explanatory purposes. Figure 6 This disclosure is not intended to limit the scope to any particular implementation.

[0099] refer to Figure 6 The AP is associated with STA 1 and STA 2. STA 1 and STA 2 have a P2P link. STA 1 has an upcoming P2P communication with STA 2, which is acting as a peer STA, i.e., a co-ex event. STA 1 sends a frame to the AP that includes a co-ex indication. The co-ex indication includes identification information associated with STA 2, which is acting as a co-ex peer STA (co-ex peer STA identifier). The co-ex indication informs the AP of the upcoming co-ex event, letting the AP know that STA 1 and STA 2 are busy.

[0100] In some examples, the first STA may include information about the time instance or duration of an upcoming coexistence event associated with the coexistence event between the first STA and the second STA in the frame indicating the coexistence event to the AP. The time instance or duration may indicate the start and end times of the coexistence event.

[0101] In some examples, the AP may assume that when the AP receives a frame from the first STA indicating a coexistence event, both the first and second STAs may be unavailable for a period of time, where the frame includes information associated with that period of time. This period of time is the duration or time instance in which the upcoming coexistence event will occur.

[0102] Figure 7 Another example indication of a coexistence event according to an embodiment is shown. Figure 7 The examples depicted are for illustrative and explanatory purposes. Figure 7 This disclosure is not intended to limit the scope to any particular implementation.

[0103] refer to Figure 7An AP is associated with STA 1 and STA 2. STA 1 and STA 2 have a P2P link. Based on the P2P communication between STA 1 and STA 2, STA 1 has an upcoming coexistence event with STA 2. The AP sends an RTS to STA 1 indicating the initial TXOP duration. In response, STA 1 sends a CTS to the AP including coexistence peer STA information. The coexistence peer STA information indicates that STA 1 and STA 2 have P2P communication with each other and may be busy, so the AP knows that STA 1 and STA 2 are unavailable. Subsequently, the AP and STA 1 perform communication with each other within the reduced TXOP based on the indication of the coexistence event. At time T1 and after the reduced TXOP, STA 1 and STA 2 begin performing P2P communication with each other (coexistence peer event). STA 1 and STA 2 complete their P2P communication at time T2. The AP knows that STA 1 and STA 2 are unavailable for the duration of the coexistence peer event.

[0104] In some examples, the AP may not send any frames to the first STA or the second STA during the indicated coexistence event period, where the AP has already received a frame from the first STA indicating the coexistence event, which includes information about the period of the coexistence event and information about the second STA (peer device).

[0105] In some examples, the AP may not expect to receive any frames (including acknowledgment frames and block acknowledgment frames) from the first STA or the second STA during the indicated coexistence event period, where the AP has already received a frame from the first STA indicating the coexistence event, which includes information about the period of the coexistence event and information about the second STA (peer device).

[0106] In some examples, the STA sends a frame to the AP indicating a coexistence event. This frame includes information about more than one second STA, with which the first STA must perform P2P communication during the upcoming coexistence event. The AP can assume, based on the frame indicating the coexistence event, that the first and second STAs may be busy and unavailable during the indicated coexistence event period.

[0107] In some examples, the STA can notify the AP of coexistence events, where the coexistence events are inherently periodic.

[0108] In some examples, the STA can notify the AP of periodic coexistence (multiple coexistence events of a periodic nature) by sending a channel usage request frame to the AP. The channel usage request frame may contain a target wake-up time (TWT) element, which can indicate the period during which coexistence events are expected to occur.

[0109] Figure 8 An example of coexistence event management according to an embodiment is shown. Figure 8 The examples depicted are for illustrative and explanatory purposes. Figure 8 This disclosure is not intended to limit the scope to any particular implementation.

[0110] refer to Figure 8 The AP is associated with STA 1. STA 1 engages in P2P communication with one or more second STAs during a time period, thus forming a periodic coexistence. STA 1 sends a channel usage request frame including a TWT element to the AP. In response, the AP sends a channel usage response frame including a TWT element to STA 1. Subsequently, the STA performs P2P communication during P2P TWT SP 1. After the time period, STA 1 performs P2P communication during P2P TWT SP 2.

[0111] In some examples, the AP can receive a P2P TWT establishment request from the STA. If the AP accepts a P2P TWT establishment request from the STA, the AP may not send any frames to the STA during the P2P TWT SP corresponding to the P2P TWT schedule.

[0112] In some examples, if a P2P TWT SP is imminent, the AP should end frame transmission to the STA, from which the AP has already accepted the P2P TWT establishment request.

[0113] In some examples, when a STA has a predictable coexistence event, the STA can notify the AP of the coexistence event. Such a coexistence event can be periodic in nature. The STA can notify the associated AP of periodic coexistence by sending a Channel Use Request frame to the AP. The Channel Use Request frame contains a TWT element, which indicates the period during which the coexistence event is expected to occur.

[0114] Figure 9 An example of coexistence event management according to an embodiment is shown. Figure 9 The examples depicted are for illustrative and explanatory purposes. Figure 9 This disclosure is not intended to limit the scope to any particular implementation.

[0115] refer to Figure 9The AP is associated with STA 1 and STA 2. STA 1 has P2P communication with STA 2 during the P2P TWT SP. The AP and STA have successfully exchanged Channel Use Request and Channel Use Response frames to establish the P2P TWT SP. The AP sends a frame (PPDU 1) to STA 1. In response, STA 1 sends a Block Acknowledgment (BA) 1 frame to the AP. Subsequently, STA 1 sends a frame (P2P PPDU 1) to STA 2 during the P2P TWT SP. In response, STA 2 sends a BA 2 frame to STA 1 during the P2P TWT SP. Subsequently, STA 1 sends a frame (P2P PPDU 2) to STA 2 during the P2P TWT SP. In response, STA 2 sends a BA 3 frame to STA 1 during the P2P TWT SP. After the P2P TWT SP ends, the AP sends a frame (PPDU 2) to STA 1. In response, STA 1 sends a BA 4 frame to the AP.

[0116] In some examples, if an AP accepts a peer-to-peer TWT establishment request from a non-AP STA, the AP may not send any frames to that non-AP STA during the P2P TWT SP corresponding to that P2P TWT schedule. If the AP is transmitting frames to a non-AP STA, and if a P2P TWT SP that the non-AP STA has already established is imminent, the AP should end frame transmission to the STA before the peer-to-peer TWT SP begins.

[0117] In some examples, the STA can indicate how long the P2P TWT schedule will remain valid when a P2P TWT SP is established. For example, the STA can indicate that the schedule is valid for 10 SPs.

[0118] In some examples, the STA can modify the parameters used for P2P TWT scheduling after it has been established. For example, the STA can use the TWT persistence parameter to modify the P2P TWT schedule.

[0119] Figure 10 An example process for managing coexistence events according to an embodiment is shown. Figure 10 The example processes depicted are for illustrative and explanatory purposes. Figure 10 This disclosure is not intended to limit the scope to any particular implementation.

[0120] refer to Figure 10 Process 1000 begins with operation 1001. In operation 1001, a coexistence event that is not expected to occur by the AP STA is about to happen.

[0121] In operation 1003, a non-AP STA sends a request frame to the AP indicating a coexistence event and the unavailability of the non-AP STA during that event. This request frame can be a P2P TWT request frame.

[0122] In operation 1005, the non-AP STA receives a response from the AP indicating that the AP accepts the request. The response frame can be made by sending a P2P TWT response frame.

[0123] In operation 1007, a non-AP STA becomes unusable for communicating with the AP and performs P2P communication or another operation with another device during the P2P TWT SP. A non-AP STA can perform operations with one or more other devices during the P2P TWT SP.

[0124] Figure 11 Another example process for managing coexistence events according to an embodiment is shown. Figure 11 The example processes depicted are for illustrative and explanatory purposes. Figure 11 This disclosure is not intended to limit the scope to any particular implementation.

[0125] refer to Figure 11 Process 1100 begins at operation 1101. In operation 1101, the AP receives a request frame from an associated non-AP STA indicating that the STA has an upcoming coexistence event, which may be a periodic event during which the STA may be unavailable to communicate with the AP. This frame may be a channel usage request frame. The request frame may also indicate one or more peer STAs that may also be unavailable to communicate with the AP due to the coexistence event.

[0126] In operation 1103, the AP sends a response frame to the non-AP STA, instructing the AP to accept the request. The response frame can be a channel usage response frame.

[0127] In operation 1105, the AP avoids transmissions to non-AP STAs during a period in which STAs indicated by non-AP STAs may have coexistence events.

[0128] This disclosure provides mechanisms and processes for sharing information in a wireless network, such as a STA instructing an AP on a coexistence event involving the STA, so that the AP knows the STA is busy and will not communicate with the STA during that time period.

[0129] Various descriptive boxes, units, modules, components, methods, operations, instructions, items, and algorithms can be implemented or executed using processing circuitry.

[0130] Unless otherwise specified, references to elements in the singular form are not intended to indicate one and only one, but rather one or more. For example, a module “a” can refer to one or more modules. Without further constraints, elements preceded by “a”, “an”, “the”, or “said” do not preclude the presence of additional identical elements.

[0131] Titles and subtitles (if any) are used for convenience only and do not limit the technical scope of this subject matter. The term "exemplary" is used to indicate that it is used as an example or illustration. Within the scope of the use of terms such as "include," "have," "carry," "contain," etc., such terms are intended to be inclusive and have a meaning similar to that of the term "comprise" when used as a transitional word in the claims. Relational terms such as "first" and "second" can be used to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between these entities or actions.

[0132] Phrases such as aspect, that aspect, on the other hand, some aspects, one or more aspects, implementation, that implementation, another implementation, some implementations, one or more implementations, embodiment, that embodiment, another embodiment, some embodiments, one or more embodiments, configuration, that configuration, another configuration, some configurations, one or more configurations, subject matter, disclosure, this disclosure, other variations thereof, etc., are used for convenience and do not imply that disclosures associated with such phrases are essential to the subject matter, or that such disclosures apply to all configurations of the subject matter. Disclosures associated with such phrases may apply to all configurations or one or more configurations. Disclosures associated with such phrases may provide one or more examples. Phrases such as aspect or some aspects may refer to one or more aspects, and vice versa, and this similarly applies to other foregoing phrases.

[0133] The phrase "at least one" preceding a series of items, separated by the terms "and" or "or," modifies the entire list, rather than each individual member of the list. The phrase "at least one of..." does not require the selection of at least one item; rather, it allows for the inclusion of at least one of any one item, and / or at least one of any combination of items, and / or at least one of each item. For example, each of the phrases "at least one of A, B, and C" or "at least one of A, B, or C" refers to only A, only B, or only C; any combination of A, B, and C; and / or at least one of each of A, B, and C.

[0134] It should be understood that the specific order or hierarchy of the disclosed steps, operations, or processes is an illustration of exemplary methods. Unless otherwise explicitly stated, it should be understood that the specific order or hierarchy of steps, operations, or processes may be performed in a different order. Some steps, operations, or processes may be performed simultaneously, or may be performed as part of one or more other steps, operations, or processes. The appended method claims (if any) present elements of various steps, operations, or processes in an exemplary order, but this does not imply limitation to the specific order or hierarchy presented. These may be performed serially, linearly, in parallel, or in different orders. It should be understood that the described instructions, operations, and systems can generally be integrated together in a single software / hardware product or packaged into multiple software / hardware products.

[0135] This disclosure is provided to enable any person skilled in the art to practice the various aspects described herein. In some cases, well-known structures and components are shown in block diagram form to avoid obscuring the concept of the subject matter. This disclosure provides various examples of the subject matter, and the subject matter is not limited to these examples. Various modifications to these aspects will be apparent to those skilled in the art, and the principles described herein can be applied to other aspects.

[0136] All structural and functional equivalents of the elements described in various aspects of this disclosure that are known to a person skilled in the art or subsequently known are expressly incorporated herein by reference and are intended to be covered by the claims. Furthermore, nothing disclosed herein is intended to be offered to the public, whether or not such disclosure is explicitly recited in the claims. No claim element should be interpreted in accordance with paragraph 6 of 35 USC § 112 unless the element is explicitly described using the phrase “means for” or, in the case of a method claim, using the phrase “step for”.

[0137] The title, background information, description of the drawings, abstract, and figures are incorporated herein by reference and are provided as illustrative examples rather than as limiting descriptions. It should be understood at the time of filing that they are not intended to limit the scope or meaning of the claims. Furthermore, in the detailed description, the description may provide illustrative examples, and various features may be combined in various embodiments for the purpose of simplifying the disclosure. The approach of this disclosure should not be construed as reflecting an intention to require more features than expressly recited in each claim. Rather, as reflected in the following claims, the inventive subject matter lies in all features of fewer than those in a single disclosure configuration or operation. The appended claims are incorporated herein by reference, wherein each claim is independently claimed as a separate subject matter.

[0138] The embodiments are provided merely as examples for understanding the invention. They are not intended and should not be construed as limiting the scope of the invention in any way. Although certain embodiments and examples have been provided, those skilled in the art will understand from the disclosure herein that changes can be made to the illustrated embodiments and examples without departing from the scope of the invention.

[0139] The claims are not intended to be limited to the aspects described herein, but should be given the full scope consistent with the wording of the claims and cover all legal equivalents. Nevertheless, no claim is intended to include subject matter that does not meet the requirements of applicable patent law, nor should they be interpreted in this manner.

Claims

1. A station (STA) (111) in a wireless network, comprising: At least one processor (240), including processing circuitry; and Memory (260) stores instructions that, when executed individually or jointly by the at least one processor (240), cause STA (111): Send a frame to the access point (AP) (101) indicating the upcoming coexistence event scheduling; as well as Perform peer-to-peer communication with one or more peer STAs during the upcoming coexistence event scheduling.

2. The STA according to claim 1, wherein, The frame indicates that the STA (111) is not available for communication with the AP (101) during the upcoming coexistence event scheduling.

3. The STA according to claim 1 or 2, wherein, When the instruction is executed individually or jointly by the at least one processor (240), it also causes the STA (111) to perform communication with the AP after the frame is sent, wherein the communication with the AP (101) ends before the start of the upcoming coexistence event scheduling.

4. The STA according to any one of the preceding claims, wherein, The frame includes a TWT element that indicates one or more target wake-up time (TWT) service periods.

5. The STA according to claim 4, wherein, The frame includes information indicating the duration for which an upcoming coexistence schedule will remain valid.

6. The STA according to any one of the preceding claims, wherein, The frame includes information associated with the one or more peer STAs.

7. The STA according to claim 6, wherein, The frame indicates information associated with the identity, characteristics, or capabilities of the one or more peer STAs.

8. The STA according to any one of the preceding claims, wherein: When the instruction is executed individually or jointly by the at least one processor (240), it also causes STA (111): Receive a control frame from AP (101) indicating the duration of the Transmission Opportunity (TXOP); as well as In response to a control frame, a frame is sent, wherein the frame indicates a time period associated with an upcoming coexistence event scheduling during which STA (111) is unavailable.

9. An access point (AP) (101) in a wireless network, comprising: At least one processor (224), including processing circuitry; and Memory (229) stores instructions that, when executed individually or jointly by the at least one processor (224), cause AP (101): The slave station (STA) (111) receives a frame indicating an upcoming coexistence event scheduling; as well as Avoid communication with STA (111) during the upcoming coexistence event scheduling.

10. The AP according to claim 9, wherein, The frame indicates that the STA (111) is not available for communication with the AP (101) during the upcoming coexistence event scheduling.

11. The AP according to claim 9 or 10, wherein, When the instruction is executed individually or jointly by the at least one processor (224), it also causes AP (101): After receiving the frame, communication with STA (111) is performed; and Terminate communication with STA (111) before the upcoming coexistence event scheduling begins.

12. The AP according to any one of claims 9 to 11, wherein, The frame includes a TWT element that indicates one or more target wake-up time (TWT) service periods.

13. The AP according to claim 12, wherein, The frame includes information indicating the duration for which an upcoming coexistence schedule will remain valid.

14. The AP according to any one of claims 9 to 13, wherein: The frame includes information associated with one or more peer STAs, wherein the one or more peer STAs perform communication with STA (111) during an upcoming coexistence scheduling period; and When executed individually or jointly by the at least one processor (224), the instructions also cause the AP (101) to avoid communication with one or more peer STAs during an upcoming coexistence event scheduling.

15. The AP according to any one of claims 9 to 14, wherein, When the instruction is executed individually or jointly by the at least one processor (224), it also causes AP (101): Send a control frame to STA (111) indicating the duration of the transmission opportunity (TXOP); as well as In response to a control frame, a frame is received, wherein the frame indicates a time period associated with an upcoming coexistence event scheduling during which STA (111) is unavailable.

Images