Method and device for scheduling and power allocation in multi-CPU cell-free network

The multi-CPU cell-free network addresses ICI and cell miniaturization issues in high-frequency bands by using distributed scheduling and power allocation based on SLINR, improving edge performance and overall network efficiency for next-generation mobile communication systems.

WO2024232615A1PCT designated stage expired Publication Date: 2024-11-14IND UNIV COOP FOUND HANYANG UNIV ERICA CAMPUS
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
PCT/KR2024/006062
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-05-10
Filing Date
2024-05-07
Publication Date
2024-11-14

AI Technical Summary

Technical Problem

High-frequency bands used in next-generation mobile communication systems, such as mmWave and THz, face challenges with inter-cell interference (ICI) and cell miniaturization, which degrade performance, especially at the cell edge, making it difficult to support services like AR and VR effectively.

Method used

A multi-CPU cell-free network is employed, utilizing distributed scheduling and power allocation based on an auction-based algorithm and signal-to-leakage-interference-plus-noise-ratio (SLINR) to optimize communication and reduce interference across multiple access points (APs), allowing UEs to communicate with multiple APs connected to different CPUs.

Benefits of technology

This approach enhances communication efficiency in high-frequency bands, improves performance for UEs at the cell edge, and maximizes overall network performance by reducing interference and scalability issues, while supporting a larger number of users with stable and efficient data transmission.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure KR2024006062_14112024_PF_FP_ABST
    Figure KR2024006062_14112024_PF_FP_ABST
Patent Text Reader

Abstract

The present specification relates to an AP operation method for performing scheduling and power allocation in a multi-CPU cell-free network, comprising the steps of: receiving a reference signal from one or more UEs; performing channel estimation on the basis of the received reference signal; deriving an SLIMR for each of the one or more UEs on the basis of the channel estimation; and performing scheduling and power allocation on the basis of the derived SLIMR.
Need to check novelty before this filing date? Find Prior Art

Description

Method and device for scheduling and power allocation in a multi-CPU cell-free network

[0001] The present disclosure relates to a method and device for performing scheduling and power allocation in a cell-free network with multiple central processing units (CPUs). Specifically, the present disclosure relates to a method and device for performing scheduling and power allocation in a distributed manner across multiple access points (APs) distributed over a wide area based on multiple CPUs.

[0002] This research was supported by the Samsung Future Technology Promotion Project (Project No. SRFC-TE2103-02).

[0003] Next-generation mobile communication systems are considering higher frequency bands to meet requirements such as enhanced mobile broadband (eMBB) services. 5G mobile communication systems use the mmWave band, and 6G is expected to use the terahertz (THz) band. Higher frequency bands offer wider bandwidths, enabling faster transmission speeds. Therefore, they can satisfy eMBB service requirements and facilitate future support for services such as augmented reality (AR) and virtual reality (VR). However, the physical characteristics of high-frequency bands can deteriorate the radio environment, potentially reducing the size of cells supported by base stations. Furthermore, inter-cell interference (ICI) at the cell edge can be aggravated. To overcome the ICI problem due to the utilization of ultra-high frequency bands and miniaturization of cells, a cell-free system can be considered, and below, a method for performing scheduling and power allocation in a multi-CPU based cell-free network is described.

[0004] [Prior Art Literature]

[0005] [Patent Document]

[0006] (Patent Document 1) International Patent Publication No. 2023-037242A1

[0007] The present specification relates to a method and apparatus for performing scheduling and power allocation in a distributed AP manner in a multi-CPU cell-free network.

[0008] The present specification relates to a method and device for performing scheduling and power allocation in multiple APs distributed over a wide area based on multiple CPUs.

[0009] The present specification relates to a method and apparatus for performing scheduling and power allocation to improve the performance of UEs located in the CPU edge area and the overall network performance.

[0010] The present specification relates to a method and apparatus for performing scheduling using an auction-based algorithm based on SLINR (signal-to-leakage-interference-plus-noise-ratio).

[0011] The present specification relates to a method and apparatus for performing scheduling based on an auction-based algorithm and performing power allocation based on a power allocation algorithm.

[0012] According to one embodiment of the present specification, a method of operating an access point (AP) that performs scheduling and power allocation in a multi-CPU (central processing unit) cell-free network may include the steps of: receiving a reference signal from at least one user equipment (UE); performing channel estimation based on the received reference signal; deriving a signal-to-leakage-interference-plus-noise-ratio (SLINR) for each of at least one UE based on the channel estimation; and performing scheduling and power allocation based on the derived SLINR.

[0013] In addition, according to one embodiment of the present specification, a method for operating a user equipment (UE) that performs scheduling in a multi-CPU (central processing unit) cell-free network may include a step of transmitting a reference signal to an access point (AP), wherein the AP receives the reference signal from at least one UE to perform channel estimation, derives a signal-to-leakage-interference-plus-noise-ratio (SLINR) for each of at least one UE based on the channel estimation, and performs scheduling and power allocation based on the derived SLINR, and when scheduling is performed by the AP, a step of receiving bid information from each of at least one AP including the AP, and a step of determining a set of APs that are to perform communication based on the bid information received from each of the at least one AP.

[0014] In addition, according to one embodiment of the present specification, an access point (AP) that performs scheduling and power allocation in a multi-CPU (central processing unit) cell-free network includes a memory, a transceiver, and a control unit that controls the memory and the transceiver, wherein the control unit controls the transceiver to receive a reference signal from at least one user equipment (UE), performs channel estimation based on the received reference signal, derives a signal-to-leakage-interference-plus-noise-ratio (SLINR) for each of at least one UE based on the channel estimation, and performs scheduling and power allocation based on the derived SLINR.

[0015] In addition, according to one embodiment of the present specification, a user equipment (UE) that performs scheduling in a multi-CPU (central processing unit) cell-free network includes a memory, a transceiver, and a control unit that controls the memory and the transceiver, wherein the control unit controls the transceiver to transmit a reference signal to an access point (AP), wherein the AP receives the reference signal from at least one UE to perform channel estimation, derives a signal-to-leakage-interference-plus-noise-ratio (SLINR) for each of at least one UE based on the channel estimation, performs scheduling and power allocation based on the derived SLINR, and when scheduling is performed by the AP, controls the transceiver to receive bid information from each of at least one AP including the AP, and determines a set of APs to perform communication based on the bid information received from each of the at least one AP.

[0016] Additionally, the following may be commonly applied:

[0017] According to one embodiment of the present disclosure, a multi-CPU cell-free network includes a plurality of CPUs, each of which may be connected to at least one AP based on a fronthaul.

[0018] Additionally, according to one embodiment of the present specification, at least one UE located in a CPU internal area among the plurality of CPUs may communicate with multiple APs connected to any one of the plurality of CPUs, and at least one UE located in a CPU external area among the plurality of UEs may communicate with multiple APs connected to each of the plurality of CPUs.

[0019] Additionally, according to one embodiment of the present disclosure, the AP performs initial scheduling and initial power allocation through the derived SLINR, and when performing the initial scheduling and initial power allocation, the AP may determine an initial scheduling UE set based on a large scale fading coefficient, and allocate the same power to each UE within the initial scheduling UE set.

[0020] In addition, according to one embodiment of the present specification, scheduling may be performed based on an auction-based algorithm after performing initial scheduling and initial power allocation, power allocation may be performed based on the power allocation algorithm, and scheduling and power allocation may be repeated until the entire algorithm converges to a final value. In the case where scheduling is performed based on the auction-based algorithm, the AP transmits to the UE bidding information determined based on the amount of power allocated for the UE and the outflow information derived through the SLINR, and the UE obtains bidding information from each of a plurality of APs to determine a set of at least one AP with which to perform communication, thereby performing scheduling.

[0021] Additionally, according to one embodiment of the present specification, when a set of UEs supported by the AP is determined based on scheduling, the AP may perform power allocation so as to maximize the performance of a UE with the lowest performance among at least one UE included in the set of UEs.

[0022] Additionally, according to one embodiment of the present disclosure, scheduling and power allocation may be repeated until the performance of the UE with the lowest performance based on the entire algorithm converges to a final value at which the performance is maximized.

[0023] Additionally, according to one embodiment of the present specification, the bidding information may be determined based on the amount of power allocated for the UE and the outflow information derived through the SLINR.

[0024] Additionally, according to one embodiment of the present specification, a multi-CPU cell-free network includes a plurality of CPUs, each of which is connected to at least one AP based on a fronthaul, and when a UE is located in an internal area of ​​the CPU, the UE can communicate with a plurality of APs connected to any one of the plurality of CPUs, and when the UE is located in an external area of ​​the CPU, the UE can communicate with a plurality of APs connected to each of the plurality of CPUs.

[0025] This specification has the effect of efficiently performing communication in a high-frequency band by performing scheduling and power allocation in a distributed manner for APs in a multi-CPU cell-free network.

[0026] The present specification has the effect of providing a method for performing scheduling and power allocation in multiple APs distributed over a wide area based on multiple CPUs.

[0027] The present specification has the effect of providing a method for performing scheduling and power allocation that improves the performance of UEs located in the CPU edge area and the overall network performance.

[0028] The present specification has the effect of providing a method for performing scheduling using an auction-based algorithm based on SLINR.

[0029] The present specification can provide a method for performing scheduling based on an auction-based algorithm and performing power allocation based on a power allocation algorithm.

[0030] The effects that can be obtained from this specification are not limited to the effects mentioned above, and other effects that are not mentioned can be clearly understood by a person having ordinary skill in the art to which the present invention pertains from the description below.

[0031] Figure 1 is a diagram illustrating a network environment applied to the present disclosure.

[0032] Figure 2 is a drawing showing a device configuration applied to the present disclosure.

[0033] FIG. 3 is a diagram illustrating a multi-CPU cell-free network applied to the present disclosure.

[0034] Figure 4 is a drawing showing a frame structure applied to the present disclosure.

[0035] FIG. 5 is a diagram illustrating a scheduling and transmission power method applied to the present disclosure.

[0036] FIG. 6 is a flowchart illustrating a scheduling and transmission power method of an AP in a multi-CPU cell-free network applied to the present disclosure.

[0037] FIG. 7 is a flowchart illustrating a UE scheduling and transmission power method in a multi-CPU cell-free network applied to the present disclosure.

[0038] Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. The detailed description set forth below, together with the accompanying drawings, is intended to illustrate exemplary embodiments of the present invention and is not intended to represent the only embodiments in which the present invention may be practiced. The following detailed description includes specific details to provide a thorough understanding of the present invention. However, one of ordinary skill in the art will appreciate that the present invention may be practiced without these specific details.

[0039] The following embodiments combine components and features of the present invention in a predetermined form. Each component or feature may be considered optional unless explicitly stated otherwise. Each component or feature may be implemented without being combined with other components or features. Furthermore, some components and / or features may be combined to form an embodiment of the present invention. The order of operations described in the embodiments of the present invention may be changed. Some components or features of one embodiment may be included in another embodiment or may be replaced with corresponding components or features of another embodiment.

[0040] Specific terms used in the following description are provided to aid in understanding the present invention, and the use of such specific terms may be changed to other forms without departing from the technical spirit of the present invention.

[0041] In some cases, to avoid obscuring the concepts of the present invention, well-known structures and devices are omitted or depicted in block diagram form focusing on the core functions of each structure and device. Furthermore, the same components are described using the same reference numerals throughout this specification.

[0042] Additionally, while the terms "first" and / or "second" may be used herein to describe various components, these components should not be limited by these terms. These terms are only intended to distinguish one component from another; for example, without departing from the scope of the concepts of this specification, a first component may be referred to as a second component, and similarly, a second component may also be referred to as a first component.

[0043] Additionally, throughout the specification, when a part is said to "include" a component, this does not exclude other components, but rather implies the inclusion of other components, unless otherwise specifically stated. Furthermore, terms such as "unit" and "part" used in the specification mean a unit that processes at least one function or operation, which may be implemented by a combination of hardware and / or software.

[0044] Figure 1 is a diagram showing a network environment applied to the present disclosure.

[0045] Referring to FIG. 1, devices (110, 120, 130, 140) may be connected via a network (150). For example, devices (110, 120, 130, 140) may be connected to at least one device or server via a wireless network (150) and may transmit and receive data therethrough. In addition, devices (110, 120, 130, 140, or user devices) may be mobile devices or fixed devices. Specifically, devices (110, 120, 130, 140) may be mobile devices such as smart phones, tablets, or wearable devices. In addition, devices (110, 120, 130, 140) may be fixed devices such as computers, laptops, and PCs. As another example, the devices (110, 120, 130, 140) may be IoT (internet of things) devices, VR (virtual reality) / AR (augmented reality) devices, and other devices, and are not limited to a specific embodiment.

[0046] Additionally, the server may be a device capable of providing content or services by being connected to one or more devices via a network (150). As a specific example, the server may provide services or responses to requests from at least one device connected via the network (150). Here, the server may be linked based on software or applications installed on at least one device, thereby providing services.

[0047] FIG. 2 is a diagram illustrating a device configuration applicable to the present disclosure. Referring to FIG. 2, the device (210) may include a control unit (211), a transceiver unit (212), and a memory (213). Furthermore, the device (210) may further include other configurations in addition to the aforementioned configurations. The device (210) of FIG. 2 may transmit and receive data through communication with another device (220) and may be a user equipment (UE). For example, the device (210) may refer to a smartphone, a smart pad, a laptop, a PC, and other communication-capable devices, but may not be limited to a specific device.

[0048] For example, the control unit (211) of the device (210) may be configured to execute and process commands related to the operation or driving of the device (210). The control unit (211) may be a logical entity that controls the transceiver unit (212) and other components, and is not limited to a specific embodiment. The control unit (211) of the device (210) may be configured to process commands of a computer program by performing arithmetic, logic, and input / output operations. For example, commands may be provided to the control unit (211) based on signals stored in the memory (213) or acquired through the transceiver unit (212), and the control unit (211) may perform operations based thereon.

[0049] The transceiver (212) may provide a function for communicating with at least one of another device (220) and a server via a network. For example, the other device (220) may also include a control unit (221), a transceiver (222), and a memory (223). In addition, the other device (220) may also be the aforementioned smart device, a PC, or other communication-capable device, and is not limited to a specific embodiment.

[0050] In addition, as an example, the device (210) may include an input unit (not shown) and an output unit (not shown). Here, the input unit may be a configuration that provides a keyboard, mouse, touchpad, camera, and other input signals, and the output unit may be a configuration that provides a display, speaker, and other output signals. However, the present invention may not be limited thereto. The external output device may include a device such as a display, speaker, or haptic feedback device.

[0051] The memory (213) is a non-transitory computer-readable recording medium, and may include a permanent mass storage device such as a random access memory (RAM), a read only memory (ROM), a disk drive, a solid state drive (SSD), or a flash memory, and is not limited to a specific form. In addition, the memory (213) may store commands or program codes related to the driving or operation of the device (210). In addition, the operating system or other software of the device (210) may be stored in the memory (213). In addition, as an example, the device (210) may use software loaded from a separate computer-readable recording medium. Here, the computer-readable recording medium may include a floppy drive, a disk, a tape, a DVD / CD-ROM drive, a memory card, and other recording media, and is not limited to a specific embodiment.

[0052]

[0053] The following description is based on a user equipment (UE) as a device (210, 220) of FIG. 2. For example, the UE may perform communication with a base station, an access point (AP), a transmission reception point (TRP), a node, and other devices based on the network of FIG. 1, and may not be limited to a specific embodiment.

[0054] For example, a UE can communicate with a base station based on a conventional mobile communication system. However, in a next-generation wireless communication system, communication can be performed over a high-frequency band based on a new mobile communication system that takes into account eMBB requirements, and communication can be performed with multiple APs configured based on this. Here, an AP can be an entity connected to a CPU and performs wireless communication with a UE, and can be a TRP, node, base station, or other components. However, for convenience of explanation, the following description will be based on an AP.

[0055] For example, cell-free can be a technology that distributes multiple APs connected to a single CPU over a wide area and supports UEs based on cooperation between the multiple APs. That is, in a cell-free network, a UE can communicate with multiple APs to transmit and receive data. For example, in existing mobile communication systems, a UE can communicate with a single base station within the cell coverage set by the base station. On the other hand, a cell-free network can be different from a network that only supports UEs within the range of the base station, such as a existing base station-based cell structure. That is, since multiple APs support UEs simultaneously, the concept of cells can be eliminated, and thus, it can be referred to as a cell-free network. However, a cell-free network is only one name and may not be limited to this. That is, it can be equally applied to a network in which multiple APs support UEs simultaneously, and for convenience of explanation, it is referred to as a cell-free network below.

[0056] Here, in high frequency (or ultra-high frequency) bands, the cell size becomes smaller, and performance may decrease due to the ICI problem described above, but in cell-free networks, this problem can be solved because multiple APs support UEs simultaneously. For example, in existing wireless communication systems (e.g., LTE), technologies to increase throughput through coordinated multi-point (CoMP) and network multi-input multi-output (network MIMO) were applied as cooperative transmission technologies. However, when transmission is performed through multiple transmission points based on CoMP, synchronization between transmission points was an issue, and scalability may also be limited. On the other hand, in cell-free networks, multiple APs connected to a single CPU can be installed over a wide range, which has the advantage of providing stable performance to UEs. For example, a cell-free network may be a network that considers only a single CPU as multiple APs connected to a single CPU.

[0057] In a single-CPU cell-free network architecture, optimal performance can be achieved because a single CPU collects and processes all information from all APs and UEs. However, because it relies on a single CPU, computational complexity can increase exponentially as the number of APs or UEs increases. Considering the above, scalability issues may arise in cell-free networks.

[0058] Below, a method for performing communication based on a multi-CPU cell-free network is described, taking into account the above-described points. More specifically, a method for performing scheduling and power allocation in a multi-CPU cell-free network is described.

[0059] FIG. 3 is a diagram illustrating a multi-CPU cell-free network applicable to the present disclosure. The multi-CPU cell-free network may have a structure in which multiple CPUs are arranged. For example, FIG. 3 considers two CPUs (311, 312), but this is only one example and may not be limited thereto. Here, multiple APs may be connected to the CPUs in a distributed manner, thereby reducing computational complexity and solving the scalability problem. For example, referring to FIG. 3, the CPU (311) connected to some APs (321, 322) and the CPU (312) connected to other APs (323, 324) may be different, thereby reducing computational complexity.

[0060] However, in a multi-CPU cell-free network, the number of APs connected to each CPU decreases, so the CPU radius, which is the range that a single CPU can support, may decrease. When the CPU radius decreases, the CPU-edge area may increase. Here, within the CPU area, multiple APs exist around the UE to support the UE, so performance can be compensated. However, in the CPU-edge area, the number of APs that surround the UE and support the UE decreases, so performance may decrease like in the existing cell-edge area. Here, the performance decrease problem in the CPU-edge area can be solved based on a multiple CPU cooperation method. That is, in FIG. 3, the UE (330) is located in the outer area of ​​each CPU (311, 312), but each AP (321, 322, 324) supports the UE located at the CPU-edge in a distributed manner, so the performance decrease problem can be solved.

[0061] For example, when information is shared among CPUs in a cooperative manner with multiple CPUs, higher performance can be supported. However, scalability issues due to increased computational complexity, similar to the problem of single-CPU cell-free networks, may arise again. Considering the above, a solution may be needed to address the performance degradation issue by supporting UEs in CPU-peripheral areas in a distributed manner from APs. If a distributed AP support method is used to support UEs in CPU-peripheral areas, if signals are transmitted to support all UEs in CPU-peripheral areas, the UEs will receive signals from multiple APs, which may cause interference and degrade performance.

[0062] Therefore, when using a distributed AP support approach to support UEs in CPU periphery areas, interference control measures may be necessary, and scheduling and power allocation methods may be required for this purpose. For example, scheduling may be a technique that determines how each AP will support a UE. Power allocation may then be a technique that determines how much power to provide to the scheduled UEs.

[0063] For example, in a multi-CPU cell-free network, multiple APs can simultaneously transmit data to a UE. Scheduling, then, can be the process of determining which APs will transmit to a specific UE. Since scheduling involves grouping at least one AP to support the UE, scheduling can also be referred to as AP clustering, but is not limited to this term. Furthermore, once scheduling is complete, power allocation can be determined based on a power allocation method associated with data transmission.

[0064] As a specific example, referring to FIG. 3, a UE (330) may perform communication by scheduling multiple APs based on a multi-CPU cell-free network. Here, a first AP (321) may be connected to a first CPU (311) via a fronthaul, and the first AP (321) may be scheduled for communication with the UE (330). On the other hand, a second AP (322) may be connected to the first CPU (311) via a fronthaul, but may not be scheduled for communication with the UE (330). In addition, a third AP (324) may be connected to a second CPU (312) via a fronthaul (340), and the third AP (324) may be scheduled with the UE (330). That is, the UE (330) may select the first AP (321) and the third AP (324) to perform data transmission.

[0065] FIG. 4 is a diagram illustrating a frame structure applicable to the present disclosure. Referring to FIG. 4, the frame may be composed of a channel estimation step (S410), a downlink data transmission step (S420), and an uplink data transmission step (S430). That is, the UE can receive or transmit data through connected APs after confirming the channel through the channel estimation step (S410), scheduling, and allocating power.

[0066] Specifically, the channel estimation step (S410) may be composed of a step (S411) of transmitting a reference signal (pilot) and a step (S412) of performing scheduling and power allocation. For example, in the channel estimation step (S410), the UE may transmit the allocated reference signal to the AP. The AP may perform channel estimation using the reference signal received from the UE. Here, the channel estimation may utilize the minimum mean square error (MMSE) technique.

[0067] More specifically, in a single-CPU cell-free network, all APs are connected to a single CPU, so they can share all information during scheduling and power allocation to derive optimal policies. Conversely, in a multi-CPU cell-free network, information sharing is only possible between APs connected to each CPU. In other words, they cannot perceive information about APs connected to other CPUs. Therefore, APs cannot predict the amount of interference they will experience based on the scheduling and power allocation policies of APs connected to other CPUs, and signal-to-interference-plus-noise ratio (SINR) cannot be used as a performance indicator for interference control. For example, if interference cannot be controlled, performance degradation can occur in the CPU-edge region of a multi-CPU cell-free network, just like in conventional cell-based networks. While a method that cooperatively supports UEs by sharing all information between CPUs can be utilized to address interference control issues, this increases computational complexity, again leading to scalability issues.

[0068] Considering the above, the following proposes a scheduling and power allocation method that operates in a distributed manner across APs. A distributed technique can be one in which scheduling and power allocation are performed independently at each AP without sharing information. Since each AP performs the scheduling and power allocation independently, this technique can be free from scalability issues. However, interference issues can arise due to the inability to identify interference information.

[0069] For example, if a specific AP supports scheduled UEs, the AP can utilize the amount of interference occurring between the UEs and the amount of interference inflicted on other UEs other than the scheduled UEs for interference control. For example, the amount of interference inflicted on other UEs other than the scheduled UEs may be leakage. The AP can perform scheduling and power allocation based on the signal-to-leakage-interference-plus-noise-ratio (SLINR) considering the leakage. That is, the AP can perform scheduling and power allocation by calculating the signal-to-leakage, interference, and noise ratios. As described above, the AP can reduce the amount of interference between scheduled UEs and suppress the amount of leakage inflicted on other UEs. This can improve the overall network performance while preventing UE performance degradation in the peripheral area of ​​the CPU without sharing information between APs connected to different CPUs.

[0070] As a concrete example, AP m This UE k If it supports, SLINR can be as shown in Equation 1 below. In Equation 1, DS m,k is the desired signal, BU m,k is beamforming uncertainty, UI m,k,k' is user-interference from UE within the same CPU, L m,k,k' can mean the amount of leakage to other CPU UEs. Also, ρ m,k is the transmission power at the AP, h m,k is the channel between AP and UE, w m,k represents the beamforming vector.

[0071]

[0072]

[0073] As described above, the AP can perform scheduling and power allocation by deriving SLINR considering the leakage amount. As a specific example, FIG. 5 is a diagram illustrating a scheduling and transmission power method applied to the present disclosure. Referring to FIG. 5, the AP performs channel estimation and derives SLINR based on mathematical expression 1. m,k After calculating, initial scheduling and power allocation can be performed. (S510) Here, initial scheduling is performed for each AP m In UE k β in between m,k This can be done by considering large-scale fading coefficients. For example, each AP m In UE k β in m,k is a certain threshold β th If exceeded, each AP m In UE k can be scheduled to include.

[0074] Additionally, the initial power allocation is AP m This initial scheduling UE set is u m When this is said, it can be set identically for each UE based on the following mathematical expression 2.

[0075]

[0076]

[0077] Here, if scheduling and power allocation are performed simultaneously, there may be limitations to simultaneous solution as it is a non-deterministic polynomial (NP)-hard combinatorial optimization problem. For example, NP problems can be non-deterministic algorithms that must simultaneously consider multiple possibilities at each step of problem solving. Simultaneous scheduling and power allocation can be problematic because they are solved based on multiple possibilities. Considering the above, the AP can be optimized by performing scheduling (S520, S530) followed by power allocation (S540), and the operation can be repeated until convergence.

[0078]

[0079] How to determine scheduling policy

[0080] As mentioned above, APs have limitations in simultaneously performing scheduling and power allocation. Therefore, scheduling may be performed first, followed by power allocation. Scheduling, in this case, may involve each AP deciding which UE to support among multiple UEs. Furthermore, UEs also need to decide which AP to select among multiple APs. In other words, each AP can simultaneously support multiple UEs, and each UE can be supported by multiple APs simultaneously.

[0081] Considering the above, scheduling can be performed based on the overlapping coalition formation game (OCFG). In the OCFG, each player can form a coalition to handle a specific task. Here, players can simultaneously belong to multiple coalitions, and each coalition can invest different amounts of resources and distribute contributions. Each coalition has a value based on the resources invested, and all players can decide which coalition to join and how much resources to invest to maximize the value of their coalitions.

[0082] For example, the OCFG method described above may be introduced for scheduling. Specifically, in an environment where multiple APs and multiple UEs coexist, the OCFC method may be considered so that each AP can support a specific UE. Here, each AP may correspond to a game player in the OCFG method. Furthermore, multiple APs may be selected to communicate with a specific UE. Here, multiple APs may form a coalition to perform communication with a specific UE. Furthermore, multiple APs may support communication with other specific UEs in addition to a specific UE. In other words, each AP may belong to multiple coalitions. In other words, scheduling operations for multiple APs and multiple UEs in a multi-CPU cell-free network may correspond to the OCFG method.

[0083] Here, based on the OCFG method, each AP can determine the optimal solution and perform scheduling operations accordingly. To achieve this, each AP must accurately recognize the value of the association (i.e., the support operation for a specific UE). For this purpose, it may be desirable to share scheduling information among all APs. However, the above-described method may not be suitable because it must be performed every frame, resulting in a significant information sharing burden.

[0084] Considering the above, scheduling may be performed based on an auction-based scheduling algorithm (S520). Here, the auction may be a decision-making method in which multiple bidders submit bids to the auctioneer, and the auctioneer determines the bidder with the highest bid among the multiple bids as the winner of the auction. For example, an auction-based scheduling algorithm may be applied to a multi-CPU cell-free network. More specifically, in a multi-CPU cell-free network, each AP may be a bidder in the auction-based scheduling algorithm, and the UE may be an auctioneer. Here, based on the auction-based scheduling algorithm, each AP may submit bids to the UE, and then the winners of the auction may be determined so that the UE forms a coalition with the highest value. For example, for convenience of explanation, the above-described scheduling may be referred to as auction-based scheduling, but may not be limited thereto. That is, based on each AP, a specific UE may perform scheduling so as to obtain the highest result, but may not be limited to this name. Based on the above, an optimal scheduling policy can be derived while drastically reducing the information sharing load.

[0085] Here, the value of a coalition can be determined based on the signal strength received by a specific UE and the amount of leakage to other UEs. For example, a specific UE may be given a higher value when the signal strength it receives is higher and the amount of leakage to other UEs is lower. Accordingly, the bid submitted by each AP to UEs may be the amount of power allocated to the coalition as resources invested for that specific UE and the amount of leakage at that time. For example, an AP m This UE k The bid submitted to may be as shown in mathematical formula 3.

[0086]

[0087]

[0088] Here, UE k utilizes the received bids to UE k The value of the union can be derived. The value function of the union is the power intensity (ρ k ) and scheduling policy decision maker (Δ k ) and can be expressed as mathematical formula 4.

[0089]

[0090]

[0091] Here is the set of APs that sent bids, and λ m,k is a scheduling policy decision maker that can have a value of 0 or 1. For example, λ m,k If is 0, AP m is UE k It means that it does not support λ m,k If is 1, AP m is UE k This may mean that it supports .

[0092] UE utilizes the collected bids to λ m,k can be combined to increase the value function. That is, each UE maximizes the value of the coalition by λ m,kThe optimal scheduling policy can be derived by solving the problem of finding a combination. The optimization problem of maximizing the value of the coalition can be expressed as Equation 5.

[0093]

[0094]

[0095] Here, the value optimization problem of the union can be transformed into mixed integer fractional programming as shown in the following mathematical expression 6.

[0096]

[0097]

[0098] In mathematical expression 6 And, can be. Based on the above, a solution can be derived through CVX using mixed integer fractional programming in Equation 6. For example, the derived solution (u, G k ) based on λ m,k Find the winner of the final auction can be determined. Also, the set of winners of the auction u m can be used as a scheduling policy. (S530)

[0099]

[0100] How to decide on power allocation policy

[0101] Based on the above-described auction-based scheduling, the set of winners of the auction u m In this case, power can be allocated based on the power allocation algorithm. (S540) Here, AP m The derived scheduling policy u mIt is possible to determine how to distribute power to each UE. For example, if the UE is located in the CPU peripheral area as described above, the performance improvement of the UE and the overall network performance can be considered. To this end, a minimum maximization method that maximizes the performance of the lowest-performance UE can be used, which can be expressed as in Equation 7.

[0102]

[0103]

[0104] At this time, each AP can optimize to ensure uniform performance across all UEs by maximizing the performance of the lowest-performing UE within the scheduling policy. Since the lowest-performing UEs may be located outside the CPU, the performance of UEs located outside the CPU can also be improved. Furthermore, the minimum maximization problem in Equation 7 can be transformed into a maximization problem based on Equation 8 below.

[0105]

[0106]

[0107] Here, the first constraint is the problem of finding the largest γ, and this problem can be solved by finding the optimal γ using the bisection method. For example, the maximization problem in Equation 8 can be transformed into a feasibility problem as shown in Equation 9 below.

[0108]

[0109]

[0110] Here γ candidate is a value given through dichotomization, is the denominator of mathematical expression 1, can be the numerator of mathematical formula 1. That is, γ derived through dichotomy candidate Given this, ρ that can satisfy the constraints mIf we can find even one combination, it can be a solution. Here, the optimal γ candidate To find γ lower Set =0, and γ upper can be set as in mathematical expression 10.

[0111]

[0112]

[0113] Here, γ upper is AP m This UE k This may mean the highest value that can be achieved if no AP supports any UE, except when supporting . After that, , and ρ that can satisfy mathematical expression 9 by using CVX m This can be explored. For example, an optimal power allocation policy is the newly explored ρ m and update with γ lower= γ candidate The lower bound can be raised to γ ​​. On the other hand, if the combination does not exist, γ upper= γ candidate The upper limit can be reduced by the above process. Here, When it converges to this level, it ends and the final power allocation policy is made. can be derived (S550).

[0114]

[0115] FIG. 6 is a flowchart illustrating a scheduling and power transmission method of an AP in a multi-CPU cell-free network applied to the present disclosure. Referring to FIG. 6, an AP performing scheduling and power allocation in a multi-CPU cell-free network may receive a reference signal from at least one UE (S610). Thereafter, the AP may perform channel estimation based on the received reference signal (S620), and may derive an SLINR for each of at least one UE based on the channel estimation (S630). Thereafter, the AP may perform scheduling and power allocation based on the derived SLINR (S640).

[0116] Here, a multi-CPU cell-free network may include multiple CPUs, and each of the multiple CPUs may be connected to at least one AP based on a fronthaul. Furthermore, at least one UE located within a CPU-internal region may communicate with multiple APs connected to any one of the multiple CPUs. Conversely, at least one UE located within a CPU-peripheral region may communicate with multiple APs connected to each of the multiple CPUs. In other words, a UE located within a CPU-peripheral region may communicate with multiple APs based on multiple CPUs.

[0117] For example, the AP can perform initial scheduling and initial power allocation using the derived SLINR. When performing initial scheduling and initial power allocation, the AP can determine an initial scheduled UE set based on a large-scale fading coefficient and allocate equal power to each UE within the initial scheduled UE set, as described above.

[0118] After that, scheduling may be performed based on an auction-based algorithm after performing initial scheduling and initial power allocation. Thereafter, power allocation may be performed based on the power allocation algorithm, and scheduling and power allocation may be repeated until the entire algorithm converges to a final value. Here, as an example, when scheduling is performed based on an auction-based algorithm, the AP may transmit to a specific UE bid information determined based on the amount of power allocated for the UE and the leakage information derived through the SLINR. Here, the specific UE may obtain bid information from each of a plurality of APs, and schedule the UE by determining a set of at least one AP with which to perform communication. In addition, a set of UEs supported by the AP may also be determined based on the above. Here, the AP may perform power allocation so as to maximize the performance of at least one UE with the lowest performance among the UEs included in the set of UEs. As an example, the above-described scheduling and power allocation may be repeated until the performance of the UE with the lowest performance converges to a final value at which the performance of the UE with the lowest performance is maximized based on the entire algorithm, as described above.

[0119] FIG. 7 is a flowchart illustrating a UE scheduling and power transmission method in a multi-CPU cell-free network applicable to the present disclosure. Referring to FIG. 7, a UE may transmit a reference signal to at least one AP (S710). Here, each of at least one AP may perform channel estimation using the reference signal received from the UE and derive an SLINR for each UE based on the channel estimation. Thereafter, the AP may perform scheduling and power allocation based on the derived SLINR.

[0120] When scheduling and power allocation are performed, the UE can receive bid information from at least one AP. (S720) The UE can determine a set of APs to perform communication based on the bid information. (S730) In addition, based on the above, the UE can determine a set of UEs to support the AP.

[0121] For example, a multi-CPU cell-free network may include multiple CPUs, each of which may be connected to at least one AP based on a fronthaul. Furthermore, at least one UE located within a CPU-internal region may communicate with multiple APs connected to any one of the multiple CPUs. Conversely, at least one UE located within a CPU-peripheral region may communicate with multiple APs connected to each of the multiple CPUs. In other words, a UE located within a CPU-peripheral region may communicate with multiple APs based on multiple CPUs.

[0122] For example, the AP can perform initial scheduling and initial power allocation using the derived SLINR. When performing initial scheduling and initial power allocation, the AP can determine an initial scheduled UE set based on a large-scale fading coefficient and allocate equal power to each UE within the initial scheduled UE set, as described above.

[0123] After that, scheduling may be performed based on an auction-based algorithm after performing initial scheduling and initial power allocation. Thereafter, power allocation may be performed based on the power allocation algorithm, and scheduling and power allocation may be repeated until the entire algorithm converges to a final value. Here, as an example, when scheduling is performed based on an auction-based algorithm, the AP may transmit to a specific UE bid information determined based on the amount of power allocated for the UE and the leakage information derived through the SLINR. Here, the specific UE may obtain bid information from each of a plurality of APs, and schedule the UE by determining a set of at least one AP with which to perform communication. In addition, a set of UEs supported by the AP may also be determined based on the above. Here, the AP may perform power allocation so as to maximize the performance of at least one UE with the lowest performance among the UEs included in the set of UEs. As an example, the above-described scheduling and power allocation may be repeated until the performance of the UE with the lowest performance converges to a final value at which the performance of the UE with the lowest performance is maximized based on the entire algorithm, as described above.

[0124]

[0125] The embodiments of the present invention described above may be implemented through various means. For example, the embodiments of the present invention may be implemented through hardware, firmware, software, or a combination thereof.

[0126] In the case of hardware implementation, the method according to embodiments of the present invention may be implemented by one or more ASICs (Application Specific Integrated Circuits), DSPs (Digital Signal Processors), DSPDs (Digital Signal Processing Devices), PLDs (Programmable Logic Devices), FPGAs (Field Programmable Gate Arrays), processors, controllers, microcontrollers, microprocessors, etc.

[0127] When implemented using firmware or software, the methods according to embodiments of the present invention may be implemented in the form of modules, procedures, or functions that perform the functions or operations described above. The software code may be stored in a memory unit and executed by a processor. The memory unit may be located within or outside the processor and may exchange data with the processor using various known means.

[0128] The detailed description of the preferred embodiments of the present invention disclosed as described above has been provided to enable those skilled in the art to implement and practice the present invention. While the present invention has been described above with reference to preferred embodiments, it will be understood by those skilled in the art that various modifications and variations can be made therein without departing from the spirit and scope of the present invention as set forth in the claims below. Accordingly, the present invention is not intended to be limited to the embodiments set forth herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein. Furthermore, while the preferred embodiments of the present specification have been illustrated and described above, the present specification is not limited to the specific embodiments described above, and various modifications may be made by those skilled in the art to which the present invention pertains without departing from the gist of the present specification as claimed in the claims. Furthermore, such modifications should not be understood individually from the technical spirit or perspective of the present specification.

[0129] In addition, both the product invention and the method invention are described in the specification, and the description of both inventions may be applied supplementarily as needed.

[0130]

[0131] [Explanation of symbols]

[0132] 210: Device

[0133] 211: Control unit of the device

[0134] 212: Transmitter and receiver of the device

[0135] 213: Device memory

[0136] 220: Device

[0137] 221: Control unit of the device

[0138] 222: Transmitter and receiver of the device

[0139] 223: Device memory

[0140] 311, 312: Central Control Unit (CPU)

[0141] 321, 322, 323, 324: Access Points (AP)

[0142] 330: User Equipment (UE)

[0143] 340: Front Hall

Claims

1. In a method of operating an access point (AP) that performs scheduling and power allocation in a multi-CPU (central processing unit) cell-free network, A step of receiving a reference signal from at least one user equipment (UE); A step of performing channel estimation based on the received reference signal; A step of deriving a signal-to-leakage-interference-plus-noise-ratio (SLINR) for each of the at least one UE based on the channel estimation; and An AP operation method for performing the scheduling and power allocation based on the above-described SLINR.

2. In paragraph 1, The above multi-CPU cell-free network includes multiple CPUs, An AP operating method, wherein at least one AP is connected to each of the plurality of CPUs based on a fronthaul.

3. In paragraph 2, Among the above at least one UE, a UE located in the CPU internal area performs communication with a plurality of APs connected to one of the plurality of CPUs, An AP operation method, wherein at least one UE located in a CPU peripheral area among the above UEs performs communication with a plurality of APs connected to each of the plurality of CPUs.

4. In paragraph 1, The above AP performs initial scheduling and initial power allocation through the above-described SLINR, An AP operation method in which, when performing the initial scheduling and the initial power allocation, the AP determines an initial scheduling UE set based on a large scale fading coefficient and allocates the same power to each UE within the initial scheduling UE set.

5. In paragraph 4, After performing the initial scheduling and the initial power allocation, the scheduling is performed based on an auction-based algorithm, the power allocation is performed based on a power allocation algorithm, and the scheduling and the power allocation are repeated until the entire algorithm converges to a final value. When the scheduling is performed based on the above auction-based algorithm, the AP transmits to the UE the bidding information determined based on the amount of power allocated for the UE and the outflow information derived through the SLINR, An AP operation method in which the scheduling is performed by the UE obtaining the bidding information from each of a plurality of APs and determining a set of at least one AP to perform communication.

6. In paragraph 5, An AP operation method in which, when a set of UEs supported by the AP is determined based on the scheduling, the AP performs the power allocation so that the performance of a UE with the lowest performance among at least one UE included in the set of UEs is maximized.

7. In paragraph 6, An AP operating method wherein the scheduling and power allocation are repeated until the performance of the UE with the lowest performance based on the overall algorithm converges to the final value at which the performance is maximized.

8. A method for operating a user equipment (UE) that performs scheduling in a multi-CPU (central processing unit) cell-free network, A step of transmitting a reference signal to an access point (AP), wherein the AP receives the reference signal from at least one UE to perform channel estimation, derives a signal-to-leakage-interference-plus-noise-ratio (SLINR) for each of the at least one UE based on the channel estimation, and performs the scheduling and power allocation based on the derived SLINR; When the scheduling is performed by the AP, a step of receiving bidding information from each of at least one AP including the AP; and A UE operation method comprising a step of determining a set of APs to perform communication based on the bidding information received from each of the at least one AP.

9. In paragraph 8, A UE operation method, wherein the bidding information is determined based on the amount of power allocated for the UE and the outflow information derived through the SLINR.

10. In paragraph 8, The above multi-CPU cell-free network includes a plurality of CPUs, each of which is connected to at least one AP based on a fronthaul, When the UE is located in the CPU internal area, the UE communicates with multiple APs connected to one of the multiple CPUs, A UE operation method in which the UE communicates with a plurality of APs connected to each of the plurality of CPUs when the UE is located in a CPU peripheral area.

11. In an access point (AP) that performs scheduling and power allocation in a multi-CPU (central processing unit) cell-free network, memory; Transmitter and receiver; and Including a control unit that controls the above memory and the above transmitter / receiver, The above control unit, Controlling the transceiver to receive a reference signal from at least one user equipment (UE), Perform channel estimation based on the received reference signal, Based on the channel estimation, a signal-to-leakage-interference-plus-noise-ratio (SLINR) for each of the at least one UE is derived, and An AP that performs the scheduling and power allocation based on the above-described SLINR.

12. In paragraph 11, The above multi-CPU cell-free network includes multiple CPUs, Each of the above plurality of CPUs has at least one AP connected based on the fronthaul.

13. In paragraph 12, Among the above at least one UE, a UE located in the CPU internal area performs communication with a plurality of APs connected to one of the plurality of CPUs, An AP in which at least one UE located in a CPU peripheral area among the above UEs communicates with a plurality of APs connected to each of the plurality of CPUs.

14. In paragraph 11, The above AP performs initial scheduling and initial power allocation through the above-described SLINR, When performing the initial scheduling and the initial power allocation, the AP determines an initial scheduling UE set based on a large scale fading coefficient and allocates the same power to each UE within the initial scheduling UE set.

15. In paragraph 14, After performing the initial scheduling and the initial power allocation, the scheduling is performed based on an auction-based algorithm, the power allocation is performed based on a power allocation algorithm, and the scheduling and the power allocation are repeated until the entire algorithm converges to a final value. When the scheduling is performed based on the above auction-based algorithm, the AP transmits to the UE the bidding information determined based on the amount of power allocated for the UE and the outflow information derived through the SLINR, The UE obtains the bidding information from each of a plurality of APs and determines a set of at least one AP with which to perform communication, thereby performing the scheduling.

16. In paragraph 15, An AP operation method in which, when a set of UEs supported by the AP is determined based on the scheduling, the AP performs the power allocation so that the performance of a UE with the lowest performance among at least one UE included in the set of UEs is maximized.

17. In paragraph 16, An AP in which the scheduling and power allocation are repeated until the performance of the UE with the lowest performance converges to the final value at which the performance is maximized based on the overall algorithm.

18. In a user equipment (UE) performing scheduling in a multi-CPU (central processing unit) cell-free network, memory; Transmitter and receiver; and Including a control unit that controls the above memory and the above transmitter / receiver, The above control unit Controlling the transceiver to transmit a reference signal to an access point (AP), wherein the AP receives the reference signal from at least one UE to perform channel estimation, derives a signal-to-leakage-interference-plus-noise-ratio (SLINR) for each of the at least one UE based on the channel estimation, and performs the scheduling and power allocation based on the derived SLINR. When the scheduling is performed by the AP, the transceiver is controlled to receive bidding information from each of at least one AP including the AP, and A UE that determines a set of APs to perform communication based on the bidding information received from each of the at least one AP.

19. In paragraph 18, The above bidding information is determined based on the amount of power allocated for the UE and the outflow information derived through the SLINR.

20. In paragraph 18, The above multi-CPU cell-free network includes a plurality of CPUs, each of which is connected to at least one AP based on a fronthaul, When the UE is located in the CPU internal area, the UE communicates with multiple APs connected to one of the multiple CPUs, When the UE is located in a CPU peripheral area, the UE performs communication with multiple APs connected to each of the multiple CPUs.

Citation Information

Patent Citations

  • System and method of wireless fixed access using a multiple antenna array

    KR101646864B1

  • Convertible seat for vehicle

    KR1020230071267A

  • Manufacturing method of high-quality dog snack using Chaga mushroom.

    KR1020240135130A