Method and apparatus for technology neutral coexistence and high priority traffic

Abstract

Technology-neutral coexistence and high priority traffic for use in unlicensed bands are disclosed. Synchronization boundaries are defined in which synchronization contention windows periodically occur across all radio access technologies attempting to access a shared communication channel. Between synchronization contention windows, nodes may revert to asynchronous access procedures. Such synchronization access procedures may be applicable to certain power classes or deployment type nodes. Additionally, various priority schemes for synchronization contention windows may be used to ensure protection of higher priority nodes or traffic, such as ultra-reliable low latency communication (URLLC) traffic. According to certain aspects, deployment of such a synchronization access method may be triggered via signaling from an initiator device. Additional aspects may provide a technology-neutral receiver protection mechanism by defining resources for protection signaling during a receiver protection interval between successive synchronization contention windows.

Description

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims the benefit of U.S. Patent Application No. 16 / 803,733, filed on February 27, 2020, entitled “TECHNOLOGY NEUTRAL COEXISTENCE AND HIGH PRIORITY TRAFFIC IN UNLICENSED FREQUENCY BANDS,” U.S. Provisional Patent Application No. 62 / 812,842, filed on March 1, 2019, entitled “TECHNOLOGY NEUTRAL COEXISTENCE AND HIGH PRIORITY TRAFFIC IN UNLICENSED FREQUENCY BANDS,” and U.S. Provisional Patent Application No. 62 / 812,842, filed on March 4, 2019, entitled “TECHNOLOGY NEUTRAL COEXISTENCE AND HIGH PRIORITY TRAFFIC IN UNLICENSED FREQUENCY BANDS.” The present invention claims the benefit of U.S. Provisional Patent Application No. 62 / 813,392, entitled “TECHNOLOGY NEUTRAL COEXISTENCE AND HIGH PRIORITY TRAFFIC IN UNLICENSEDFREQUENCY BANDS”, U.S. Provisional Patent Application No. 62 / 814,245, filed on March 5, 2019, entitled “TECHNOLOGY NEUTRAL COEXISTENCE AND HIGH PRIORITY TRAFFIC IN UNLICENSED FREQUENCY BANDS”, and U.S. Provisional Patent Application No. 62 / 820,649, filed on March 19, 2019, entitled “TECHNOLOGY NEUTRAL COEXISTENCE AND HIGH PRIORITY TRAFFIC IN UNLICENSED FREQUENCY BANDS”, each of which is expressly incorporated herein by reference in its entirety.

[0003] background

[0004] field

[0005] Aspects of the present disclosure relate generally to wireless communication systems, and more particularly to technology-neutral coexistence and high priority traffic in unlicensed bands.

[0006] background

[0007] Wireless communication networks are widely deployed to provide various communication services, such as voice, video, packet data, messaging, broadcasting, etc. These wireless networks can be multiple access networks that can support multiple users by sharing available network resources. Such networks, which are usually multiple access networks, support the communication of multiple users by sharing available network resources. An example of such a network is the Universal Terrestrial Radio Access Network (UTRAN). UTRAN is a radio access network (RAN) defined as a part of the Universal Mobile Telecommunications System (UMTS), which is a third generation (3G) mobile phone technology supported by the Third Generation Partnership Project (3GPP). Examples of multiple access network formats include code division multiple access (CDMA) networks, time division multiple access (TDMA) networks, frequency division multiple access (FDMA) networks, orthogonal FDMA (OFDMA) networks, and single carrier FDMA (SC-FDMA) networks.

[0008] A wireless communication network may include several base stations or Node Bs that can support communications for several user equipments (UEs). A UE may communicate with a base station via a downlink and an uplink. A downlink (or forward link) refers to the communication link from a base station to a UE, while an uplink (or reverse link) refers to the communication link from a UE to a base station.

[0009] The base station may transmit data and control information to the UE on the downlink and / or may receive data and control information from the UE on the uplink. On the downlink, the transmission from the base station may encounter interference caused by transmissions from neighboring base stations or from other wireless radio frequency (RF) transmitters. On the uplink, the transmission from the UE may encounter interference from uplink transmissions of other UEs communicating with the neighboring base stations or from other wireless RF transmitters. This interference may degrade the performance of both the downlink and uplink.

[0010] As the demand for mobile broadband access continues to grow, the potential for interference and congested networks continues to grow as more UEs access long-range wireless communication networks and more short-range wireless systems are being deployed in communities. Research and development continues to advance wireless technologies to not only meet the growing demand for mobile broadband access, but also to improve and enhance the user experience with mobile communications.

[0011] Overview

[0012] In one aspect of the present disclosure, a wireless communication method includes: obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines a synchronization contention window and periodicity of synchronization access contention for all access nodes of one or more radio access technologies; identifying, by the wireless node, a next synchronization contention window according to the synchronization boundary configuration using an absolute system timing reference; initiating, by the wireless node, a synchronization contention procedure at the next synchronization contention window; transmitting, by the wireless node according to a result of the synchronization contention procedure; and returning, by the wireless node, to asynchronous access contention for one or more asynchronous contention windows after the next synchronization contention window and before a subsequent synchronization contention window.

[0013] In an additional aspect of the present disclosure, a device configured for wireless communication includes: a device for obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines a synchronization contention window and periodicity for synchronization access contention for all access nodes of one or more radio access technologies; a device for identifying, by the wireless node, a next synchronization contention window according to the synchronization boundary configuration using an absolute system timing reference; a device for initiating, by the wireless node, a synchronization contention procedure at the next synchronization contention window; a device for transmitting, by the wireless node, according to a result of the synchronization contention procedure; and a device for returning, by the wireless node, to asynchronous access contention for one or more asynchronous contention windows after the next synchronization contention window and before a subsequent synchronization contention window.

[0014] In an additional aspect of the present disclosure, a non-transitory computer-readable medium having program code recorded thereon is disclosed. The program code further includes: code for obtaining a synchronization boundary configuration for a shared communication channel by a wireless node, wherein the synchronization boundary configuration defines a synchronization contention window and periodicity for synchronization access contention for all access nodes of one or more radio access technologies; code for identifying a next synchronization contention window according to the synchronization boundary configuration using an absolute system timing reference by the wireless node; code for initiating a synchronization contention procedure at the next synchronization contention window by the wireless node; code for transmitting by the wireless node according to the result of the synchronization contention procedure; and code for returning to asynchronous access contention for one or more asynchronous contention windows by the wireless node after the next synchronization contention window and before a subsequent synchronization contention window.

[0015] In an additional aspect of the present disclosure, a device configured for wireless communication is disclosed. The device includes at least one processor and a memory coupled to the processor. The processor is configured to: obtain, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines a synchronization contention window and periodicity for synchronization access contention for all access nodes of one or more radio access technologies; identify, by the wireless node, a next synchronization contention window according to the synchronization boundary configuration using an absolute system timing reference; initiate, by the wireless node, a synchronization contention procedure at the next synchronization contention window; transmit, by the wireless node, according to a result of the synchronization contention procedure; and return, by the wireless node, to asynchronous access contention for one or more asynchronous contention windows after the next synchronization contention window and before a subsequent synchronization contention window.

[0016] In an additional aspect of the present disclosure, a wireless communication method includes: obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention of all access nodes of one or more radio access technologies; attempting, by the wireless node, to transmit on the shared communication channel using a synchronization contention procedure at a next synchronization contention window determined according to the synchronization access parameters; configuring, by the wireless node, one or more preferred contention windows between the next synchronization contention window and a subsequent synchronization contention window in response to detecting data for transmission in a buffer of the wireless node; attempting, by the wireless node, access to the shared communication channel for further transmission of data at a next preferred contention window in the one or more preferred contention windows; and terminating, by the wireless node, the further transmission at a boundary of a subsequent preferred contention window in the one or more preferred contention windows when a portion of the data remains in the buffer in response to successful access.

[0017] In an additional aspect of the present disclosure, a device configured for wireless communication includes: a device for obtaining a synchronization boundary configuration for a shared communication channel by a wireless node, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention for all access nodes of one or more radio access technologies; a device for the wireless node to attempt to use a synchronization contention procedure to transmit on the shared communication channel at a next synchronization contention window determined based on the synchronization access parameters; a device for the wireless node to configure one or more preferred contention windows between the next synchronization contention window and a subsequent synchronization contention window in response to detecting data for transmission in a buffer of the wireless node; a device for the wireless node to attempt access to the shared communication channel for further transmission of data at the next preferred contention window in the one or more preferred contention windows; and a device for being executed by the wireless node in response to successful access to terminate the further transmission at the boundary of a subsequent preferred contention window in the one or more preferred contention windows when a portion of the data remains in the buffer.

[0018] In an additional aspect of the present disclosure, a non-transitory computer-readable medium having program code recorded thereon is disclosed. The program code further includes: code for obtaining a synchronization boundary configuration for a shared communication channel by a wireless node, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention of all access nodes for one or more radio access technologies; code for attempting to transmit on the shared communication channel using a synchronization contention procedure at a next synchronization contention window determined according to the synchronization access parameters by the wireless node; code for configuring one or more preferred contention windows between the next synchronization contention window and a subsequent synchronization contention window in response to detecting data for transmission in a buffer of the wireless node; code for attempting access to the shared communication channel by the wireless node for further transmission of data at a next preferred contention window in the one or more preferred contention windows; and code for being executable by the wireless node in response to the success of the access to terminate the further transmission at a boundary of a subsequent preferred contention window in the one or more preferred contention windows when a portion of the data remains in the buffer.

[0019] In an additional aspect of the present disclosure, a device configured for wireless communication is disclosed. The device includes at least one processor and a memory coupled to the processor. The processor is configured to: obtain a synchronization boundary configuration for a shared communication channel by a wireless node, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention of all access nodes for one or more radio access technologies; attempt to transmit on the shared communication channel using a synchronization contention procedure at a next synchronization contention window determined according to the synchronization access parameters by the wireless node; configure one or more preferred contention windows between the next synchronization contention window and a subsequent synchronization contention window in response to detecting data for transmission in a buffer of the wireless node; attempt to access the shared communication channel by the wireless node for further transmission of data at the next preferred contention window in the one or more preferred contention windows; and terminate the further transmission at the boundary of the subsequent preferred contention window in the one or more preferred contention windows when a portion of the data remains in the buffer in response to the success of the access by the wireless node.

[0020] In an additional aspect of the present disclosure, a wireless communication method includes: obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines a synchronization contention window and periodicity for synchronization access contention for all access nodes of one or more radio access technologies; identifying, by the wireless node, a next synchronization contention window according to the synchronization boundary configuration using an absolute system timing reference; initiating, by the wireless node, a synchronization contention procedure at the next synchronization contention window; transmitting, by the wireless node according to a result of the synchronization contention procedure; and returning, by the wireless node to asynchronous access contention for one or more asynchronous contention windows after the next synchronization contention window and before a subsequent synchronization contention window.

[0021] In an additional aspect of the present disclosure, a device configured for wireless communication includes: a device for obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines a synchronization contention window and periodicity for synchronization access contention for all access nodes of one or more radio access technologies; a device for identifying, by the wireless node, a next synchronization contention window according to the synchronization boundary configuration using an absolute system timing reference; a device for initiating, by the wireless node, a synchronization contention procedure at the next synchronization contention window; a device for transmitting, by the wireless node, according to a result of the synchronization contention procedure; and a device for returning, by the wireless node, to asynchronous access contention for one or more asynchronous contention windows after the next synchronization contention window and before a subsequent synchronization contention window.

[0022] In an additional aspect of the present disclosure, a non-transitory computer-readable medium having program code recorded thereon is disclosed. The program code further includes: code for obtaining a synchronization boundary configuration for a shared communication channel by a wireless node, wherein the synchronization boundary configuration defines a synchronization contention window and periodicity for synchronization access contention for all access nodes of one or more radio access technologies; code for identifying a next synchronization contention window according to the synchronization boundary configuration using an absolute system timing reference by the wireless node; code for initiating a synchronization contention procedure at the next synchronization contention window by the wireless node; code for transmitting by the wireless node according to the result of the synchronization contention procedure; and code for returning to asynchronous access contention for one or more asynchronous contention windows by the wireless node after the next synchronization contention window and before a subsequent synchronization contention window.

[0023] In an additional aspect of the present disclosure, a device configured for wireless communication is disclosed. The device includes at least one processor and a memory coupled to the processor. The processor is configured to: obtain, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines a synchronization contention window and periodicity for synchronization access contention for all access nodes of one or more radio access technologies; identify, by the wireless node, a next synchronization contention window according to the synchronization boundary configuration using an absolute system timing reference; initiate, by the wireless node, a synchronization contention procedure at the next synchronization contention window; transmit, by the wireless node, according to a result of the synchronization contention procedure; and return, by the wireless node, to asynchronous access contention for one or more asynchronous contention windows after the next synchronization contention window and before a subsequent synchronization contention window.

[0024] In an additional aspect of the present disclosure, a wireless communication method includes: obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention for all access nodes of one or more radio access technologies; deriving, by the wireless node, a plurality of synchronization boundaries based on the synchronization access parameters relative to an absolute timing reference, wherein the synchronization access parameters include synchronization boundary positions and periodicity of the plurality of synchronization boundaries; determining, by the wireless node, a condition associated with synchronization operation at the wireless node; initiating, by the wireless node in response to the condition, a synchronization contention procedure during a current synchronization period between a previous synchronization boundary and a next current synchronization boundary at the end of the current synchronization period; participating, by the wireless node in response to the success of the synchronization contention procedure, in a communication burst, wherein the length of the communication burst is set by the wireless node to up to twice the maximum length of the periodicity; and ceasing participation in the communication burst by the wireless node at the next synchronization boundary after the length.

[0025] In an additional aspect of the present disclosure, a device configured for wireless communication includes: a device for obtaining a synchronization boundary configuration for a shared communication channel by a wireless node, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention for all access nodes of one or more radio access technologies; a device for deriving multiple synchronization boundaries by the wireless node based on the synchronization access parameters relative to an absolute timing reference, wherein the synchronization access parameters include synchronization boundary positions and periodicity of the multiple synchronization boundaries; a device for determining a condition associated with synchronization operation at the wireless node by the wireless node; a device for initiating a synchronization contention procedure by the wireless node during a current synchronization period between a previous synchronization boundary and a next current synchronization boundary at the end of the current synchronization period in response to the condition; a device for participating in a communication burst by the wireless node in response to the success of the synchronization contention procedure, wherein the length of the communication burst is set by the wireless node to up to twice the maximum length of the periodicity; and a device for ceasing to participate in the communication burst by the wireless node at the next synchronization boundary after the length.

[0026] In an additional aspect of the present disclosure, a non-transitory computer-readable medium having program code recorded thereon is disclosed. The program code further includes: code for obtaining a synchronization boundary configuration for a shared communication channel by a wireless node, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention of all access nodes for one or more radio access technologies; code for deriving multiple synchronization boundaries by the wireless node based on the synchronization access parameters relative to an absolute timing reference, wherein the synchronization access parameters include synchronization boundary positions and periodicity of the multiple synchronization boundaries; code for determining a condition associated with synchronization operation at the wireless node by the wireless node; code for initiating a synchronization contention procedure during a current synchronization period between a previous synchronization boundary and a next current synchronization boundary at the end of the current synchronization period by the wireless node in response to the condition; code for participating in a communication burst by the wireless node in response to the success of the synchronization contention procedure, wherein the length of the communication burst is set by the wireless node to a maximum length of up to twice the periodicity; and code for stopping execution of the code for participating in the communication burst by the wireless node at the next synchronization boundary after the length.

[0027] In an additional aspect of the present disclosure, a device configured for wireless communication is disclosed. The device includes at least one processor and a memory coupled to the processor. The processor is configured to: obtain a synchronization boundary configuration for a shared communication channel by a wireless node, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention of all access nodes for one or more radio access technologies; derive multiple synchronization boundaries by the wireless node based on the synchronization access parameters relative to an absolute timing reference, wherein the synchronization access parameters include synchronization boundary positions and periodicity of the multiple synchronization boundaries; determine a condition associated with synchronization operation at the wireless node; initiate a synchronization contention procedure during a current synchronization period between a previous synchronization boundary and a next current synchronization boundary at the end of the current synchronization period by the wireless node in response to the condition; participate in a communication burst by the wireless node in response to the success of the synchronization contention procedure, wherein the length of the communication burst is set by the wireless node to a maximum length of up to twice the periodicity; and stop execution of the configuration for participating in the communication burst by the wireless node at the next synchronization boundary after the length.

[0028] The foregoing has broadly outlined the features and technical advantages of examples according to the present disclosure in an effort to make the following detailed description better understood. Additional features and advantages will be described hereinafter. The disclosed concepts and specific examples can be easily used as a basis for modifying or designing other structures for implementing the same purpose as the present disclosure. Such equivalent constructions do not depart from the scope of the appended claims. The characteristics of the concepts disclosed herein, both in terms of their organization and method of operation, and the associated advantages will be better understood by considering the following description in conjunction with the accompanying drawings. Each of the accompanying drawings is provided for illustration and description purposes and does not define limitations on the claims. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] A further understanding of the nature and advantages of the present disclosure may be obtained by reference to the following drawings. In the drawings, similar components or features may have the same reference numeral. In addition, individual components of the same type may be distinguished by following the reference numeral with a dash and a second reference numeral that distinguishes between similar components. If only the first reference numeral is used in the specification, the description may apply to any of the similar components having the same first reference numeral regardless of the second reference numeral.

[0031] Figure 1 is a block diagram illustrating the details of a wireless communication system.

[0032] Figure 2 is a block diagram illustrating a design of a base station and a UE configured according to one aspect of the present disclosure.

[0033] Figure 3is a block diagram illustrating a wireless communication system including a base station that uses directional wireless beams.

[0034] Figure 4 is a block diagram illustrating a general NR-U network operating according to the legacy medium access procedure.

[0035] Figure 5 is a block diagram illustrating example blocks executed to implement one aspect of the present disclosure.

[0036] Fig. 6A is a block diagram illustrating an NR-U network having wireless nodes and UEs, each configured according to one aspect of the present disclosure.

[0037] Figure 6B is a block diagram illustrating an NR-U network having a TRP configured according to one aspect of the present disclosure.

[0038] Figure 7 is a block diagram illustrating an NR-U network having a base station and a UE, each configured according to one aspect of the present disclosure.

[0039] Figure 8 is a block diagram illustrating example blocks executed to implement one aspect of the present disclosure.

[0040] Fig. 9 is a block diagram illustrating an NR-U network having wireless nodes and UEs, each configured according to one aspect of the present disclosure.

[0041] Fig.10 is a block diagram illustrating example blocks executed to implement one aspect of the present disclosure.

[0042] Fig.11 is a block diagram illustrating an NR-U network having wireless nodes and UEs, each configured according to one aspect of the present disclosure.

[0043] Fig.12 is a block diagram illustrating an example base station configured according to one aspect of the present disclosure.

[0044] Fig.13 is a block diagram illustrating an NR-U network having wireless nodes and UEs, each configured according to one aspect of the present disclosure.

[0045] Fig.14 is a block diagram illustrating example blocks executed to implement one aspect of the present disclosure.

[0046] Fig.15 is a block diagram illustrating a portion of an NR-U network having nodes configured according to one aspect of the present disclosure.

[0047] Fig.16is a block diagram illustrating a portion of an NR-U network having nodes configured according to one aspect of the present disclosure.

[0048] Fig.17 is a block diagram illustrating a portion of an NR-U network having nodes configured according to one aspect of the present disclosure.

[0049] Fig.18 is a block diagram illustrating a portion of an NR-U network having nodes configured according to one aspect of the present disclosure.

[0050] Detailed Description

[0051] The detailed description set forth below in conjunction with the accompanying drawings is intended as a description of various configurations and is not intended to limit the scope of the present disclosure. Instead, this detailed description includes specific details in order to provide a thorough understanding of the subject matter of the present invention. It will be apparent to those skilled in the art that these specific details are not required in every case, and in some instances, for clarity of presentation, well-known structures and components are shown in block diagram form.

[0052] The present disclosure generally relates to providing or participating in authorized shared access between two or more wireless communication systems (also referred to as wireless communication networks). In various embodiments, various techniques and devices may be used for wireless communication networks, such as code division multiple access (CDMA) networks, time division multiple access (TDMA) networks, frequency division multiple access (FDMA) networks, orthogonal FDMA (OFDMA) networks, single carrier FDMA (SC-FDMA) networks, LTE networks, GSM networks, fifth generation (5G) or new radio (NR) networks, and other communication networks. As described herein, the terms "network" and "system" may be used interchangeably.

[0053] OFDMA network can realize radio technologies such as Evolved UTRA (E-UTRA), IEEE 802.11, IEEE 802.16, IEEE802.20, flash-OFDM, etc. UTRA, E-UTRA and Global System for Mobile Communications (GSM) are parts of Universal Mobile Telecommunications System (UMTS). Specifically, Long Term Evolution (LTE) is a version of UMTS using E-UTRA. UTRA, E-UTRA, GSM, UMTS and LTE are described in documents provided by an organization named "3rd Generation Partnership Project" (3GPP), while cdma2000 is described in documents from an organization named "3rd Generation Partnership Project 2" (3GPP2). These various radio technologies and standards are known or under development. For example, the 3rd Generation Partnership Project (3GPP) is a collaboration between various telecommunications association groups that aims to define a globally applicable third generation (3G) mobile phone specification. 3GPP Long Term Evolution (LTE) is a 3GPP project aimed at improving the Universal Mobile Telecommunications System (UMTS) mobile phone standard. 3GPP may define specifications for next generation mobile networks, mobile systems, and mobile devices. The present disclosure focuses on the evolution of wireless technologies from LTE, 4G, 5G, NR and beyond with shared access to wireless spectrum between networks using a set of new and different radio access technologies or radio air interfaces.

[0054] Specifically, 5G networks envision diverse deployments, diverse spectrum, and diverse services and devices that can be implemented using a unified OFDM-based air interface. To achieve these goals, in addition to developing new radio technologies for 5G NR networks, further enhancements to LTE and LTE-A are also considered. 5G NR will be able to scale to provide coverage for: (1) ultra-high density (e.g., about 1M nodes / km) 2 ), ultra-low complexity (e.g., about tens of bits / second), ultra-low energy (e.g., about 10+ years of battery life), and deep coverage capable of reaching challenging locations; (2) including mission-critical control with strong security (to protect sensitive personal, financial, or confidential information), ultra-high reliability (e.g., about 99.9999% reliability), ultra-low latency (e.g., about 1 ms), and users with a wide range of mobility or lack of mobility; and (3) with enhanced mobile broadband, including extremely high capacity (e.g., about 10 Tbps / km 2 ), extreme data rates (e.g., multi-Gbps rates, 100+Mbps user experience rates), and deep cognition with advanced discovery and optimization.

[0055] 5G NR can be implemented to: use optimized OFDM-based waveforms with scalable parameter sets and transmission time intervals (TTIs); have a common, flexible framework to efficiently multiplex services and features using dynamic, low-latency time time division duplex (TDD) / frequency division duplex (FDD) designs; and have advanced wireless technologies such as massive multiple-input multiple-output (MIMO), robust millimeter wave (mmWave) transmission, advanced channel coding, and device-centric mobility. The scalability of parameter sets in 5G NR (and the scaling of subcarrier spacing) can efficiently address the operation of diverse services across diverse spectrums and diverse deployments. For example, in various outdoor and macro coverage deployments less than 3GHz FDD / TDD implementations, the subcarrier spacing can occur, for example, at 15kHz on bandwidths such as 1, 5, 10, 20MHz. For other various outdoor and small cell coverage deployments of TDD greater than 3GHz, the subcarrier spacing can occur at 30kHz on 80 / 100MHz bandwidths. For various other indoor broadband implementations, subcarrier spacing may occur at 60kHz over a 160MHz bandwidth using TDD on the unlicensed portion of the 5GHz band. Finally, for various deployments using mmWave components for transmission with TDD at 28GHz, subcarrier spacing may occur at 120kHz over a 500MHz bandwidth.

[0056] 5G NR's scalable parameter set facilitates scalable TTI to meet diverse latency and quality of service (QoS) requirements. For example, shorter TTIs can be used for low latency and high reliability, while longer TTIs can be used for higher spectral efficiency. Efficient multiplexing of long TTIs and short TTIs allows transmissions to start on symbol boundaries. 5G NR also contemplates a self-contained integrated subframe design with uplink / downlink scheduling information, data, and acknowledgment in the same subframe. Self-contained integrated subframes support communications in unlicensed or contention-based shared spectrum, supporting adaptive uplink / downlink that can be flexibly configured on a per-cell basis to dynamically switch between uplink and downlink to meet current traffic needs.

[0057] Various other aspects and features of the present disclosure are further described below. It should be apparent that the teachings herein can be embodied in a variety of forms, and any specific structure, function, or both disclosed herein are representative and non-restrictive. Based on the teachings herein, it should be appreciated by those of ordinary skill in the art that the aspects disclosed herein can be implemented independently of any other aspects and two or more of these aspects can be combined in various ways. For example, any number of aspects set forth herein can be used to implement a device or practice a method. In addition, other structures, functionality, or structures and functionality that are supplementary to or different from one or more aspects set forth herein can be used to implement such a device or practice such a method. For example, the method can be implemented as a part of a system, device, device, and / or as an instruction stored on a computer-readable medium for execution on a processor or computer. Not only that, an aspect can include at least one element of a claim.

[0058] Figure 1 1 is a block diagram illustrating a 5G network 100 including various base stations and UEs configured according to various aspects of the present disclosure. The 5G network 100 includes several base stations 105 and other network entities. A base station may be a station that communicates with a UE and may also be referred to as an evolved Node B (eNB), a next generation eNB (gNB), an access point, etc. Each base station 105 may provide communication coverage for a particular geographic area. In 3GPP, the term "cell" may refer to such a specific geographic coverage area of ​​a base station and / or a base station subsystem serving that coverage area, depending on the context in which the term is used.

[0059] A base station may provide communication coverage for a macro cell or a small cell (such as a pico cell or a femto cell), and / or other types of cells. A macro cell generally covers a relatively large geographic area (e.g., a radius of several kilometers) and may allow unrestricted access by UEs that have a service subscription with a network provider. A small cell (such as a pico cell) generally covers a relatively small geographic area and may allow unrestricted access by UEs that have a service subscription with a network provider. A small cell (such as a femto cell) generally also covers a relatively small geographic area (e.g., a residence) and, in addition to unrestricted access, may also provide restricted access to UEs associated with the femto cell (e.g., UEs in a closed subscriber group (CSG), UEs of users in the residence, etc.). A base station for a macro cell may be referred to as a macro base station. A base station for a small cell may be referred to as a small cell base station, a pico base station, a femto base station, or a home base station. In Figure 1In the example shown in FIG. 1 , base stations 105d and 105e are conventional macro base stations, while base stations 105a-105c are macro base stations enabled with one of 3-dimensional (3D), full-dimensional (FD), or massive MIMO. Base stations 105a-105c utilize their higher dimensional MIMO capabilities to increase coverage and capacity using 3D beamforming in both elevation and azimuth beamforming. Base station 105f is a small cell base station, which may be a home node or a portable access point. The base station may support one or more (e.g., two, three, four, etc.) cells.

[0060] The 5G network 100 may support synchronous or asynchronous operation. For synchronous operation, each base station may have similar frame timing, and transmissions from different base stations may be approximately aligned in time. For asynchronous operation, each base station may have different frame timing, and transmissions from different base stations may not be aligned in time.

[0061] UE 115 is dispersed throughout the wireless network 100, and each UE can be stationary or mobile. UE can also be referred to as a terminal, a mobile station, a subscriber unit, a station, etc. UE can be a cellular phone, a personal digital assistant (PDA), a wireless modem, a wireless communication device, a handheld device, a tablet computer, a laptop computer, a cordless phone, a wireless local loop (WLL) station, etc. In one aspect, the UE can be a device including a universal integrated circuit card (UICC). On the other hand, the UE can be a device that does not include a UICC. In some aspects, a UE that does not include a UICC can also be referred to as an Internet of Everything (IoE) or Internet of Things (IoT) device. UE 115a-115d is an example of a mobile smart phone type device that accesses the 5G network 100.

[0062] UE may also be a machine specifically configured for connected communications (including machine type communications (MTC), enhanced MTC (eMTC), narrowband IoT (NB-IoT), etc.). UE 115e-115k is an example of various machines configured for communications to access 5G network 100. UE may be able to communicate with any type of base station, whether a macro base station, a small cell, or the like. Figure 1 In the present invention, lightning (e.g., communication link) indicates wireless transmission between the UE and a serving base station (a serving base station is a base station designated to serve the UE on a downlink and / or uplink), or expected transmission between base stations, and backhaul transmission between base stations.

[0063] In operation of the 5G network 100, base stations 105a-105c use 3D beamforming and coordinated spatial techniques such as coordinated multipoint (CoMP) or multi-connectivity to serve UEs 115a and 115b. Macro base station 105d performs backhaul communications with base stations 105a-105c and small cell base station 105f. Macro base station 105d also transmits multicast services subscribed to and received by UEs 115c and 115d. Such multicast services may include mobile TV or streaming video, or may include other services for providing community information such as weather emergencies or alerts, such as Amber Alerts or Gray Alerts.

[0064] The 5G network 100 also supports mission-critical communications with ultra-reliable and redundant links for mission-critical devices, such as UE 115e, which is a drone. Redundant communication links with UE 115e include from macro base stations 105d and 105e, and small cell base station 105f. Other machine-type devices, such as UE 115f (thermometer), UE 115g (smart meter), and UE 115h (wearable device), can communicate directly with base stations, such as small cell base station 105f and macro base station 105e, through the 5G network 100, or communicate through the 5G network 100 in a multi-hop configuration by communicating with another user device that relays its information to the network, such as UE 115f communicating temperature measurement information to smart meter UE 115g, which is then reported to the network through small cell base station 105f. The 5G network 100 may also provide additional network efficiencies through dynamic, low latency TDD / FDD communications, such as in a vehicle-to-vehicle (V2V) mesh network between UEs 115i-115k communicating with a macro base station 105e.

[0065] Figure 2 A block diagram showing a design of a base station 105 and a UE 115 is shown, and the base station 105 and the UE 115 may be Figure 1One of each base station and one of each UE in the base station 105. At the base station 105, the transmit processor 220 may receive data from the data source 212 and control information from the controller / processor 240. The control information may be used for PBCH, PCFICH, PHICH, PDCCH, EPDCCH, MPDCCH, etc. The data may be used for PDSCH, etc. The transmit processor 220 may process (e.g., encode and symbol map) the data and the control information to obtain data symbols and control symbols, respectively. The transmit processor 220 may also generate reference symbols (e.g., for PSS, SSS, and reference signals that vary from cell to cell). The transmit (TX) multiple-input multiple-output (MIMO) processor 230 may perform spatial processing (e.g., precoding) on ​​data symbols, control symbols, and / or reference symbols where applicable, and may provide output symbol streams to modulators (MOD) 232a to 232t. Each modulator 232 may process a respective output symbol stream (e.g., for OFDM, etc.) to obtain an output sample stream. Each modulator 232 may further process (eg, convert to analog, amplify, filter, and upconvert) the output sample stream to obtain a downlink signal. The downlink signals from modulators 232a through 232t may be transmitted via antennas 234a through 234t, respectively.

[0066] At the UE 115, antennas 252a to 252r may receive downlink signals from the base station 105 and may provide received signals to demodulators (DEMODs) 254a to 254r, respectively. Each demodulator 254 may condition (e.g., filter, amplify, downconvert, and digitize) a respective received signal to obtain input samples. Each demodulator 254 may further process the input samples (e.g., for OFDM, etc.) to obtain received symbols. A MIMO detector 256 may obtain received symbols from all demodulators 254a to 254r, perform MIMO detection on the received symbols where applicable, and provide detected symbols. A receive processor 258 may process (e.g., demodulate, deinterleave, and decode) the detected symbols, provide decoded data for the UE 115 to a data sink 260, and provide decoded control information to a controller / processor 280.

[0067] On the uplink, at the UE 115, a transmit processor 264 may receive and process data (e.g., for PUSCH) from a data source 262 and control information (e.g., for PUCCH) from a controller / processor 280. The transmit processor 264 may also generate reference symbols for a reference signal. The symbols from the transmit processor 264 may be precoded by a TX MIMO processor 266, if applicable, further processed by modulators 254a through 254r (e.g., for SC-FDM, etc.), and transmitted to the base station 105. At the base station 105, uplink signals from the UE 115 may be received by antennas 234, processed by demodulators 232, detected by MIMO detectors 236, if applicable, and further processed by receive processors 238 to obtain decoded data and control information sent by the UE 115. The processor 238 may provide decoded data to a data sink 239 and decoded control information to the controller / processor 240.

[0068] The controller / processors 240 and 280 may direct the operation at the base station 105 and the UE 115, respectively. The controller / processor 240 and / or other processors and modules at the base station 105 may perform or direct the execution of various processes for the techniques described herein. The controller / processor 280 and / or other processors and modules at the UE 115 may also perform or direct the execution of various processes for the techniques described herein. Figure 5 and 8 105 and UE 115. The memory 242 and 282 may store data and program codes for the base station 105 and the UE 115, respectively. The scheduler 244 may schedule the UE for data transmission on the downlink and / or uplink.

[0069] Wireless communication systems operated by different network operating entities (e.g., network operators) may share spectrum. In some instances, one network operating entity may be configured to use the entire designated shared spectrum for at least one period of time, and then another network operating entity may use the entire designated shared spectrum for a different period of time. Thus, in order to allow network operating entities to use the entire designated shared spectrum, and to mitigate interfering communications between different network operating entities, specific resources (e.g., time) may be divided and allocated to different network operating entities for specific types of communications.

[0070] For example, a network operation entity may be allocated specific time resources that are reserved for exclusive communication by the network operation entity using the entire shared spectrum. Other time resources may also be allocated to a network operation entity where the entity has priority over other network operation entities for communication using the shared spectrum. These time resources prioritized for use by the network operation entity may be utilized by other network operation entities on an opportunistic basis if the prioritized network operation entity does not utilize these resources. Additional time resources may be allocated to any network operator to be used on an opportunistic basis.

[0071] Access to the shared spectrum and arbitration of time resources among different network operating entities may be centrally controlled by a single entity, autonomously determined through a predefined arbitration scheme, or dynamically determined based on interactions between wireless nodes of the network operator.

[0072] In some cases, the UE 115 and the base station 105 (in the 5G network 100) Figure 1 ) may operate in a shared radio frequency spectrum band, which may include licensed or unlicensed (e.g., contention-based) spectrum. In the unlicensed frequency portion of the shared radio frequency spectrum band, the UE 115 or the base station 105 may traditionally perform medium sensing procedures to contend for access to the spectrum. For example, the UE 115 or the base station 105 may perform a listen-before-talk (LBT) procedure (such as a clear channel assessment (CCA)) before communicating to determine whether the shared channel is available. CCA may include energy detection procedures to determine whether there are any other active transmissions. For example, the device may infer that a change in the received signal strength indicator (RSSI) of a power meter indicates that the channel is occupied. Specifically, signal power concentrated in a particular bandwidth and exceeding a predetermined noise floor may indicate another wireless transmitter. CCA may also include detection of a specific sequence indicating channel usage. For example, another device may transmit a specific preamble before transmitting a data sequence. In some cases, the LBT procedure may include the wireless node acting as a proxy for collisions to adjust its own backoff window based on the amount of energy detected on the channel and / or acknowledgment / negative acknowledgment (ACK / NACK) feedback for its own transmitted packets.

[0073] Using medium sensing procedures to contend for access to unlicensed shared spectrum may result in communication inefficiencies. This may be particularly evident when multiple network operating entities (e.g., network operators) are trying to access shared resources. In the 5G network 100, the base station 105 and the UE 115 may be operated by the same or different network operating entities. In some examples, an individual base station 105 or UE 115 may be operated by more than one network operating entity. In other examples, each base station 105 and UE 115 may be operated by a single network operating entity. Requiring each base station 105 and UE 115 of a different network operating entity to contend for shared resources may result in increased signaling overhead and communication latency.

[0074] Figure 3 An example of a timing diagram 300 for coordinated resource partitioning is illustrated. The timing diagram 300 includes a superframe 305, which may represent a fixed duration of time (e.g., 20 ms). The superframe 305 may repeat for a given communication session and may be used by a wireless system (such as a wireless communication system such ... Figure 1 The 5G network 100 described herein is used. The superframe 305 can be divided into intervals, such as an acquisition interval (A-INT) 310 and an arbitration interval 315. As described in more detail below, the A-INT 310 and the arbitration interval 315 can be subdivided into sub-intervals that are designated for specific resource types and are allocated to different network operating entities to facilitate coordinated communication between different network operating entities. For example, the arbitration interval 315 can be divided into a plurality of sub-intervals 320. Moreover, the superframe 305 can be further divided into a plurality of subframes 325 having a fixed duration (e.g., 1 ms). Although the timing diagram 300 illustrates three different network operating entities (e.g., operator A, operator B, operator C), the number of network operating entities that use the superframe 305 for coordinated communication can be greater or less than the number illustrated in the timing diagram 300.

[0075] A-INT 310 may be a dedicated interval of superframe 305 that is reserved for exclusive communication by network operating entities. In some examples, specific resources within A-INT 310 may be allocated to each network operating entity for exclusive communication. For example, resource 330-a may be reserved for exclusive communication by operator A (such as through base station 105a), resource 330-b may be reserved for exclusive communication by operator B (such as through base station 105b), and resource 330-c may be reserved for exclusive communication by operator C (such as through base station 105c). Since resource 330-a is reserved for exclusive communication by operator A, neither operator B nor operator C can communicate during resource 330-a, even if operator A chooses not to communicate during those resources. That is, access to exclusive resources is limited to designated network operators. Similar restrictions apply to resource 330-b of operator B and resource 330-c of operator C. Each wireless node (eg, UE 115 or base station 105) of operator A may communicate any desired information (such as control information or data) during its exclusive resource 330-a.

[0076] When communicating on exclusive resources, the network operation entity does not need to perform any medium sensing procedures (e.g., listen before talk (LBT) or clear channel assessment (CCA)) because the network operation entity is aware that these resources are reserved. Because only designated network operation entities can communicate on exclusive resources, the possibility of interfering communications can be reduced compared to relying solely on medium sensing techniques (e.g., no hidden node problem). In some examples, A-INT 310 is used to transmit control information, such as synchronization signals (e.g., SYNC (synchronization) signals), system information (e.g., system information blocks (SIBs)), paging information (e.g., physical broadcast channel (PBCH) messages), or random access information (e.g., random access channel (RACH) signals). In some examples, all wireless nodes associated with the network operation entity can transmit simultaneously during their exclusive resources.

[0077] In some examples, resources may be classified as being preferentially used for a specific network operation entity. Resources assigned as being preferentially used for a specific network operation entity may be referred to as a guaranteed interval (G-INT) for the network operation entity. The resource interval used by the network operation entity during the G-INT may be referred to as a prioritized sub-interval. For example, resource 335-a may be preferentially used by operator A, and may therefore be referred to as operator A's G-INT (e.g., G-INT-OpA). Similarly, resource 335-b may be preferentially used for operator B (e.g., G-INT-OpB), resource 335-c (e.g., G-INT-OpC) may be preferentially used for operator C, resource 335-d may be preferentially used for operator A, resource 335-e may be preferentially used for operator B, and resource 335-f may be preferentially used for operator C.

[0078] Figure 3 The various G-INT resources illustrated in the figure appear to be staggered to illustrate the association of these resources with their corresponding network operating entities, but these resources can all be on the same frequency bandwidth. Thus, if viewed along the time-frequency grid, the G-INT resources can appear as adjacent lines within the superframe 305. This division of data can be an example of time division multiplexing (TDM). Moreover, when resources appear in the same subinterval (e.g., resource 340-a and resource 335-b), these resources represent the same time resources relative to the superframe 305 (e.g., these resources occupy the same subinterval 320), but these resources are separately specified to illustrate that the same time resources can be classified differently for different operators.

[0079] When resources are assigned to be used preferentially for a particular network operation entity (e.g., G-INT), that network operation entity can use those resources to communicate without having to wait for or perform any medium sensing procedures (e.g., LBT or CCA). For example, a wireless node of operator A can freely communicate any data or control information during resource 335-a without interference from wireless nodes of operator B or operator C.

[0080] The network operation entity may additionally signal to another operator that it intends to use a particular G-INT. For example, referring to resource 335-a, operator A may signal to operator B and operator C that it intends to use resource 335-a. Such signaling may be referred to as an activity indication. In addition, since operator A has priority with respect to resource 335-a, operator A may be considered a higher priority operator than both operator B and operator C. However, as discussed above, operator A does not have to send signaling to other network operation entities to ensure interference-free transmission during resource 335-a because resource 335-a is assigned to operator A with priority.

[0081] Similarly, a network operation entity may signal to another network operation entity that it intends not to use a particular G-INT. Such signaling may also be referred to as an activity indication. For example, with reference to resource 335-b, operator B may signal to operator A and operator C that it intends not to use resource 335-b for communication, even if these resources are preferentially assigned to operator B. With reference to resource 335-b, operator B may be considered a network operation entity with a higher priority than operator A and operator C. In such a case, operators A and C may attempt to use the resources of subinterval 320 on an opportunistic basis. Thus, from the perspective of operator A, subinterval 320 containing resource 335-b may be considered an opportunistic interval (O-INT) for operator A (e.g., O-INT-OpA). For illustrative purposes, resource 340-a may represent an O-INT for operator A. Moreover, from the perspective of operator C, the same subinterval 320 may represent an O-INT for operator C with corresponding resource 340-b. Resources 340-a, 335-b, and 340-b all represent the same time resource (e.g., a particular subinterval 320), but are identified separately to represent that the same resource may be considered G-INT for some network operating entities and still O-INT for other network operating entities.

[0082] In order to utilize resources on an opportunistic basis, operator A and operator C may perform medium sensing procedures to check for communications on a particular channel before transmitting data. For example, if operator B decides not to use resources 335-b (e.g., G-INT-OpB), operator A may use those same resources (e.g., represented by resources 340-a) by first checking the channel for interference (e.g., LBT) and then transmitting data if the channel is determined to be clear. Similarly, if operator C wants to access resources on an opportunistic basis during subinterval 320 (e.g., using O-INT represented by resources 340-b) in response to operator B's indication that its G-INT (e.g., resources 335-b) will not be used, operator C may perform medium sensing procedures and access those resources if they are available. In some cases, two operators (e.g., operator A and operator C) may attempt to access the same resources, in which case the two operators may employ contention-based procedures to avoid interfering communications. Operators may also have sub-priorities assigned to them that are designed to determine which operator may gain access to a resource if more than one operator is attempting access simultaneously. For example, operator A may have a higher priority than operator C during sub-interval 320 when operator B is not using resource 335-b (e.g., G-INT-OpB). Note that in another sub-interval (not shown), operator C may have a higher priority than operator A when operator B is not using its G-INT.

[0083] In some examples, a network operation entity may intend not to use a particular G-INT assigned to it, but may not send an activity indication outwardly that conveys the intention not to use the resources. In such a case, for a particular subinterval 320, a lower priority operation entity may be configured to monitor the channel to determine whether a higher priority operation entity is using the resources. If a lower priority operation entity determines through LBT or a similar method that a higher priority operation entity will not use its G-INT resources, the lower priority operation entity may attempt to access these resources on an opportunistic basis, as described above.

[0084] In some examples, access to G-INT or O-INT may be preceded by a reservation signal (e.g., request to send (RTS) / clear to send (CTS)) and a contention window (CW) may be randomly selected between one operating entity and all number of operating entities.

[0085] In some examples, the operation entity may adopt or be compatible with coordinated multi-point (CoMP) communications. For example, the operation entity may adopt CoMP and dynamic time division duplexing (TDD) in G-INT and opportunistic CoMP in O-INT as needed.

[0086] exist Figure 3 In the example illustrated in , each sub-interval 320 includes a G-INT for one of operators A, B, or C. However, in some cases, one or more sub-intervals 320 may include resources that are neither reserved for exclusive use nor reserved for prioritized use (e.g., unassigned resources). Such unassigned resources may be considered O-INT for any network operating entity and may be accessed on an opportunistic basis, as described above.

[0087] In some examples, each subframe 325 may contain 14 symbols (e.g., 250-μs for a 60 kHz frequency modulation interval). These subframes 325 may be self-contained, self-contained intervals C (ITCs), or the subframes 325 may be part of a long ITC. An ITC may be a self-contained transmission that begins with a downlink transmission and ends with an uplink transmission. In some embodiments, an ITC may include one or more subframes 325 that operate contiguously while the medium is occupied. In some cases, assuming a 250-μs transmission opportunity, there may be up to eight network operators in an A-INT 310 (e.g., having a duration of 2 ms).

[0088] although Figure 3 Three operators are illustrated in the superframe 305, but it should be understood that fewer or more network operating entities may be configured to operate in a coordinated manner as described above. In some cases, the position of each operator's G-INT, O-INT, or A-INT within the superframe 305 is autonomously determined based on the number of network operating entities active in the system. For example, if there is only one network operating entity, each subinterval 320 may be occupied by a G-INT for that single network operating entity, or the subinterval 320 may alternate between G-INT and O-INT for that network operating entity to allow other network operating entities to enter. If there are two network operating entities, the subinterval 320 may alternate between G-INT for the first network operating entity and G-INT for the second network operating entity. If there are three network operating entities, the G-INT and O-INT for each network operating entity may be as follows. Figure 3. If there are four network operation entities, the first four sub-intervals 320 may include coherent G-INT for the four network operation entities, while the remaining two sub-intervals 320 may contain O-INT. Similarly, if there are five network operation entities, the first five sub-intervals 320 may include coherent G-INT for the five network operation entities, while the remaining sub-intervals 320 may contain O-INT. If there are six network operation entities, all six sub-intervals 320 may include coherent G-INT for each network operation entity. It should be understood that these examples are for illustrative purposes only, and other autonomously determined interval allocations may also be used.

[0089] It should be understood that reference Figure 3 The coordination framework described is for illustration purposes only. For example, the duration of superframe 305 may be more or less than 20 ms. Furthermore, the number, duration, and location of subintervals 320 and subframes 325 may differ from the illustrated configuration. Furthermore, the type of resource designation (e.g., exclusive, prioritized, unassigned) may differ or include more or fewer sub-designations.

[0090] As wireless technology advances, mobile network operator (MNO)-driven wide area networks will continue to serve traditional use cases. 5G technology is expected to expand beyond traditional use cases to new applications in healthcare, Industrial Internet of Things (IIOT), etc. Certain non-traditional use case scenarios can benefit from solutions to current problems to meet the stringent requirements for ultra-reliable, low latency communication (URLLC) services. In mission-critical (MiCr) applications, URLLC operations may be expected to be 10 -6 Packet error rate, ms latency, all in multi-year 24 / 7 operation. Expanding on NR features, 5G NR-U will have support for both License Assisted Access (LAA) (where an unlicensed channel is assisted by a licensed channel to ensure communications) and standalone mode.

[0091] In IIOT applications, factory automation communications are typically cyclic, with each cycle including URLLC operations. The packet arrival process is typically periodic and predictable or deterministic, so that the periodicity is considered to be a cycle time. In such factory automation scenarios, the packet arrival process can be synchronized across all UEs, can be symmetrical in the downlink direction and the uplink direction, and includes small packets (e.g., several or tens of bytes). Losing a single packet (even temporarily and occasionally) will interrupt the automation process, which may lead to the closure of the entire industrial operation. A potential idea for improving service availability and thus opening the door to URLLC services for industrial / hospital applications in unlicensed / shared bands is to open wireless operations in the 6 GHz band (e.g., unlicensed national information infrastructure (UNII)-7). In addition, it may be considered to facilitate advanced technologies such as coordinated multi-point (CoMP) transmission in the unlicensed / shared band of the 6 GHz band.

[0092] Spectrum availability continues to be at the forefront of discussions for increasing access to wireless services. The primary targets for NR-U deployment have been identified as the 5 GHz band and the upcoming 6 GHz band. Existing medium access procedures in the unlicensed 5 GHz band may create several problems that may result in poor performance, thus making the unlicensed spectrum insufficient for such new high-priority applications. The 5 GHz band, which may be shared with other radio access technologies such as WiFi, may suffer from interference caused by hidden and exposed nodes, loose quality of service (QoS) controls, and insufficient support for new advanced transmission technologies such as CoMP.

[0093] In response to various high-tech companies' demands for more "mid-band" unlicensed spectrum to supplement the unlicensed spectrum already available in the 5 GHz band, government agencies have considered opening the 6 GHz band (e.g., 5.925-7.125 GHz) for unlicensed use. The 6 GHz band is currently used by licensed incumbents (such as fixed services, mobile services, and satellite services, etc.). In order to open the 6 GHz band, complex sharing mechanisms will be used to protect these licensed incumbents. Because the 6 GHz band has not yet been opened to unlicensed use, it does not have "legacy" secondary users. As such, it provides a good opportunity to develop new procedures that can support these new use cases in the unlicensed spectrum. Various aspects of the present disclosure are directed to providing technology-neutral medium access rules that allow advanced use of unlicensed spectrum.

[0094] Figure 4is a block diagram illustrating a general NR-U network 40 operating according to the legacy medium access procedure. As illustrated, three wireless nodes (nodes 1-3) have been located so that the coverage area of ​​each node substantially overlaps with the coverage area of ​​the other nodes. Nodes 1 and 3 may each have a portion of their coverage area that is not overlapped by the other nodes. However, the coverage area of ​​node 2 is completely overlapped by the coverage area of ​​either node 1 or node 3. Figure 4 An illustrative timeline for each of nodes 1-3 is further shown. In providing communications with UEs 115a-c, the medium access procedure for each node includes a contention window in which each node may contend for a shared communications channel. However, while there are scenarios in which nodes 1 and 3 may have a successful contention procedure to guarantee a channel occupancy time (COT) for communications, because the contention windows for each of nodes 1-3 do not overlap, node 2 will not have an opportunity to access the medium as long as nodes 1 and 3 are not within listening range of each other and are using the medium.

[0095] Under current medium access rules, existing listen-before-talk (LBT) schemes may suffer from starvation (e.g., failure to guarantee channel access) due to interference experienced from exposed or hidden nodes. Medium access procedures are not further well defined for CoMP operations. Trigger-based schemes for uplink multi-user multiple-input multiple-output (MU-MIMO) operations may not be considered "fair" due to the potentially higher transmit power of the access point compared to its clients. Additionally, there is no current or practical technology-neutral way to protect the receiver. When defined in WiFi operations, receiver protection techniques do not perform well in heavily loaded scenarios when the WiFi preamble is not detected due to low signal-to-interference-plus-noise ratio (SINR).

[0096] Synchronous access schemes have been proposed to improve the handling of such problems. Synchronization can improve fairness because it enables overlapping contention windows. It alleviates the exposed node interference problem. Each node can get a fair share of the medium. In addition, this can help alleviate the hidden node interference problem because all nodes monitor control signaling at a given time. Moreover, it is possible to achieve receiver protection similar to the Clear to Send (CTS) message in a technology-neutral manner.

[0097] In CoMP scenarios, adjacent transmit receive points (TRPs) can block each other's channel access and significantly reduce any gains that can normally be achieved through CoMP operation. Synchronization of access contention allows contention windows to overlap within TRPs and across operators, which can help achieve CoMP operation gains in multi-operator scenarios. When medium access is successful, system behavior can be closer to licensed spectrum networks than typical unlicensed, which ultimately leads to better performance. Otherwise, CoMP operation based on independent TRP contention will be trigger-dependent and will result in the creation of localized clusters that may be suboptimal.

[0098] In order to make the 6 GHz (UNII-7) band suitable for MiCr applications (such as IIOT URLLC services), efforts should be made to keep it from being affected by transmissions from unmanaged devices without active detection by the client or mobile access point. Additionally, technology-neutral mechanisms can be defined to minimize interference to such services. Other nodes can listen for the presence of IIOT URLLC traffic and avoid using the same channel. Future-proof media access procedures can be further defined for more advanced transmission technologies (such as CoMP and enhanced mobile broadband (eMBB) services). In such technologies, load-based equipment (LBE) media access procedures use, at least in part, synchronized contention windows. When such media access is successfully accessed, the system behavior can be closer to a licensed spectrum network than a typical unlicensed one.

[0099] Figure 5 1 is a block diagram illustrating example blocks that are executed to implement one aspect of the present disclosure. The example blocks will also be referred to as Fig.12 The description is based on the base station 105 illustrated in FIG. Fig.12 1 is a block diagram illustrating a base station 105 configured according to one aspect of the present disclosure. The base station 105 includes Figure 2 105. For example, the base station 105 includes a controller / processor 240 that operates to execute logic or computer instructions stored in a memory 242 and to control the components of the base station 105 that provide the features and functionality of the base station 105. The base station 105 transmits and receives signals via wireless radios 1200a-t and antennas 234a-t under the control of the controller / processor 240. The wireless radios 1200a-t include various components and hardware (such as those shown in FIG. Figure 2 ), including modulators / demodulators 232a-t, a MIMO detector 236, a receive processor 238, a transmit processor 220, and a TX MIMO processor 230.

[0100] In block 500, a wireless node may obtain a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines a synchronization contention window and periodicity for synchronization access contention for all access nodes of one or more radio access technologies. The synchronization boundary configuration sets the details of the size and frequency of the synchronization contention window. A wireless node (such as a base station 105) may have this information predetermined in memory 242 at the synchronization boundary configuration 1201 as part of the standard information preprogrammed into the base station 105. In other example implementations, the configuration information may be received from a neighboring node in order to initiate a synchronization access contention operation. Such a signal will be received at the base station 105 via the antennas 234a-t and the wireless radios 1200a-t and stored at the synchronization boundary configuration 1201 in the memory 242.

[0101] At block 501, the wireless node uses an absolute system timing reference to identify the next synchronization contention window according to the synchronization boundary configuration. The base station 105, under the control of the controller / processor 240, will use the absolute system time reference to identify the location of the next synchronization contention window according to the configuration information at the synchronization boundary configuration 1201. Depending on the capabilities of the base station 105, the absolute system timing reference may be autonomously generated at the system time information 1204 and stored in the memory 242. Alternatively, the base station 105 may rely on external signals from other radio access networks to supply the absolute system timing reference to be stored at the system time information 1004. For example, if the wireless radio 1200a-t includes a GPS radio, the GPS signals received by the antenna 234a-t and the wireless radio 1200a-t so equipped may provide the absolute system timing reference. In an alternative example, if the base station 105 does not have a GPS radio or when network information has been provided for all nodes of any radio access technology attempting to access a shared communication channel to monitor for certain other radio access technology signals (such as certain WiFi beacon signals that include an absolute system timestamp), the base station 105 will attempt to detect and decode such signals to obtain an absolute system timing reference.

[0102] At block 502, the wireless node initiates a synchronization contention procedure at the next synchronization contention window. When the base station 105 identifies the next synchronization contention window, it may execute a synchronization access procedure 1202 under the control of the controller / processor 240. The execution environment of the synchronization access procedure provides the base station 105 with functionality to compete with other nodes attempting to access the shared communication channel at the synchronization contention window. It also uses periodic information to provide a switch to the synchronization procedure for each synchronization contention window.

[0103] The wireless node transmits according to the result of the synchronization contention procedure at block 503. Depending on the result of the synchronization contention procedure, the base station 105 may either transmit data via the wireless radio 1200a-t and antenna 234a-t, or back off if it detects another node that has won access, or if the priority scheme includes high priority nodes or high priority traffic (such as URLLC), the base station 105 may try to find a different channel for transmission.

[0104] At block 504, the wireless node performs asynchronous access contention for one or more asynchronous contention windows after the next synchronous contention window and before the subsequent synchronous contention window. After completion of the synchronous access contention operation, the base station 105 may return to asynchronous access operation. The base station 105, under the control of the controller / processor 240, will execute the asynchronous access procedure 1203 in the memory 242. The execution environment of the asynchronous access procedure 1203 provides the base station 105 with functionality for identifying additional asynchronous contention windows and performing contention access procedures during those windows between each of the synchronous contention windows.

[0105] It should be noted that although reference Figure 5 The illustrated and described set of blocks executed may provide a mandatory, standardized execution of the described synchronous access contention, but alternative aspects of the present disclosure may allow for an optional selection of synchronous access contention by a wireless node, such as a base station 105. For example, after obtaining the synchronization boundary configuration in block 500, alternative aspects of the present disclosure provide functionality at block 505-a to determine whether the wireless node elects to follow synchronous access contention. The base station 105 executes alternative synchronization selection logic 1206-a under the control of the controller / processor 204. The execution environment of the synchronization selection logic 1206-a determines the current communication state of the base station 105. For example, if the base station 105 has made at least a threshold maximum number of attempts to access a shared communication channel that have failed due to contention with other wireless nodes, the functionality of the synchronization selection logic 1206-a will prompt the base station 105 to elect to follow the synchronous access contention functionality and proceed to block 501, as described above. Similarly, if the base station 105 detects that the buffer 1205 has at least a threshold amount of data for transmission, the functionality of the synchronization selection logic 1206-a will also prompt the base station 105 to select to follow the synchronization access contention functionality and thus also proceed to block 501. Additionally, within the synchronization configuration parameters stored in the synchronization boundary configuration 1201, a node that selects to follow the synchronization contention access functionality may use different transmission access parameters that may be more advantageous.

[0106] The transmission access parameters include parameters defining the length of the maximum channel occupancy time (MCOT), the length of the backoff window, etc. Thus, within the execution environment of the synchronization selection logic 1206-a, the base station 105 may also choose to follow the synchronous access contention functionality in order to benefit from better transmission parameters. In one example aspect, the MCOT provided for synchronous access may be defined as a multiple of the MCOT for asynchronous operation (e.g., 2x asynchronous MCOT, 3x asynchronous MCOT, etc.). Similarly, the backoff window may be reduced, which reduces the potential time that the base station 105 may spend accessing the shared communication channel. Therefore, by choosing to follow the synchronous access functionality, the base station 105 may improve its transmission characteristics.

[0107] However, within the execution environment of the synchronous selection logic 1206-a, in circumstances where using synchronous contention functionality would not necessarily benefit communications of the base station 105, the base station 105 would not elect to follow the synchronous access contention functionality and therefore proceed to box 504 to perform asynchronous access contention.

[0108] Fig. 6A is a block diagram illustrating an NR-U network 60 having wireless nodes 1-3 and UEs 115a-c, each configured according to one aspect of the present disclosure. Figure 4 As illustrated in , wireless nodes 1-3 have overlapping coverage areas, wherein the coverage area of ​​wireless node 2 is completely overlapped by a portion of the coverage areas of nodes 1 and 3. According to the illustrated aspects of the present disclosure, the LBT procedure is modified to accommodate periodic synchronization access contention. Synchronization boundaries (such as synchronization boundaries 61 and 62) are perhaps defined within Federal Communications Commission (FCC) regulations. Synchronization access contention at each of synchronization boundaries 61 and 62 includes synchronization contention windows 600 and 601 at a periodicity 602. Periodicity 602 can be set to various times as frequent as a single maximum COT (MCOT) up to multiple MCOTs (e.g., 20ms to 100ms).

[0109] At the synchronization contention window 600, each of the wireless nodes 1-3 listens for any control signaling from other nodes before guaranteeing a COT for transmission. After the synchronization contention window 600, the asynchronous access procedure may return, such as at an asynchronous contention window 603 for wireless node 1 and an asynchronous contention window 604 for wireless node 3. However, because overlapping synchronization contention windows (such as synchronization contention windows 600 and 601) are configured, the wireless node 2 may still actually contend for access to the shared communication channel.

[0110] At synchronization boundaries 61 and 62 as defined by the regulations, all transmitting devices following the synchronization access procedure stop transmitting and restart channel access using the synchronization access procedure. For example, the wireless node 3 guarantees a COT and starts transmitting within the COT after successful contention at the asynchronous contention window 604. As the synchronization boundary 62 is approached together with the synchronization contention window 601, the wireless node 3 terminates transmission and resets for synchronization access contention.

[0111] It should be noted that in additional aspects of the present disclosure, the synchronous access contention operation may be limited to a specific node class. The node class may include different power classes or deployment locations of the node, such as indoors or outdoors. With reference to the NR-U network 60, the illustrated aspects of the present disclosure identify that low-power outdoor nodes comply with the synchronous access contention. Therefore, nodes 1-3 classified as low-power outdoor nodes comply with the illustrated synchronous access procedures, while other node classes (such as base station 105a) that are high-power outdoor nodes do not comply with the synchronous access procedures.

[0112] The size of the synchronous contention windows 600 and 601 and the length of the periodicity 602 may be predefined by regulations, and the size of the MCOT does not need to be changed. As described, asynchronous access procedures will be allowed outside the synchronous contention windows 600 and 601. There will be no other impact on system behavior except for the reset of the periodic transmission gaps and contention windows.

[0113] Figure 6B 6 is a block diagram illustrating an NR-U network 63 having TRPs 1-5 configured according to one aspect of the present disclosure. TRPs 1-5 are positioned so that a portion of each coverage area of ​​the respective TRP is overlapped by the coverage area of ​​another one or more TRPs. As illustrated, TRPs 2-4 operate as a CoMP cluster, while TRPs 1 and 5 remain independent access points. Without the synchronous contention of various aspects of the present disclosure, the overlapping coverage areas and transmissions of the independent access points can effectively block the operation of the individual TRPs in the CoMP set, thereby significantly reducing the possibility of achieving a beneficial CoMP result. However, according to the illustrated aspects of the present disclosure, each of TRPs 1-5 is subject to synchronous access contention operation. The synchronous contention windows 607-610 overlap for each of TRPs 1-5. Accordingly, cluster member TRPs 2-4 and each of the independent access points TRPs 1 and TRP 5 will have equal access when contending for a shared communication channel. Synchronizing access contention across all TRPs 1-5 increases the likelihood of achieving beneficial performance of CoMP operations.

[0114] Figure 71 is a block diagram illustrating an NR-U network 70 having base stations 105a and 105f and UEs 115a and 115b, each configured according to an aspect of the present disclosure. In the illustrated aspect, synchronous access contention applies to all node classes, so that base stations 105a and 105f each contend for access to a shared communication channel at synchronous contention windows 702 and 703, while returning to asynchronous access procedures between synchronous boundaries. During the synchronous contention windows 702 and 703, access may be prioritized among different nodes or different traffic classes. In a first optional aspect, no priority is used for contention. Thus, within the synchronous contention windows 702 and 703, all nodes contend for access 704 without priority. In a second optional aspect, a fixed priority scheme may be used, in which a first set of nodes or an identified traffic type (e.g., URLLC traffic) may be assigned a fixed priority to a shared communication channel. Thus, the fixed priority scheme 705 will allow high priority nodes (e.g., URLLC traffic, fixed priority nodes) to always access or reserve the medium at the beginning of the time slot. The high priority node will not comply with the backoff or delay because in the fixed priority scheme 705, it can always be the highest priority (i.e., priority 1). Other traffic, priority 2 nodes will not contend with the high priority node. When the priority 2 node detects such a priority 1 node, the priority 2 node can back off, or in the case of the priority 1 node identifying the URLLC traffic, the priority 2 node can attempt to access another shared communication channel. Further enhancement of quality of service (QoS) control may be possible, and is not limited to URLLC traffic.

[0115] The previously described aspects of the present disclosure provide for synchronization access contention based on standards for predetermining wireless nodes for synchronization procedures. Nodes may determine the location of synchronization boundaries using a predetermined synchronization boundary configuration and an absolute system timing reference. The absolute system timing reference may be autonomously generated or may be obtained via an external signal, whether an over-the-air (OTA) signal from other nodes of the same radio access technology, or by receiving other radio access technology signals (e.g., global positioning system (GPS) signals) at the wireless node, or detecting other radio access technology signals (e.g., monitoring to find certain WiFi beacon signals that include absolute timestamps). Additional aspects of the present disclosure may trigger synchronized contention based on a signal received from an initiator device (e.g., an access point).

[0116] For some wireless nodes that do not have the ability to autonomously maintain synchronization, coexistence requirements may provide OTA signaling support for receiving synchronization information (such as absolute system timing reference and synchronization contention information from the initiator device) within their own radio access technology. Utilizing the corresponding waveform used by the receiving device will depend on the transmitting device. Such coexistence requirements may apply to all nodes (indoor or outdoor) and power classes or to specific node classes, such as outdoor only or outdoor standard power only, indoor low power only, etc. Low power nodes can benefit from synchronization alignment of the contention window. Scenarios where multiple nodes request disjoint synchronization points by using an absolute system timing reference.

[0117] Figure 8 1 is a block diagram illustrating example blocks that are executed to implement one aspect of the present disclosure. The example blocks will also be referred to as Fig.12 The description is based on the base station 105 illustrated in FIG.

[0118] In block 800, a wireless node obtains a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention for all access nodes of one or more radio access technologies. The synchronization boundary configuration sets the details of the size and frequency of the synchronization contention window. A wireless node (such as a base station 105) may have this information predetermined in memory 242 at the synchronization boundary configuration 1201 as part of the standard information preprogrammed into the base station 105. In other example implementations, the configuration information may be received from a neighboring node in order to initiate a synchronization access contention operation. Such a signal will be received at the base station 105 via the antennas 234a-t and the wireless radios 1200a-t and stored at the synchronization boundary configuration 1201 in the memory 242.

[0119] In block 801, a wireless node attempts to transmit on a shared communication channel using a synchronization contention procedure at a next synchronization contention window determined according to synchronization access parameters. The base station 105, under the control of the controller / processor 240, will use an absolute system time reference to identify the location of the next synchronization contention window according to the configuration information at the synchronization boundary configuration 1201. Depending on the capabilities of the base station 105, the absolute system timing reference may be obtained by various means, as described above. When the base station 105 identifies the next synchronization contention window, it may execute a synchronization access procedure 1202 under the control of the controller / processor 240. The execution environment of the synchronization access procedure 1202 provides the base station 105 with functionality for competing with other nodes attempting to access the shared communication channel at the synchronization contention window. It also uses periodic information from the synchronization access parameters to provide a switch to the synchronization procedure for each synchronization contention window.

[0120] In block 802, the wireless node configures one or more preferred contention windows between a next synchronization contention window and a subsequent synchronization contention window in response to detecting data for transmission in a buffer of the wireless node. The synchronization access parameters in the synchronization boundary configuration 1201 include a configuration in which a number of preferred contention windows are located between successive synchronization contention windows at a predefined periodicity of one MCOT. The base station 105 may use this information to configure a preferred contention window upon detecting data remaining for transmission in the buffer 1205.

[0121] At block 803, the wireless node attempts access to the shared communication channel for further transmission of data at the next preferred contention window in the one or more preferred contention windows. When the buffer 1205 is extended because it has data for transmission, the base station 105 may attempt access to the shared communication channel at the next of the preferred contention windows within the execution context of the synchronization access procedure 1202.

[0122] In block 804, if the wireless node has gained access and is transmitting data, the wireless node then terminates further transmission at the boundary of the subsequent preferred contention window in the one or more preferred contention windows when a portion of the data remains in the buffer. If the contention procedure is successful, the base station 105 may transmit the data in the buffer 1205 via the wireless radio 1200a-t and the antenna 234a-t. The base station 105 may continue such transmission until the boundary of the next preferred contention window. The base station 105 will be required to stop transmitting at the next preferred contention window, even if there is data remaining in the buffer 1205. If there is data remaining in the buffer 1205 at the next preferred contention window, then after stopping transmission, the base station 105 may again synchronously contend for access to the shared communication channel at the next preferred contention window.

[0123] In accordance with Figure 8 In an alternative aspect, a wireless node may terminate further transmissions simply by using an enhanced COT (eCOT). The eCOT is defined to include both the amount of time used by a node to gain access to a channel as well as the actual transmission time. By modifying the definition of the COT in this way, a node does not have to track the start of the next preferred contention window in order to terminate any ongoing transmissions. Instead, the defined COT includes the access time, and thus, scheduled transmissions within the eCOT will automatically terminate at the end of the eCOT.

[0124] It should be noted that alternative aspects of the present disclosure may apply the definition of eCOT to any node, whether or not the node complies with synchronous access functionality. By scheduling eCOT, both synchronous and asynchronous nodes may actually obtain synchronous access contention windows until the amount of data to be transmitted causes the transmission to terminate before the standard eCOT.

[0125] Fig. 9 is a block diagram illustrating an NR-U network 80 having wireless nodes 1-3 and UEs 115a-c, each configured according to one aspect of the present disclosure. Fig. 9 As illustrated in FIG. 1 , wireless nodes 1-3 have overlapping coverage areas, where the coverage area of ​​wireless node 2 is completely overlapped by a portion of the coverage areas of nodes 1 and 3. According to the illustrated aspects of the present disclosure, the LBT procedure is modified to implement synchronous access contention. In addition to accommodating periodic synchronous access contention (such as with respect to Fig. 6A In addition to what has been illustrated and described, additional aspects of the present disclosure allow for maintaining synchronous access contention while experiencing full buffer traffic.

[0126] When buffer traffic (e.g., data for transmission in node buffer) is detected, synchronization of access contention can be extended. When such buffer traffic is detected, node 1-3 can obtain the position information of the additional contention window between synchronization contention window 900 and 904. This information will be predefined according to the standard, and is obtained together with the synchronization boundary information in the synchronization access parameter of the synchronization boundary configuration. When the synchronization access periodicity 911 between synchronization contention window 900 and 904 is a multiple of MCOT, multiple "preferred" contention windows 901-903 will be defined between synchronization contention window 900 and 904. Additionally, the periodicity 910 of preferred contention window 901-903 can be defined as equal to MCOT. For any node that obtains access to a shared communication channel during one of preferred contention windows 901-903, transmission will be required to stop at the boundary of the next preferred contention window, regardless of whether there is data remaining in the buffer. If there is not enough data in the buffer to transmit to the next preferred contention window boundary, the node can stop transmitting when the data runs out. However, if there is data remaining at the next preferred contention window boundary, the node must terminate the transmission. For example, if Fig. 9 , node 2 wins access to the shared communication channel at the preferred contention window 901 and starts transmitting at COT 905. At the beginning of the next MCOT and thus at the boundary of the preferred contention window 902, when there is data remaining in the buffer of node 2, node 2 must stop transmitting and contend with nodes 1 and 3 for access again at the preferred contention window 902.

[0127] Asynchronous access points may still be allowed during the extended synchronous access contention period. For example, when a small amount of data for transmission results in a short COT (such as COT 906) or no access occurs after a preferred contention window (such as preferred contention window 903), nodes 1-3 may contend for access at asynchronous points (such as asynchronous listening opportunities 907-909). When accessing the shared communication channel from one of the asynchronous listening opportunities 907-909, such as by node 2 at the asynchronous listening opportunity 907, node 2 will not be required to terminate transmission at the boundary of the next preferred synchronous contention window (i.e., preferred contention window 903).

[0128] It should be noted that the maximum channel occupancy can be achieved to effectively reduce the time spent contending and accessing the medium during these preferred contention windows, but the alignment of the preferred contention windows 901-903 can be maintained in a full buffer scenario.

[0129] Fig.13 1 is a block diagram illustrating an NR-U network 1300 having wireless nodes 1-3 and UEs 115a-c, each configured according to one aspect of the present disclosure. Fig.13 As illustrated in FIG, wireless nodes 1-3 have overlapping coverage areas, where the coverage area of ​​wireless node 2 is completely overlapped by a portion of the coverage areas of nodes 1 and 3. According to the illustrated aspect, instead of a node terminating an ongoing transmission at the next preferred contention window, an eCOT is used that schedules a complete transmission according to an eCOT equal to a normalized constant time T.

[0130] In the case of full buffer traffic as described above, a preferred contention window may be maintained. The wireless node may calculate the eCOT in such a way that the time taken to access the shared communication channel (e.g., contention window) plus the actual transmission time equals a predefined standardized constant time T. Synchronization of such nodes using eCOT scheduling will be maintained, even if preference is given to some synchronized nodes utilizing a constant time nT, where n is an integer (e.g., n=2). There will be no other impact on system behavior other than the cessation of transmission at synchronization boundaries and the resetting of the contention window.

[0131] Thus, at synchronization boundary 1301, nodes 1-3 have synchronized contention windows 1303 and 1305. Because nodes 1 and 3 have non-overlapping coverage areas, both nodes 1 and 3 can secure access to the shared communication channel and transmit during COT 1304 and COT 1306, respectively, for a predetermined time constant T defining the length of eCOT 1307. However, node 2 does not gain access. Upon detecting buffer data, a preferred contention window may be defined by eCOT 1307. At 1308, synchronization is maintained because nodes 1 and 3 transmit for the full eCOT 1307. Node 2 successfully accesses the channel at preferred contention window 1309 and transmits in COT 1310 for the combined duration of eCOT 1307. Thus, at 1311, synchronization is still maintained.

[0132] After winning access to the shared channel after 1311, node 1 transmits only the duration of COT 1314, which is less than the combined length of eCOT 1307. Therefore, synchronization is lost at 1315. Any further access to the shared channel by any of nodes 1-3 will subsequently lose synchronization until the next boundary at synchronization boundary 1302.

[0133] Fig.10 1 is a block diagram illustrating example blocks that are executed to implement one aspect of the present disclosure. In block 1000, a node is initialized for asynchronous access operation. In block 1001, the node performs contention operation according to the current synchronization state. In block 1002, a determination is made as to whether synchronization information has been received. If so, then in block 1003, the node is set for synchronous access operation and the synchronization timer is restarted. If synchronization information is not received or after the node is set for synchronous access operation, in block 1004, another determination is made to determine whether the synchronization timer has expired. If so, the node is reset for asynchronous access operation. If the synchronization timer has not expired or after resetting the node for asynchronous access operation, the node returns to performing contention operation in block 1001 according to the current synchronization state. The current state will be either asynchronous access operation or synchronous access operation depending on the reception of synchronization information and / or the state of the synchronization timer.

[0134] As mentioned above, existing messages defined in various radio access technologies (such as WiFi) can be enhanced to convey timing information in a relatively straightforward manner. For example, a WiFi beacon signal according to IEEE 802.11 contains a timestamp. The beacon signal can then be used to deliver absolute system timing reference information for the purpose of identifying synchronization boundaries for synchronous access contention. Different values ​​can be reserved to indicate a certain synchronization contention window reference point and otherwise have no other impact on behavior. In order for this delivery mechanism to work, all access points or wireless nodes will monitor to find messages or beacon signals that convey this absolute timing information.

[0135] The FCC defines synchronization boundaries for synchronized contention. Such synchronization boundaries may be referred to as a time domain grid, where all complying nodes with ongoing transmissions may be required to stop transmitting and restart using synchronized contention. In one example implementation, standard power, outdoor access points may be required to comply with a time domain grid (e.g., synchronized access contention) if there is no OTA signaling support within its own radio access technology for receiving timing information. These devices may already have a GPS receiver to determine their location for the purpose of coexistence with primary 6 GHz or UNII-7 band users. Otherwise, access points may be required to comply with synchronized access contention only if synchronization information is available through OTA signaling within its own technology.

[0136] Fig.11 1 is a block diagram illustrating an NR-U network 1100 having wireless nodes 1-3 and UEs 115a-c, each configured according to one aspect of the present disclosure. Figure 4 As illustrated in , wireless nodes 1-3 have overlapping coverage areas, wherein the coverage area of ​​wireless node 2 is completely overlapped by a portion of the coverage areas of nodes 1 and 3. According to the illustrated aspects, a technology-neutral receiver protection mechanism can be defined in a relatively straightforward manner by utilizing the concept of receiver signaling during a predefined interval determined relative to a synchronization boundary. A node (such as node 1) that wins contention at the synchronization contention window 1100 can use the synchronization contention window 1100 for receiver protection signaling. As indicated above, receiver protection signaling can be similar to CTS signaling, wherein an expected receiver node transmits a CTS to indicate that it will expect to receive a transmitted signal. Surrounding nodes that monitor to find and detect such receiver protection signals can schedule or coordinate their own transmissions to minimize interference with the receiver.

[0137] To improve the granularity of receiver protection, additional receiver protection intervals R-TX 1102-1104 may be defined to be sufficient to convey receiver feedback (e.g., ~50-100 μs) between the synchronization contention windows 1100 and 1101. Receiver protection signals may then be transmitted during such receiver protection intervals R-TX 1102-1104. Between the synchronization contention windows 1100 and 1101 and between the additional receiver protection intervals R-TX 1102-1104, node 3 may have asynchronous access opportunities at asynchronous contention opportunity windows 1105-1108. Thus, a technology-neutral mechanism is implemented for receiver protection between the synchronization contention windows 1100 and 1101.

[0138] Fig.14 1 is a block diagram illustrating example blocks that are executed to implement one aspect of the present disclosure. The example blocks will also be referred to as Fig.12 The description is based on the base station 105 illustrated in FIG. Fig.12 1 is a block diagram illustrating a base station 105 configured according to one aspect of the present disclosure. The base station 105 includes Figure 2 105. For example, the base station 105 includes a controller / processor 240 that operates to execute logic or computer instructions stored in a memory 242 and to control the components of the base station 105 that provide the features and functionality of the base station 105. The base station 105 transmits and receives signals via wireless radios 1200a-t and antennas 234a-t under the control of the controller / processor 240. The wireless radios 1200a-t include various components and hardware (such as those shown in FIG. Figure 2 ), including modulators / demodulators 232a-t, a MIMO detector 236, a receive processor 238, a transmit processor 220, and a TX MIMO processor 230.

[0139] At block 1400, the wireless node obtains a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention for all access nodes of one or more radio access technologies. The synchronization boundary configuration includes synchronization access parameters that set details of the location and frequency of the synchronization contention window. A wireless node, such as a base station 105, may have this information predetermined in the memory 242 at the synchronization boundary configuration 1201 as part of standard information pre-programmed into the base station 105.

[0140] At block 1401, a wireless node derives a plurality of synchronization boundaries relative to an absolute timing reference based on synchronization access parameters, wherein the synchronization access parameters include synchronization boundary locations and periodicity of the plurality of synchronization boundaries. The base station 105, under the control of the controller / processor 240, has access to system time information 1204 that provides an absolute timing reference for which the base station 105 derives the locations of synchronization boundaries using the synchronization access parameters from the synchronization boundary configuration 1201.

[0141] At block 1402, the wireless node determines a condition associated with synchronous operation at the wireless node. A compatible wireless node may have the ability to operate synchronously via synchronous access procedures 1202 and asynchronously via asynchronous access procedures 1203. During certain conditions, the wireless node may achieve improved access or performance by using synchronous transmission operations. Such conditions may include a large amount of data in the buffer 1205, high priority data traffic, detection of a crowded spectrum in which multiple different nodes are attempting to access the same shared communication channel, and failure of channel access procedures rising to a threshold level. When these and other similar conditions are detected at the base station 105, the base station 105, under the control of the controller / processor 240, may elect to use synchronous access contention.

[0142] In response to the condition, the wireless node initiates a synchronization contention procedure during the current synchronization period between the previous synchronization boundary and the next current synchronization boundary at the end of the current synchronization period at block 1403. When these and other similar conditions are detected at the base station 105, the base station 105, under the control of the controller / processor 240, may select to execute the synchronization access procedure 1202 in the memory 242 according to the synchronization access parameters in the synchronization boundary configuration 1201. Execution environment of the synchronization access procedure 1202.

[0143] In block 1404, the wireless node participates in a communication burst in response to the success of the synchronization contention procedure, wherein the length of the communication burst is set by the wireless node to be up to twice the maximum length of the periodicity. Upon detecting success in the contention operation, the base station 105 may participate in a communication burst that may include the base station 105 transmitting data from the buffer 1205 via the wireless radio 1200a-t and the antenna 234a-t. The communication burst also includes idle time during the contention window when the base station 105 attempts to access the shared communication channel, and any time when the base station 105 receives transmissions from other nodes communicating with the base station 105 and any switching time when switching between transmission and reception. Based on the synchronization access parameters in the synchronization boundary configuration 1201, the base station 105 has information for calculating the communication burst length to be up to two complete synchronization periods. According to certain aspects, the base station 105 may be allowed communication bursts of up to two complete synchronization periods, while other selected aspects may limit the extended communication bursts to a predefined percentage of the two synchronization periods.

[0144] At block 1405, the wireless node stops participating in the communication burst at the next synchronization boundary of the next synchronization period. When the base station 105 reaches the next synchronization boundary after the extended communication burst, it will stop transmitting for the next synchronized contention access period. Additional aspects of the present disclosure may define synchronization super boundaries that are equivalent to other synchronization boundaries defined by the synchronization access parameters of the synchronization boundary configuration 1201. The synchronization super boundaries appear with a super periodicity that can be a constant multiple of the existing periodicity of the conventional synchronization boundary. Any node (including the base station 105) participating in the synchronization operation will end all transmissions and communication bursts at the synchronization super boundary, regardless of any additional extended communication burst rules.

[0145] Fig.15 1 is a block diagram illustrating a portion of an NR-U network 1550 having nodes 1-3 configured according to one aspect of the present disclosure. As illustrated, three wireless nodes (nodes 1-3) have been located such that the coverage area of ​​each node substantially overlaps the coverage area of ​​the other nodes. Nodes 1 and 3 may each have a portion of their coverage area that is not overlapped by the other nodes. However, the coverage area of ​​node 2 is completely overlapped by the coverage area of ​​either node 1 or node 3. Fig.15 Illustrative timelines for each of nodes 1-3 are further shown.In providing communications with UEs 115a-c, the medium access procedures for each node include a contention window in which each node may contend for a shared communications channel.

[0146] In the implementation of various aspects of the present disclosure, the periodic synchronization boundary is defined by a standard (e.g., FCC standard, etc.). Such nodes will have predefined configuration information for synchronization boundaries, including periodicity (e.g., 6ms, 8ms, etc.) defined relative to global navigation satellite system (GNSS) time. According to the illustrated aspects, a communication burst can be defined as the total transmission time of a master device and any associated slave device, including a gap for switching the transmission direction and a continuous idle time of a contention window heard by the master device immediately before the start of the transmission. When not operating under synchronized transmission, each communication burst may not span more than one synchronization boundary. When a given node has enough data to transmit, the communication burst associated with the node may not be shorter than the synchronization boundary period, unless the communication burst ends at the synchronization boundary, and if the communication burst starts at the synchronization boundary, the burst will end at the next synchronization boundary as long as there is data left in the buffer, so as to retain and maintain synchronized traffic. However, when a node selects to perform transmission according to a synchronized transmission configuration, the synchronized node can maintain the communication burst to up to two synchronization boundary periods.

[0147] like Fig.15 , node 2 has enough data to be transmitted according to the synchronous transmission configuration, while nodes 1 and 3 are either unable to perform synchronous transmission or do not have enough data for extended transmission. Node 2 operating according to the synchronous transmission configuration identifies synchronization boundaries 1500-1504 that appear at periodicity 1505. At synchronization boundary 1500, node 3 has data and uses the contention window of communication burst 1506 to win access to the shared communication channel. In the absence of enough data to continue to transmit to synchronization boundary 1501, node 3 ends communication burst 1506 at 1507. Node 2 operating according to the synchronous configuration obtains access to the shared communication channel in the contention window of communication burst 1508. Because node 2 is operating synchronously, it knows the location of synchronization boundaries 1500-1504, and when access to the shared communication channel is guaranteed at 1507, node 2 is allowed to exceed the single synchronous periodic transmission limit and continue transmission to the next synchronization boundary (i.e., synchronization boundary 1502) after the next complete synchronization period. According to the illustrated aspect, when operating synchronously, node 2 may continue transmission for up to two synchronization periods.

[0148] After node 2 stops transmitting at synchronization boundary 1502, node 1 successfully gains access to the shared communication channel for a short transmission (i.e., communication burst 1509) ending at 1510. Again, with sufficient data to transmit, node 2 regains access to the shared communication channel at 1510 for a communication burst 1511 that extends for most of the duration of the synchronization period 1505 between synchronization boundaries 1502 and 1503 and the entire synchronization period 1505 between synchronization boundaries 1503 and 1504. As a rule, node 2 stops transmitting at synchronization boundary 1504, but contends and gains access to the shared communication channel for communication burst 1512 if there is still more data to transmit. According to the illustrated aspect, synchronized transmission is not mandated by the standard, but is enabled and motivated by the ability of participating nodes to extend transmissions longer than the standard limit of a single synchronization periodicity 1505.

[0149] Fig.16 1 is a block diagram illustrating a portion of an NR-U network 1660 having nodes 1-3 configured according to one aspect of the present disclosure. Fig.15 , three wireless nodes (nodes 1-3) have been positioned so that the coverage area of ​​each node substantially overlaps with the coverage areas of the other nodes. Nodes 1 and 3 may each have a portion of their coverage area that is not overlapped by other nodes. However, the coverage area of ​​node 2 is completely overlapped by the coverage area of ​​either node 1 or node 3. The periodic synchronization boundaries 1500-1504 are defined by a standard (e.g., an FCC standard, etc.), where nodes 1-3 will have predefined configuration information, including a periodicity defined relative to GNSS time (e.g., 6ms, 8ms, etc.).

[0150] A communication burst can also be defined as the total transmission time of a master device and any associated slave devices, including gaps for switching transmission direction and the idle time of the contention window immediately before the start of the transmission. Fig.15 As explained in , when not operating under synchronous transmission, Fig.16 Each communication burst of may not cross more than one synchronization boundary, and when a given node has enough data to transmit, a communication burst associated with that node may not be shorter than a synchronization boundary period, unless the communication burst ends at a synchronization boundary, and if it starts at a synchronization boundary, the communication burst will end at the next synchronization boundary. However, when Fig.16 When one of the nodes 1-3 selects to perform a transmission according to the synchronized transmission configuration, the synchronized nodes may maintain a communication burst for longer than a single synchronization period.

[0151] It should be noted that the length of the additional amount that a synchronization node is allowed to transmit may be predetermined (e.g., 125%, 150%, 175%, etc.) according to the implemented standard in order to influence the motivation of a node to choose to use synchronization transmission. For example, when set to 150%, the average communication burst length may be equal to the synchronization boundary period (within a defined tolerance) at a random starting position of a communication burst. Therefore, when set to 150% or lower, there may be less motivation for a node to choose synchronization operation rather than achieve synchronization operation.

[0152] like Fig.16 As illustrated in FIG. 1 , node 2 has sufficient data to transmit according to the synchronized transmission configuration, while nodes 1 and 3 (as in FIG. 1 ) have sufficient data to transmit according to the synchronized transmission configuration. Fig.15 1502. Node 2, operating according to the synchronous transmission configuration, identifies synchronization boundaries 1500-1504 that appear at periodicity 1505. At synchronization boundary 1500, node 3 has data and uses the contention window of communication burst 1600 to win access to the shared communication channel. In the absence of enough data to continue to transmit to synchronization boundary 1501, node 3 ends communication burst 1600 at 1601. Node 2, operating according to the synchronous configuration, obtains access to the shared communication channel in the contention window of communication burst 1602. Because node 2 is operating synchronously, it knows the location of synchronization boundaries 1500-1504.

[0153] While securing access to the shared communication channel at 1601, node 2 is allowed to exceed the single synchronization periodicity transmission limit by a predetermined length and continue transmission to the next synchronization boundary (i.e., synchronization boundary 1502) after the next full synchronization period. For the purpose of the illustrated example, an excess length of 150% of the periodicity 1505 is allowed for continued transmission. Node 2 determines at 1601 that a periodicity 1505 less than or equal to 150% exists between 1601 and synchronization boundary 1502. Therefore, node 2 can continue transmission of communication burst 1602 from 1601 to synchronization boundary 1502. At synchronization boundary 1502, node 1 secures access to the shared communication channel for communication burst 1603 that ends at 1604 shortly after synchronization boundary 1502. Node 2, operating synchronously again, regains access to the shared communication channel for communication burst 1605 in the contention window after 1604. However, when node 2 obtains access to the shared communication channel at 1604, it determines that the remaining time of the synchronization period between synchronization boundaries 1502 and 1503 plus the synchronization period between synchronization boundaries 1503 and 1504 is greater than a periodicity 1505 of 150%. Accordingly, node 2, under synchronous operation, needs to stop transmitting communication bursts 1605 at synchronization boundary 1503. As illustrated, nodes 1 and 3 each obtain access to the shared communication channel at non-overlapping portions for transmission of communication bursts 1606 and 1607, which are limited by the standard predetermined length of a single synchronization period. Node 2 can obtain access to the shared channel again at synchronization boundary 1504 for transmission of communication bursts 1608.

[0154] Fig.17 1 is a block diagram illustrating a portion of an NR-U network 1770 having nodes 1-3 configured according to one aspect of the present disclosure. Fig.15 and 16 , three wireless nodes (nodes 1-3) have been positioned so that the coverage area of ​​each node substantially overlaps with the coverage area of ​​other nodes. Nodes 1 and 3 may each have a portion of their coverage area that is not overlapped by other nodes. However, the coverage area of ​​node 2 is completely overlapped by the coverage area of ​​node 1 or node 3. Periodic synchronization boundaries 1704-1706 and periodic synchronization super boundaries 1701 and 1702 are defined by standards (e.g., FCC standards, etc.), where nodes 1-3 will have predefined configuration information, including periodicity 1707 (e.g., 6ms, 8ms, etc.) between synchronization boundaries 1704-1706 and super periodicity 1703 of synchronization super boundaries 1701-1702 (which may be defined as the number n of synchronization boundaries (e.g., n=5, 10, etc.)), each of which is defined relative to GNSS time.

[0155] As reference Fig.15 and16 Explained and described, Fig.17 A communication burst of the aspects illustrated in the can also be defined as the total transmission time of the master device and any associated slave devices, including gaps for switching transmission direction and idle time of the contention window immediately before the start of transmission. Moreover, when not operating under synchronous transmission, Fig.17 Each communication burst of may not cross more than one synchronization boundary, and when a given node has enough data to transmit, a communication burst associated with that node may not be shorter than a synchronization boundary period, unless the communication burst ends at a synchronization boundary, and if it starts at a synchronization boundary, the communication burst will end at the next synchronization boundary. Fig.17 When one of the nodes 1-3 operating synchronously chooses to perform transmission according to the synchronized transmission configuration, the synchronized node may maintain the communication burst for longer than a single synchronization period (e.g., 125%, 150%, 175%, etc.). However, any of the nodes 1-3 operating synchronously may not continue to transmit on one of the synchronization hyperboundaries 1701 and 1702.

[0156] according to Fig.17 In the illustrated example implementation, nodes 1 and 3 each have sufficient data to select synchronization operation, while node 2 may not select synchronization operation or may have limited data insufficient for sustained transmission over at least the full synchronization period. At synchronization overboundary 1701, nodes 1 and 3 gain access to the shared communication channel for transmission of communication bursts 1708 and 1709, respectively. Due to the limits set by the predetermined excess lengths (125%, 150%, 175%), each of nodes 1 and 3 stops transmitting at synchronization node 704. Node 2 contends and gains access to the shared communication channel for transmission of a communication burst 1710, which ends at 1711 before the next boundary (i.e., synchronization boundary 1705).

[0157] At 1711, nodes 1 and 3 each regain access to the shared communication channel for transmission of communication bursts 712 and 713, respectively. Upon gaining access to the shared communication channel at 1711, each of nodes 1 and 3 determines that the remaining length of the synchronization period between synchronization boundaries 1704 and 1705 plus the complete synchronization period between synchronization boundaries 1705 and 1706 is less than a predetermined excess length. Accordingly, communication bursts 1712 and 1713 cross synchronization boundary 1705 and stop transmission at synchronization boundary 1706.

[0158] Again, at synchronization boundary 1706, node 2 successfully obtains access to the shared communication channel for transmission of a communication burst 1714, which ends at 1715 before the next synchronization boundary (i.e., synchronization super boundary 1702). Nodes 1 and 3 regain access to the shared communication channel at 1715 for transmission of communication bursts 1716 and 1717, respectively, which end at synchronization super boundary 1702. As nodes operating synchronously, nodes 1 and 3 are obliged to stop all transmissions at any super boundary (such as synchronization super boundary 1702). Node 2 then regains access to the shared communication channel for communication burst 1718 after the contention window starting at synchronization super boundary 1702.

[0159] As described above, when the predetermined excess length is set to 150%, the average communication burst length may be equal to the synchronization boundary period (within a defined tolerance) at a random start position of the communication burst.

[0160] Fig.18 1 is a block diagram illustrating a portion of an NR-U network 1880 having nodes 1-3 configured according to one aspect of the present disclosure. Fig.15 , 16 In Figures 1 and 17, three wireless nodes (nodes 1-3) have been positioned so that the coverage area of ​​each node substantially overlaps with the coverage area of ​​other nodes. Nodes 1 and 3 may each have a portion of their coverage area that is not overlapped by other nodes. However, the coverage area of ​​node 2 is completely overlapped by the coverage area of ​​node 1 or node 3. Periodic synchronization boundaries 1704-1706 and periodic synchronization super boundaries 1701 and 1702 are defined by standards (e.g., FCC standards, etc.), where nodes 1-3 will have predefined configuration information, including periodicity 1707 (e.g., 6ms, 8ms, etc.) between synchronization boundaries 1704-1706 and super periodicity 1703 of synchronization super boundaries 1701-1702 (which can be defined as the number n of synchronization boundaries (e.g., n=5, 10, etc.)), each of which is defined relative to GNSS time.

[0161] As reference Fig.15 , 16 and 17 explained and described, Fig.18 A communication burst of the aspects illustrated in may also be defined as the total transmission time of a master device and any associated slave devices, including gaps for switching transmission direction and idle time of a contention window immediately before transmission begins. Fig.18Each communication burst of may not cross more than one synchronization boundary, and when a given node has enough data to transmit, a communication burst associated with that node may not be shorter than a synchronization boundary period, unless the communication burst ends at a synchronization boundary, and if it starts at a synchronization boundary, the communication burst will end at the next synchronization boundary. Fig.18 When one of nodes 1-3 chooses to perform a transmission according to the synchronized transmission configuration, the synchronized node is also limited to transmissions of a length equal to the synchronization period, whether starting at one of the synchronization boundaries 1704-1706 or the synchronization super boundaries 1701 and 1702.

[0162] Communication bursts 1806 and 1807 for synchronized masters (nodes 1 and 3) may not cross synchronization hyperboundary 1702. In the event that there is sufficient data to be transmitted, communication bursts 1800 and 1801 may be equal to the synchronization boundary period between synchronization hyperboundary 1701 and synchronization boundary 1704, unless communication burst 1800 or 1801 ends at synchronization boundary 1704. This alternative may be Fig.18 1806. At synchronization boundary 1704, node 2 obtains access to the shared channel for transmission of communication burst 1802. At the next boundary, namely synchronization boundary 1705, node 1 grabs the shared channel for a short transmission of communication burst 1803 (which ends at 1804). At 1804, the synchronization of the system is lost. When access to the shared communication channel is regained, node 2 transmits to its further length, although not synchronously, but will still be limited to the length of periodicity 1707 equal to that starting at 1804 and ending at 1806. The synchronization nodes, namely nodes 1 and 3, regain access to the shared communication channel at 1806 for transmission of communication bursts 1807 and 1808, respectively, but as synchronization nodes, nodes 1 and 3 must end communication bursts 1807 and 1808 at synchronization super boundary 1702. Node 2 can then contend and obtain access to the shared communication channel for transmission of communication burst 1809. Synchronization is achieved by forcing the synchronization nodes to terminate transmission at each synchronization hyperboundary.

[0163] Those skilled in the art will appreciate that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referred to throughout the above description may be represented by voltage, current, electromagnetic waves, magnetic fields or magnetic particles, optical fields or optical particles, or any combination thereof.

[0164] Figure 5 , 8The functional blocks and modules in , 10 and 14 may include processors, electronic devices, hardware devices, electronic components, logical circuits, memories, software codes, firmware codes, etc., or any combination thereof.

[0165] The technician will further appreciate that the various illustrative logic boxes, modules, circuits, and algorithm steps described in conjunction with the disclosure herein can be implemented as electronic hardware, computer software, or a combination of the two. To clearly explain this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps are generally described in the form of their functionality above. Whether such functionality is implemented as hardware or software depends on the specific application and the design constraints imposed on the overall system. The technician can implement the described functionality in different ways for each specific application, but such implementation decisions should not be interpreted as causing departure from the scope of the present disclosure. The technician will also easily recognize that the order or combination of components, methods, or interactions described herein are only examples and the components, methods, or interactions of various aspects of the present disclosure can be combined or performed in a manner different from those explained and described herein.

[0166] Various aspects of the present disclosure may be implemented in many different ways, including methods, processes, non-transitory computer-readable media having program code recorded thereon, devices having one or more processors with configurations and instructions for performing the described features and functionalities, etc. In a first aspect, implementing such aspects for wireless communications includes: obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines a synchronization contention window and periodicity for synchronization access contention for all access nodes of one or more radio access technologies; identifying, by the wireless node, a next synchronization contention window according to the synchronization boundary configuration using an absolute system timing reference; initiating, by the wireless node, a synchronization contention procedure at the next synchronization contention window; transmitting, by the wireless node, according to a result of the synchronization contention procedure; and returning, by the wireless node, to asynchronous access contention for one or more asynchronous contention windows after the next synchronization contention window and before a subsequent synchronization contention window.

[0167] A second aspect based on the first aspect further comprises: terminating, by the wireless node, all current transmissions on the shared communication channel in response to identification of a next synchronization contention window, wherein initiating a synchronization contention procedure is performed after the cessation.

[0168] A third aspect based on the first aspect, wherein the synchronous access contention according to the obtaining, the identifying, the initiating, the conducting and the returning is performed in response to a predetermined node class of the wireless node, wherein the predetermined node class includes one or more of the following: power class and deployment location.

[0169] A fourth aspect based on the first aspect, wherein the periodicity is defined for one or more maximum channel occupancy times (MCOTs).

[0170] A fifth aspect based on the first aspect, wherein a synchronized contention procedure determines access to a shared communication channel according to one of: a listen-before-talk (LBT) procedure between one or more equal priority wireless nodes of one or more radio access technologies; a rotating priority, wherein one or more wireless nodes of one or more radio access technologies are divided into one or more access groups, wherein a priority sequence rotates between each of the one or more access groups per synchronized contention window; or a fixed priority, wherein a priority access type is assigned to each of one or more priority wireless nodes having high priority traffic, and a low priority access type is assigned to each of one or more nodes not having high priority traffic.

[0171] A sixth aspect based on the fifth aspect, wherein transmitting includes switching access to another shared communication channel for transmission in response to a result of a synchronization contention procedure including a wireless node with a low priority access type detecting that a priority wireless node with a priority access type is contending for a shared communication channel.

[0172] A seventh aspect based on the first aspect, wherein obtaining the synchronization boundary configuration comprises receiving the synchronization boundary configuration from a synchronization initiator node.

[0173] An eighth aspect based on the seventh aspect, wherein the absolute system timing reference is obtained according to one of the following: autonomously determining the absolute system timing reference within the wireless node; receiving the absolute system timing reference from a neighboring node in the same radio access technology as the wireless node; receiving the absolute system timing reference in a separate radio access technology signal received at the wireless node; or monitoring to find the absolute system timing reference in detected signals from different radio access technologies.

[0174] A ninth aspect based on the first aspect further includes: detecting, by the wireless node, the success of the synchronization contention procedure; and transmitting, by the wireless node, a signaling grant to a receiving node, wherein the signaling grant provides the receiving node with resources for transmitting a protection signal before the end of a next synchronization contention window.

[0175] A tenth aspect based on the ninth aspect, wherein the signaling grant further provides the receiving node with a plurality of additional resources for transmitting the protection signal at an interval between a next synchronization contention window and a subsequent synchronization contention window.

[0176] The eleventh aspect of wireless communication includes: obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention for all access nodes of one or more radio access technologies; attempting, by the wireless node, to transmit on the shared communication channel using a synchronization contention procedure at a next synchronization contention window determined according to the synchronization access parameters; configuring, by the wireless node, one or more preferred contention windows between the next synchronization contention window and a subsequent synchronization contention window in response to detecting data for transmission in a buffer of the wireless node; attempting, by the wireless node, access to the shared communication channel for further transmission of data at a next preferred contention window in the one or more preferred contention windows; and terminating, by the wireless node, at a boundary of a subsequent preferred contention window in the one or more preferred contention windows in response to successful access, the further transmission even when a portion of the data remains in the buffer.

[0177] A twelfth aspect is based on the eleventh aspect, wherein the synchronization access parameter further defines the synchronization periodicity between the next synchronization contention window and the subsequent synchronization contention window as a multiple of the maximum channel occupancy time (MCOT) for the shared communication channel, and defines the preferred periodicity between each of the one or more preferred contention windows as a single MCOT.

[0178] The thirteenth aspect based on the eleventh aspect further includes: the wireless node fails to detect the data in the buffer; the wireless node returns to the asynchronous access contention for one or more asynchronous contention windows after the next synchronous contention window and before the subsequent synchronous contention window; the wireless node attempts to use the asynchronous contention procedure to perform other transmissions of new data in the buffer at the next asynchronous contention window in the one or more asynchronous contention windows outside the one or more preferred contention windows; and when there is still remaining data of new data in the buffer at the boundary of the subsequent preferred synchronous contention window, the wireless node continues to perform other transmissions of new data beyond the boundary after the asynchronous contention procedure succeeds.

[0179] The fourteenth aspect of wireless communication includes: obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines a synchronization contention window and periodicity of synchronization access contention for all access nodes of one or more radio access technologies; identifying, by the wireless node, a next synchronization contention window according to the synchronization boundary configuration using an absolute system timing reference; initiating, by the wireless node, a synchronization contention procedure at the next synchronization contention window; transmitting, by the wireless node, using synchronization transmission parameters according to a result of the synchronization contention procedure; and returning, by the wireless node, to asynchronous access contention for one or more asynchronous contention windows after the next synchronization contention window and before a subsequent synchronization contention window.

[0180] A fifteenth aspect based on the fourteenth aspect further includes: the wireless node determines to perform the identification, the initiation and the conduct in response to detecting the communication state of the wireless node identified for synchronous access.

[0181] A sixteenth aspect based on the fifteenth aspect, wherein the communication status includes one or more of the following: a maximum threshold number of failed attempts to access the shared communication channel; or a data buffer being filled with more than a threshold amount of data for transmission.

[0182] A seventeenth aspect based on the fourteenth aspect, wherein the synchronous transmission parameters include one or more of the following: maximum channel occupancy time (MCOT) and backoff window, and wherein the synchronous transmission parameters are more advantageous than the asynchronous transmission parameters used in transmission according to asynchronous access contention.

[0183] An eighteenth aspect of wireless communications includes: obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention for all access nodes of one or more radio access technologies; deriving, by the wireless node, a plurality of synchronization boundaries based on the synchronization access parameters relative to an absolute timing reference, wherein the synchronization access parameters include synchronization boundary positions and periodicity of the plurality of synchronization boundaries; determining, by the wireless node, a condition associated with synchronization operation at the wireless node; initiating, by the wireless node in response to the condition, a synchronization contention procedure during a current synchronization period between a previous synchronization boundary and a next current synchronization boundary at the end of the current synchronization period; participating, by the wireless node in response to the success of the synchronization contention procedure, in a communication burst, wherein the length of the communication burst is set by the wireless node to up to twice the maximum length of the periodicity; and ceasing participation in the communication burst by the wireless node at the next synchronization boundary after the length.

[0184] A nineteenth aspect based on the eighteenth aspect, wherein the communication burst includes: idle time during the synchronization contention procedure; transmission time of the wireless node; reception time of the wireless node; and switching time between the transmission time and the reception time.

[0185] A twentieth aspect based on the eighteenth aspect, wherein the length of the communication burst is defined according to twice a predefined percentage of the periodicity.

[0186] Aspect 21 based on aspect 20 further includes: determining, by the wireless node, an available length of a communication burst, wherein the available length includes an available transmission time between a synchronization contention procedure and a next synchronization boundary; ending the communication burst at the next current synchronization boundary by the wireless node in response to one of the following: the available length exceeds a predefined percentage of twice the periodicity, wherein the participation and the stop are in response to the available length satisfying a predefined percentage of twice the periodicity, and the synchronization contention procedure occurs at the previous synchronization boundary.

[0187] A twenty-second aspect based on the twentieth aspect, wherein the synchronization access parameter further defines a periodic synchronization super-boundary within the plurality of synchronization boundaries with a super-periodicity within the plurality of synchronization boundaries.

[0188] A twenty-third aspect of the twenty-second aspect further includes: the wireless node ends the communication burst at the next synchronization super boundary, regardless of the length set by the wireless node.

[0189] The various illustrative logical blocks, modules, and circuits described in conjunction with the disclosure herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. The processor may also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

[0190] The steps of the method or algorithm described in conjunction with the disclosure of this article can be implemented directly in hardware, in a software module executed by a processor, or in a combination of the two. The software module can reside in a RAM memory, a flash memory, a ROM memory, an EPROM memory, an EEPROM memory, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor so that the processor can read and write information from / to the storage medium. In an alternative, a storage medium can be integrated into a processor. The processor and the storage medium can reside in an ASIC. The ASIC can reside in a user terminal. In an alternative, the processor and the storage medium can reside in a user terminal as discrete components.

[0191] In one or more exemplary designs, the functions described can be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, each function can be stored on or transmitted by a computer-readable medium as one or more instructions or codes. Computer-readable media include both computer storage media and communication media, including any media that facilitates the transfer of a computer program from one place to another. Computer-readable storage media can be any available media that can be accessed by a general or special-purpose computer. As an example and not limitation, such a computer-readable medium may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage or other magnetic storage device, or any other medium that can be used to carry or store the desired program code means in the form of instructions or data structures and can be accessed by a general or special-purpose computer, or a general or special-purpose processor. Moreover, the connection can also be appropriately referred to as a computer-readable medium. For example, if the software is transmitted from a web site, a server, or other remote source using a coaxial cable, a fiber optic cable, a twisted pair, or a digital subscriber line (DSL), the coaxial cable, the fiber optic cable, the twisted pair, or the DSL is included in the definition of the medium. Disk and disc as used herein include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, wherein disk usually reproduces data magnetically, while disc reproduces data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

[0192] As used herein, including in the claims, the term "and / or" used in a list of two or more items means that any of the listed items may be taken alone, or any combination of two or more of the listed items may be taken. For example, if a composition is described as comprising components A, B, and / or C, the composition may comprise only A; only B; only C; a combination of A and B; a combination of A and C; a combination of B and C; or a combination of A, B, and C. Moreover, as used herein, including in the claims, "or" used in a list of items in the context of "at least one of" indicates a disjunctive list, such that, for example, a list of "at least one of A, B, or C" means any of A or B or C or AB or AC or BC or ABC (i.e., A and B and C) or any combination thereof.

[0193] The previous description of the disclosure is provided to enable any person skilled in the art to make or use the disclosure. Various modifications to the disclosure will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other variations without departing from the spirit or scope of the disclosure. Thus, the disclosure is not intended to be limited to the examples and designs described herein, but should be granted the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A wireless communication method, comprising: obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines a synchronization contention window and a periodicity for synchronization access contention for all access nodes of one or more radio access technologies; identifying, by the wireless node, a next synchronization contention window according to the synchronization boundary configuration using an absolute system timing reference; terminating, by the wireless node in response to identifying the next synchronization contention window, all current transmissions on the shared communication channel; initiating, by the wireless node, a synchronization contention procedure at the next synchronization contention window after terminating all current transmissions on the shared communication channel; Transmitting by the wireless node according to the result of the synchronization contention procedure; as well as Returning, by the wireless node, to asynchronous access contention for one or more asynchronous contention windows after the next synchronous contention window and before a subsequent synchronous contention window.

2. The method of claim 1, wherein: The synchronous access contention according to the obtaining, the identifying, the initiating, the conducting, and the returning is performed in response to a predetermined node class of the wireless node, wherein the predetermined node class includes one or more of: power class and deployment location.

3. The method of claim 1, wherein: The periodicity is defined for one or more Maximum Channel Occupancy Times (MCOT).

4. The method of claim 1, wherein: The synchronization contention procedure determines access to the shared communication channel according to one of: a listen-before-talk (LBT) procedure between one or more equal priority wireless nodes of said one or more radio access technologies; rotating priorities, wherein the one or more wireless nodes of the one or more radio access technologies are divided into one or more access groups, wherein a priority sequence rotates between each of the one or more access groups per synchronized contention window; or Fixed priority, wherein a priority access type is assigned to each of one or more priority wireless nodes having high priority traffic, and a low priority access type is assigned to each of one or more nodes not having the high priority traffic.

5. The method of claim 4, wherein: Performing the transmission includes: Access is switched to another shared communication channel for the transmission in response to a result of the synchronization contention procedure including a wireless node with the low priority access type detecting that a priority wireless node with a priority access type is contending for the shared communication channel.

6. The method of claim 1, wherein: Obtaining the synchronization boundary configuration includes receiving the synchronization boundary configuration from a synchronization initiator node.

7. The method of claim 6, wherein: The absolute system timing reference is obtained according to one of the following: autonomously determining the absolute system timing reference within the wireless node; receiving the absolute system timing reference from a neighboring node in the same radio access technology as the wireless node; receiving the absolute system timing reference in a separate radio access technology signal received at the wireless node; or Monitoring for the absolute system timing reference in detected signals from different radio access technologies.

8. The method of claim 1, further comprising: detecting, by the wireless node, success of the synchronization contention procedure; as well as A signaling grant is transmitted by the wireless node to a recipient node, wherein the signaling grant provides the recipient node with resources for transmitting a protection signal before an end of the next synchronization contention window.

9. The method of claim 8, wherein: The signaling grant further provides the recipient node with a plurality of additional resources for transmitting the protection signal at an interval between the next synchronization contention window and the subsequent synchronization contention window.

10. A wireless communication method, comprising: obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention of all access nodes of one or more radio access technologies; attempting, by the wireless node, to transmit on the shared communication channel using a synchronization contention procedure at a next synchronization contention window determined based on the synchronization access parameters; configuring, by the wireless node in response to detecting data for transmission in a buffer of the wireless node, one or more preferred contention windows between the next synchronization contention window and a subsequent synchronization contention window; attempting, by the wireless node, access to the shared communication channel for further transmission of the data at a next preferred contention window of the one or more preferred contention windows; as well as terminating, by the wireless node in response to success of the access, the further transmission at a boundary of a subsequent preferred contention window of the one or more preferred contention windows when a portion of the data remains in the buffer, The synchronization access parameters further define the synchronization periodicity between the next synchronization contention window and the subsequent synchronization contention window as a multiple of the maximum channel occupancy time (MCOT) for the shared communication channel, and define the preferred periodicity between each of the one or more preferred contention windows as a single MCOT.

11. The method of claim 10, further comprising: a failure to detect, by the wireless node, the data in the buffer; returning, by the wireless node, to asynchronous access contention for one or more asynchronous contention windows after the next synchronous contention window and before the subsequent synchronous contention window; attempting, by the wireless node, an additional transmission of new data in the buffer using an asynchronous contention procedure at a next asynchronous contention window of the one or more asynchronous contention windows outside of the one or more preferred contention windows; as well as When there is remaining data of the new data in the buffer at a boundary of the subsequent preferred contention window, continuing the other transmissions of the new data by the wireless node beyond the boundary after the asynchronous contention procedure succeeds.

12. A wireless communication method, comprising: obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines a synchronization contention window and a periodicity for synchronization access contention for all access nodes of one or more radio access technologies; identifying, by the wireless node, a next synchronization contention window according to the synchronization boundary configuration using an absolute system timing reference; terminating, by the wireless node in response to identifying the next synchronization contention window, all current transmissions on the shared communication channel; initiating, by the wireless node, a synchronization contention procedure at the next synchronization contention window after terminating all current transmissions on the shared communication channel; Transmitting by the wireless node using synchronization transmission parameters according to the result of the synchronization contention procedure; as well as Returning, by the wireless node, to asynchronous access contention for one or more asynchronous contention windows after the next synchronous contention window and before a subsequent synchronous contention window.

13. The method of claim 12, further comprising: The identifying, the initiating, and the proceeding are determined to be performed by the wireless node in response to detecting a communication state of the wireless node identified for synchronous access.

14. The method of claim 13, wherein: The communication status includes one or more of the following: a maximum threshold number of failed attempts to access the shared communication channel; or The data buffer is filled beyond a threshold amount of data for transmission.

15. The method of claim 12, wherein: The synchronization transmission parameters include one or more of the following: maximum channel occupancy time (MCOT) and a backoff window, and The synchronous transmission parameters are more favorable than asynchronous transmission parameters used in transmission according to the asynchronous access contention.

16. A wireless communication method, comprising: obtaining, by a wireless node, a synchronization boundary configuration for a shared communication channel, wherein the synchronization boundary configuration defines synchronization access parameters for periodic synchronization access contention of all access nodes of one or more radio access technologies; deriving, by the wireless node relative to an absolute timing reference, a plurality of synchronization boundaries based on the synchronization access parameters, wherein the synchronization access parameters include synchronization boundary positions and periodicity of the plurality of synchronization boundaries; determining, by the wireless node, a condition associated with a synchronization operation at the wireless node; initiating, by the wireless node in response to the condition, a synchronization contention procedure during a current synchronization period between a previous synchronization boundary and a next current synchronization boundary at an end of the current synchronization period; engaging, by the wireless node in response to success of the synchronization contention procedure, in a communication burst, wherein a length of the communication burst is set by the wireless node to be up to twice a maximum length of the periodicity; and Participation in the communication burst is ceased by the wireless node at a next synchronization boundary following the length.

17. The method of claim 16, wherein: The communication burst comprises: idle time during the synchronization contention procedure; The transmission time of the wireless node; The reception time of the wireless node; and The switching time between the transmission time and the reception time.

18. The method of claim 16, wherein: The length of the communication burst is defined according to a predefined percentage of twice the periodicity.

19. The method of claim 18, further comprising: determining, by the wireless node, an available length for the communication burst, wherein the available length comprises an available transmission time between the synchronization contention procedure and the next synchronization boundary; The communication burst is ended, by the wireless node, at the next current synchronization boundary in response to one of: the available length exceeds the predefined percentage of twice the periodicity, wherein the engaging and the stopping are responsive to the available length meeting the predefined percentage of twice the periodicity, and The synchronization contention procedure occurs at the previous synchronization boundary.

20. The method of claim 18, wherein: The synchronization access parameters further define, within the plurality of synchronization boundaries, a periodic synchronization hyperboundary located within the plurality of synchronization boundaries with a hyperperiodicity.

21. The method of claim 20, further comprising: The communication burst is ended by the wireless node at a next synchronization hyperboundary regardless of the length set by the wireless node.

Images