CN114828270B - Pairing scheduling method, pairing scheduling device and storage medium - Google Patents

Pairing scheduling method, pairing scheduling device and storage medium Download PDF

Info

Publication number
CN114828270B
CN114828270B CN202210357171.4A CN202210357171A CN114828270B CN 114828270 B CN114828270 B CN 114828270B CN 202210357171 A CN202210357171 A CN 202210357171A CN 114828270 B CN114828270 B CN 114828270B
Authority
CN
China
Prior art keywords
pairing
terminals
period
pairing scheduling
time slots
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210357171.4A
Other languages
Chinese (zh)
Other versions
CN114828270A (en
Inventor
郑雨婷
李�一
金雨超
朱小萌
肖天
薛永备
刘光海
程新洲
李贝
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN202210357171.4A priority Critical patent/CN114828270B/en
Publication of CN114828270A publication Critical patent/CN114828270A/en
Application granted granted Critical
Publication of CN114828270B publication Critical patent/CN114828270B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0452—Multi-user MIMO systems
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The application provides a pairing scheduling method, a pairing scheduling device and a storage medium, relates to the technical field of communication, and is used for solving the problem of high consumption of computing power resources of a base station. The pairing scheduling method comprises the following steps: determining pairing results of a plurality of terminals in a first time slot in a first period; the first period includes a plurality of time slots; calculating a first gain value of the spectrum efficiency of a cell to which the plurality of terminals belong in a first time slot when the plurality of terminals are paired and scheduled based on a pairing result; when the first gain value is larger than a preset threshold value, predicting the spectrum efficiency of the cell to be at the second gain value of other time slots; the other time slots are the time slots except the first time slot in the first period; and determining a pairing scheduling strategy of the terminals in the first period according to the second gain value. The method and the device reduce the consumption of the computing power resources in the pairing scheduling process of the base station.

Description

Pairing scheduling method, pairing scheduling device and storage medium
Technical Field
The present disclosure relates to the field of communications, and in particular, to a pairing scheduling method, apparatus, and storage medium.
Background
In order to improve the utilization of network resources, on the basis of single-user multiple-input multiple-output (single user multiple input multiple output, SU-MIMO), multi-user multiple-input multiple-output (multi user multiple input multiple output, MU-MIMO) is proposed. The base station can communicate with a plurality of terminals at the same time and in the same frequency band by starting the MU-MIMO function, so that network resources are reasonably scheduled, and the utilization rate of the network resources is improved.
Under the condition that the base station starts the MU-MIMO function, the base station can further improve the network resource utilization rate through a pairing scheduling method. Specifically, the base station may pair the plurality of terminals according to the information such as the channel quality parameters, the location parameters, the service parameters and the like of the plurality of terminals in the coverage cell, and perform resource scheduling (i.e. schedule the terminals on the pair in the same resource block).
However, existing base stations are typically pair-scheduled based on slot (slot) granularity. That is, the base station needs to calculate the pairing result of a plurality of terminals and the network resources to be scheduled in each time slot, which occupies a great deal of computational resources.
Disclosure of Invention
The application provides a pairing scheduling method, a pairing scheduling device and a storage medium, which are used for improving pairing scheduling efficiency.
In order to achieve the above purpose, the present application adopts the following technical scheme:
in a first aspect, a pairing scheduling method is provided, including: determining pairing results of a plurality of terminals in a first time slot in a first period; the first period includes a plurality of time slots; calculating a first gain value of the spectrum efficiency of a cell to which the plurality of terminals belong in a first time slot when the plurality of terminals are paired and scheduled based on a pairing result; when the first gain value is larger than a preset threshold value, predicting the spectrum efficiency of the cell to be at the second gain value of other time slots; the other time slots are the time slots except the first time slot in the first period; and determining a pairing scheduling strategy of the terminals in the first period according to the second gain value.
Optionally, when the first gain value is less than or equal to a preset threshold, pairing scheduling is not performed on the plurality of terminals.
Optionally, when the second gain value is greater than the preset threshold, determining the pairing scheduling policy is: pairing scheduling is carried out on a plurality of terminals based on pairing results; and when the second gain value is smaller than or equal to a preset threshold value, determining a pairing scheduling strategy as follows: and the pairing scheduling is not carried out on the plurality of terminals.
Optionally, calculating a third gain value of a target monitoring point of the spectrum efficiency of the cell in the first period when the plurality of terminals are paired and scheduled based on the pairing result; the target monitoring point comprises a plurality of time slots in a first period; the number of time slots in the target monitoring point is smaller than that in the first period; the third gain value comprises a plurality of gain values which are in one-to-one correspondence with a plurality of time slots in the target monitoring point; when one or more gain values in the third gain values are larger than a preset threshold value and the pairing scheduling policy is to pair and schedule the plurality of terminals based on the pairing result, determining that the pairing scheduling policy is unchanged; when all gain values in the third gain values are smaller than or equal to a preset threshold value and the pairing scheduling policy is to pair and schedule the plurality of terminals based on a pairing result, determining the pairing scheduling policy of the plurality of terminals in a second period; the first time slot of the second period is the next time slot adjacent to the target monitoring point; when one or more gain values in the third gain values are larger than a preset threshold value and the pairing scheduling policy is that the plurality of terminals are not paired to be scheduled, determining the pairing scheduling policy of the plurality of terminals in a second period; and when all gain values in the third gain values are smaller than or equal to a preset threshold value and the pairing scheduling policy is to pair and schedule the plurality of terminals based on the pairing result, determining that the pairing scheduling policy is unchanged.
Optionally, the pairing scheduling method further includes: inputting target data into a pre-trained prediction model to obtain a second gain value; the target data includes: the method comprises the steps that under a plurality of time slots in a third period before a first period, the spectrum efficiency of a cell and the network parameters used for representing the network state of the cell under the first time slot in the first period are used; the prediction model is obtained by training according to sample data.
In a second aspect, there is provided a pairing scheduling device, including: a processing unit and a prediction unit; the processing unit is used for determining pairing results of a plurality of terminals in the first time slot in the first period; the first period includes a plurality of time slots; the processing unit is further used for calculating a first gain value of the spectrum efficiency of the cell to which the plurality of terminals belong in the first time slot when the plurality of terminals are paired and scheduled based on the pairing result; the prediction unit is used for predicting the second gain value of the spectral efficiency of the cell in other time slots when the first gain value calculated by the processing unit is larger than a preset threshold value; the other time slots are the time slots except the first time slot in the first period; and the processing unit is also used for determining the pairing scheduling strategy of the terminals in the first period according to the second gain value predicted by the predicting unit.
Optionally, the processing unit is further configured to not pair-schedule the plurality of terminals when the first gain value is less than or equal to a preset threshold value.
Optionally, when the second gain value predicted by the prediction unit is greater than the preset threshold, determining the pairing scheduling policy is: pairing scheduling is carried out on a plurality of terminals based on pairing results; when the second gain value predicted by the prediction unit is smaller than or equal to a preset threshold value, determining that the pairing scheduling strategy is: and the pairing scheduling is not carried out on the plurality of terminals.
Optionally, the processing unit is further configured to calculate a third gain value of a target monitoring point of the spectrum efficiency of the cell in the first period when the paired scheduling is performed on the plurality of terminals based on the paired result; the target monitoring point comprises a plurality of time slots in a first period; the number of time slots in the target monitoring point is smaller than that in the first period; the third gain value comprises a plurality of gain values which are in one-to-one correspondence with a plurality of time slots in the target monitoring point; the processing unit is further configured to determine that the pairing scheduling policy is unchanged when one or more gain values in the third gain values are greater than a preset threshold value and the pairing scheduling policy is to pair and schedule the plurality of terminals based on a pairing result; the processing unit is further configured to determine a pairing scheduling policy of the plurality of terminals in the second period when all gain values in the third gain values are less than or equal to a preset threshold value and the pairing scheduling policy is to pair the plurality of terminals based on a pairing result; the first time slot of the second period is the next time slot adjacent to the target monitoring point; the processing unit is further configured to determine a pairing scheduling policy of the plurality of terminals in the second period when one or more gain values in the third gain values are greater than a preset threshold and the pairing scheduling policy is that the plurality of terminals are not paired; and the processing unit is further used for determining that the pairing scheduling policy is unchanged when all gain values in the third gain values are smaller than or equal to a preset threshold value and the pairing scheduling policy is to pair and schedule the plurality of terminals based on a pairing result.
Optionally, the pairing scheduling device further includes: inputting target data into a pre-trained prediction model to obtain a second gain value; the target data includes: the method comprises the steps that under a plurality of time slots in a second period before a first period, the spectrum efficiency of a cell and the network parameters used for representing the network state of the cell under the first time slot in the first period are used; the prediction model is obtained by training according to sample data.
In a third aspect, a pairing scheduling device is provided, including a memory and a processor; the memory is used for storing computer execution instructions, and the processor is connected with the memory through a bus; when the pairing scheduling device runs, the processor executes computer-executable instructions stored in the memory, so that the pairing scheduling device executes the pairing scheduling method in the first aspect.
The pairing scheduling device may be a network device, or may be a part of a device in the network device, for example, a chip system in the network device. The system-on-chip is configured to support the network device to implement the functions involved in the first aspect and any one of its possible implementations, for example, to receive, determine, and offload data and/or information involved in the pairing scheduling method described above. The chip system includes a chip, and may also include other discrete devices or circuit structures.
In a fourth aspect, there is provided a computer readable storage medium comprising computer executable instructions which, when run on a computer, cause the computer to perform the pairing scheduling method according to the first aspect.
In a fifth aspect, there is also provided a computer program product comprising computer instructions which, when run on a pairing scheduling device, cause the pairing scheduling device to perform the pairing scheduling method according to the first aspect described above.
It should be noted that the above-mentioned computer instructions may be stored in whole or in part on the first computer readable storage medium. The first computer readable storage medium may be packaged together with the processor of the pairing scheduling device, or may be packaged separately from the processor of the pairing scheduling device, which is not limited in this application.
The description of the second, third, fourth and fifth aspects of the present application may refer to the detailed description of the first aspect; the advantages of the second aspect, the third aspect, the fourth aspect and the fifth aspect may be referred to as analysis of the advantages of the first aspect, and will not be described here.
In this application, the names of the above pairing scheduling devices do not limit the devices or functional modules themselves, and in actual implementation, these devices or functional modules may appear under other names. Insofar as the function of each device or function module is similar to the present application, it is within the scope of the claims of the present application and the equivalents thereof.
These and other aspects of the present application will be more readily apparent from the following description.
The technical scheme provided by the application at least brings the following beneficial effects:
based on any one of the above aspects, the present application provides a pairing scheduling method, which may determine a pairing result of a plurality of terminals in a first time slot in a first period including a plurality of time slots, and calculate a first gain value of a spectrum efficiency of a cell to which the plurality of terminals belong in the first time slot when performing pairing scheduling on the plurality of terminals based on the pairing result. And when the first gain value is larger than a preset threshold value, predicting a second gain value of the time slots except the first time slot in the first period of the spectrum efficiency of the cell, and determining a pairing scheduling strategy of a plurality of terminals in the first period according to the second gain value.
Since the time of one slot is short, the pairing scheduling policy for a plurality of terminals may be the same in consecutive slots within one period. In this case, when determining the pairing scheduling policy of the plurality of terminals in the first period, the present application may determine the pairing scheduling policy by calculating the gain value in the first period and predicting the gain values in other time slots. Compared with the prior art, the pairing scheduling strategy does not need to be determined under each time slot in the first period, so that the consumption of computing power resources of the base station can be effectively reduced, and the efficiency of determining the pairing scheduling strategy is improved.
Drawings
Fig. 1 is a schematic structural diagram of a pairing scheduling system provided in an embodiment of the present application;
fig. 2A is a schematic hardware structure of a communication device according to an embodiment of the present application;
fig. 2B is a schematic diagram of another hardware structure of the communication device according to the embodiment of the present application;
fig. 3 is a flowchart of a pairing scheduling method according to an embodiment of the present application;
fig. 4 is a second flowchart of a pairing scheduling method according to an embodiment of the present application;
fig. 5 is a flowchart of a pairing scheduling method according to an embodiment of the present application;
fig. 6 is a flow chart diagram of a pairing scheduling method provided in an embodiment of the present application;
fig. 7 is a schematic diagram of a periodic structure of a pairing scheduling method according to an embodiment of the disclosure;
fig. 8 is a schematic diagram of a periodic structure of a pairing scheduling method according to an embodiment of the present disclosure;
fig. 9 is a fifth flowchart of a pairing scheduling method according to an embodiment of the present application;
fig. 10 is a schematic structural diagram of a pairing scheduling device according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
It should be noted that, in the embodiments of the present application, words such as "exemplary" or "such as" are used to mean serving as an example, instance, or illustration. Any embodiment or design described herein as "exemplary" or "for example" should not be construed as preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "such as" is intended to present related concepts in a concrete fashion.
In order to clearly describe the technical solutions of the embodiments of the present application, in the embodiments of the present application, the terms "first", "second", and the like are used to distinguish the same item or similar items having substantially the same function and effect, and those skilled in the art will understand that the terms "first", "second", and the like are not limited in number and execution order.
As described in the background, in the prior art, base stations are typically scheduled based on slot granularity. That is, the base station needs to calculate the pairing result of a plurality of terminals and the network resources to be scheduled in each time slot, which occupies a great deal of computational resources.
In view of the foregoing, an embodiment of the present application provides a pairing scheduling method, which may determine a pairing result of a plurality of terminals in a first time slot in a first period including a plurality of time slots, and calculate a first gain value of a spectrum efficiency of a cell to which the plurality of terminals belong in the first time slot when performing pairing scheduling on the plurality of terminals based on the pairing result. And when the first gain value is larger than a preset threshold value, predicting a second gain value of the time slots except the first time slot in the first period of the spectrum efficiency of the cell, and determining a pairing scheduling strategy of a plurality of terminals in the first period according to the second gain value.
Since the time of one slot is short, the pairing scheduling policy for a plurality of terminals may be the same in consecutive slots within one period. In this case, when determining the pairing scheduling policy of the plurality of terminals in the first period, the present application may determine the pairing scheduling policy by calculating the gain value in the first period and predicting the gain values in other time slots. Compared with the prior art, the pairing scheduling strategy does not need to be determined under each time slot in the first period, so that the consumption of computing power resources of the base station can be effectively reduced, and the efficiency of determining the pairing scheduling strategy is improved.
The pairing scheduling method is suitable for a pairing scheduling system. Fig. 1 shows one configuration of the paired scheduling system 100. As shown in fig. 1, the pairing scheduling system 100 includes: a plurality of terminals (including terminal 101, terminal 102, terminal 103) and base station 104.
Wherein the base station 104 is communicatively coupled to a plurality of terminals, respectively.
Terminals 101, 102, 103 in fig. 1 may each be devices that provide voice and/or data connectivity to a user, handheld devices with wireless connectivity, or other processing devices connected to a wireless modem. The wireless terminal may communicate with one or more core networks via a radio access network (radio access network, RAN). The wireless terminals may be mobile terminals such as mobile telephones (or "cellular" telephones) and computers with mobile terminals, as well as portable, pocket, hand-held, computer-built-in or car-mounted mobile devices which exchange voice and/or data with radio access networks, e.g. cell phones, tablet computers, notebook computers, netbooks, personal digital assistants (personal digital assistant, PDA).
The base station 104 in fig. 1 may be a base station or a base station controller for wireless communication, etc. In the embodiment of the present application, the base station may be a base station (base transceiver station, BTS) in a global system for mobile communications (global system for mobile communication, GSM), a base station (base transceiver station, BTS) in a code division multiple access (code division multiple access, CDMA), a base station (node B) in a wideband code division multiple access (wideband code division multiple access, WCDMA), a base station (eNB) in an internet of things (internet of things, ioT) or a narrowband internet of things (NB-IoT), a base station in a future 5G mobile communication network or a future evolved public land mobile network (public land mobile network, PLMN), which is not limited in any way by the embodiment of the present application.
The basic hardware structure of each terminal (terminal 101, terminal 102, terminal 103) and base station 104 in the pairing scheduling system 100 is similar, and includes elements included in the communication device shown in fig. 2A or fig. 2B. The hardware configuration of the terminal 101, the terminal 102, the terminal 103, and the base station 104 will be described below taking the communication apparatus shown in fig. 2A and 2B as an example.
Fig. 2A is a schematic hardware structure of a communication device according to an embodiment of the present application. The communication device comprises a processor 21, a memory 22, a communication interface 23, a bus 24. The processor 21, the memory 22 and the communication interface 23 may be connected by a bus 24.
The processor 21 is a control center of the communication device, and may be one processor or a collective term of a plurality of processing elements. For example, the processor 21 may be a general-purpose central processing unit (central processing unit, CPU), or may be another general-purpose processor. Wherein the general purpose processor may be a microprocessor or any conventional processor or the like.
As one example, processor 21 may include one or more CPUs, such as CPU 0 and CPU 1 shown in fig. 2A.
Memory 22 may be, but is not limited to, a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (random access memory, RAM) or other type of dynamic storage device that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), magnetic disk storage or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
In a possible implementation, the memory 22 may exist separately from the processor 21, and the memory 22 may be connected to the processor 21 by a bus 24 for storing instructions or program code. The processor 21, when calling and executing instructions or program code stored in the memory 22, is capable of implementing the pairing scheduling method provided in the following embodiments of the present application.
In the embodiment of the present application, the software programs stored in the memory 22 are different for the terminal 101, the base station 102, the MEC server 103 and the authentication server 104, so the functions realized by the terminal 101, the base station 102, the MEC server 103 and the authentication server 104 are different. The functions performed with respect to the respective devices will be described in connection with the following flowcharts.
In another possible implementation, the memory 22 may also be integrated with the processor 21.
A communication interface 23 for connecting the communication device with other devices via a communication network, which may be an ethernet, a radio access network, a wireless local area network (wireless local area networks, WLAN) or the like. The communication interface 23 may include a receiving unit for receiving data, and a transmitting unit for transmitting data.
Bus 24 may be an industry standard architecture (industry standard architecture, ISA) bus, an external device interconnect (peripheral component interconnect, PCI) bus, or an extended industry standard architecture (extended industry standard architecture, EISA) bus, among others. The bus may be classified as an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 2A, but not only one bus or one type of bus.
It should be noted that the structure shown in fig. 2A does not constitute a limitation of the communication device, and the communication device may include more or less components than those shown in fig. 2A, or may combine some components, or may be arranged in different components.
Fig. 2B shows another hardware structure of the communication device in the embodiment of the present application. As shown in fig. 2B, the communication device may include a processor 31 and a communication interface 32. The processor 31 is coupled to a communication interface 32.
The function of the processor 31 may be as described above with reference to the processor 21. The processor 31 also has a memory function and can function as the memory 22.
The communication interface 32 is used to provide data to the processor 31. The communication interface 32 may be an internal interface of the communication device or an external interface of the communication device (corresponding to the communication interface 23).
It should be noted that the structure shown in fig. 2A (or fig. 2B) does not constitute a limitation of the communication apparatus, and the communication apparatus may include more or less components than those shown in fig. 2A (or fig. 2B), or may combine some components, or may be arranged in different components.
Fig. 3 is a schematic flow chart of a pairing scheduling method according to an embodiment of the present application. The embodiment of the application can be applied to the base station in the pairing scheduling system shown in fig. 1, and comprises the following steps: S301-S304.
S301, determining pairing results of a plurality of terminals by the first time slot of the base station in the first period.
Specifically, when the base station performs resource scheduling on the terminal, the network resource utilization rate can be improved by a pairing scheduling mode.
The pairing scheduling is to determine pairing results among a plurality of terminals by acquiring pairing parameters of the plurality of terminals served by the base station, and perform resource scheduling based on the pairing results.
Optionally, the pairing parameters may include channel quality parameters, location parameters, service data parameters, and the like of the terminal.
Wherein the channel quality parameter is used to represent the channel quality of the terminal. When the channel quality of the terminal a and the channel quality of the terminal B are similar or identical in a plurality of terminals served by the base station, the base station can schedule the terminal a and the terminal B to the same resource block, so that pairing scheduling of the terminal a and the terminal B is realized.
Optionally, when the base station performs downlink resource scheduling for the terminal, the channel quality parameter includes a channel quality indication (channel quality indicator, CQI). The base station can determine the downlink channel quality of the terminal through the channel quality indication sent by the terminal at the physical layer.
When the base station performs uplink resource scheduling for the terminal, the channel quality parameter includes a sounding reference signal (sounding reference signal, SRS). The base station can determine the uplink channel quality of the terminal through the sounding reference signal sent by the terminal.
The location parameter is used to indicate the current geographical location of the terminal. When the geographic positions of the terminal a and the terminal B are close (for example, the terminal a and the terminal B are in the same office building) in a plurality of terminals served by the base station, the base station can schedule the terminal a and the terminal B to the same resource block, so that pairing scheduling of the terminal a and the terminal B is realized.
The service data parameter is used to represent the size of the service data packet of the terminal. When the service data packets of the terminal a and the terminal B are the same or similar (for example, the service data of the terminal a and the terminal B are both large service data) in a plurality of terminals served by the base station, the base station may schedule the terminal a and the terminal B to the same resource block, thereby implementing pairing scheduling for the terminal a and the terminal B.
In practical application, the base station can also pair and schedule more accurately a plurality of terminals served by the base station in a mode of combining channel quality parameters, position parameters and service data parameters, and can pair and schedule a plurality of terminals served by the base station in other existing modes, which is not limited in the application.
In the prior art, when a base station performs pairing scheduling on a plurality of terminals, the pairing scheduling is generally performed based on granularity of time slots. I.e. the base station needs to calculate a pairing result at each time slot and perform pairing scheduling based on the pairing result. However, since the time of one slot is short (typically 0.5 ms), the pairing scheduling policy for a plurality of terminals may be the same in consecutive slots within one period.
To reduce the computational resources of the base station (i.e., without calculating the pairing result at each time slot), the base station may determine the pairing scheduling policy based on the granularity of the period in the present application. In this case, the base station may determine pairing results of the plurality of terminals in the first slot in the first period.
Wherein the first period includes a plurality of time slots.
Alternatively, the first period may be divided by other time concepts, such as milliseconds, seconds, etc.
And S302, when the base station schedules the plurality of terminals based on the pairing result, calculating a first gain value of the spectrum efficiency of the cell to which the plurality of terminals belong in the first time slot.
Specifically, after determining the pairing result of the plurality of terminals in the first time slot, the base station may perform resource scheduling on each terminal in a mode of simulated scheduling according to the determined pairing result, and calculate a gain value of spectrum efficiency of the cells before and after scheduling, that is, a first gain value.
After determining the pairing results of the plurality of terminals, the base station does not necessarily perform pairing scheduling on the terminals in the period. Therefore, the base station does not need to pair and schedule a plurality of terminals in the first time slot, and only needs to calculate the first gain value of the spectrum efficiency of the cell in the first time slot.
The spectrum efficiency refers to the number of bits that can be transmitted per second on a unit bandwidth transmission channel, and represents the utilization efficiency of spectrum resources by a cell covered by a base station, which is used for measuring the effectiveness of network resources of the cell.
Optionally, when calculating the spectrum efficiency of the cell, the base station may acquire the channel rate and the channel interval of the cell, and determine the ratio of the channel rate to the channel interval as the spectrum efficiency of the cell.
Where channel rate generally refers to the net rate of a single wavelength and channel spacing refers to the wavelength spacing (e.g., 50GHz/100 GHz).
For example, if a certain cell has a channel rate of 100bit/s and a channel interval of 50GHz before pairing and scheduling, the spectrum efficiency of the cell before pairing and scheduling is 2bit/s/Hz. After pairing scheduling, the channel rate is 200bit/s, the channel interval is 50GHz, and the spectrum efficiency of the cell after pairing scheduling is 4bit/s/Hz. In this case, the first gain value is 2 bits/s/Hz.
Alternatively, the present application may also use other parameters for measuring benefit improvement of the cell as the first gain value, which is not limited in this application.
S303, when the first gain value is larger than a preset threshold value, the base station predicts a second gain value of the spectral efficiency of the cell in other time slots.
Wherein the other time slots are time slots except the first time slot in the first period.
Alternatively, the preset threshold may be a threshold set by an operation and maintenance person according to experience. In practical application, the preset threshold value can be updated in real time according to practical conditions.
Specifically, the gain value of the spectrum efficiency of the cell has correlation with channel quality, terminal pairing scheduling mode and the like to a great extent, and predictability is presented. Therefore, when the first gain value is greater than the preset threshold value, the base station can perform pairing scheduling on the plurality of terminals in the first time slot. In this case, the base station may predict the second gain value of the spectral efficiency of the cell at other time slots, and further determine whether pairing scheduling is required for the plurality of terminals.
Optionally, when the base station predicts the second gain value of the cell in other time slots, the base station may predict the second gain value through a prediction model; the second gain value may also be predicted by a prediction algorithm; the second gain value may also be predicted by other prediction means. The present application is not limited in this regard.
The preset threshold is set, for example, to 2 bits/s/Hz. The first gain value determined by the base station in the first time slot is 3bit/s/Hz. In this case, since the first gain value is greater than the preset threshold, it is indicated that the base station may perform pairing scheduling on the plurality of terminals in the first time slot. In this case, the base station may predict that the spectral efficiency of the cell is at the second gain value of 1.5bit/s/Hz for the other slots.
S304, the base station determines a pairing scheduling strategy of the terminals in the first period according to the second gain value.
Specifically, after predicting the spectrum efficiency of the cell at the second gain value of the other time slots, the base station may determine a pairing scheduling policy of the plurality of terminals in the first period according to the second gain value.
Optionally, when the second gain value is greater than the preset threshold, it is indicated that the pairing scheduling of the plurality of terminals in the first period may improve the resource utilization rate. In this case, the base station may determine the pairing scheduling policy as: and carrying out resource scheduling on the plurality of terminals.
Optionally, because the interval of one time slot is very short, when the base station performs resource scheduling on a plurality of terminals, the base station may perform pairing scheduling on a plurality of terminals based on the pairing result determined by the base station in the first time slot. Therefore, the base station does not need to repeatedly calculate the pairing result, and the computing power resource of the base station is further saved.
When the second gain value is smaller than or equal to the preset threshold value, the fact that the paired scheduling is performed on the plurality of terminals in the first period does not improve the resource utilization rate or the improved resource utilization rate is lower is indicated. In this case, the base station may determine the pairing scheduling policy as: and the plurality of terminals are not paired and scheduled, so that the resource consumption caused by the paired and scheduled of the plurality of terminals by the base station is reduced.
In combination with the above example, the preset threshold is set to 2bit/s/Hz. The first gain value determined by the base station in the first time slot is 3bit/s/Hz.
When the base station predicts that the frequency spectrum efficiency of the cell is 1.5bit/s/Hz in the second gain value of other time slots, the base station indicates that the pairing scheduling of the plurality of terminals in the first period does not improve the frequency spectrum efficiency too much. In this case, the base station may not perform pairing scheduling on the plurality of terminals in order to reduce resource consumption caused by the base station performing pairing scheduling on the plurality of terminals.
When the base station predicts that the frequency spectrum efficiency of the cell is 3bit/s/Hz in the second gain value of other time slots, the base station indicates that the pairing scheduling of a plurality of terminals in the first period can improve certain frequency spectrum efficiency. In this case, the base station may perform pairing scheduling for the plurality of terminals based on a pairing result determined by the base station at the first slot.
In an implementation manner, in conjunction with fig. 3, as shown in fig. 4, when the base station calculates that the pairing is performed on the plurality of terminals based on the pairing result, the spectrum efficiency of the cell to which the plurality of terminals belong after the first gain value of the first time slot further includes:
s401, when the first gain value is smaller than or equal to a preset threshold value, the base station does not pair and schedule the plurality of terminals.
Specifically, when the first gain value is smaller than or equal to the preset threshold value, the base station indicates that if the base station performs pairing scheduling on the plurality of terminals according to the pairing result determined in the first time slot in the first period, the spectrum efficiency gain of the cell covered by the base station is smaller or no gain. That is, the pairing scheduling of the plurality of terminals according to the pairing result determined in the first time slot does not improve the resource utilization rate, or the improved resource utilization rate is lower. In this case, in order to reduce the power consumption of the base station, the base station does not perform pairing scheduling on the plurality of terminals in the first period.
In an implementation manner, referring to fig. 3, as shown in fig. 5, in S304, the method for determining, by the base station, a pairing scheduling policy of a plurality of terminals in a first period according to a second gain value specifically includes:
s501, when the second gain value is larger than a preset threshold value, the base station determines that the pairing scheduling policy is: and carrying out pairing scheduling on the plurality of terminals based on the pairing result.
S502, when the second gain value is smaller than or equal to a preset threshold value, the base station determines that the pairing scheduling policy is: and the pairing scheduling is not carried out on the plurality of terminals.
In one implementation, as shown in fig. 6, the pairing scheduling method further includes:
And S601, the base station calculates a third gain value of a target monitoring point of the spectral efficiency of the cell in the first period when the plurality of terminals are paired and scheduled based on the pairing result.
Specifically, in order to ensure the effectiveness and flexibility of the base station when performing pairing scheduling on a plurality of terminals, the base station may set a plurality of monitoring points (including target monitoring points) to monitor in the process of performing pairing scheduling on the plurality of terminals.
The target monitoring point comprises a plurality of time slots in a first period; the number of time slots in the target monitoring point is smaller than that in the first period; the third gain value includes a plurality of gain values that are in one-to-one correspondence with a plurality of time slots within the target monitoring point.
It should be noted that, in the case that the number of time slots in the target monitoring point is smaller than the number of time slots in the first period, the power consumption of the base station can be reduced.
S602, when one or more gain values in the third gain values are larger than a preset threshold value, and the pairing scheduling policy is to pair and schedule the plurality of terminals based on the pairing result, the base station determines that the pairing scheduling policy is unchanged.
Specifically, when one or more gain values calculated by the base station at the target monitoring point are greater than a preset threshold value, the base station performs pairing scheduling on the terminals based on a pairing result in a first period, so that the resource utilization rate can be improved, and the pairing scheduling strategy is effective. In this case, the base station may continue to keep the policy of pairing scheduling the plurality of terminals based on the pairing result unchanged.
For example, as shown in fig. 7, in the pairing scheduling period i (i.e., the first period), m monitoring points may be set in other time slots than the first time slot (i.e., the spectrum efficiency gain prediction section in the pairing scheduling period i in fig. 7), each monitoring point has n time slots (e.g., 2 time slots), that is, the base station may calculate n gain values at each monitoring point, and when one or more of the n gain values calculated in the monitoring point 1 is greater than a preset threshold, the base station continues to maintain pairing scheduling for each terminal.
Similarly, the base station always maintains pairing scheduling of the terminals based on the pairing result in the period i until the pairing scheduling period i is ended, and enters the next pairing scheduling period i+1 in which one or more gain values calculated by other monitoring points (for example, the mth monitoring point) in the pairing scheduling period i are larger than a preset threshold value.
And S603, when all gain values in the third gain values are smaller than or equal to a preset threshold value and the pairing scheduling policy is to pair and schedule the plurality of terminals based on the pairing result, the base station determines the pairing scheduling policy of the plurality of terminals in the second period.
Wherein the first time slot of the second period is the next time slot adjacent to the target monitoring point.
Specifically, when the third gain values are all smaller than or equal to the preset threshold value, it is indicated that in the first period, the base station performs pairing scheduling on the plurality of terminals based on the pairing result, so that the resource utilization rate cannot be improved, and the pairing scheduling policy is invalid. In this case, the base station may adjust the pairing scheduling policy to stop pairing scheduling based on the pairing result, and exit the first period. Then, the base station starts pairing scheduling of a second period from the next time slot adjacent to the target monitoring point, so that resource consumption caused by invalid pairing scheduling of a plurality of terminals by the base station is reduced.
It should be understood that, when determining the pairing scheduling policy of the plurality of terminals in the second period, the base station may refer to the base station to determine the pairing scheduling policy of the plurality of terminals in the first period, which is not described herein.
As shown in fig. 8, in combination with the above example, when all of the n gain values calculated at the monitoring point 2 are smaller than or equal to the preset threshold, the base station adjusts the pairing scheduling policy to stop the pairing scheduling based on the pairing result. And exits the paired schedule period i and starts to enter the next paired schedule period i+1 from the next time slot adjacent to the monitoring point 2.
S604, when one or more gain values in the third gain values are larger than a preset threshold value and the pairing scheduling policy is that the pairing scheduling is not performed on the plurality of terminals, the base station determines the pairing scheduling policy of the plurality of terminals in the second period.
Specifically, when one or more gain values in the third gain values are greater than a preset threshold, it is indicated that the predicted value obtained by the base station through the prediction model is inaccurate in the first period. In this case, to increase the effectiveness of the pairing scheduling policy, the base station may adjust the pairing scheduling policy to exit the first period, and then start pairing scheduling of the second period from the next time slot adjacent to the target monitoring point.
S605, when all gain values in the third gain values are smaller than or equal to a preset threshold value, and the pairing scheduling strategy is that the pairing scheduling is not performed on the plurality of terminals based on the pairing result, the base station determines that the pairing scheduling strategy is unchanged.
Specifically, when the third gain values are all smaller than the preset threshold value, it is indicated that the predicted value obtained by the station through the prediction model is relatively accurate in the first period. In this case, during the first period, the base station may continue to keep the policy of not performing pairing scheduling for each terminal unchanged.
In one implementation manner, as shown in fig. 9 in connection with fig. 3, in S303, a method for predicting, by a base station, a second gain value of a spectrum efficiency of a cell in another time slot specifically includes:
s701, the base station inputs target data into a pre-trained prediction model to obtain a second gain value.
Wherein the target data includes: the method comprises the steps that under a plurality of time slots in a second period before a first period, the spectrum efficiency of a cell and the network parameters used for representing the network state of the cell under the first time slot in the first period are used; the prediction model is obtained by training according to sample data.
Optionally, the network parameters used to represent the network state of the cell include an operating frequency band of the base station, a bandwidth of the base station, a peak spectrum frequency of a downlink single user served by the base station, a peak spectrum efficiency of an uplink single user served by the base station, an uplink single user MIMO stream number served by the base station, a downlink MU-MIMO stream number of the base station, an uplink MU-MIMO stream number of the base station, a peak data rate of a user served by the base station, and the like.
Alternatively, the base station may train to obtain the predictive model based on sample data and artificial intelligence algorithms over a historical period of time.
The foregoing description of the solution provided in the embodiments of the present application has been mainly presented in terms of a method. To achieve the above functions, it includes corresponding hardware structures and/or software modules that perform the respective functions. Those of skill in the art will readily appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is implemented as hardware or computer software driven hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The embodiment of the application may divide the functional modules of the terminal according to the above method example, for example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated modules may be implemented in hardware or in software functional modules. Optionally, the division of the modules in the embodiments of the present application is schematic, which is merely a logic function division, and other division manners may be actually implemented.
Fig. 10 is a schematic structural diagram of a pairing scheduling device according to an embodiment of the present application. The information processing apparatus may be used to perform the pairing scheduling method shown in fig. 3 to 9. The pairing scheduling device shown in fig. 10 includes: a processing unit 1001 and a prediction unit 1002;
a processing unit 1001, configured to determine pairing results of a plurality of terminals in a first time slot in a first period; the first period includes a plurality of time slots;
the processing unit 1001 is further configured to calculate a first gain value of a spectrum efficiency of a cell to which the plurality of terminals belong in a first time slot when performing pairing scheduling on the plurality of terminals based on a pairing result;
a prediction unit 1002, configured to predict a second gain value of the spectral efficiency of the cell in other time slots when the first gain value calculated by the processing unit 1001 is greater than a preset threshold; the other time slots are the time slots except the first time slot in the first period;
the processing unit 1001 is further configured to determine a pairing scheduling policy of the plurality of terminals in the first period according to the second gain value predicted by the predicting unit 1002.
Optionally, the processing unit 1001 is further configured to not pair-schedule the plurality of terminals when the first gain value is less than or equal to a preset threshold.
Optionally, the processing unit 1001 is specifically configured to:
when the second gain value predicted by the prediction unit 1002 is greater than the preset threshold, it is determined that the pairing scheduling policy is: pairing scheduling is carried out on a plurality of terminals based on pairing results;
when the second gain value predicted by the prediction unit 1002 is less than or equal to the preset threshold, it is determined that the pairing scheduling policy is: and the pairing scheduling is not carried out on the plurality of terminals.
Optionally, the processing unit 1001 is further configured to calculate a third gain value of a target monitoring point of the spectrum efficiency of the cell in the first period when performing pairing scheduling on the plurality of terminals based on the pairing result; the target monitoring point comprises a plurality of time slots in a first period; the number of time slots in the target monitoring point is smaller than that in the first period; the third gain value comprises a plurality of gain values which are in one-to-one correspondence with a plurality of time slots in the target monitoring point;
the processing unit 1001 is further configured to determine that the pairing scheduling policy is unchanged when one or more gain values in the third gain values are greater than a preset threshold and the pairing scheduling policy is to pair and schedule the plurality of terminals based on a pairing result;
the processing unit 1001 is further configured to determine a pairing scheduling policy of the plurality of terminals in the second period when all gain values in the third gain values are less than or equal to a preset threshold and the pairing scheduling policy is to pair the plurality of terminals based on a pairing result; the first time slot of the second period is the next time slot adjacent to the target monitoring point;
The processing unit 1001 is further configured to determine a pairing scheduling policy of the plurality of terminals in the second period when one or more gain values of the third gain values are greater than a preset threshold and the pairing scheduling policy is that the plurality of terminals are not paired;
the processing unit 1001 is further configured to determine that the pairing scheduling policy is unchanged when all gain values in the third gain values are less than or equal to a preset threshold and the pairing scheduling policy is to pair and schedule the plurality of terminals based on a pairing result.
Optionally, the prediction unit 1002 is specifically configured to:
inputting target data into a pre-trained prediction model to obtain a second gain value; the target data includes: the method comprises the steps that under a plurality of time slots in a third period before a first period, the spectrum efficiency of a cell and the network parameters used for representing the network state of the cell under the first time slot in the first period are used; the prediction model is obtained by training according to sample data.
The present application also provides a computer-readable storage medium including computer-executable instructions that, when executed on a computer, cause the computer to perform the information processing method provided in the above embodiments.
The embodiment of the present application also provides a computer program, which can be directly loaded into a memory and contains software codes, and the computer program can implement the information processing method provided in the above embodiment after being loaded and executed by a computer.
Those of skill in the art will appreciate that in one or more of the examples described above, the functions described herein may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, these functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer-readable storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.
From the foregoing description of the embodiments, it will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of functional modules is illustrated, and in practical application, the above-described functional allocation may be implemented by different functional modules according to needs, i.e. the internal structure of the apparatus is divided into different functional modules to implement all or part of the functions described above.
In the several embodiments provided in this application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described embodiments of the apparatus are merely illustrative, and the division of modules or units, for example, is merely a logical function division, and other manners of division are possible when actually implemented. For example, multiple units or components may be combined or may be integrated into another device, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form. The units described as separate parts may or may not be physically separate, and the parts shown as units may be one physical unit or a plurality of physical units, may be located in one place, or may be distributed in a plurality of different places. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units. The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a readable storage medium. Based on such understanding, the technical solution of the embodiments of the present application may be essentially or a part contributing to the prior art or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium, including several instructions for causing a device (may be a single-chip microcomputer, a chip or the like) or a processor (processor) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk, etc.
The foregoing is merely specific embodiments of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions easily conceivable by those skilled in the art within the technical scope of the present application should be covered in the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (8)

1. A pairing scheduling method, comprising:
determining pairing results of a plurality of terminals in a first time slot in a first period; the first period includes a plurality of time slots;
calculating a first gain value of the spectrum efficiency of a cell to which the plurality of terminals belong in the first time slot when the plurality of terminals are paired and scheduled based on the pairing result;
when the first gain value is larger than a preset threshold value, predicting a second gain value of the spectrum efficiency of the cell in other time slots; the other time slots are time slots except the first time slot in the first period;
and when the second gain value is greater than the preset threshold value, determining a pairing scheduling policy as follows: pairing scheduling is carried out on the plurality of terminals based on the pairing result;
And when the second gain value is smaller than or equal to the preset threshold value, determining that the pairing scheduling strategy is: the plurality of terminals are not paired and scheduled;
the predicting the second gain value of the spectrum efficiency of the cell in other time slots includes:
inputting target data into a pre-trained prediction model to obtain the second gain value; the target data includes: the spectral efficiency of the cell and the network parameters representing the network state of the cell at the first time slot in the first period under a plurality of time slots in a third period preceding the first period; the prediction model is obtained by training according to sample data.
2. The pairing scheduling method according to claim 1, wherein when the computing performs pairing scheduling on the plurality of terminals based on the pairing result, the spectrum efficiency of the cell to which the plurality of terminals belong is after the first gain value of the first slot, further comprising:
and when the first gain value is smaller than or equal to the preset threshold value, not carrying out pairing scheduling on the plurality of terminals.
3. The pairing scheduling method according to claim 1, further comprising:
Calculating a third gain value of a target monitoring point of the spectrum efficiency of the cell in the first period when the terminals are paired and scheduled based on the pairing result; the target monitoring point comprises a plurality of time slots in the first period; the number of time slots in the target monitoring point is smaller than the number of time slots in the first period; the third gain value comprises a plurality of gain values which are in one-to-one correspondence with a plurality of time slots in the target monitoring point;
when one or more gain values in the third gain values are larger than the preset threshold value and the pairing scheduling policy is that the plurality of terminals are paired and scheduled based on the pairing result, determining that the pairing scheduling policy is unchanged;
when all gain values in the third gain values are smaller than or equal to the preset threshold value and the pairing scheduling policy is that the plurality of terminals are paired and scheduled based on the pairing result, determining the pairing scheduling policy of the plurality of terminals in a second period; the first time slot of the second period is the next time slot adjacent to the target monitoring point;
when one or more gain values in the third gain values are larger than the preset threshold value and the pairing scheduling policy is that the plurality of terminals are not paired to be scheduled, determining the pairing scheduling policy of the plurality of terminals in the second period;
And when all gain values in the third gain values are smaller than or equal to the preset threshold value, and the pairing scheduling strategy is that the plurality of terminals are not paired and scheduled based on the pairing result, the pairing scheduling strategy is determined to be unchanged.
4. A pairing scheduling device, comprising: a processing unit and a prediction unit;
the processing unit is used for determining pairing results of a plurality of terminals in a first time slot in a first period; the first period includes a plurality of time slots;
the processing unit is further configured to calculate a first gain value of spectral efficiency of a cell to which the plurality of terminals belong in the first time slot when the plurality of terminals are paired and scheduled based on the pairing result;
the predicting unit is configured to predict a second gain value of the spectral efficiency of the cell in other time slots when the first gain value calculated by the processing unit is greater than a preset threshold; the other time slots are time slots except the first time slot in the first period;
the processing unit is specifically configured to: when the second gain value predicted by the prediction unit is greater than the preset threshold value, determining a pairing scheduling policy as follows: pairing scheduling is carried out on the plurality of terminals based on the pairing result;
When the second gain value predicted by the prediction unit is smaller than or equal to the preset threshold value, determining that the pairing scheduling policy is: the plurality of terminals are not paired and scheduled;
the prediction unit is specifically configured to:
inputting target data into a pre-trained prediction model to obtain the second gain value; the target data includes: the spectral efficiency of the cell and the network parameters representing the network state of the cell at the first time slot in the first period under a plurality of time slots in a third period preceding the first period; the prediction model is obtained by training according to sample data.
5. The paired scheduling device according to claim 4, wherein,
and the processing unit is further configured to not perform pairing scheduling on the plurality of terminals when the first gain value is less than or equal to the preset threshold value.
6. The paired scheduling device according to claim 4, wherein,
the processing unit is further used for calculating a third gain value of a target monitoring point of the spectrum efficiency of the cell in the first period when the terminals are paired and scheduled based on the pairing result; the target monitoring point comprises a plurality of time slots in the first period; the number of time slots in the target monitoring point is smaller than the number of time slots in the first period; the third gain value comprises a plurality of gain values which are in one-to-one correspondence with a plurality of time slots in the target monitoring point;
The processing unit is further configured to determine that the pairing scheduling policy is unchanged when one or more gain values in the third gain values are greater than the preset threshold and the pairing scheduling policy is that the pairing scheduling is performed on the plurality of terminals based on the pairing result;
the processing unit is further configured to determine a pairing scheduling policy of the plurality of terminals in a second period when all gain values in the third gain values are less than or equal to the preset threshold and the pairing scheduling policy is that the plurality of terminals are paired and scheduled based on the pairing result; the first time slot of the second period is the next time slot adjacent to the target monitoring point;
the processing unit is further configured to determine a pairing scheduling policy of the plurality of terminals in the second period when one or more gain values in the third gain values are greater than the preset threshold and the pairing scheduling policy is that the plurality of terminals are not paired for scheduling;
and the processing unit is further configured to determine that the pairing scheduling policy is unchanged when all gain values in the third gain values are less than or equal to the preset threshold and the pairing scheduling policy is that pairing scheduling is not performed on the plurality of terminals based on the pairing result.
7. A pairing scheduling device, which is characterized by comprising a memory and a processor; the memory is used for storing computer execution instructions, and the processor is connected with the memory through a bus; when the pairing scheduling device is running, the processor executes the computer-executable instructions stored in the memory, so that the pairing scheduling device executes the pairing scheduling method according to any one of claims 1 to 3.
8. A computer readable storage medium comprising computer executable instructions which, when run on a computer, cause the computer to perform the pairing scheduling method according to any one of claims 1-3.
CN202210357171.4A 2022-04-06 2022-04-06 Pairing scheduling method, pairing scheduling device and storage medium Active CN114828270B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210357171.4A CN114828270B (en) 2022-04-06 2022-04-06 Pairing scheduling method, pairing scheduling device and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210357171.4A CN114828270B (en) 2022-04-06 2022-04-06 Pairing scheduling method, pairing scheduling device and storage medium

Publications (2)

Publication Number Publication Date
CN114828270A CN114828270A (en) 2022-07-29
CN114828270B true CN114828270B (en) 2024-04-12

Family

ID=82535576

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210357171.4A Active CN114828270B (en) 2022-04-06 2022-04-06 Pairing scheduling method, pairing scheduling device and storage medium

Country Status (1)

Country Link
CN (1) CN114828270B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014007711A1 (en) * 2012-07-06 2014-01-09 Telefonaktiebolaget L M Ericsson (Publ) Methods and nodes for multiple user mimo scheduling
CN103703854A (en) * 2012-11-05 2014-04-02 华为技术有限公司 Scheduling method, apparatus and base station
CN103974441A (en) * 2013-01-31 2014-08-06 华为技术有限公司 Dispatching method and device
JP2015008390A (en) * 2013-06-25 2015-01-15 株式会社Ｎｔｔドコモ Base station device, user device and cellular system
CN104412535A (en) * 2012-07-06 2015-03-11 瑞典爱立信有限公司 Methods and nodes for multiple user mimo scheduling
CN108632965A (en) * 2017-03-24 2018-10-09 华为技术有限公司 A kind of method and apparatus of uplink transmission power control
CN109076465A (en) * 2016-05-11 2018-12-21 索尼公司 Terminal device, base station equipment, communication means and program
CN110213779A (en) * 2019-06-04 2019-09-06 北京大学 A kind of the ascending honeycomb network multiple cell coordinated scheduling method and ascending honeycomb system of low complex degree

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106507701B (en) * 2015-06-01 2019-11-29 华为技术有限公司 A kind of resource regulating method and device
EP3376716A4 (en) * 2015-11-27 2018-11-14 Huawei Technologies Co., Ltd. Control information sending method, data block transmission method, and related apparatus
WO2018182336A1 (en) * 2017-03-29 2018-10-04 엘지전자 주식회사 Method for allocating resource for multiple signals in wireless communication system and apparatus therefor

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014007711A1 (en) * 2012-07-06 2014-01-09 Telefonaktiebolaget L M Ericsson (Publ) Methods and nodes for multiple user mimo scheduling
CN104412535A (en) * 2012-07-06 2015-03-11 瑞典爱立信有限公司 Methods and nodes for multiple user mimo scheduling
CN103703854A (en) * 2012-11-05 2014-04-02 华为技术有限公司 Scheduling method, apparatus and base station
CN103974441A (en) * 2013-01-31 2014-08-06 华为技术有限公司 Dispatching method and device
JP2015008390A (en) * 2013-06-25 2015-01-15 株式会社Ｎｔｔドコモ Base station device, user device and cellular system
CN109076465A (en) * 2016-05-11 2018-12-21 索尼公司 Terminal device, base station equipment, communication means and program
CN108632965A (en) * 2017-03-24 2018-10-09 华为技术有限公司 A kind of method and apparatus of uplink transmission power control
CN110213779A (en) * 2019-06-04 2019-09-06 北京大学 A kind of the ascending honeycomb network multiple cell coordinated scheduling method and ascending honeycomb system of low complex degree

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
InterDigital.R2-1706681 "Logical Channel Selection Restrictions in LCP".3GPP tsg_ran\WG2_RL2.2017,(TSGR2_AHs),全文. *
Survey on 5G Network Expansion Methods;Yi Li等;2021 20th International Conference on Ubiquitous Computing and Communications (IUCC/CIT/DSCI/SmartCNS);20220303;全文 *
双向能量协作的中继系统功率分配算法;黄刚;赵夙;朱琦;;信号处理;20180925(09);全文 *
无线网络中多用户调度技术研究;江纪蓉;中国优秀硕士学位论文全文数据库;20150315;全文 *

Also Published As

Publication number Publication date
CN114828270A (en) 2022-07-29

Similar Documents

Publication Publication Date Title
EP3152951B1 (en) Method and user equipment for predicting available throughput for uplink data
US9974048B2 (en) Systems, methods, and devices for distributed scheduling for device-to-device interference mitigation
CN106465451B (en) Adaptive C-DRX management
US9313792B2 (en) Wireless multi-site capacity coordination
US20170188381A1 (en) Method and radio network node for scheduling of wireless devices in a cellular network
JP2015506130A (en) Method and apparatus for performing D2D communication
CN103493388A (en) Method for coordinated transmission in a plurality of cells of a wireless communication system
CN106105379A (en) Hetero-com-munication method and apparatus
EP3673596B1 (en) Method and apparatus for improving resource efficiency in a wireless communication system
CN106793047B (en) Uplink power control method and base station
US9161367B2 (en) Radio communication system, base station, user terminal, and communication control method
US20220014943A1 (en) Measurement method and apparatus, and device
US20220377610A1 (en) Reinforcement learning based inter-radio access technology load balancing under multi-carrier dynamic spectrum sharing
CN113302870A (en) Method and device for reporting channel state information
CN111740768A (en) Communication method and device
JP2023549479A (en) Radio frequency (RF) exposure compliant
JP5651236B2 (en) Base station and resource allocation method in mobile communication system
CN111083789A (en) Communication method and communication device
WO2019095266A1 (en) Method and apparatus for uplink scheduling
KR101617466B1 (en) User equipment scheduling method in cellular uplink communication system and base station apparutus therefor
US20130046889A1 (en) Methods and apparatuses for scheduling users in wireless networks
CN113940123A (en) Method and device for allocating wireless communication resources and communication equipment
CN114501600A (en) Method and equipment for adjusting PDCCH monitoring period
CN114828270B (en) Pairing scheduling method, pairing scheduling device and storage medium
CN110474664B (en) Method and device for transmitting data and computer readable storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant