A terminal scheduling method and device for load balancing

By using optimization algorithms to schedule data flow and channel power in 5G networks, the problems of channel interference and load imbalance are solved, and load balancing and efficiency improvement of communication systems are achieved.

CN114501660BActive Publication Date: 2024-11-01HANGZHOU WEIMING XINKE TECH CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111482155.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-12-06
Publication Date
2024-11-01
Estimated Expiration
2041-12-06

AI Technical Summary

Technical Problem

The ultra-dense small base station network in 5G networks leads to the same channel frequency band, causing channel interference, and it is difficult for the existing technology to effectively schedule to achieve load balancing and improve communication efficiency.

Method used

A terminal scheduling method for load balancing is proposed. Through the optimization algorithm, the data stream variables, data streams flow through the terminal variables and channel power variables are obtained, the load information of each cellular network is determined, and the target cellular network with unbalanced load is determined, and the geometric planning is carried out. The method optimizes the data flow and channel power, satisfying multiple restrictions to iteratively adjust until the total rate reaches maximum.

Benefits of technology

The load balancing of the communication system is realized, communication efficiency is improved, and channel interference is reduced and network performance is improved through optimal data flow and channel power variable scheduling.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114501660B_ABST
    Figure CN114501660B_ABST
Patent Text Reader

Abstract

The present application relates to the field of communication technology, and more specifically, the present application relates to a terminal scheduling method and device for load balancing. The method includes: obtaining the load information of each cellular network of the communication system; when there is a cellular network with unbalanced load in the load information of each cellular network, determining the target cellular network; and scheduling the target cellular network using an optimization algorithm, wherein the optimization algorithm includes optimized data flow variables, data flow through terminal variables, and channel power variables. The method described in the present application schedules the communication system through an optimized algorithm, and the optimization algorithm includes optimized data flow variables X, data flow through terminal variables D, and channel power variables P. The algorithm is executed while satisfying several constraints until the total rate reaches the maximum, and the optimal solution of X, D and P is obtained. The communication system is scheduled by the optimal variables to achieve load balancing, thereby improving communication efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of communication technology, and more specifically, to a terminal scheduling method and device for load balancing. Background Art

[0002] Like earlier 2G, 3G and 4G mobile networks, 5G networks are digital cellular networks in which the service area covered by the provider is divided into many small geographic areas called cells. Analog signals representing sound and images are digitized in the phone, converted by an analog-to-digital converter and transmitted as a bit stream. All 5G wireless devices in the cell communicate via radio waves with local antenna arrays and low-power automatic transceivers in the cell.

[0003] However, 5G has an ultra-dense small base station network. In this new network, the channel frequency band of each cell is the same, and borrowing channels will cause channel interference. Therefore, a better terminal scheduling method is needed. Summary of the invention

[0004] Based on the above technical problems, in order to solve the problem of better scheduling of communication systems and to achieve load balancing, the present invention proposes a terminal scheduling method for load balancing, which is scheduled through an optimized algorithm. The optimization algorithm includes optimized data flow variables, data flow terminal variables and channel power variables.

[0005] A first aspect of the present invention provides a terminal scheduling method for load balancing, the method comprising:

[0006] Obtaining load information of each cellular network of the communication system;

[0007] When there is a cellular network with unbalanced load in the load information of each cellular network, determining a target cellular network;

[0008] The target cellular network is scheduled using an optimization algorithm, wherein the optimization algorithm includes optimized data flow variables, data flow through terminal variables, and channel power variables.

[0009] Specifically, the optimization algorithm formula is:

[0010]

[0011] Among them, X represents the data flow variable, D represents the data flow through the terminal variable, P represents the channel power variable, r f represents the rate of data flow f; X is given by A matrix composed of d i,fA matrix composed of , where d = 1 means that the end point of data flow f is terminal i, and d = 0 means that the end point of data flow f is not terminal i; P is composed of The matrix composed of represents the channel power from terminal i to terminal j.

[0012] Specifically, the execution steps of the optimization algorithm include:

[0013] S21, initialize X, D, P;

[0014] S22, fix P and optimize X and D by geometric programming method;

[0015] S23, fix X and optimize P by geometric programming method;

[0016] S24. Iterate S22 and S23 until the total rate reaches the maximum and the optimal solution of X, D and P is obtained.

[0017] Furthermore, the execution of the optimization algorithm includes a first constraint, a second constraint, and a third constraint; the first constraint is flow conservation; the second constraint is that the endpoint of each data flow is a base station; the third constraint is that the transmission rate of a data flow from one terminal to another does not exceed a preset threshold.

[0018] Furthermore, the execution of the optimization algorithm also includes a fourth restriction condition, and the fourth restriction condition is that the channel power from terminal i to terminal j does not exceed a preset upper limit value.

[0019] Furthermore, the execution of the optimization algorithm further includes a fifth restriction condition, which is:

[0020]

[0021] Among them, x i,j Indicates whether there is data flow sent from terminal i to terminal j. The formula is:

[0022]

[0023] Among them, f represents a data flow, and F represents a data flow set.

[0024] A second aspect of the present invention provides a terminal scheduling device for load balancing, the device comprising:

[0025] An acquisition module, used to acquire load information of each cellular network of the communication system;

[0026] A determination module, configured to determine a target cellular network when there is a cellular network with an unbalanced load in the load information of each cellular network;

[0027] The scheduling module is used to schedule the target cellular network using an optimization algorithm, wherein the optimization algorithm includes optimized data flow variables, data flow terminal variables and channel power variables.

[0028] A third aspect of the present invention provides a communication system, wherein the communication system applies the load balancing-oriented terminal scheduling method in each embodiment of the present invention.

[0029] A fourth aspect of the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the following steps:

[0030] Obtaining load information of each cellular network of the communication system;

[0031] When there is a cellular network with unbalanced load in the load information of each cellular network, determining a target cellular network;

[0032] The target cellular network is scheduled using an optimization algorithm, wherein the optimization algorithm includes optimized data flow variables, data flow through terminal variables, and channel power variables.

[0033] A fifth aspect of the present invention is a computer program product, comprising a computer program, which, when executed by a processor, implements the following steps:

[0034] Obtaining load information of each cellular network of the communication system;

[0035] When there is a cellular network with unbalanced load in the load information of each cellular network, determining a target cellular network;

[0036] The target cellular network is scheduled using an optimization algorithm, wherein the optimization algorithm includes optimized data flow variables, data flow through terminal variables, and channel power variables.

[0037] The beneficial effects of the present application are as follows: the method described in the present application schedules the communication system through an optimized algorithm, and the optimization algorithm includes an optimized data flow variable X, a data flow terminal variable D, and a channel power variable P. The first step of executing the algorithm is to initialize X, D, and P, the second step is to fix P, and optimize X and D through a geometric programming method, and the third step is to fix X, and optimize P through a geometric programming method, and iteratively execute the second and third steps while satisfying several constraints until the total rate reaches the maximum, and obtain the optimal solution of X, D, and P, that is, the optimal variable, and schedule the communication system through the optimal variable, so as to achieve load balancing and thus improve communication efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] The accompanying drawings, which constitute a part of the specification, illustrate embodiments of the present application and, together with the description, serve to explain the principles of the present application.

[0039] The present application can be more clearly understood from the following detailed description with reference to the accompanying drawings, in which:

[0040] Figure 1 A schematic diagram of the method steps of an exemplary embodiment of the present application is shown;

[0041] Figure 2 A schematic diagram of a communication system according to an exemplary embodiment of the present application is shown;

[0042] Figure 3 A schematic diagram of the device structure of an exemplary embodiment of the present application is shown;

[0043] Figure 4 A schematic diagram of the structure of an electronic device provided by an exemplary embodiment of the present application is shown;

[0044] Figure 5 A schematic diagram of a storage medium provided by an exemplary embodiment of the present application is shown. DETAILED DESCRIPTION

[0045] Hereinafter, embodiments of the present application will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the present application. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present application. It is obvious to those skilled in the art that the present application can be implemented without one or more of these details. In other examples, in order to avoid confusion with the present application, some technical features known in the art are not described.

[0046] It should be noted that the terms used herein are only for describing specific embodiments and are not intended to limit exemplary embodiments according to the present application. As used herein, unless the context clearly indicates otherwise, the singular form is also intended to include the plural form. In addition, it should also be understood that when the terms "comprise" and / or "include" are used in this specification, it indicates the presence of the features, wholes, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or combinations thereof.

[0047] Now, exemplary embodiments according to the present application will be described in more detail with reference to the accompanying drawings. However, these exemplary embodiments may be implemented in a variety of different forms and should not be construed as being limited to the embodiments described herein. The accompanying drawings are not drawn to scale, and certain details may be magnified and certain details may be omitted for the purpose of clear expression. The shapes of the various regions and layers shown in the figures and the relative sizes and positional relationships therebetween are merely exemplary, and may deviate in practice due to manufacturing tolerances or technical limitations, and those skilled in the art may additionally design regions / layers with different shapes, sizes, and relative positions according to actual needs.

[0048] The following is attached to the instruction manual Figure 1-5 Several embodiments are given to describe exemplary implementations according to the present application. It should be noted that the following application scenarios are only shown to facilitate understanding of the spirit and principles of the present application, and the implementations of the present application are not limited in this regard. On the contrary, the implementations of the present application can be applied to any applicable scenario.

[0049] Embodiment 1:

[0050] This embodiment implements a terminal scheduling method for load balancing, and the method includes the following steps:

[0051] S1. Obtaining load information of each cellular network of the communication system;

[0052] S2. When there is a cellular network with unbalanced load in the load information of each cellular network, determining a target cellular network;

[0053] S3. Using an optimization algorithm to schedule the target cellular network, wherein the optimization algorithm includes optimized data flow variables, data flow through terminal variables, and channel power variables.

[0054] Specifically, the optimization algorithm formula is:

[0055]

[0056] Among them, X represents the data flow variable, D represents the data flow through the terminal variable, P represents the channel power variable, r f represents the rate of data flow f; X is given by A matrix composed of d i,f A matrix composed of , where d = 1 means that the end point of data flow f is terminal i, and d = 0 means that the end point of data flow f is not terminal i; P is composed of The matrix composed of represents the channel power from terminal i to terminal j.

[0057] Specifically, the execution steps of the optimization algorithm include:

[0058] S21, initialize X, D, P;

[0059] S22, fix P and optimize X and D by geometric programming method;

[0060] S23, fix X and optimize P by geometric programming method;

[0061] S24. Iterate S22 and S23 until the total rate reaches the maximum and the optimal solution of X, D and P is obtained.

[0062] Furthermore, the execution of the optimization algorithm includes a first constraint, a second constraint, and a third constraint; the first constraint is flow conservation; the second constraint is that the endpoint of each data flow is a base station; the third constraint is that the transmission rate of a data flow from one terminal to another does not exceed a preset threshold.

[0063] Furthermore, the execution of the optimization algorithm also includes a fourth restriction condition, and the fourth restriction condition is that the channel power from terminal i to terminal j does not exceed a preset upper limit value.

[0064] Furthermore, the execution of the optimization algorithm further includes a fifth restriction condition, which is:

[0065]

[0066] Among them, x i,j Indicates whether there is data flow sent from terminal i to terminal j. The formula is:

[0067]

[0068] Among them, f represents a data flow, and F represents a data flow set.

[0069] Embodiment 2:

[0070] This embodiment implements a terminal scheduling method for load balancing, which includes the following steps: acquiring load information of each cellular network of the communication system; when there is a load-unbalanced cellular network in the load information of each cellular network, determining a target cellular network; and scheduling the target cellular network using an optimization algorithm, wherein the optimization algorithm includes optimized data flow variables, data flow terminal variables, and channel power variables.

[0071] Figure 2 is a schematic diagram of a communication system, such as Figure 2As shown in the figure, the communication system is composed of multiple cellular networks, which are what we usually call service cells. Each service cell has a base station and multiple users, and the users here are also terminals. The load balancing state of the communication system is represented by the total rate of all data flows. When the total rate reaches the maximum, the system achieves the optimal load balancing state. The network nodes through which the data flow is sent from the terminal to the base station, for example, data flow 1 passes through "terminal 1-terminal 2-base station 2", optimizing the nodes through which all data flows pass can achieve load balancing optimization, that is, realize the load balancing of the communication system.

[0072] Specifically, the optimization algorithm formula is:

[0073]

[0074] Among them, X represents the data flow variable, D represents the data flow through the terminal variable, P represents the channel power variable, r f represents the rate of data flow f; X is given by A matrix composed of d i,f A matrix composed of , where d = 1 means that the end point of data flow f is terminal i, and d = 0 means that the end point of data flow f is not terminal i; P is composed of The matrix composed of represents the channel power from terminal i to terminal j.

[0075] Specifically, the execution steps of the optimization algorithm include:

[0076] S21, initialize X, D, P;

[0077] S22, fix P and optimize X and D by geometric programming method;

[0078] S23, fix X and optimize P by geometric programming method;

[0079] S24. Iterate S22 and S23 until the total rate reaches the maximum and the optimal solution of X, D and P is obtained.

[0080] In a preferred embodiment, the constraints for executing the optimization algorithm include (a)-(g):

[0081] (a)

[0082]

[0083] (a) represents flow conservation. represents the rate at which data stream f is sent from user i to user j, N irepresents the neighboring users of user i (neighboring users can transmit data with user i), s i,f Indicates whether the starting point of data stream f is user i (s=1 indicates that the starting point of data stream f is user i, s=0 indicates that the starting point of data stream f is not user i), and M indicates the set of users.

[0084] (b)

[0085] (b) indicates that the end point of each data flow is a base station (rather than a user), B indicates a set of base stations, f indicates a data flow, and F indicates a set of data flows.

[0086] (c)

[0087] (c) represents the rate limit of the data flow, R i,j represents the upper limit of the data rate from user i to user j.

[0088] (d)

[0089] (d) Indicates whether there is a data flow sent from user i to user j.

[0090] (ee)

[0091] (e) represents the transmission power limitation, P1 represents the upper power limit, and K represents the set of channels.

[0092] (f)

[0093] (f) indicates that the data flow consists of various branches.

[0094] (g)

[0095] (g) represents the value range of each variable, d i,f Indicates whether there is a data stream sent from terminal i to terminal j. If yes, the value is 1, otherwise, the value is 0. Figure 2 As shown, here terminal i and terminal j also represent user i and user j.

[0096] The method described in the present application schedules the communication system through an optimized algorithm, and the optimization algorithm includes an optimized data flow variable X, a data flow terminal variable D, and a channel power variable P. The first step of executing the algorithm is to initialize X, D, and P, the second step is to fix P, and optimize X and D through a geometric programming method, and the third step is to fix X and optimize P through a geometric programming method. The second and third steps are iteratively executed while satisfying several constraints until the total rate reaches the maximum, and the optimal solution of X, D, and P, that is, the optimal variable, is obtained. The communication system is scheduled by the optimal variable, which can achieve load balancing and thus improve communication efficiency.

[0097] Embodiment 3:

[0098] This embodiment provides a terminal scheduling device for load balancing. Figure 3 As shown, the device comprises:

[0099] An acquisition module 301 is used to acquire load information of each cellular network of a communication system;

[0100] A determination module 302, configured to determine a target cellular network when there is a cellular network with an unbalanced load in the load information of each cellular network;

[0101] The scheduling module 303 is used to schedule the target cellular network using an optimization algorithm, wherein the optimization algorithm includes optimized data flow variables, data flow terminal variables and channel power variables.

[0102] Embodiment 4:

[0103] This embodiment provides a communication system, which applies the terminal scheduling method for load balancing in each implementation manner of the present application, and the communication system is preferably a 5G communication system.

[0104] Please refer to the following Figure 4 , which shows a schematic diagram of an electronic device provided by some embodiments of the present application. Figure 4 As shown, the electronic device 2 includes: a processor 200, a memory 201, a bus 202 and a communication interface 203, and the processor 200, the communication interface 203 and the memory 201 are connected via the bus 202; the memory 201 stores a computer program that can be run on the processor 200, and when the processor 200 runs the computer program, it executes the load balancing-oriented terminal scheduling method provided in any of the aforementioned embodiments of the present application, and the electronic device can be an electronic device with a touch-sensitive display.

[0105] The memory 201 may include a high-speed random access memory (RAM), and may also include a non-volatile memory, such as at least one disk memory. The communication connection between the system network element and at least one other network element is realized through at least one communication interface 203 (which may be wired or wireless), and the Internet, wide area network, local area network, metropolitan area network, etc. may be used.

[0106] The bus 202 may be an ISA bus, a PCI bus, or an EISA bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc. The memory 201 is used to store a program, and the processor 200 executes the program after receiving an execution instruction. The load balancing-oriented terminal scheduling method disclosed in any implementation of the embodiment of the present application may be applied to the processor 200, or implemented by the processor 200.

[0107] The processor 200 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the hardware integrated logic circuit or software instructions in the processor 200. The above processor 200 can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a readily available programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiments of the present application can be directly embodied as a hardware decoding processor to be executed, or the hardware and software modules in the decoding processor can be executed. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory 201, and the processor 200 reads the information in the memory 201 and completes the steps of the above method in combination with its hardware.

[0108] The electronic device provided in the embodiment of the present application and the terminal scheduling method for load balancing provided in the embodiment of the present application are based on the same inventive concept and have the same beneficial effects as the methods adopted, run or implemented therein.

[0109] The present application also provides a computer-readable storage medium corresponding to the load balancing-oriented terminal scheduling method provided in the above-mentioned embodiment. Figure 5 , Figure 5 The computer-readable storage medium shown is an optical disc 30 on which a computer program (ie, a program product) is stored. When the computer program is executed by a processor, the terminal scheduling method for load balancing provided in any of the aforementioned embodiments is executed.

[0110] In addition, examples of the computer-readable storage medium may also include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other optical or magnetic storage media, which are not listed here one by one.

[0111] The computer-readable storage medium provided in the above-mentioned embodiments of the present application and the method for allocating channels for quantum key distribution in a space-division multiplexed optical network provided in the embodiments of the present application are based on the same inventive concept and have the same beneficial effects as the methods adopted, run or implemented by the application programs stored therein.

[0112] The present application also provides a computer program product, including a computer program, which, when executed by a processor, implements the steps of the terminal scheduling method for load balancing provided in any of the aforementioned embodiments, the steps of the method including: obtaining load information of each cellular network of the communication system; when there is a load-unbalanced cellular network in the load information of each cellular network, determining a target cellular network; and scheduling the target cellular network using an optimization algorithm, wherein the optimization algorithm includes optimized data flow variables, data flow terminal variables, and channel power variables.

[0113] It should be noted that the algorithms and displays provided herein are not inherently related to any particular computer, virtual device or other device. Various general devices can also be used together with the teachings based thereon. According to the above description, it is obvious that the structure required for constructing such devices is constructed. In addition, the present application is not directed to any specific programming language. It should be understood that the content of the present application described herein can be implemented using various programming languages, and the above description of specific languages ​​is to disclose the best implementation mode of the present application. In the specification provided herein, a large number of specific details are described. However, it is understood that the embodiments of the present application can be practiced without these specific details. In some instances, known methods, structures and techniques are not shown in detail so as not to obscure the understanding of this specification.

[0114] Similarly, it should be understood that in order to streamline the present application and aid in understanding one or more of the various inventive aspects, in the above description of the exemplary embodiments of the present application, the various features of the present application are sometimes grouped together into a single embodiment, figure, or description thereof. However, this disclosed method should not be interpreted as reflecting the following intention: the claimed application requires more features than the features explicitly recited in each claim. More specifically, as reflected in the claims below, the inventive aspects lie in less than all the features of the single embodiment disclosed above. Therefore, the claims that follow the specific embodiment are hereby expressly incorporated into the specific embodiment, with each claim itself serving as a separate embodiment of the present application.

[0115] Those skilled in the art will appreciate that the modules in the devices in the embodiments can be adaptively changed and arranged in one or more devices different from the embodiments. The modules or units or components in the embodiments can be combined into one module or unit or component, and in addition they can be divided into multiple submodules or subunits or subassemblies. Except that at least some of such features and / or processes or units are mutually exclusive, all features disclosed in this specification and all processes or units of any method or device disclosed in this manner can be combined in any combination. Unless otherwise clearly stated, each feature disclosed in this specification can be replaced by an alternative feature providing the same, equivalent or similar purpose.

[0116] The various component embodiments of the present application can be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. It should be understood by those skilled in the art that a microprocessor or digital signal processor (DSP) can be used in practice to implement some or all functions of some or all components in the creation device of the virtual machine according to the embodiment of the present application. The present application can also be implemented as a device or device program for executing part or all of the methods described herein. The program implementing the present application can be stored on a computer-readable medium, or can have the form of one or more signals. Such a signal can be downloaded from an Internet website, or provided on a carrier signal, or provided in any other form.

[0117] The above is only a preferred specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.

Claims

1. A terminal scheduling method for load balancing, characterized in that: The method comprises: Obtaining load information of each cellular network of the communication system; When there is a cellular network with unbalanced load in the load information of each cellular network, determining a target cellular network; The target cellular network is scheduled using an optimization algorithm, wherein the optimization algorithm includes optimized data flow variables, data flow terminal variables, and channel power variables; The optimization algorithm formula is: Among them, X represents the data flow variable, D represents the data flow through the terminal variable, P represents the channel power variable, r f represents the rate of data flow f; X is given by A matrix composed of d i,f A matrix composed of , where d = 1 means that the end point of data flow f is terminal i, and d = 0 means that the end point of data flow f is not terminal i; P is composed of The matrix composed of represents the channel power from terminal i to terminal j; The execution steps of the optimization algorithm include: S21, initialize X, D, P; S22, fix P and optimize X and D by geometric programming method; S23, fix X and optimize P by geometric programming method; S24. Iterate S22 and S23 until the total rate reaches the maximum and the optimal solution of X, D and P is obtained.

2. The terminal scheduling method for load balancing according to claim 1, characterized in that: The execution of the optimization algorithm includes a first constraint, a second constraint, and a third constraint; the first constraint is flow conservation; the second constraint is that the endpoint of each data flow is a base station; the third constraint is that the transmission rate of a data flow from one terminal to another does not exceed a preset threshold.

3. The terminal scheduling method for load balancing according to claim 2, characterized in that: The execution of the optimization algorithm also includes a fourth restriction condition, and the fourth restriction condition is that the channel power from terminal i to terminal j does not exceed a preset upper limit value.

4. The terminal scheduling method for load balancing according to claim 1, characterized in that: The execution of the optimization algorithm also includes a fifth restriction condition, which is: Among them, x i,j Indicates whether there is data flow sent from terminal i to terminal j. The formula is: Among them, f represents a data flow, and F represents a data flow set.

5. A terminal scheduling device for load balancing, characterized in that: The device comprises: An acquisition module, used to acquire load information of each cellular network of the communication system; A determination module, configured to determine a target cellular network when there is a cellular network with an unbalanced load in the load information of each cellular network; A scheduling module, configured to schedule the target cellular network using an optimization algorithm, wherein the optimization algorithm includes optimized data flow variables, data flow through terminal variables, and channel power variables; The optimization algorithm formula is: Among them, X represents the data flow variable, D represents the data flow through the terminal variable, P represents the channel power variable, r f represents the rate of data flow f; X is given by A matrix composed of d i,f A matrix composed of , where d = 1 means that the end point of data flow f is terminal i, and d = 0 means that the end point of data flow f is not terminal i; P is composed of The matrix composed of represents the channel power from terminal i to terminal j; The execution steps of the optimization algorithm include: S21, initialize X, D, P; S22, fix P and optimize X and D by geometric programming method; S23, fix X and optimize P by geometric programming method; S24. Iterate S22 and S23 until the total rate reaches the maximum and the optimal solution of X, D and P is obtained.

6. A communication system, characterized in that: The communication system applies the terminal scheduling method for load balancing as described in any one of claims 1-4.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 4 are implemented.

8. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 4 are implemented.