Method and apparatus for scheduling within a cellular network

By scheduling UEs to RBs using RSRP and SINR-based bin adjustments, the method addresses interference inconsistencies in cellular networks, enhancing communication efficiency and reducing interference.

JP2026111559APending Publication Date: 2026-07-03NTT DOCOMO INC

Patent Information

Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
NTT DOCOMO INC
Filing Date
2025-12-23
Publication Date
2026-07-03

AI Technical Summary

Technical Problem

Existing UE scheduling methods fail to accurately account for interference variations, leading to inefficient power control and increased interference between UEs in cellular networks.

Method used

A method for scheduling UEs to resource blocks (RBs) based on local information such as RSRP values and SINR limits, adjusting bin settings to align expected interference with actual interference levels.

Benefits of technology

Improves network performance by reducing unnecessary interference and optimizing power control, resulting in better communication links for UEs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2026111559000001_ABST
    Figure 2026111559000001_ABST
Patent Text Reader

Abstract

This invention provides a system and method for scheduling user equipment (UE) into resource blocks (RB). [Solution] The method in a wireless communication system includes the steps of initializing a base station (BS) without assigning scheduling bins, identifying a new bin setting for the BS, transmitting the new bin setting to the BS, and collecting network data.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001]

[0001] This application claims the benefit of U.S. Provisional Patent Application No. 63 / 738,155, filed on December 23, 2024, entitled "METHODS AND APPARATUS FOR SCHEDULING IN CELLULAR NETWORK", which is hereby incorporated by reference in its entirety.

[0002]

[0002] This disclosure generally relates to wireless technology, and more particularly to techniques for scheduling user equipment (UE) to resource blocks (RB) in relation to power control of the physical uplink shared channel (PUSCH).

Background Art

[0003]

[0003] A telecommunications network is a system that enables the exchange of information between entities or nodes through links. A cellular network is a type of telecommunications network in which the links to end nodes are wireless and the network is distributed across cells in small geographical areas served by at least one fixed-location transceiver (such as a base station: BS). The BS provides cells with network coverage that can be used to transmit voice, data, and other types of content over radio waves. The coverage area of ​​each cell is determined by factors such as the transceiver's power, antenna parameters (antenna height, horizontal and vertical antenna beamwidth, antenna azimuth and tilt, available MIMO configurations, and capabilities, etc.), terrain, and the frequency band used. User equipment (UE) communicates with the network or cells through the BS. Interference between different UEs spanning different BSs can degrade overall system performance. For example, a UE may require higher transmission power from the UE to communicate with a BS, but this may cause more interference with other UEs. [Overview of the Initiative]

[0004]

[0004] Processes, machines, and products for scheduling user equipment (UE) to resource blocks (RB) are described. In some embodiments, a method for scheduling user equipment (UE) to resource blocks (RB) includes the steps of initializing a first base station (BS) without assigning scheduling bins, identifying a new bin setting for the first BS, transmitting the new bin setting to the first BS, and collecting network data.

[0005]

[0005] Other processes, machines, and products are also described herein and may be combined in any number of ways, such as in brief schematic embodiments, without departing from the scope of this disclosure.

[0006]

[0006] This disclosure is not limited to but is illustrated by examples in the accompanying drawings. In the accompanying drawings, similar reference numerals indicate similar elements. To facilitate the identification of a particular element or operation, the most significant digit in the reference numeral refers to the figure number in which the element is first introduced. [Brief explanation of the drawing]

[0007] [Figure 1] This is a diagram illustrating an exemplary wireless communication system according to several embodiments. [Figure 2] This diagram shows a BS or base station (BS) communicating with a user equipment (UE) device, according to several embodiments. [Figure 3] This is an illustrative block diagram of a UE according to several embodiments. [Figure 4] These are exemplary block diagrams of gNB or BS according to several embodiments. [Figure 5] This is an exemplary block diagram of a cellular communication circuit according to several embodiments. [Figure 6] This is an illustrative diagram of several embodiments of an open radio access network (O-RAN) architecture. [Figure 7] This figure shows exemplary resource blocks (RBs) for forming interference according to several embodiments. [Figure 8] These are illustrative diagrams of signals and interference in a UE according to several embodiments. [Figure 9] This diagram schematically illustrates the scheduling of bins for forming interference according to several embodiments. [Figure 10] This diagram schematically illustrates the scheduling of bins for forming interference according to several embodiments. [Figure 11] This figure shows examples of scheduling UEs to bins from the perspective of the BS, according to several embodiments. [Figure 12]This figure shows examples of scheduling UEs to bins from the perspective of the BS, according to several embodiments. [Figure 13] This figure shows examples of scheduling UEs to bins according to several embodiments. [Figure 14A] This figure shows an example of scheduling a UE to a bin when the only condition for scheduling a UE to an upper bin is a positive limit. [Figure 14B] This figure shows an example of scheduling UEs to bins when the condition for scheduling UEs to upper bins is a limit value between 0 and 10. [Figure 14C] This figure shows an example of scheduling UEs to bins when the condition for scheduling UEs to upper bins is a limit value of -5 to 10. [Figure 14D] This figure shows an example of scheduling a UE to a bin when there is no binning, which is the condition for scheduling a UE to the upper bin. [Figure 15A] This figure shows the relationship between the total number of cases where the only condition for scheduling to the upper bin is a positive limit value, and the signal-to-interference + noise ratio (SINR) or signal-to-noise ratio (SNR). [Figure 15B] This figure shows the relationship between the total number of cases where the condition for scheduling to the upper bin is a limit value of 0 to 10, and the signal-to-interference + noise ratio (SINR) or signal-to-noise ratio (SNR). [Figure 15C] This figure shows the relationship between the total number of cases where the conditions for scheduling to the upper bin are within the limit of -5 to 10, and the signal-to-interference + noise ratio (SINR) or signal-to-noise ratio (SNR). [Figure 15D] This figure shows the relationship between the total number of cases where binning is not performed and the signal-to-interference-to-noise ratio (SINR) or signal-to-noise ratio (SNR), which are conditions for scheduling to the upper bin. [Figure 16] This is an illustrative flowchart for scheduling a UE to an RB, according to several embodiments. [Figure 17]FIG. is a diagram illustrating some embodiments of an exemplary process for scheduling a UE to a RB. [Figure 18] FIG. is a diagram illustrating some embodiments of an exemplary process for scheduling a UE to a RB. [Figure 19] FIG. is a diagram illustrating some embodiments of an exemplary process for scheduling a UE to a RB. [Figure 20] FIG. is a diagram illustrating some embodiments of an exemplary process for scheduling a UE to a RB. [Figure 21] FIG. is a diagram illustrating some embodiments of an exemplary process for scheduling a UE to a RB. [Figure 22] FIG. is a diagram illustrating some embodiments of an exemplary process for identifying a new bin setting of a BS. DETAILED DESCRIPTION

[0008]

[0029] In general, the present disclosure describes techniques for scheduling a UE within a mobile network. More specifically, embodiments are directed to techniques for scheduling a UE to a resource bin (RB) such that, in the presence of interference, the interference approaches that of the expected interference. In the following description, numerous specific details are set forth in order to provide a thorough understanding of embodiments of the present disclosure. It will be apparent to one skilled in the art that embodiments of the present disclosure may be practiced without these specific details. In other instances, well-known components, structures, and techniques have not been shown in detail so as not to obscure the understanding of this description.

[0009]

[0030] References to "one embodiment" or "an embodiment" in this specification mean that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the present disclosure. Appearances of the phrase "in one embodiment" in various places in this specification are not necessarily all referring to the same embodiment.

[0010]

[0031] In the following description and claims, the words “combined” and “connected” may be used together with their derivatives. It should be understood that these words are not intended to be synonyms of each other. “Combined” may be used to mean that two or more elements, which may or may not be in direct physical or electrical contact with each other, work together or interact with each other. “Connected” may be used to mean the establishment of communication between two or more elements that are combined with each other.

[0011]

[0032] The process shown in the following diagram is carried out by processing logic that includes hardware (e.g., circuitry, dedicated logic, etc.), software (such as that executed on a general-purpose computer system or a dedicated machine), or a combination of both. While the process is described below as several consecutive operations, it should be noted that some of the operations described may occur in a different order. Furthermore, some operations may occur in parallel rather than sequentially.

[0012]

[0033] The terms “server,” “client,” and “device” are intended to refer generally to a data processing system, rather than specifically to any particular form factor relating to a server, client, and / or device.

[0013]

[0034] In some embodiments, a method for wireless communication by a UE includes the steps of associating with a BS, measuring reference signal received power (RSRP) data, reporting the RSRP data to the BS, and transmitting on an allocated resource block (RB). In some embodiments, the method further includes the steps of receiving a signal from a BS, measuring RSRP data from an adjacent BS, and reporting the RSRP data to the BS. The signal may include one or more of RSRP data and power control. The method may further include the step of associating with a new BS.

[0014]

[0035] In some embodiments, a wireless communication method by a BS for scheduling user equipment (UEs) to resource blocks (RBs) includes the steps of: receiving updated RB bin sizes from a RAN intelligent controller (RIC); receiving reference signal received power (RSRP) data from user equipment (UEs); scheduling UEs that satisfy a certain condition, e.g., neigRSRP-servRSRP≦0, to some group within a particular bin of the resource block (RB); scheduling UEs that satisfy another pre-specified “strong neighbor RSRP” condition, e.g., neigRSRP-servRSRP>0, to some group within a separate pre-specified (e.g., lower) bin of the RB; receiving traffic data; and reporting the traffic data to the RIC. In other words, the techniques disclosed herein include “binning” RB groups such that UEs are scheduled to bins (or other) of an RB group only on the basis of some condition, e.g., neigRSRP-servRSRP>0 or <=0. As used herein, the term "neigRSRP" refers to the RSRP from the UE to the neighboring BS, and the term "servRSRP" refers to the RSRP received by the UE from the first BS.

[0015]

[0036] In some embodiments, a wireless network communication method for scheduling user equipment (UE) to resource blocks (RB) includes the steps of: initializing a base station (BS) without allocating scheduling bins; identifying a new bin setting for the BS; transmitting the new bin setting to the BS; and receiving network data from the BS. In some embodiments, the method includes the steps of updating the bin setting and transmitting the updated bin setting to the BS. The method may further include the steps of maintaining the bin setting and reporting network data to a database.

[0016]

[0037] In some embodiments, the step of identifying a new bin setting for BS is to receive historical measurement reports (MR) for BS A, obtain an estimate of the RB required for the next period (E[RB]_T) for UEs (UE_T) that do not satisfy the "strong neighboring RSRP" condition, e.g., neigRSRP-servRSRP≦0, obtain an estimate of the RB required for the next period (E[RB]_L) for UEs (UE_L) that satisfy the "strong neighboring RSRP" condition, e.g., neigRSRP-servRSRP>0, and assign UE_T using the upper bins, which satisfy the "strong neighboring RSRP" condition. The pre-specified bin for a non-UE (e.g., upper bin) is a contiguous block of RBs of size close to T / (T+L) of all available RBs, where T=|UE_T|*E[RB]_T and L=|UE_L|*E[RB]_L, where |UE_T| contains elements of UE_T and |UE_L| contains elements of UE_L, and the pre-specified bin for a UE (e.g., lower bin) that satisfies the "strong adjacency RSRP", where the two bins do not overlap, and the pre-specified bin for a UE (e.g., lower bin) that satisfies the "strong adjacency RSRP", and the pre-specified bin for a UE (e.g., lower bin) is a contiguous block of RBs of size close to T / (T+L) of all available RBs, where T=|UE_T|*E[RB]_T and L=|UE_L|*E[RB]_L, where |UE_T| contains elements of UE_T and |UE_L| contains elements of UE_L, and the pre-specified bin for a UE (e.g., lower bin) that satisfies the "strong adjacency RSRP", and the pre-specified bin for a UE (e.g., lower bin) is a pre-specified bin for a non-UE that satisfies the "strong adjacency RSRP", where the two bins do not overlap.

[0017]

[0038] Note that in alternative embodiments, instead of using two bins (e.g., upper / lower bins), three or more bins can be used.

[0018]

[0039] In some embodiments, MR includes one or more of the following: resource block (RB) utilization data, servRSRP, neigRSRP, and signal-to-interference-plus-noise ratio (SINR) values. As used herein, “signal-to-interference-and-noise ratio” or “SINR” refers to (signal power) - (interference and noise power). As used herein, “signal-to-noise ratio” or “SNR” refers to (signal power) - (noise power). SINR or SNR may be measured in dB units.

[0019]

[0040] A problem with pseudo-random, round-robin, or any other UE scheduler that does not coordinate UE scheduling across cells is that the interference anticipated by the UE may differ significantly from the actual interference experienced during transmission. Power control fails when the anticipated interference deviates from the actual interference. If interference to a UE being served is underestimated, the UE will consequently have a poor (high-interference) communication link. If interference to a UE being served is overestimated, the transmit power used by the UE will be unnecessarily high, potentially causing unnecessarily high interference to UEs in neighboring cells.

[0020]

[0041] To address the shortcomings of currently available technologies, the technology disclosed herein leverages the use of local information (e.g., RSRP values, SINR limits) to schedule UEs (e.g., bins, RBs) so that the expected magnitude of interference is closer to the actual magnitude, thus leading to significantly better performance. Scheduling can be performed via pseudo-random allocation or guided by channel quality index (CQI) measurement, but the scheduler provided herein may be used in conjunction with any such method to benefit network control.

[0021]

[0042] Figure 1 shows a simplified exemplary wireless communication system in several embodiments. It should be noted that the system in Figure 1 is merely one example of a possible system, and the functions of this disclosure may be implemented in any of the various systems as needed.

[0022]

[0043] As illustrated, an exemplary wireless communication system includes a base station 102A that communicates with one or more user devices 106A, 106B, etc. ~ 106N via a transmission medium. Each user device may also be referred to herein as a “user equipment” (UE) or UE device. Thus, user device 106 is referred to as a UE or UE device.

[0023]

[0044] Base station (BS) 102A may be a base transceiver station (BTS) or a cell site ("cellular base station"), and may include hardware that enables wireless communication with UE106A~106N.

[0024]

[0045] The communication area (or coverage area) of a base station is sometimes referred to as a "cell." Base stations 102A and UE106 may be configured to communicate over a transmission medium using various radio access technologies (RATs), also known as wireless communication technologies, or telecommunication standards, such as GSM®, UMTS (e.g., related to WCDMA® or TD-SCDMA air interfaces), LTE, LTE-Advanced (LTE-A), 5G new radio (5G NR), HSPA, 3GPP® 2 CDMA2000 (e.g., 1xRTT, 1xEV-DO, HRPD, eHRPD), 6G, etc. Note that when base station 102A is implemented in the context of LTE, it may be alternatively referred to as "eNodeB" or "eNB." Note that when base station 102A is implemented in the context of 5G NR, it may be alternatively referred to as "gNodeB" or "gNB." Next-generation eNBs (ng-eNBs) may include advanced versions of eNBs that use a 4G LTE air interface to connect a 5G UE to a 5G core network.

[0025]

[0046] As illustrated, base station 102A may be equipped to communicate with network 100 (e.g., a telecommunications network such as the cellular service provider's core network, the Public Switched Telephone Network (PSTN), and / or the Internet, among various possibilities). Thus, base station 102A may facilitate communication between user devices and / or between user devices and network 100. In particular, cellular base station 102A may provide UEs 106A-N with various telecommunications capabilities such as voice, SMS, and / or data services. In various embodiments, it will be recognized that the term “network” may be used to collectively refer to one or more devices and components that form a telecommunications network. For example, a reference to a network that transmits data to or receives data from a UE may refer to one or more parts of the cellular service provider's core network and / or one or more base stations. In some such examples, the data to be transmitted to the UE may be determined by a component of the core network and then relayed to the UE via a base station. In other such examples, the data to be transmitted to the UE may be determined by a base station and then transmitted to the UE.

[0026]

[0047] Therefore, base stations 102A and other similar base stations (such as base stations 102B...102N) operating according to the same or different cellular communication standards may be provided as a network of cells, which may provide continuous or nearly continuous overlapping services to UE106A~N and similar devices over a geographic area via one or more cellular communication standards.

[0027]

[0048] Therefore, base station 102A may function as a “serving cell” for UEs 106A to 106N as shown in Figure 1, but each UE 106 may also be able to receive signals from (and possibly within their communication range) one or more other cells (which may be provided by base stations 102B to 102N and / or any other base stations), which may also be called “adjacent cells.” Such cells may also facilitate communication between user devices and / or between user devices and the network 100. Such cells may include “macro” cells, “micro” cells, “pico” cells, and / or cells that provide any other granularity of service area size. For example, base stations 102A to 102B shown in Figure 1 may be macrocells, and base station 102N may be a microcell. Other configurations are also possible.

[0028]

[0049] In some embodiments, base station 102A may be a next-generation base station, such as a 5G New Radio (5G NR) base station, or a "gNB". In some embodiments, the BS may be connected to a legacy evolved packet core (EPC) network and / or an NR core (NRC) network. The BS cell may also include one or more transmit and receive points (TRPs). Furthermore, a UE capable of operating according to 5G NR may be connected to one or more TRPs in one or more BSs.

[0029]

[0050] It should be noted that UE106 may be capable of communicating using multiple wireless communication standards. For example, UE106 may be configured to communicate using at least one cellular communication protocol (e.g., GSM®, UMTS (e.g., related to WCDMA or TD-SCDMA air interface), LTE, LTE-A, 5G NR, 6G, HSPA, 3GPP® 2 CDMA2000® (e.g., 1xRTT, 1xEV-DO, HRPD, eHRPD)) in addition to wireless networking (e.g., Wi-Fi) and / or peer-to-peer wireless communication protocols (e.g., Bluetooth®, Wi-Fi® peer-to-peer). UE106 may also be configured to communicate using one or more Global Navigation Satellite Systems (GNSS, e.g., GPS or GLONASS), one or more mobile television broadcasting standards (e.g., ATSC-M / H or DVB-H), and / or any other wireless communication protocols, if necessary. Other combinations of wireless communication standards (including three or more wireless communication standards) are also possible.

[0030]

[0051] Figure 2 shows a UE 106 (e.g., one of devices 106A to 106N) in communication with a base station 102 according to several embodiments. The UE 106 may be a device with cellular communication capabilities, such as a mobile phone, a handheld device, a computer or tablet, or substantially any type of wireless device.

[0031]

[0052] UE106 may include a processor configured to execute program instructions stored in memory. By executing such stored instructions, UE106 may perform any of the functions and / or operations of the embodiments described herein. Alternatively, or additionally, UE106 may include programmable hardware elements, such as an FPGA (Field Programmable Gate Array), configured to perform any of the embodiments described herein, or a portion of any of the embodiments described herein.

[0032]

[0053] UE106 may include one or more antennas for communication using one or more wireless communication protocols or technologies. In some embodiments, UE106 may be configured to communicate using, for example, 5G NR, CDMA2000 (1xRTT / 1xEV-DO / HRPD / eHRPD), 6G, or LTE using a single shared radio, and / or GSM or LTE using a single shared radio. The shared radio may be coupled to a single antenna for wireless communication, or to multiple antennas (e.g., for MIMO). Generally, the radio may include any combination of a baseband processor, analog RF signal processing circuitry (e.g., including filters, mixers, oscillators, amplifiers, etc.), or digital processing circuitry (e.g., for digital modulation and other digital processing). Similarly, the radio may implement one or more receive and transmit chains using the hardware described above. For example, UE106 may share one or more parts of the receive chain and / or transmit chain among the multiple wireless communication technologies described above.

[0033]

[0054] In some embodiments, UE106 may include separate transmit chains and / or receive chains (e.g., separate antennas and other radio components) for each wireless communication protocol it is configured to communicate using. Further possibilities include UE106 including one or more radios shared among multiple wireless communication protocols and one or more radios used exclusively by a single wireless communication protocol. For example, UE106 may include a shared radio for communication using either LTE or 5G NR (or LTE or 1xRTT or LTE or GSM or 6G) and separate radios for communication using Wi-Fi® and Bluetooth®, respectively. Other configurations are also possible.

[0034]

[0055] Figure 3 shows an exemplary simplified block diagram of a UE (communication device) 106 according to several embodiments. It should be noted that the block diagram of the communication device in Figure 3 is only one example of a possible communication device. According to the embodiments, the UE 106 may be, among other things, a user equipment (UE) device, a mobile device or mobile station, a wireless device or wireless station, a desktop computer or computing device, a mobile computing device (e.g., a laptop, notebook, or portable computing device), a tablet, and / or a combination of devices. As shown, the UE 106 may include a set of components 300 configured to perform core functions. For example, this set of components may be implemented as a system-on-a-chip (SOC) which may include parts for various purposes. Alternatively, this set of components 300 may be implemented as separate components or groups of components for various purposes. The set of components 300 may be coupled (e.g., directly or indirectly, in a communicative manner) to various other circuits of the communication device 106.

[0035]

[0056] For example, UE106 may include various types of memory (e.g., including NAND flash 310), input / output interfaces such as connector I / F 320 (for connecting to computer systems, docks, charging cradles, input devices such as microphones, cameras, keyboards, and speakers), a display 360 which may be integrated into or external to the communication device 106, a cellular communication circuit section 330 for 5G NR, LTE, GSM, etc., and a short-to-medium-range wireless communication circuit section 329 (e.g., Bluetooth® and WLAN circuit sections). In some embodiments, UE106 may include a wired communication circuit section (not shown), such as a network interface card for Ethernet®.

[0036]

[0057] The cellular communication circuit 330 may be coupled (for example, directly or indirectly, in a communicative manner) to one or more antennas, such as antennas 335 and 336, as shown in the figure. The short-to-medium-range wireless communication circuit 329 may also be coupled (for example, directly or indirectly, in a communicative manner) to one or more antennas, such as antennas 337 and 338, as shown in the figure. Alternatively, the short-to-medium-range wireless communication circuit 329 may be coupled (for example, directly or indirectly, in a communicative manner) to antennas 335 and 336, in addition to or instead of coupling (for example, directly or indirectly, in a communicative manner) to antennas 337 and 338. The short-to-medium-range wireless communication circuit 329 and / or the cellular communication circuit 330 may include multiple receive chains and / or transmit chains for receiving and / or transmitting multiple spatial streams, such as in a multiple-input multiple output (MIMO) configuration.

[0037]

[0058] In some embodiments, as further described below, the cellular communication circuit 330 may include dedicated receiving chains for multiple radio access techniques (RATs) (including dedicated processors and / or radios, and / or being connected to them directly or indirectly, for example, in a communicative manner) (e.g., a first receiving chain for LTE and a second receiving chain for 5G NR). In addition, in some embodiments, the cellular communication circuit 330 may include a single transmitting chain that can be switched between radios dedicated to specific RATs. For example, the first radio may be dedicated to a first RAT, e.g., LTE, and may be in communication with a dedicated receiving chain and a transmitting chain shared with an additional radio, e.g., a second radio, which may be dedicated to a second RAT, e.g., 5G NR, and may be in communication with a dedicated receiving chain and a shared transmitting chain.

[0038]

[0059] UE106 may also include one or more user interface elements and / or be configured for use with one or more user interface elements. User interface elements may include any of a variety of elements, such as a display 360 (which may be a touchscreen display), a keyboard (which may be a separate keyboard or implemented as part of a touchscreen display), a mouse, a microphone and / or a speaker, one or more cameras, one or more buttons, and / or any of any other elements that can provide information to the user and / or receive or interpret user input.

[0039]

[0060] The UE106 may further include one or more smart cards 345, such as one or more UICC (Universal Integrated Circuit Card) cards 345, which include SIM (Subscriber Identity Module) functionality.

[0040]

[0061] As shown in the figure, the SOC 300 may include a processor 302 which may execute program instructions relating to the UE 106, and a display circuit 304 which may perform graphics processing and provide display signals to the display 360. The processor 302 may also be coupled to a memory management unit (MMU) 340 which may be configured to receive addresses from the processor 302 and translate those addresses to locations in memory (e.g., memory 306, read-only memory (ROM) 350, NAND flash memory 310), and / or to other circuits or devices, such as the display circuit 304, the short-range wireless communication circuit 229, the cellular communication circuit 330, the connector I / F 320, and / or the display 360. The MMU 340 may be configured to perform memory protection and page table translation or setup. In some embodiments, the MMU 340 may be included as part of the processor 302.

[0041]

[0062] As described above, UE106 may be configured to communicate using wireless and / or wired communication circuits. UE106 may be configured to transmit a request to connect to a first network node operating according to a first RAT (e.g., 5G NR, 4G LTE, Bluetooth®, Wi-Fi®, etc.) and to transmit an instruction that the wireless device is capable of maintaining substantially simultaneous connectivity with the first network node and a second network node operating according to a second RAT (e.g., 5G NR, 4G LTE, Bluetooth, Wi-Fi, etc.). The wireless device may also be configured to transmit a request to connect to a second network node. The request may include an instruction that the wireless device is capable of maintaining substantially simultaneous connectivity with the first and second network nodes. Furthermore, the wireless device may be configured to receive an instruction that dual connectivity with the first and second network nodes has been established.

[0042]

[0063] As described herein, UE106 may include hardware and software components that implement the above-described functions for supporting DGL transmission. The processor 302 of UE106 may be configured to implement some or all of the functions described herein by executing program instructions stored, for example, in a memory medium (e.g., a non-temporary computer-readable memory medium). Alternatively (or additionally), the processor 302 may be configured as a programmable hardware element such as an FPGA (Field Programmable Gate Array) or as an ASIC (Application Specific Integrated Circuit). Alternatively (or additionally), the processor 302 of UE106 may be configured to implement some or all of the functions described herein together with one or more of the other components 300, 304, 306, 310, 320, 329, 330, 340, 345, 350, 360.

[0043]

[0064] In addition, as described herein, the processor 302 may include one or more processing elements. Thus, the processor 302 may include one or more integrated circuits (ICs) configured to perform the functions of the processor 302. In addition, each integrated circuit may include circuit sections (e.g., a first circuit section, a second circuit section, etc.) configured to perform the functions of the processor 302.

[0044]

[0065] Furthermore, as described herein, the cellular communication circuit section 330 and the short-range wireless communication circuit section 329 may each include one or more processing elements. In other words, one or more processing elements may be included in the cellular communication circuit section 330, and similarly, one or more processing elements may be included in the short-range wireless communication circuit section 329. Thus, the cellular communication circuit section 330 may include one or more integrated circuits (ICs) configured to perform the functions of the cellular communication circuit section 330. In addition, each integrated circuit may include circuit sections (e.g., a first circuit section, a second circuit section, etc.) configured to perform the functions of the cellular communication circuit section 330. Similarly, the short-range wireless communication circuit section 329 may include one or more ICs configured to perform the functions of the short-range wireless communication circuit section 329. In addition, each integrated circuit may include circuit sections (e.g., a first circuit section, a second circuit section, etc.) configured to perform the functions of the short-range wireless communication circuit section 329.

[0045]

[0066] Figure 4 shows an exemplary block diagram of a base station 102 according to several embodiments. It should be noted that the base station in Figure 4 is only one example of a possible base station. As shown, the base station 102 may include one or more processors 404 that may execute program instructions relating to the base station 102. The processors 404 may also be coupled to a memory management unit (MMU) 440 or to other circuitry or devices, the memory management unit (MMU) 440 may be configured to receive addresses from the processors 404 and translate those addresses to locations in memory (e.g., memory 460 and read-only memory (ROM) 450).

[0046]

[0067] The base station 102 may include at least one network port 470. The network port 470 may be connected to a telephone network and configured to provide access to the telephone network to multiple devices, such as UE devices 106, as described above in Figures 1 and 2.

[0047]

[0068] Network port 470 (or additional network ports) may be further or alternatively configured to connect to a cellular network, such as the core network of a cellular service provider. The core network may provide mobility-related services and / or other services to multiple devices, such as UE device 106. In some cases, network port 470 may be connected to a telephone network via the core network, and / or the core network may provide a telephone network (e.g., between other UE devices serviced by the cellular service provider).

[0048]

[0069] In some embodiments, base station 102 may be a next-generation base station, for example, a 5G New Radio (5G NR) base station, or a “next-generation node B,” “gNodeB,” or “gNB.” In such embodiments, base station 102 may be connected to a legacy Evolved Packet Core (EPC) network and / or NR Core (NRC) network. In addition, base station 102 may be considered a 5G NR cell and may include one or more transmit and receive points (TRPs). In addition, a UE capable of operating according to 5G NR may be connected to one or more TRPs in one or more gNBs.

[0049]

[0070] The base station 102 may include at least one antenna 434, and possibly multiple antennas such as an array of antennas. These antennas may be configured to operate as wireless transceivers and may also be configured to communicate with the UE device 106 via a radio 430. Antenna 434 communicates with the radio 430 via a communication chain 432. The communication chain 432 may be a receive chain, a transmit chain, or both. The radio 430 may be configured to communicate via various wireless communication standards, including, but not limited to, 5G NR, LTE, LTE-A, GSM, UMTS, CDMA2000, Wi-Fi, etc.

[0050]

[0071] The base station 102 may be configured to wirelessly communicate using multiple wireless communication standards. In some examples, the base station 102 may include multiple radios, which may enable the base station 102 to communicate according to multiple wireless communication technologies. For example, one possibility is that the base station 102 includes an LTE radio for communicating according to LTE and a 5G NR radio for communicating according to 5G NR. In such a case, the base station 102 may be capable of operating as both an LTE base station and a 5G NR base station. Another possibility is that the base station 102 includes a multimode radio capable of communicating according to any of the multiple wireless communication technologies (e.g., 5G NR and Wi-Fi, LTE and Wi-Fi, LTE and UMTS, LTE and CDMA2000, UMTS and GSM, etc.).

[0051]

[0072] As further described herein, BS102 may include hardware and software components that implement or assist in the implementation of the functions described herein. The processor 404 of the base station 102 may be configured to implement or assist in the implementation of some or all of the methods described herein by executing program instructions stored, for example, in a memory medium (e.g., a non-temporary computer-readable memory medium). Alternatively, the processor 404 may be configured as a programmable hardware element such as an FPGA (Field Programmable Gate Array), or as an ASIC (Application Specific Integrated Circuit), or a combination thereof. Alternatively (or in addition), the processor 404 of BS102 may be configured together with one or more of the other components 430, 432, 434, 440, 450, 460, 470 to implement or assist in the implementation of some or all of the functions described herein.

[0052]

[0073] In addition, as described herein, the processor 404 may consist of one or more processing elements. In other words, one or more processing elements may be included in the processor 404. Thus, the processor 404 may include one or more integrated circuits (ICs) configured to perform the functions of the processor 404. In addition, each integrated circuit may include circuit sections (e.g., a first circuit section, a second circuit section, etc.) configured to perform the functions of the processor 404.

[0053]

[0074] Furthermore, as described herein, the radio 430 may consist of one or more processing elements. In other words, one or more processing elements may be included in the radio 430. Thus, the radio 430 may include one or more integrated circuits (ICs) configured to perform the functions of the radio 430. In addition, each integrated circuit may include circuit sections (e.g., a first circuit section, a second circuit section, etc.) configured to perform the functions of the radio 430.

[0054]

[0075] Figure 5 shows an exemplary simplified block diagram of the cellular communication circuit in several embodiments. It should be noted that the block diagram of the cellular communication circuit in Figure 5 is only one example of a possible cellular communication circuit. According to the embodiments, the cellular communication circuit 330 may be included in a communication device such as the UE106 described above. As described above, the UE106 may be, among other things, a mobile device or mobile station, a wireless device or wireless station, a desktop computer or computing device, a mobile computing device (e.g., a laptop, notebook, or portable computing device), a tablet, and / or a combination of devices.

[0055]

[0076] The cellular communication circuit unit 330 may be coupled (for example, directly or indirectly, in a communicative manner) to one or more antennas, such as antennas 335a-b and 336, as shown. In some embodiments, the cellular communication circuit unit 330 may include dedicated receiving chains for multiple RATs (including dedicated processors and / or radios, and / or coupled to them, for example, in a communicative manner, directly or indirectly) (for example, a first receiving chain for LTE and a second receiving chain for 5G NR). For example, as shown in Figure 5, the cellular communication circuit unit 330 may include modems 510 and 520. Modem 510 may be configured for communication according to a first RAT, for example, LTE or LTE-A, and modem 520 may be configured for communication according to a second RAT, for example, 5G NR.

[0056]

[0077] As shown in the figure, the modem 510 may include one or more processors 512 and a memory 516 communicating with the processors 512. The modem 510 may also communicate with a radio frequency (RF) front end 530. The RF front end 530 may include circuitry for transmitting and receiving radio signals. For example, the RF front end 530 may include a receiving circuit (RX) 532 and a transmitting circuit (TX) 534. In some embodiments, the receiving circuit 532 may communicate with a downlink (DL) front end 550, which may include circuitry for receiving radio signals via an antenna 335a.

[0057]

[0078] Similarly, the modem 520 may include one or more processors 522 and a memory 526 communicating with the processors 522. The modem 520 may also communicate with an RF front end 540. The RF front end 540 may include circuitry for transmitting and receiving radio signals. For example, the RF front end 540 may include a receiving circuit 542 and a transmitting circuit 544. In some embodiments, the receiving circuit 542 may communicate with a DL front end 560, which may include circuitry for receiving radio signals via an antenna 335b.

[0058]

[0079] In some embodiments, the switch 570 may couple the transmitting circuit 534 to the uplink (UL) front end 572. In addition, the switch 570 may couple the transmitting circuit 544 to the UL front end 572. The UL front end 572 may include a circuit for transmitting radio signals via the antenna 336. Thus, when the cellular communication circuit 330 receives a command to transmit according to a first RAT (e.g., supported via the modem 510), the switch 570 may be switched to a first state in which the modem 510 can transmit signals according to the first RAT (e.g., via a transmission chain including the transmitting circuit 534 and the UL front end 572). Similarly, when the cellular communication circuit 330 receives a command to transmit according to a second RAT (e.g., supported via the modem 520), the switch 570 may be switched to a second state in which the modem 520 can transmit signals according to the second RAT (e.g., via a transmission chain including the transmitting circuit 544 and the UL front end 572).

[0059]

[0080] As described herein, the modem 510 may include hardware and software components for implementing the above functions, or for supporting DGL transmission, and for various other technologies described herein. The processor 512 may be configured to implement some or all of the functions described herein by executing program instructions stored, for example, in a memory medium (e.g., a non-temporary computer-readable memory medium). Alternatively (or in addition), the processor 512 may be configured as a programmable hardware element such as an FPGA (Field Programmable Gate Array) or as an ASIC (Application Specific Integrated Circuit). Alternatively (or in addition), the processor 512 may be configured to implement some or all of the functions described herein together with one or more of the other components 530, 532, 534, 550, 570, 572, 335, and 336.

[0060]

[0081] In addition, as described herein, the processor 512 may include one or more processing elements. Thus, the processor 512 may include one or more integrated circuits (ICs) configured to perform the functions of the processor 512. In addition, each integrated circuit may include circuit sections (e.g., a first circuit section, a second circuit section, etc.) configured to perform the functions of the processor 512.

[0061]

[0082] As described herein, the modem 520 may include hardware and software components for implementing the above-described functions for supporting DGL transmission, as well as various other technologies described herein. The processor 522 may be configured to implement some or all of the functions described herein by executing program instructions stored, for example, in a memory medium (e.g., a non-temporary computer-readable memory medium). Alternatively (or in addition), the processor 522 may be configured as a programmable hardware element such as an FPGA (Field Programmable Gate Array) or as an ASIC (Application Specific Integrated Circuit). Alternatively (or in addition), the processor 522 may be configured to implement some or all of the functions described herein together with one or more of the other components 540, 542, 544, 550, 570, 572, 335, and 336.

[0062]

[0083] In addition, as described herein, the processor 522 may include one or more processing elements. Thus, the processor 522 may include one or more integrated circuits (ICs) configured to perform the functions of the processor 522. In addition, each integrated circuit may include circuit sections (e.g., a first circuit section, a second circuit section, etc.) configured to perform the functions of the processor 522.

[0063]

[0084] Figure 6 shows an illustrative diagram of an open radio access network (O-RAN) architecture. The O-RAN 602 includes a database (DB) 606 containing service requirements 604, a service management and orchestration / non-real-time RAN intelligent (SMO / non-RT RIC) 608, and a quasi-RT RIC 610. The DB 606 contains and controls network log / network traffic and BS (e.g., gNodeB (gNB)) information. The SMO / non-RT RIC 608 performs control policy optimization, parameter optimization, and parameter planning. The quasi-RT RIC 610 controls the RAN and performs UE power control for the PUSCH. As used herein, “PUSCH” refers to the channel used for transmitting data uplink (i.e., from the UE to the BS). As used herein, “power control” refers to controlling the transmission power of the UE. The SMO / non-RT RIC 608 or quasi-RT RIC 610 transmits signals to the BS 616. UE614 is associated with BS616. BS616 transmits quasi-RT-RIC610 data. BS616 also collects data612 such as terminal reports and gNB reports and transmits that data to DB606.

[0064]

[0085] As used herein, E-UTRAN cell identity (ECI) refers to a unique identifier assigned to each individual cell in an LTE network, consisting of an eNodeB ID and a physical cell ID, and acts as a cell ID that enables mobile devices to identify and connect to a specific BS (cell tower) for communication. In some embodiments provided herein, the BS may be the ECI. In some embodiments, the ECI may refer to the BS. Note that, in contrast to ECI, the PCI value of a cell is selected at network planning time and is not part of the ECI value given to the cell. Also, PCI is reused, but ECI is not. One of the goals of allocating PCI within a network is that the PCI is locally unique in any given frequency band.

[0065]

[0086] Figure 7 shows an exemplary resource block (RB) for forming interference. RB702 includes an upper bin 704 and a lower bin 706. When associated with a UE, the BS and controller receive the neigRSRP and servRSRP for each UE. The UE may be scheduled to either the upper bin 704 or the lower bin 706 based on specific measurement data, e.g., RSRP values. In some embodiments, if the BS expects that the UE associated with that BS will produce more interference (e.g., signals of no value to the receiver) than information (e.g., signals of value to the receiver), the BS places that UE in a different RB bin. For example, all UEs for which "0 <= |neigRSRP| - |servRSRP|" is true are assigned to the upper bin 704, and all other UEs are assigned to the lower bin 706.

[0066]

[0087] Figure 8 shows an illustrative diagram of UE signaling and interference. A BS can identify the UE channels associated with that BS and the expected interference. For example, using local information, BS802 knows that the signal from UE808 will cause more interference than it would cause in the network. Using local information, BS804 knows that the signal from UE806 will cause slightly less interference than it would cause in the network. In some embodiments, a BS signals one of its UEs to increase its power to protect against expected interference, which could lead to higher interference elsewhere in the network.

[0067]

[0088] BS can protect the network by separating UEs with signals that generate a lot of interference into RB bins, away from UEs with signals that do not generate a lot of interference. For example, BS802 can separate UE808 into a separate RB bin from UEs whose signals do not generate a lot of interference. BS804 can separate UE806 into a separate RB bin from UEs whose signals are expected to generate a lot of interference.

[0068]

[0089] Figure 9 schematically illustrates bin scheduling for forming interference in several embodiments. In some embodiments, scheduling bins users with similar “neigRSRP-servRSRP” values ​​so that both UEs can reach a SINR of 5 dB (i.e., the combined target limit is close to 10 dB) if interference occurs. These UEs set their power in anticipation of a low or moderate amount of interference power and are likely to experience such interference. In this case, the UEs can be scheduled in the upper bin.

[0069]

[0090] The above 5dB and 10dB values ​​are inferred from network data. These values ​​serve as examples and are not intended to be exact values ​​to be used everywhere. In some other embodiments, other values ​​may be used. In some embodiments, the limit values ​​are defined as follows: Limit value = neigRSRP0 - servRSRP0 + neigRSRP1 - servRSRP1 For example, in the case of UE1, neigRSRP=-70, servRSRP=-60 For example, in the case of UE2, neigRSRP=-92, servRSRP=-88

[0070]

[0091] In some embodiments, UE1 and UE2 are scheduled in the upper bin to accommodate the expected low or moderate interference.

[0071]

[0092] Binning is not about selecting which UEs to interfere with. Instead, binning separates UEs so that the expected interference values ​​are similar to the actual interference values. Within each "bin," the RB allocation can be pseudo-random or follow other existing methods.

[0072]

[0093] Figure 10 schematically illustrates several embodiments of the process for scheduling bins to form interference. Referring to Figure 10, UEs that will generate high interference are binned together, and those UEs set their power in anticipation of high interference power and receive high interference power. In some embodiments, the limits are defined as follows: Limit value = neigRSRP0 - servRSRP0 + neigRSRP1 - servRSRP1 For example, in the case of UE1, neigRSRP=-60, serv_RSRP=-62 For example, in the case of UE2, neigRSRP=-94, servRSRP=-96 UE1 and UE2 are scheduled in the lower bin to accommodate the expected high level of interference.

[0073]

[0094] Figure 11 shows examples of scheduling UEs to bins from the perspective of the BS in several embodiments. In some embodiments, the gNB controlling UE2 schedules some RBs to the upper bins (above the line) for UE2's traffic. Similarly, the gNB schedules some RBs for UE1 and UE2 to the lower bins (below the line) for their traffic.

[0074]

[0095] Figure 12 shows examples of scheduling UEs to bins from the perspective of the BS in several embodiments. In some embodiments, the gNB controlling UE2 and UE3 schedules them to several RBs in the upper bin (above the line). Similarly, the gNB schedules several RBs in the lower bin (below the line) for UE1.

[0075]

[0096] Figure 13 shows examples of scheduling UEs into bins according to several embodiments. In these embodiments, each BS bins UEs such that, if interference occurs, the interference is close to the expected interference. The scheduling provided here does not divide RBs by BS. Each BS uses all available RBs. The allocation of RBs within a bin is assumed to be pseudo-random.

[0076]

[0097] In some embodiments, the thresholds or conditions for scheduling a UE to an upper or lower bin affect the probability of interference and are traffic-dependent. Figures 14A–14D show several embodiments of the exemplary process for scheduling UEs to bins.

[0077]

[0098] In Figure 14A, the only condition for scheduling a UE to the upper bin is a positive limit. In this case, all UEs where |neig_RSRP|-|serv_RSRP|>=0 are scheduled to the upper bin, and all UEs where |neig_RSRP|-|serv_RSRP|<0 are scheduled to the lower bin. Note that in some other embodiments, non-zero values ​​may be used.

[0078]

[0099] In Figure 14B, the condition for scheduling a UE to the upper bin is |neigRSRP|-|serv_RSRP| between 0 and 10. In this case, all UEs where 0 <= |neig_RSRP|-|serv_RSRP| <= 10 are scheduled to the upper bin, and all UEs where |neig_RSRP|-|serv_RSRP| < 0 or |neig_RSRP|-|serv_RSRP| > 10 are scheduled to the lower bin. Note that in some other embodiments, values ​​other than 0 and 10 may be used.

[0079]

[0100] In Figure 14C, the condition for scheduling a UE to the upper bin is |neigRSRP|-|servRSRP| between -5 and 10. In this case, all UEs where -5 <= |neig_RSRP|-|serv_RSRP| <= 10 are scheduled to the upper bin, and all UEs where |neig_RSRP|-|serv_RSRP| < -5 or |neig_RSRP|-|serv_RSRP| > 10 are scheduled to the lower bin. Note that in some other embodiments, values ​​other than "-5" and "10" may be used.

[0080]

[0101] In Figure 14D, binning is not performed.

[0081]

[0102] Figures 15A to 15D show the relationship between the signal-to-interference + noise ratio (SINR) or signal-to-noise ratio (SNR) and the total number of cases for scheduling to the upper bin, under the conditions of positive limit only (Figure 15A), limit of 0 to 10 (Figure 15B), limit of -5 to 10 (Figure 15C), and no binning (Figure 15D), where the limit is |neig_RSRP|-|serv_RSRP|. The local information P, Pmax, and power savings due to power control for each binning schedule are as follows. [Table 1] In some embodiments, schedule control saves 11.8% compared to having only positive limits and having no binning.

[0082]

[0103] Figure 16 shows several embodiments of the process of wireless communication by a UE for scheduling a UE to an RB. Referring to Figure 16, process 1600 of the method of wireless communication by a UE begins with processing block 1602, where processing logic associates the UE with a first BS. Process 1600 continues with processing block 1604, where the processing logic of the UE measures RSRP data to the first BS and reports the RSRP data to the first BS. Process 1600 further continues with processing block 1606, where processing logic transmits at the assigned RB.

[0083]

[0104] Figure 17 shows several embodiments of the process of wireless communication by a UE for scheduling a UE to an RB. Referring to Figure 17, process 1700 of the method of wireless communication by a UE begins with processing block 1702, where the processing logic associates the UE with a first BS. Process 1700 then continues to processing block 1702, where the processing logic of the UE measures RSRP data to the first BS (servRSRP) and reports the RSRP data to the first BS. Process 1700 further continues to processing block 1706, where the processing logic transmits to the assigned RB. Process 1700 then continues to processing block 1708, where the processing logic verifies whether the UE is still associated with the same BS. If the UE is still associated with the same BS, process 1700 moves to processing block 1710, where the processing logic receives signals (e.g., data, control) from the same BS. Process 1700 proceeds to processing block 1712, where the processing logic measures the RSRP to the adjacent BS (neigRSRP), and then in processing block 1704, the processing logic measures the RSRP to the serving BS and reports the neigRSRP and servRSRP to the first BS. If the UE is not yet associated with the same BS, process 1700 moves to processing block 1714, where the processing logic of the UE associates with the new BS. Process 1700 may continue with the steps described herein.

[0084]

[0105] Figure 18 shows several embodiments of the process of wireless communication by BS for scheduling UEs to RB. Referring to Figure 18, process 1800 begins in processing block 1802, where the processing logic receives updated bin sizes from the network (e.g., the RAN Intelligent Controller (RIC)). Process 1800 continues in processing block 1804, where the processing logic receives RSRP data from the UEs, and then in processing block 1806, the processing logic schedules UEs that satisfy the condition neigRSRP-servRSRP ≤ a predetermined value (e.g., 0) to the upper bins of the RB, and UEs that satisfy the condition neigRSRP-servRSRP > a predetermined value (e.g., 0) to the lower bins of the RB. Process 1800 then continues in processing block 1808, where the processing logic receives traffic data, and in processing block 1810, the processing logic reports the traffic data to the network.

[0085]

[0106] Figure 19 shows several embodiments of the process of wireless communication by BS for scheduling UEs to RB. Referring to Figure 19, process 1900 begins in processing block 1902, where the processing logic receives updated bin sizes from RIC. Process 1900 continues in processing block 1904, where the processing logic receives RSRP data from the UEs, and then in processing block 1906, the processing logic schedules UEs that satisfy the condition neigRSRP-servRSRP ≤ a predetermined value (e.g., 0) to the upper bins of the RB, and UEs that satisfy the condition neigRSRP-servRSRP > a predetermined value (e.g., 0) to the lower bins of the RB. Subsequently, in processing block 1908, the processing logic receives traffic data, and in processing block 1910, reports the traffic data to the network. Then, in processing block 1912, the processing logic verifies whether the network has still updated the UE bin allocation. If the network is no longer updating the bins, process 1900 moves to processing block 1914, and the processing logic maintains the bins as they are. If the network is still updating the bins, process 1900 moves to processing block 1902, and the processing logic receives the updated bin sizes from the RIC. Process 1900 may continue with the steps described herein.

[0086]

[0107] It should be noted that scheduling within the bins can follow any other suitable form of scheduling (e.g., pseudo-random, CQI-based, etc.). Data collection may occur faster than the frequency at which data is reported to the RIC. Thus, the process may loop as shown in Figure 19, or data collection may occur faster and / or more frequently than reporting data to the RIC in the process.

[0087]

[0108] Figure 20 shows several embodiments of the process of wireless communication by the network for scheduling a UE to an RB. Referring to Figure 20, process 2000 starts with processing block 2002, where the processing logic initializes the BS without assigning scheduling bins. Process 2000 continues with processing block 2004, where the processing logic identifies a new bin setting for the BS and then, in processing block 2006, sends the new bin setting to the BS. Process 2000 continues with processing block 2008, where the processing logic collects network data (e.g., traffic data and / or RSRP data).

[0088]

[0109] Figure 21 shows several embodiments of the process of wireless communication by the network for scheduling UEs to RBs. Referring to Figure 21, process 2100 starts at processing block 2102, where the processing logic initializes the BS without assigning scheduling bins. Process 2100 continues to processing block 2104, where the processing logic identifies the new bin setting for the BS and then, at processing block 2106, sends the new bin setting to the BS. Process 2100 then continues to processing block 2108, where the processing logic collects network data (e.g., traffic data) and then, at processing block 2110, the processing logic verifies whether the network is still updating the bin assignments for the UEs. If the network is no longer updating the bins, process 2100 moves from processing block 2110 to processing block 2112, where the processing logic maintains the scheduled bins and sends the collected data to the database. If the network is still updating the bin assignments, process 2100 moves from processing block 2110 to processing block 2112, where the processing logic updates the bin settings. Process 2100 then proceeds to processing block 2106, in which the processing logic sends the new bin configuration to BS. Process 2100 may continue with the processing blocks described herein.

[0089]

[0110] Figure 22 shows several embodiments of the process for identifying new bin settings for BS, as shown, for example, in processing block 2104 of Figure 21. Referring to Figure 22, process 2200 begins in processing block 2202, where the processing logic receives historical measurement reports (MRs) for BS A. In some embodiments, the MRs include RB utilization data, servRSRP, neigRSRP, SINR values, or another key performance indicator (KPI) that depends on SINR (e.g., bitrate). Process 2200 continues to processing block 2204, where the processing logic verifies whether all BSs have been examined. If not all BSs have been examined, process 2200 moves to processing block 2206, where the processing logic examines the BS A that have not yet been examined. Process 2200 continues through processing block 2208, where the RIC processing logic obtains an estimate of the required RB for the next period (E[RB]_T) for UEs (UE_T) that satisfy the condition neigRSRP-servRSRP≦0, and an estimate of the required RB for the next period (E[RB]_L) for UEs (UE_L) that satisfy the condition neigRSRP-servRSRP>0. The estimates may be based on data from the previous period or on a more complex function / model. If all BSs have been examined in processing block 2204, process 2200 moves to processing block 2210, where the processing logic schedules bin sizes for all BSs.

[0090]

[0111] In some embodiments, the RIC allocates UE_T using the upper bin, where the upper bin is a contiguous block of RBs of a size close to T / (T+L) of all available RBs.

number

number

number

number

number

number

[0091]

[0112] Note that while the embodiments described herein assign the UE to either the upper or lower bin, in alternative embodiments such assignments may be reversed (e.g., to the lower or upper bin).

[0092]

[0113] The techniques disclosed herein are shown in relation to single-antenna UE and single-antenna BS, but these techniques can also be applied in MIMO settings with appropriate modifications. One simple approach is to translate the MIMO target SINR requirement into a single-antenna (SISO) scenario and directly apply the techniques described herein in that context as well. Another, more attractive option, is to directly consider the effects of a multi-antenna array on reception at a base station. In this case, in some embodiments, multiple signals received across the array can be linearly combined into a single signal having a higher SINR than the signals at each individual antenna element. These are well-known methods in the art, and the techniques disclosed can be applied directly at the output of a linear combiner.

[0093]

[0114] Some of the processes described above may be implemented using logic circuits, such as dedicated logic circuits, or using a microcontroller or other form of processing core that executes program code instructions. Thus, the processes taught in the above description may also be performed by program code, such as machine-executable instructions, that cause the machine executing the instructions to perform a specific function. In this context, “machine” may refer to a machine that translates intermediate (or “abstract”) instructions into processor-specific instructions (e.g., an abstract execution environment such as a “virtual machine” (e.g., Java® virtual machine), an interpreter, a common language runtime, a high-level language virtual machine, etc.), and / or an electronic circuit (e.g., a “logic circuit unit” implemented with transistors) located on a semiconductor chip designed to execute instructions, such as a general-purpose processor and / or a special-purpose processor. The processes taught in the above description may also be performed (as a substitute for or in combination with a machine) by an electronic circuit designed to execute the process (or part thereof) without the execution of program code.

[0094]

[0115] This disclosure also relates to an apparatus for performing the operations described herein. The apparatus may be specifically constructed for the required purpose, or may comprise a general-purpose computer that is selectively operated or reconfigured by a computer program stored in the computer. Such computer programs may be stored on a computer-readable storage medium, which is any type of disk, including but not limited to floppy disks, optical disks, CD-ROMs, and magneto-optical disks, read-only memory (ROM), RAM, EPROM, EEPROM, magnetic or optical cards, or any type of medium suitable for storing electronic instructions, each coupled to a computer system bus.

[0095]

[0116] A machine-readable medium includes any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer). For example, machine-readable media include read-only memory ("ROM"), random-access memory ("RAM"), magnetic disk storage media, optical storage media, flash memory devices, and the like.

[0096]

[0117] A manufactured product may be used to store program code. A manufactured product for storing program code may, but is not limited to, one or more memories (e.g., one or more flash memories, random access memories (static, dynamic, or otherwise)), optical discs, CD-ROMs, DVD-ROMs, EPROMs, EEPROMs, magnetic or optical cards, or other types of machine-readable media suitable for storing electronic instructions. Program code may also be downloaded from a remote computer (e.g., a server) to a requesting computer (e.g., a client) via data signals embodied in a propagation medium (e.g., via a communication link (e.g., a network connection)).

[0097]

[0118] This specification describes several exemplary embodiments.

[0098]

[0119] Example 1 is a method for wireless communication by user equipment (UE). The method includes the steps of associating with a first base station (BS), measuring reference signal received power (RSRP) data, reporting the RSRP data to the first BS, and transmitting on an allocated resource block (RB).

[0099]

[0120] Example 2 is the method of Example 1, further comprising the steps of receiving a signal from a BS, measuring RSRP data to an adjacent BS (neigRSRP), and reporting the RSRP data to a first BS (servRSRP).

[0100]

[0121] Example 3 is the method of Example 2, wherein the signal includes one or more of data and control signals.

[0101]

[0122] Example 4 is the method of Example 1, further including the step of associating it with a new BS.

[0102]

[0123] Example 5 is a user device (UE) having one or more processors configured to operate in one of the ways described in Examples 1 through 5.

[0103]

[0124] Example 6 is a non-temporary machine-readable medium having executable instructions that cause one or more processing units to perform one of the methods in Examples 1 to 5.

[0104]

[0125] Example 7 is a UE baseband processor configured to cause the UE to perform one of the methods in Examples 1-5.

[0105]

[0126] Example 8 is a wireless communication method by a first base station (BS) for scheduling user equipment (UEs) to resource blocks (RBs). The method includes the steps of receiving updated bin sizes from the network, receiving reference signal received power (RSRP) data from the user equipment (UEs), scheduling UEs that satisfy the condition neigRSRP - servRSRP ≤ a predetermined value (e.g., 0) to the upper bins of the resource block (RB), scheduling UEs that satisfy the condition neigRSRP - servRSRP > a predetermined value to the lower bins of the RB, collecting traffic data, and reporting the traffic data to the network. "neigRSRP" is the neighbor RSRP value from the UE to the neighboring BS. "servRSRP" is the serving RSRP value from the UE to the first BS.

[0106]

[0127] Example 9 is a non-temporary, machine-readable medium having executable instructions that cause one or more processing units to perform the method of Example 8.

[0107]

[0128] Example 10 is a network comprising one or more processors configured to operate in the manner of Example 8.

[0108]

[0129] Example 11 is a wireless network communication method for scheduling user equipment (UE) to resource blocks (RB). The method includes the steps of initializing a base station (BS) without allocating scheduling bins, The process includes the steps of identifying a new bin configuration for the first BS, transmitting the new bin configuration to the first BS, and collecting network data.

[0109]

[0130] Example 12 is the method of Example 11, further comprising the steps of updating the bin configuration and sending the updated bin configuration to the BS.

[0110]

[0131] Example 13 is the method of Example 11, further including the steps of maintaining the bin configuration and reporting network data to a database.

[0111]

[0132] Example 14 is one of the methods in Examples 11-13, wherein the steps to identify a new bin setting for BS are: receiving historical measurement reports (MR) for BS A; obtaining an estimated value of the RB required for the next period (E[RB]_T) for UEs (UE_T) that satisfy the condition neigRSRP - servRSRP ≤ a predetermined value (e.g., 0); obtaining an estimated value of the RB required for the next period (E[RB]_L) for UEs (UE_L) that satisfy the condition neigRSRP - servRSRP > a predetermined value, where neigRSRP is the neighbor RSRP value from the UE to the neighboring BS, and servRSRP is the serving RSRP value from the UE to the first BS; and assigning UE_T using the upper bin, where the upper bin is a contiguous block of RBs of a size close to T / (T+L) of all available RBs.

number

number

[0112]

[0133] Example 15 is the method of Example 14, wherein the MR includes one or more of the following: resource block (RB) utilization data, servRSRP, neigRSRP, signal-to-interference-plus-noise ratio (SINR) value, or key performance indicators (KPIs) that depend on SINR.

[0113]

[0134] Example 16 is a non-temporary, machine-readable medium having executable instructions that cause one or more processing units to perform one of the methods in Examples 11 to 15.

[0114]

[0135] Example 17 is a network comprising one or more processors configured to operate in one of the manners described in Examples 1-5.

[0115]

[0136] The detailed descriptions above are presented as algorithms and symbolic representations of operations on data bits in computer memory. These algorithmic descriptions and representations are means used by those skilled in data processing techniques to most effectively communicate the content of their research to others skilled in the art. An algorithm, as used herein and generally, is considered a self-sufficient sequence of actions leading to a desired result. An action is one that requires the physical manipulation of a physical quantity. Usually, but not always, these quantities take the form of electrical or magnetic signals that can be stored, transferred, combined, compared, and otherwise manipulated. Sometimes, particularly because of their widespread use, it has proven convenient to refer to these signals as bits, values, elements, symbols, characters, terms, digits, etc.

[0116]

[0137] However, it should be kept in mind that all such terms and similar terms should be associated with the physical quantities in question and are merely convenient labels applicable to those quantities. As is evident from the above explanation, unless otherwise specified, explanations throughout the explanation that use terms such as “select,” “decide,” “receive,” “form,” “group,” “aggregate,” “generate,” and “remove” refer to the operations and processes of a computer system or similar electronic computing device that manipulate data represented as physical (electronic) quantities within the registers and memory of a computer system to convert it into other data similarly represented as physical quantities within the computer system memory or registers or other such information storage, transmission, or display device.

[0117]

[0138] The processes and representations presented herein are essentially independent of any particular computer or other device. Various general-purpose systems may be used with the programs in accordance with the teachings herein, or it may be convenient to construct more specialized devices for performing the operations described. The structures required for various such systems will become apparent from the following description. In addition, this disclosure is not described with reference to any particular programming language. It will be recognized that various programming languages ​​may be used to carry out the teachings of this disclosure described herein.

[0118]

[0139] It is well understood that the use of personally identifiable information should comply with privacy guidelines and practices that are generally recognized as meeting or exceeding industry or administrative requirements for maintaining user privacy. In particular, personally identifiable information data should be managed and handled in a manner that minimizes the risk of unintended or unauthorized access or use, and the nature of permitted use should be clearly indicated to the user.

[0119]

[0140] The above description merely illustrates some exemplary embodiments of the present disclosure. Those skilled in the art will readily recognize that various modifications can be made from such description, accompanying drawings, and claims without departing from the spirit and scope of the present disclosure.

Claims

1. A wireless communication method over a network for scheduling user equipment (UE) to resource blocks (RB), The steps include initializing the first base station (BS) without allocating scheduling bins, The steps include identifying a new bin setting for the first BS, The steps include sending the new bin configuration to the first BS, Steps to collect network data, A method that includes this.

2. The method according to claim 1, wherein the bin settings transmitted to the first BS constitute the allocation of RBs to UEs by the first BS.

3. The step of updating the bin settings, The steps include sending the updated bin settings to BS, The method according to claim 1, further comprising:

4. The step of maintaining the bin settings, The steps include reporting the aforementioned network data to a database, The method according to claim 1, further comprising:

5. The method according to claim 1, wherein the step of identifying the new bin setting of the BS is performed based on a range of relative RSRP differences between the RSRP of an adjacent cell and the RSRP of a serving cell.

6. The method according to claim 5, wherein the bin setting corresponds to two bins of two different ranges, each having an endpoint that either includes or does not include one predetermined value.

7. The step of identifying the new bin setting of the BS is: Receiving past measurement reports (MR) from BS A, For a UE (UE_T) that satisfies the condition that the RSRP of the adjacent cell (neigRSRP) - the RSRP of the serving cell (servRSRP) ≤ a predetermined value, obtain the estimated value of RB required for the next period (E[RB]_T), For a UE (UE_L) that satisfies the condition neigRSRP - serveRSRP > the predetermined value, obtain the estimated value of RB required for the next period (E[RB]_L), where neigRSRP is the adjacent RSRP value relating to the signal from the UE to the adjacent BS, and serveRSRP is the serving RSRP value relating to the signal from the UE to the first BS. Allocating UE_T using an upper bin, wherein the upper bin is a contiguous block of RBs of a size close to T / (T+L) of all available RBs, [Math 1] and [Math 2] Therefore, |UE_T| contains elements of UE_T, and |UE_L| contains elements of UE_L, and the assignment is as follows: Assigning UE_L using a lower bin, wherein the lower bin is a block other than the upper bin, The method according to claim 1, including the method described in claim 1.

8. The aforementioned MR includes resource block (RB) utilization data, serveRSRP, neigRSRP, signal-to-interference + noise ratio (SINR) value, and key performance indicators (KPIs) that depend on the SINR. The method according to claim 7, comprising one or more of the above.

9. The method according to claim 1, wherein the network data includes at least one of traffic data and RSRP data.

10. A device comprising one or more processors, The aforementioned one or more processors are Initializing the first base station (BS) without assigning scheduling bins, Identifying the new bin settings for the first BS, Send the new bin configuration to the first BS, Collecting network data and A device configured to perform operations including those mentioned above.

11. The apparatus according to claim 10, wherein the bin settings transmitted to the first BS constitute the allocation of RB to UE by the first BS.

12. The aforementioned operation, Updating the aforementioned bin settings, Send the updated bin settings to BS, The apparatus according to claim 11, further comprising:

13. The aforementioned operation, Maintaining the aforementioned bin settings, Report the aforementioned network data to the database, The apparatus according to claim 10, further comprising:

14. The apparatus according to claim 10, wherein identifying a new bin setting for the BS is performed based on the range of relative RSRP differences between the RSRP of an adjacent cell and the RSRP of the serving cell.

15. The apparatus according to claim 14, wherein the bin setting corresponds to two bins of two different ranges, each having an endpoint that includes or does not include one predetermined value.

16. Identifying new bin settings in BS is Receiving past measurement reports (MR) from BS A, For a UE (UE_T) that satisfies the condition that the RSRP of the adjacent cell (neigRSRP) - the RSRP of the serving cell (servRSRP) ≤ a predetermined value, obtain the estimated value of RB required for the next period (E[RB]_T), For a UE (UE_L) that satisfies the condition neigRSRP - serveRSRP > the predetermined value, obtain the estimated value of RB required for the next period (E[RB]_L), where neigRSRP is the adjacent RSRP value from the UE to the adjacent BS, and serveRSRP is the serving RSRP value from the UE to the first BS. Allocating UE_T using an upper bin, wherein the upper bin is a contiguous block of RBs of a size close to T / (T+L) of all available RBs, [Math 3] and [Math 4] Therefore, |UE_T| contains elements of UE_T, and |UE_L| contains elements of UE_L, and the assignment is as follows: Assigning UE_L using a lower bin, wherein the lower bin is a block other than the upper bin, The apparatus according to claim 10, including the following:

17. The aforementioned MR includes resource block (RB) utilization data, serveRSRP, neigRSRP, signal-to-interference + noise ratio (SINR) value, and key performance indicators (KPIs) that depend on the SINR. The apparatus according to claim 16, comprising one or more of the above.

18. The apparatus according to claim 10, wherein the network data includes at least one of traffic data and RSRP data.

19. A binning step of binning resource blocks (RBs) into multiple bins, wherein each bin of the multiple bins specifies a range of radio strength conditions between a UE, a service cell of the UE, and the strongest adjacent cell of the UE; For each UE, the steps include identifying the bin to which the UE belongs, The steps include allocating RB to the UE from the bin to which the UE belongs, How to perform scheduling across a wireless network using [this method].

20. The method according to claim 19, wherein bins are allocated and updated collaboratively across the network by a RAN intelligent controller.