CN114828270A - Pairing scheduling method and device and storage medium - Google Patents
Pairing scheduling method and device and storage medium Download PDFInfo
- Publication number
- CN114828270A CN114828270A CN202210357171.4A CN202210357171A CN114828270A CN 114828270 A CN114828270 A CN 114828270A CN 202210357171 A CN202210357171 A CN 202210357171A CN 114828270 A CN114828270 A CN 114828270A
- Authority
- CN
- China
- Prior art keywords
- pairing
- terminals
- period
- scheduling
- pairing scheduling
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 44
- 238000001228 spectrum Methods 0.000 claims abstract description 42
- 238000012544 monitoring process Methods 0.000 claims description 45
- 238000012545 processing Methods 0.000 claims description 40
- 230000003595 spectral effect Effects 0.000 claims description 13
- 238000012549 training Methods 0.000 claims description 6
- 238000004891 communication Methods 0.000 abstract description 30
- 238000004364 calculation method Methods 0.000 abstract description 4
- 230000008569 process Effects 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 20
- 238000010586 diagram Methods 0.000 description 8
- 238000004590 computer program Methods 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 230000010365 information processing Effects 0.000 description 3
- 238000010295 mobile communication Methods 0.000 description 2
- 230000000737 periodic effect Effects 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000006386 memory function Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
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 computational resource consumption 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 cycle comprises a plurality of time slots; calculating a first gain value of the frequency 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 the pairing result; when the first gain value is larger than a preset threshold value, predicting second gain values of the frequency spectrum efficiency of the cell in 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 plurality of terminals in the first period according to the second gain value. The method and the device reduce the consumption of calculation resources in the pairing scheduling process of the base station.
Description
Technical Field
The present application 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 rate of network resources, on the basis of single-user multiple-input multiple-output (SU-MIMO), a 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 as to reasonably schedule network resources and improve the utilization rate of the network resources.
Under the condition that the base station starts the MU-MIMO function, the base station can further improve the utilization rate of network resources by a pairing scheduling method. Specifically, the base station may pair a plurality of terminals according to information such as channel quality parameters, location parameters, and service parameters of the plurality of terminals in the coverage cell, and perform resource scheduling (i.e., schedule the paired terminals in the same resource block).
However, existing base stations are typically scheduled for pairing based on slot (slot) granularity. That is, the base station needs to calculate the pairing results of multiple terminals and the network resources to be scheduled in each time slot, which occupies a large amount 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 the efficiency of pairing scheduling.
In order to achieve the purpose, the technical scheme is as follows:
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 cycle comprises a plurality of time slots; calculating a first gain value of the frequency 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 the pairing result; when the first gain value is larger than a preset threshold value, predicting second gain values of the frequency spectrum efficiency of the cell in 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 plurality of terminals in the first period according to the second gain value.
Optionally, when the first gain value is smaller than or equal to the preset threshold, the multiple terminals are not scheduled in a pairing manner.
Optionally, when the second gain value is greater than the preset threshold, determining the pairing scheduling policy as: performing pairing scheduling on the plurality of terminals based on the pairing result; when the second gain value is smaller than or equal to the preset threshold value, determining the pairing scheduling strategy as follows: the pairing scheduling is not performed for a plurality of terminals.
Optionally, when the multiple terminals are paired and scheduled based on the pairing result, a third gain value of a target monitoring point of the frequency spectrum efficiency of the cell in the first period is calculated; 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 of the 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 a preset threshold value and the pairing scheduling strategy is to perform pairing scheduling on a plurality of terminals based on a pairing result, determining that the pairing scheduling strategy is not changed; when all the third gain values are smaller than or equal to a preset threshold value and the pairing scheduling strategy is to perform pairing scheduling on the multiple terminals based on the pairing result, determining the pairing scheduling strategy of the multiple 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 strategy is that the plurality of terminals are not subjected to pairing scheduling, determining the pairing scheduling strategy of the plurality of terminals in a second period; and when all the third gain values are smaller than or equal to the preset threshold value and the pairing scheduling strategy is to perform pairing scheduling on the plurality of terminals based on the pairing result, determining that the pairing scheduling strategy is not changed.
Optionally, the pairing scheduling method further includes: inputting the target data into a pre-trained prediction model to obtain a second gain value; the target data includes: the spectrum efficiency of the cell and the network parameters for representing the network state of the cell at a plurality of time slots in a third period before the first period; the prediction model is obtained by training according to the sample data.
In a second aspect, a pairing scheduling apparatus is provided, including: a processing unit and a prediction unit; the processing unit is used for determining the pairing result of the plurality of terminals in the first time slot in the first period; the first cycle comprises a plurality of time slots; the processing unit is further configured to calculate 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 the pairing result; the prediction unit is used for predicting second gain values of the frequency spectrum 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 further used for determining the pairing scheduling strategy of the plurality of terminals in the first period according to the second gain value predicted by the prediction unit.
Optionally, the processing unit is further configured to not perform pairing scheduling on the multiple terminals when the first gain value is smaller than or equal to the preset threshold.
Optionally, when the second gain value predicted by the prediction unit is greater than the preset threshold, the pairing scheduling policy is determined as: performing pairing scheduling 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, determining the pairing scheduling policy as: the pairing scheduling is not performed for a 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 multiple 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 of the 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 not changed when one or more gain values of the third gain values are greater than a preset threshold and the pairing scheduling policy is based on a pairing result to perform pairing scheduling on the plurality of terminals; 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 smaller than or equal to a preset threshold and the pairing scheduling policy is that the plurality of terminals are scheduled in a pairing manner 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 a 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 scheduled in a pairing manner; and the processing unit is further configured to determine that the pairing scheduling policy is not changed when all the third gain values are smaller than or equal to a preset threshold and the pairing scheduling policy is based on a pairing result to perform pairing scheduling on the plurality of terminals.
Optionally, the pairing scheduling apparatus further includes: inputting the target data into a pre-trained prediction model to obtain a second gain value; the target data includes: the spectrum efficiency of the cell and the network parameters for representing the network state of the cell at a plurality of time slots in a second period before the first period; the prediction model is obtained by training according to sample data.
In a third aspect, a pairing scheduling apparatus 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 scheduler is running, the processor executes computer-executable instructions stored in the memory to cause the pairing scheduler to perform the pairing scheduling method of the first aspect.
The pairing scheduling apparatus may be a network device, or may be a part of the apparatus in the network device, for example, a system on chip 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 the possible implementations thereof, for example, to receive, determine, and offload data and/or information involved in the pairing scheduling method. The chip system includes a chip and may also include other discrete devices or circuit structures.
In a fourth aspect, a computer-readable storage medium is provided, which includes computer-executable instructions, which when executed on a computer, cause the computer to perform the pairing scheduling method of the first aspect.
In a fifth aspect, there is also provided a computer program product comprising computer instructions which, when run on a pairing scheduler, cause the pairing scheduler to perform the pairing scheduling method as described in the first aspect above.
It should be noted that the 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 with the processor of the paired scheduling device, or may be packaged separately from the processor of the paired scheduling device, which is not limited in this application.
For the descriptions of the second, third, fourth and fifth aspects in this application, reference may be made to the detailed description of the first aspect; in addition, for the beneficial effects of the second aspect, the third aspect, the fourth aspect and the fifth aspect, reference may be made to the beneficial effect analysis of the first aspect, and details are not repeated here.
In the present application, the names of the above-mentioned pairing scheduling apparatuses do not limit the devices or functional modules themselves, and in actual implementation, the devices or functional modules may appear by other names. Insofar as the functions of the respective devices or functional modules are similar to those of the present application, they fall within the scope of the claims of the present application and their equivalents.
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 cycle including the plurality of time slots, and 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 scheduled for pairing based on the pairing result. And then, when the first gain value is larger than a preset threshold value, predicting a second gain value of the frequency spectrum efficiency of the cell in the first period except for the first time slot, and determining a pairing scheduling strategy of the plurality of terminals in the first period according to the second gain value.
Since the time of one time slot is short, the pairing scheduling policy for a plurality of terminals may be the same at consecutive time slots within one cycle. 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 only 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 in each time slot in the first period, the consumption of calculation 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 according to an embodiment of the present application;
fig. 2A is a schematic hardware structure diagram of a communication device according to an embodiment of the present disclosure;
fig. 2B is a schematic diagram of another hardware structure of a communication device according to an embodiment of the present disclosure;
fig. 3 is a first flowchart illustrating a pairing scheduling method according to an embodiment of the present application;
fig. 4 is a second flowchart illustrating a pairing scheduling method according to an embodiment of the present application;
fig. 5 is a third flowchart illustrating a pairing scheduling method according to an embodiment of the present application;
fig. 6 is a fourth flowchart illustrating a pairing scheduling method according to an embodiment of the present application;
fig. 7 is a first schematic diagram illustrating a periodic structure of a pairing scheduling method according to an embodiment of the present application;
fig. 8 is a schematic diagram of a periodic structure of a pairing scheduling method according to an embodiment of the present application;
fig. 9 is a fifth flowchart illustrating a pairing scheduling method according to an embodiment of the present application;
fig. 10 is a schematic structural diagram of a pairing scheduling apparatus according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that in the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or explanations. Any embodiment or design described herein as "exemplary" or "e.g.," is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present concepts related in a concrete fashion.
For the convenience of clearly describing the technical solutions of the embodiments of the present application, in the embodiments of the present application, the terms "first" and "second" are used to distinguish the same items or similar items with basically the same functions and actions, and those skilled in the art can understand that the terms "first" and "second" are not used to limit the quantity 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 results of multiple terminals and the network resources to be scheduled in each time slot, which occupies a large amount of computational resources.
In view of the foregoing problems, 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 cycle including the plurality of time slots, and 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. And then, when the first gain value is larger than a preset threshold value, predicting a second gain value of the frequency spectrum efficiency of the cell in the first period except for the first time slot, and determining a pairing scheduling strategy of the plurality of terminals in the first period according to the second gain value.
Since the time of one time slot is short, the pairing scheduling policy for a plurality of terminals may be the same at consecutive time slots within one cycle. 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 only 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 in each time slot in the first period, the consumption of calculation 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 pairing 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 a base station 104.
Wherein the base station 104 is communicatively coupled to a plurality of terminals, respectively.
The base station 104 in fig. 1 may be a base station or a base station controller for wireless communication, etc. In this embodiment, the base station may be a base station (BTS) in a global system for mobile communication (GSM), Code Division Multiple Access (CDMA), a base station (node B) in a Wideband Code Division Multiple Access (WCDMA), a base station (eNB) in an 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 (PLMN), which is not limited in this embodiment.
The basic hardware structures of the terminals (terminal 101, terminal 102, terminal 103) and the base station 104 in the pairing-scheduling system 100 are similar and include elements included in the communication apparatus shown in fig. 2A or fig. 2B. The following describes the hardware configurations of the terminal 101, the terminal 102, the terminal 103, and the base station 104, taking the communication apparatus shown in fig. 2A and 2B as an example.
Fig. 2A is a schematic diagram of a hardware structure of a communication device according to an embodiment of the present disclosure. 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 apparatus, and may be a single processor or a collective term for a plurality of processing elements. For example, the processor 21 may be a Central Processing Unit (CPU), other general-purpose processors, or the like. Wherein a general purpose processor may be a microprocessor or any conventional processor or the like.
For one embodiment, processor 21 may include one or more CPUs, such as CPU 0 and CPU 1 shown in FIG. 2A.
The memory 22 may be, but is not limited to, a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a Random Access Memory (RAM) or other type of dynamic storage device that may store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a magnetic disk storage medium 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 via a bus 24 for storing instructions or program codes. The pairing scheduling method provided in the following embodiments of the present application can be implemented when the processor 21 calls and executes instructions or program codes stored in the memory 22.
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 implemented by the terminal 101, the base station 102, the MEC server 103, and the authentication server 104 are different. The functions performed by the devices will be described in connection with the following flow charts.
In another possible implementation, the memory 22 may also be integrated with the processor 21.
The communication interface 23 is used for connecting the communication device with other devices through a communication network, which may be an ethernet, a radio access network, a Wireless Local Area Network (WLAN), or the like. The communication interface 23 may include a receiving unit for receiving data, and a transmitting unit for transmitting data.
The bus 24 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an extended ISA (enhanced industry standard architecture) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 2A, but it is not intended that there be only one bus or one type of bus.
It is noted that the configuration shown in fig. 2A does not constitute a limitation of the communication apparatus, which may include more or less components than those shown in fig. 2A, or some components in combination, or a different arrangement of components, in addition to those shown in fig. 2A.
Fig. 2B shows another hardware configuration of the communication apparatus 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 refer to the description of the processor 21 above. 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 may be an external interface (corresponding to the communication interface 23) of the communication device.
It is noted that the configuration shown in fig. 2A (or fig. 2B) does not constitute a limitation of the communication apparatus, which may include more or less components than those shown in fig. 2A (or fig. 2B), or combine some components, or a different arrangement of components, in addition to the components shown in fig. 2A (or fig. 2B).
Fig. 3 is a schematic flowchart of a pairing scheduling method according to an embodiment of the present application. The embodiment of the present application may be applied to a base station in the pairing scheduling system shown in fig. 1, including: S301-S304.
S301, the base station determines the pairing result of the plurality of terminals in the first time slot in the first period.
Specifically, when the base station performs resource scheduling on the terminal, the base station can improve the utilization rate of network resources in a pairing scheduling mode.
The pairing scheduling refers to determining a pairing result among a plurality of terminals by acquiring pairing parameters of the plurality of terminals served by the base station, and performing resource scheduling based on the pairing result.
Optionally, the pairing parameter may include a channel quality parameter, a location parameter, a service data parameter, and the like of the terminal.
Wherein the channel quality parameter is used to indicate the channel quality of the terminal. When the channel quality of the terminal a is similar to or the same as that of the terminal B in a plurality of terminals served by the base station, the base station may schedule the terminal a and the terminal B on the same resource block, thereby implementing the pairing scheduling of the terminal a and the terminal B.
Optionally, when the base station performs downlink resource scheduling for the terminal, the channel quality parameter includes a 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 in the physical layer.
When the base station performs uplink resource scheduling for the terminal, the channel quality parameter includes a 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 for indicating the current geographic 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 located in an office building) among a plurality of terminals served by the base station, the base station may schedule the terminal a and the terminal B on the same resource block, thereby implementing pairing scheduling of the terminal a and the terminal B.
The service data parameter is used to indicate the size of a service data packet of the terminal. When the service data packets of the terminal a and the terminal B are the same or similar in a plurality of terminals served by the base station (for example, the service data of the terminal a and the service data of the terminal B are both large traffic data), the base station may schedule the terminal a and the terminal B on the same resource block, thereby implementing pairing scheduling for the terminal a and the terminal B.
In practical application, the base station may further perform pairing scheduling on a plurality of terminals served by the base station more accurately in a manner of combining the channel quality parameter, the position parameter, and the service data parameter, and may also perform pairing scheduling on a plurality of terminals served by the base station in other existing manners, which is not limited in this 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 the granularity of time slots. That is, the base station needs to calculate the pairing result at each time slot and perform pairing scheduling based on the pairing result. However, since the time of one time slot is very short (typically 0.5 ms), the pairing scheduling policy for a plurality of terminals may be the same for several consecutive time slots within one cycle.
In order to reduce the computational resources of the base station (i.e., without calculating the pairing result at each time slot), in the present application, the base station may determine the pairing scheduling policy based on the granularity of the cycle. In this case, the base station may determine the pairing result of the plurality of terminals at the first time slot within the first period.
Wherein the first period comprises a plurality of slots.
Alternatively, the first period may be divided by other time concepts, such as milliseconds, seconds, and the like.
S302, when the base station schedules the plurality of terminals based on the pairing result, a first gain value of the spectrum efficiency of the cell to which the plurality of terminals belong in the first time slot is calculated.
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 simulated scheduling manner according to the determined pairing result, and calculate a gain value of the spectrum efficiency of the cell before and after the scheduling, that is, a first gain value.
It should be noted that, after determining the pairing result of a 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 perform pairing scheduling on the plurality of terminals in the first time slot, and only needs to calculate the first gain value of the frequency spectrum efficiency of the cell in the first time slot.
The spectrum efficiency refers to the number of bits per second that can be transmitted on a transmission channel of a unit bandwidth, represents the utilization efficiency of spectrum resources by a cell covered by a base station, and is used to measure the effectiveness of network resources of the cell.
Optionally, when calculating the spectrum efficiency of the cell, the base station may obtain a channel rate and a channel interval of the cell, and determine a ratio of the channel rate to the channel interval as the spectrum efficiency of the cell.
Wherein 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).
Illustratively, before the pairing scheduling, the channel rate of a certain cell is 100bit/s, the channel interval is 50GHz, and then the frequency spectrum efficiency of the certain cell before the pairing scheduling is 2 bit/s/Hz. After the pairing scheduling, the channel rate is 200bit/s, the channel interval is 50GHz, and the frequency spectrum efficiency of the cell after the pairing scheduling is 4 bit/s/Hz. In this case, the first gain value is 2 bit/s/Hz.
Optionally, the first gain value may also be a parameter for measuring the benefit improvement of the cell, which is not limited in this application.
And S303, when the first gain value is larger than a preset threshold value, the base station predicts second gain values of the frequency spectrum efficiency of the cell in other time slots.
And the other time slots are the time slots in the first period except the first time slot.
Alternatively, the preset threshold may be a threshold set by the operation and maintenance staff according to experience. In practical application, the preset threshold value can be updated in real time according to practical situations.
Specifically, the gain value of the spectrum efficiency of the cell has correlation with the channel quality, the terminal pairing scheduling mode and the like to a great extent, and is predictable. Therefore, when the first gain value is greater than the preset threshold, it indicates that the base station can perform pairing scheduling on multiple terminals in the first time slot. In this case, the base station may predict second gain values of the spectral efficiency of the cell in other time slots, and further determine whether to perform paired scheduling on the multiple terminals.
Optionally, when the base station predicts the second gain value of the spectrum efficiency of the cell in other time slots, the base station may predict the second gain value through the 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. This is not a limitation of the present application.
Illustratively, the preset threshold is set to 2 bits/s/Hz. The first gain value determined by the base station in the first time slot is 3 bit/s/Hz. In this case, since the first gain value is greater than the preset threshold, it indicates that the base station can perform pairing scheduling on multiple terminals in the first time slot. In this case, the base station can predict that the second gain value of the spectral efficiency of the cell at other time slots is 1.5 bit/s/Hz.
S304, the base station determines the pairing scheduling strategy of the plurality of terminals in the first period according to the second gain value.
Specifically, after predicting the second gain values of the spectral efficiencies of the cells in other time slots, the base station may determine the pairing scheduling policy of the multiple terminals in the first period according to the second gain values.
Optionally, when the second gain value is greater than the preset threshold, it is indicated that the resource utilization rate may be improved by performing pairing scheduling on the multiple terminals in the first period. In this case, the base station may determine the pairing scheduling policy as: and scheduling resources for a plurality of terminals.
Optionally, because the interval of one time slot is short, when the base station performs resource scheduling on the multiple terminals, the base station may perform pairing scheduling on the multiple terminals based on the pairing result determined by the base station at the first time slot. Therefore, the base station does not need to repeatedly calculate the pairing result, and the calculation resource of the base station is further saved.
When the second gain value is smaller than or equal to the preset threshold, it is indicated that the resource utilization rate is not increased or is low when the multiple terminals are paired and scheduled in the first period. In this case, the base station may determine the pairing scheduling policy as: and the base station does not perform pairing scheduling on the plurality of terminals, so that the resource consumption caused by the pairing scheduling of the plurality of terminals by the base station is reduced.
In connection with the above example, the preset threshold is set to 2 bit/s/Hz. The first gain value determined by the base station in the first time slot is 3 bit/s/Hz.
When the base station predicts that the second gain values of the frequency spectrum efficiency of the cell in other time slots are 1.5bit/s/Hz, it is shown that the frequency spectrum efficiency cannot be improved too much by carrying out pairing scheduling on a plurality of terminals in the first period. 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 second gain value of the frequency spectrum efficiency of the cell in other time slots is 3bit/s/Hz, the certain frequency spectrum efficiency which can be improved by carrying out pairing scheduling on the plurality of terminals in the first period is shown. In this case, the base station may perform pairing scheduling on a plurality of terminals based on a pairing result determined by the base station at the first time slot.
In an implementation manner, with reference to fig. 3, as shown in fig. 4, when the base station calculates that the spectrum efficiency of the cell to which the plurality of terminals belong is after the first gain value of the first time slot when performing pairing scheduling on the plurality of terminals based on the pairing result, the method further includes:
s401, when the first gain value is smaller than or equal to a preset threshold value, the base station does not perform pairing scheduling on the plurality of terminals.
Specifically, when the first gain value is smaller than or equal to the preset threshold, it indicates that if the base station performs pairing scheduling on the multiple terminals according to the pairing result determined at the first time slot in the first period, the spectrum efficiency gain of the cell covered by the base station is less or no gain. That is, the resource utilization rate is not increased or is low when the pairing scheduling is performed on the plurality of terminals according to the pairing result determined at the first time slot. In this case, in order to reduce the power consumption of the base station, the base station does not perform pairing scheduling for the plurality of terminals in the first cycle.
In an implementation manner, with reference to fig. 3 and as shown in fig. 5, in the above S304, the method for determining, by the base station, a pairing scheduling policy of the multiple terminals in the first period according to the second gain value specifically includes:
s501, when the second gain value is larger than the preset threshold value, the base station determines the pairing scheduling policy as follows: and performing pairing scheduling on the plurality of terminals based on the pairing result.
S502, when the second gain value is smaller than or equal to the preset threshold, the base station determines the pairing scheduling policy as follows: the pairing scheduling is not performed for a plurality of terminals.
In an implementation manner, as shown in fig. 6, the pairing scheduling method further includes:
s601, the base station calculates a third gain value of a target monitoring point of the frequency spectrum efficiency of the cell in a first period when the base station performs pairing scheduling on the plurality of terminals based on the pairing result.
Specifically, in order to ensure the effectiveness and flexibility of the base station in performing pairing scheduling on the plurality of terminals, the base station may set a plurality of monitoring points (including a target monitoring point) for monitoring 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 of the time slots in the first period; the third gain value includes a plurality of gain values in one-to-one correspondence with a plurality of time slots within the target monitoring point.
It should be noted that, when the number of time slots in the target monitoring point is smaller than the number of time slots in the first period, the computational resource consumption of the base station can be reduced.
And S602, when one or more gain values in the third gain values are larger than a preset threshold value and the pairing scheduling strategy is to perform pairing scheduling on a plurality of terminals based on the pairing result, the base station determines that the pairing scheduling strategy is not changed.
Specifically, when one or more gain values calculated by the base station at the target monitoring point are greater than a preset threshold, it indicates 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 can be improved, and the pairing scheduling policy is effective. In this case, the base station may continue to keep the policy for pairing scheduling of the plurality of terminals based on the pairing result unchanged.
For example, as shown in fig. 7, in a pairing scheduling period i (i.e., a first period), m monitoring points may be set in other time slots than a first time slot (i.e., a 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 at the monitoring point 1 are greater than a preset threshold, the base station continues to maintain pairing scheduling for each terminal.
Similarly, in the gain values calculated by the base station at other monitoring points (for example, the mth monitoring point) in the pairing scheduling period i, one or more gain values are greater than the preset threshold value, and the base station always keeps pairing scheduling on each terminal based on the pairing result in the period i until the pairing scheduling period i is finished, and enters the next pairing scheduling period i + 1.
And S603, when all the third gain values are smaller than or equal to a preset threshold value and the pairing scheduling strategy is to perform pairing scheduling on the plurality of terminals based on the pairing result, the base station determines the pairing scheduling strategy of the plurality of terminals in a second period.
And 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, it indicates that in the first period, the base station performs pairing scheduling on the multiple terminals based on the pairing result, which may not improve the resource utilization, and the pairing scheduling policy is invalid. In this case, the base station may adjust the pairing scheduling policy to stop the pairing scheduling based on the pairing result and exit the first period. And then, the base station starts the pairing scheduling of the second period from the next time slot adjacent to the target monitoring point, so that the resource consumption caused by invalid pairing scheduling of a plurality of terminals by the base station is reduced.
It should be understood that, when the base station determines the pairing scheduling policy of the multiple terminals in the second period, the base station may refer to the base station to determine the pairing scheduling policy of the multiple terminals in the first period, which is not described herein again.
For example, 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 less than or equal to the preset threshold, the base station adjusts the pairing scheduling policy to stop performing pairing scheduling based on the pairing result. And quits the pairing scheduling period i, and starts to enter the next pairing scheduling 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 strategy is not to perform pairing scheduling on the multiple terminals, the base station determines the pairing scheduling strategy of the multiple terminals in a second period.
Specifically, when one or more gain values in the third gain values are greater than the preset threshold, it indicates that the predicted value obtained by the base station through the prediction model is inaccurate in the first period. In this case, in order to improve the effectiveness of the pairing scheduling policy, the base station may adjust the pairing scheduling policy to exit the first period, and then start the pairing scheduling of the second period from the next time slot adjacent to the target monitoring point.
S605, when all the gain values in the third gain values are smaller than or equal to a preset threshold value and the pairing scheduling policy is that the plurality of terminals are not paired and scheduled based on the pairing result, the base station determines that the pairing scheduling policy is not changed.
Specifically, when all the third gain values are smaller than the preset threshold, it is indicated that the predicted values obtained by the station through the prediction model are more accurate in the first period. In this case, the base station may continue to keep the policy of not performing pairing scheduling for each terminal unchanged during the first period.
In an implementation manner, referring to fig. 3, as shown in fig. 9, in the above S303, the method for predicting, by the base station, the second gain value of the spectral efficiency of the cell in another time slot specifically includes:
s701, the base station inputs the target data into a pre-trained prediction model to obtain a second gain value.
Wherein the target data includes: the spectrum efficiency of the cell and the network parameters for representing the network state of the cell at a plurality of time slots in a second period before the first period; the prediction model is obtained by training according to the sample data.
Optionally, the network parameter used for indicating the network state of the cell includes an operating frequency band of the base station, a bandwidth of the base station, a peak spectrum frequency of a downlink single user provided with service by the base station, a peak spectrum efficiency of an uplink single user provided with service by the base station, a number of uplink single user MIMO streams provided with service by the base station, a number of downlink MU-MIMO streams of the base station, a number of uplink MU-MIMO streams of the base station, a user peak data rate provided with service by the base station, and the like.
Optionally, the base station may train to obtain the prediction model according to sample data in a historical time period and an artificial intelligence algorithm.
The scheme provided by the embodiment of the application is mainly introduced from the perspective of a method. To implement the above functions, it includes hardware structures and/or software modules for performing the respective functions. Those of skill in the art would readily appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is performed as hardware or computer software drives 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.
In the embodiment of the present application, the terminal may be divided into the functional modules according to the 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 module can be realized in a hardware mode, and can also be realized in a software functional module mode. Optionally, the division of the modules in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
Fig. 10 is a schematic structural diagram of a pairing scheduling apparatus according to an embodiment of the present application. The information processing apparatus may be configured to execute the pairing scheduling method shown in fig. 3 to 9. The pairing scheduling apparatus shown in fig. 10 includes: a processing unit 1001 and a prediction unit 1002;
a processing unit 1001, configured to determine pairing results of multiple terminals in a first time slot in a first cycle; the first cycle comprises a plurality of time slots;
the processing unit 1001 is further configured to calculate a first gain value of spectral efficiency of a cell to which the plurality of terminals belong in a first time slot when the plurality of terminals are scheduled for pairing based on the pairing result;
a predicting unit 1002, configured to predict, when the first gain value calculated by the processing unit 1001 is greater than a preset threshold, a second gain value of the spectral efficiency of the cell in another time slot; 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 perform pairing scheduling on the multiple terminals when the first gain value is smaller than or equal to the 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, determining the pairing scheduling policy as: performing pairing scheduling on the plurality of terminals based on the pairing result;
when the second gain value predicted by the prediction unit 1002 is smaller than or equal to the preset threshold, determining the pairing scheduling policy as: the pairing scheduling is not performed for a 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 the multiple 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 of the 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 1001 is further configured to determine that the pairing scheduling policy is not changed when one or more gain values of the third gain values are greater than a preset threshold and the pairing scheduling policy is to perform pairing scheduling on a plurality of terminals based on a pairing result;
the processing unit 1001 is further configured to determine a pairing scheduling policy of the multiple terminals in a second period when all gain values of the third gain values are smaller than or equal to a preset threshold and the pairing scheduling policy is that the multiple terminals are scheduled in a pairing manner 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 multiple terminals in a 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 multiple terminals are not to be paired and scheduled;
the processing unit 1001 is further configured to determine that the pairing scheduling policy is not changed when all gain values of the third gain values are smaller than or equal to a preset threshold and the pairing scheduling policy is to perform pairing scheduling on a plurality of terminals based on the pairing result.
Optionally, the prediction unit 1002 is specifically configured to:
inputting the target data into a pre-trained prediction model to obtain a second gain value; the target data includes: the spectrum efficiency of the cell and the network parameters for representing the network state of the cell at a plurality of time slots in a third period before the first period; the prediction model is obtained by training according to the sample data.
Embodiments of the present application further provide a computer-readable storage medium, where the computer-readable storage medium includes computer-executable instructions, and when the computer-executable instructions run on a computer, the computer is enabled to execute the information processing method provided in the foregoing embodiments.
The embodiment of the present application further provides a computer program, where the computer program may be directly loaded into the memory and contains a software code, and the computer program is loaded and executed by the computer to implement the information processing method provided in the foregoing embodiment.
Those skilled in the art will recognize 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, the 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.
Through the above description of the embodiments, it is clear to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the above function distribution may be completed by different functional modules according to needs, that is, the internal structure of the device may be divided into different functional modules to complete all or part of the above described functions.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules or units is only one logical function division, and there may be other division ways in actual implementation. For example, various elements or components may be combined or may be integrated into another device, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form. Units described as separate parts may or may not be physically separate, and parts displayed as units may be one physical unit or a plurality of physical units, may be located in one place, or may be distributed to a plurality of different places. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit. The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present application may be essentially or partially contributed to by the prior art, or all or part of the technical solutions may be embodied in the form of a software product, where the software product is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present application should be covered within 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 (12)
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 cycle comprises a plurality of slots;
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;
when the first gain value is larger than a preset threshold value, predicting second gain values of the frequency spectrum efficiency of the cell in other time slots; the other time slots are the time slots in the first period except the first time slot;
and determining the pairing scheduling strategy of the plurality of terminals in the first period according to the second gain value.
2. The method according to claim 1, wherein when the calculating performs the pairing scheduling on the plurality of terminals based on the pairing result, the calculating the spectral efficiency of the cell to which the plurality of terminals belong after the first gain value of the first time slot further includes:
and when the first gain value is smaller than or equal to the preset threshold value, not performing pairing scheduling on the plurality of terminals.
3. The method according to claim 1, wherein the determining the pairing scheduling policy of the plurality of terminals in the first period according to the second gain value comprises:
when the second gain value is greater than the preset threshold value, determining that the pairing scheduling policy is: performing pairing scheduling on the plurality of terminals based on the pairing result;
when the second gain value is less than or equal to the preset threshold, determining that the pairing scheduling policy is: the plurality of terminals are not paired and scheduled.
4. The pairing scheduling method of claim 3, further comprising:
calculating a third gain value of a target monitoring point of the frequency 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 the first period; the number of time slots in the target monitoring point is less than that of the 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 of the third gain values are larger than the preset threshold value and the pairing scheduling policy is the pairing scheduling of the plurality of terminals based on the pairing result, determining that the pairing scheduling policy is not changed;
when all 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 a 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 of the third gain values are greater than the preset threshold and the pairing scheduling policy is that the plurality of terminals are not paired and scheduled, determining a pairing scheduling policy of the plurality of terminals in the second period;
and when all 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 that the pairing scheduling policy is not changed.
5. The pair scheduling method according to any of claims 1-4, wherein the predicting the second gain values of the spectral efficiency of the cell in other time slots comprises:
inputting target data into a pre-trained prediction model to obtain the second gain value; the target data includes: the spectrum efficiency of the cell and the network parameters used for representing the network state of the cell at a plurality of time slots in a third period before the first period; the prediction model is obtained by training according to sample data.
6. A pairing scheduler, comprising: a processing unit and a prediction unit;
the processing unit is used for determining the pairing result of the plurality of terminals in the first time slot in the first period; the first cycle comprises a plurality of 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 scheduled for pairing based on the pairing result;
the prediction unit is configured to predict second gain values 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 the time slots in the first period except the first time slot;
the processing unit 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 prediction unit.
7. The pairing scheduling device of claim 6,
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.
8. The pairing scheduling device of claim 6, wherein the processing unit is specifically configured to:
when the second gain value predicted by the prediction unit is greater than the preset threshold, determining that the pairing scheduling policy is: performing pairing scheduling 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, determining that the pairing scheduling policy is: the plurality of terminals are not paired and scheduled.
9. The pairing scheduling device of claim 8,
the processing unit is further configured to calculate 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 scheduled for pairing 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 less than that of the 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 not changed when one or more gain values of the third gain values are greater than the preset threshold and the pairing scheduling policy is that the plurality of terminals are scheduled for pairing 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 of the third gain values are smaller than or equal to the preset threshold and the pairing scheduling policy is that the plurality of terminals are scheduled in a pairing manner 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 of the third gain values are greater than the preset threshold and the pairing scheduling policy is that the plurality of terminals are not paired and scheduled;
the processing unit is further configured to determine that the pairing scheduling policy is not changed when all gain values of the third gain values are smaller 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.
10. The pair scheduling device according to any of claims 6 to 9, wherein 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 spectrum efficiency of the cell and the network parameters used for representing the network state of the cell at a plurality of time slots in a third period before the first period; the prediction model is obtained by training according to sample data.
11. A pairing scheduling apparatus 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; the computer-executable instructions stored by the memory are executable by the processor when the pair scheduling apparatus is running to cause the pair scheduling apparatus to perform the pair scheduling method of any one of claims 1-5.
12. A computer-readable storage medium comprising computer-executable instructions that, when executed on a computer, cause the computer to perform the pairing scheduling method of any one of claims 1-5.
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 true CN114828270A (en) | 2022-07-29 |
| CN114828270B 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 (11)
| 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 |
| US20180152957A1 (en) * | 2015-06-01 | 2018-05-31 | Huawei Technologies Co., Ltd. | Resource scheduling method and apparatus |
| US20180279346A1 (en) * | 2015-11-27 | 2018-09-27 | Huawei Technologies Co., Ltd. | Control information sending method, data block transmission method, and related apparatus |
| 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 |
| US20200044814A1 (en) * | 2017-03-29 | 2020-02-06 | Lg Electronics Inc. | Method for allocating resource for multiple signals in wireless communication system and apparatus therefor |
-
2022
- 2022-04-06 CN CN202210357171.4A patent/CN114828270B/en active Active
Patent Citations (11)
| 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 |
| US20180152957A1 (en) * | 2015-06-01 | 2018-05-31 | Huawei Technologies Co., Ltd. | Resource scheduling method and apparatus |
| US20180279346A1 (en) * | 2015-11-27 | 2018-09-27 | Huawei Technologies Co., Ltd. | Control information sending method, data block transmission method, and related apparatus |
| 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 |
| US20200044814A1 (en) * | 2017-03-29 | 2020-02-06 | Lg Electronics Inc. | Method for allocating resource for multiple signals in wireless communication system and apparatus therefor |
| 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)
| Title |
|---|
| INTERDIGITAL: "R2-1706681 "Logical Channel Selection Restrictions in LCP"", 3GPP TSG_RAN\\WG2_RL2, no. 2, 17 June 2017 (2017-06-17) * |
| YI LI等: "Survey on 5G Network Expansion Methods", 2021 20TH INTERNATIONAL CONFERENCE ON UBIQUITOUS COMPUTING AND COMMUNICATIONS (IUCC/CIT/DSCI/SMARTCNS), 3 March 2022 (2022-03-03) * |
| 江纪蓉: "无线网络中多用户调度技术研究", 中国优秀硕士学位论文全文数据库, 15 March 2015 (2015-03-15) * |
| 黄刚;赵夙;朱琦;: "双向能量协作的中继系统功率分配算法", 信号处理, no. 09, 25 September 2018 (2018-09-25) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114828270B (en) | 2024-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11026239B2 (en) | Method and user equipment for predicting available throughput for uplink data | |
| CN103814609B (en) | Method and apparatus for performing D2D communications | |
| CN114788353A (en) | Performing a handover procedure | |
| CN110062351A (en) | Transmit the method and its terminal device of data | |
| CN110663264A (en) | Power regulation for ad hoc networks | |
| Virdis et al. | Performance analysis of OpenAirInterface system emulation | |
| CN109391342A (en) | A kind of data transmission method, relevant device and system | |
| JP5651236B2 (en) | Base station and resource allocation method in mobile communication system | |
| KR101617466B1 (en) | User equipment scheduling method in cellular uplink communication system and base station apparutus therefor | |
| CN111741450A (en) | Network flow prediction method and device and electronic equipment | |
| US20130046889A1 (en) | Methods and apparatuses for scheduling users in wireless networks | |
| CN113940123A (en) | Method and device for allocating wireless communication resources and communication equipment | |
| US20220014250A1 (en) | Channel state information measurement method and apparatus and network side device | |
| de Almeida | Inter-Cell Interference Impact on LTE Performance in Urban Scenarios | |
| EP2519058B1 (en) | Method for attaching a user terminal to a base station of a network | |
| CN114828270B (en) | Pairing scheduling method, pairing scheduling device and storage medium | |
| CN114731545A (en) | Method for accessing terminal equipment to network and communication device | |
| CN105532031B (en) | Resource optimization method and device | |
| CN111741452B (en) | Method and device for predicting residual capacity of NB-IoT base station | |
| CN115665879A (en) | Resource scheduling method, device and storage medium | |
| EP4274178A1 (en) | Node determination method and apparatus for distributed task, and device and medium | |
| CN115002784A (en) | Spectrum configuration method, device and storage medium | |
| CN113315773A (en) | Code rate adjusting method and device, electronic equipment and storage medium | |
| CN115297536B (en) | Power control method, device and storage medium | |
| Wei et al. | Queue-aware energy-efficient scheduling in small-cell networks |
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 |