CN117580182A - Multi-input multi-output scheduling method and equipment - Google Patents

Multi-input multi-output scheduling method and equipment Download PDF

Info

Publication number
CN117580182A
CN117580182A CN202210931952.XA CN202210931952A CN117580182A CN 117580182 A CN117580182 A CN 117580182A CN 202210931952 A CN202210931952 A CN 202210931952A CN 117580182 A CN117580182 A CN 117580182A
Authority
CN
China
Prior art keywords
users
mimo
user group
scheduling
user
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.)
Pending
Application number
CN202210931952.XA
Other languages
Chinese (zh)
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 Mobile Communications Group Co Ltd
China Mobile Communications Ltd Research Institute
Original Assignee
China Mobile Communications Group Co Ltd
China Mobile Communications Ltd Research Institute
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 Mobile Communications Group Co Ltd, China Mobile Communications Ltd Research Institute filed Critical China Mobile Communications Group Co Ltd
Priority to CN202210931952.XA priority Critical patent/CN117580182A/en
Publication of CN117580182A publication Critical patent/CN117580182A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H04W4/08—User group management
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A method and device for multiple input multiple output (MU-MIMO) scheduling are applied to scheduling a plurality of users, wherein the plurality of users at least comprise users in a first MU-MIMO user group, and the method comprises the following steps: under the condition that a first MU-MIMO user group is scheduled on a first time unit, reducing the scheduling priority of a first part of users in the first MU-MIMO user group; and determining a target user scheduled on a second time unit according to the scheduling priority of each candidate user, and scheduling the target user on the second time unit, wherein the candidate users comprise each MU-MIMO user group and/or each SU-MIMO user in the plurality of users, and the scheduling priority of the MU-MIMO user group is equal to the highest scheduling priority of the users in the MU-MIMO user group. The method and the device can improve the cell throughput.

Description

Multi-input multi-output scheduling method and equipment
Technical Field
The present application relates to the field of mobile communications technologies, and in particular, to a method and an apparatus for multiple input multiple output scheduling.
Background
With the increasing number of 5G users, a multi-User Multiple-Input Multiple-Output (MU-MIMO) technology is introduced to improve the throughput of a cell, and the main principle is that Multiple users are scheduled on the same time-frequency resource, and compared with the previous scheduling of only one User on one time-frequency resource, the throughput of the cell is multiplied.
The traditional classical Media Access Control (MAC) scheduling methods mainly have three kinds: maximum C/I algorithm, polling scheduling algorithm, proportional fairness algorithm. The proportional fair algorithm is widely applied to product realization at present, namely, a base station MAC layer distributes a scheduling priority (hereinafter referred to as priority) for each user in a system: each scheduled transmission time interval (Transmission Time Interval, TTI), the user with the highest priority is scheduled and allocated physical resource block (Physical Resource Block, PRB) resources. The priority of each user is dynamically allocated, and after the user 1 with good channel quality or higher service priority is scheduled, the priority of the user decreases along with the increase of the allocated PRB resource. When the priority of user 1 drops below the priority of user 2, user 2 is scheduled with priority. This ensures a balance between multiuser diversity gain and fairness.
If the MU-MIMO scheduling only adopts a proportional fairness algorithm, only few PRBs are used for the MU-MIMO, so that the problem that the cell throughput is not optimal is caused.
Disclosure of Invention
At least one embodiment of the present application provides a method and an apparatus for mimo scheduling, which are used to improve cell throughput.
In order to solve the technical problems, the application is realized as follows:
in a first aspect, an embodiment of the present application provides a multiple input multiple output scheduling method, which is applied to scheduling a plurality of users, where the plurality of users at least includes users in a first MU-MIMO user group, including:
under the condition that a first MU-MIMO user group is scheduled on a first time unit, reducing the scheduling priority of a first part of users in the first MU-MIMO user group;
and determining a target user scheduled on a second time unit according to the scheduling priority of each candidate user, and scheduling the target user on the second time unit, wherein the candidate users comprise each MU-MIMO user group and/or each SU-MIMO user in the plurality of users, and the scheduling priority of the MU-MIMO user group is equal to the highest scheduling priority of the users in the MU-MIMO user group.
Optionally, the first part of users are any one of the following:
the first MU-MIMO user group is arranged with top N from high to low according to the scheduling priority 1 MU-MIMO users, the N 1 Is a preset positive integer and is smaller than the total number of MU-MIMO users in the first MU-MIMO user group;
randomly selected N from the first MU-MIMO user group 2 MU-MIMO users, the N 2 Is a preset positive integer and is less than the total number of MU-MIMO users in the first MU-MIMO user group.
Optionally, the N 1 1.
Optionally, the determining, according to the scheduling priority of each candidate user, the target user scheduled on the second time unit includes:
and selecting the candidate user with the highest scheduling priority as the target user scheduled on the second time unit according to the scheduling priority sequence of each candidate user.
Optionally, the reducing the scheduling priority of the first part of users in the first MU-MIMO user group includes:
and calculating the scheduling priority of each user in the first part of users according to the channel quality and the historical scheduling data quantity of the MU-MIMO user, wherein the scheduling priority is positively related to the channel quality and negatively related to the historical scheduling data quantity.
Optionally, when the scheduling priority of a part of MU-MIMO users in the first MU-MIMO user group is reduced, the scheduling priority of other users except for the first part of users in the plurality of users is kept unchanged.
Optionally, the method further comprises:
and reducing the scheduling priority of the target user under the condition that the target user is scheduled on the second time unit, wherein when the target user is any MU-MIMO user group, the scheduling priority of only a second part of MU-MIMO users in the any MU-MIMO user group is reduced, and the number of the second part of MU-MIMO users is smaller than the total number of MU-MIMO users in the any MU-MIMO user group.
In a second aspect, embodiments of the present application provide a network device comprising a transceiver and a processor, wherein,
the processor is configured to schedule a plurality of users, where the plurality of users at least includes users in a first MU-MIMO user group, and reduce a scheduling priority of a first part of users in the first MU-MIMO user group when the first MU-MIMO user group is scheduled on a first time unit; determining target users scheduled on the second time unit according to the scheduling priority of each candidate user;
the transceiver for scheduling the target user over the second time unit;
wherein the candidate users comprise each MU-MIMO user group and/or each SU-MIMO user in the plurality of users, and the scheduling priority of the MU-MIMO user group is equal to the highest scheduling priority of the users in the MU-MIMO user group.
Optionally, the first part of users are any one of the following:
the first MU-MIMO user group is arranged with top N from high to low according to the scheduling priority 1 MU-MIMO users, the N 1 Is a preset positive integer and is smaller than the total number of MU-MIMO users in the first MU-MIMO user group;
randomly selected N from the first MU-MIMO user group 2 MU-MIMO users, the N 2 Is a preset positive integer and is less than the total number of MU-MIMO users in the first MU-MIMO user group.
Optionally, the N 1 1.
11. The network device of claim 8, wherein the processor is further configured to select a candidate user with a highest scheduling priority as the target user scheduled in the second time unit according to a scheduling priority order of each candidate user.
Optionally, the processor is further configured to calculate a scheduling priority of each user in the first part of users according to a channel quality and a historical scheduling data amount of MU-MIMO users, where the scheduling priority is positively related to the channel quality and negatively related to the historical scheduling data amount.
Optionally, the processor is further configured to maintain the scheduling priority of other users except for the first portion of the users in the plurality of users unchanged when reducing the scheduling priority of the portion of MU-MIMO users in the first MU-MIMO user group.
Optionally, the processor is further configured to reduce a scheduling priority of the target user when the target user is scheduled in the second time unit, where when the target user is any MU-MIMO user group, only a scheduling priority of a second part of MU-MIMO users in the any MU-MIMO user group is reduced, and the number of the second part of MU-MIMO users is smaller than the total number of MU-MIMO users in the any MU-MIMO user group.
In a third aspect, an embodiment of the present application provides a network device, including: a processor, a memory and a program stored on the memory and executable on the processor, which when executed by the processor implements the steps of the method according to any of the first aspects.
In a fourth aspect, embodiments of the present application provide a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method according to any of the first aspects.
Compared with the prior art, the multi-input multi-output scheduling method and the multi-input multi-output scheduling equipment provided by the embodiment of the application do not reduce the scheduling priority of all users in the MU-MIMO user group after scheduling the MU-MIMO user group in a certain scheduling time unit, but only reduce the scheduling priority of part of users in the MU-MIMO user group, so that the scheduling priority of the MU-MIMO user group can be improved with a certain probability, the probability that the MU-MIMO user group is scheduled in a subsequent scheduling time unit is improved, and the cell throughput and the resource utilization rate are improved.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the application. Also, like reference numerals are used to designate like parts throughout the figures. In the drawings:
fig. 1 is a schematic view of an application scenario in an embodiment of the present application;
FIG. 2 is a flow chart of a method of MIMO scheduling according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a network device according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a network device according to another embodiment of the present application;
fig. 5 is a schematic structural diagram of a network device according to another embodiment of the present application.
Detailed Description
Exemplary embodiments of the present application will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present application are shown in the drawings, it should be understood that the present application may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The terms first, second and the like in the description and in the claims, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that embodiments of the present application described herein may be capable of operation in sequences other than those illustrated or described herein, for example. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus. "and/or" in the specification and claims means at least one of the connected objects.
The techniques described herein are not limited to NR systems and long term evolution (Long Time Evolution, LTE)/LTE evolution (LTE-Advanced, LTE-a) systems and may also be used for various wireless communication systems such as code division multiple access (Code Division Multiple Access, CDMA), time division multiple access (Time Division Multiple Access, TDMA), frequency division multiple access (Frequency Division Multiple Access, FDMA), orthogonal frequency division multiple access (Orthogonal Frequency Division Multiple Access, OFDMA), single-carrier frequency division multiple access (Single-carrier Frequency-Division Multiple Access, SC-FDMA), and other systems. The terms "system" and "network" are often used interchangeably. A CDMA system may implement radio technologies such as CDMA2000, universal terrestrial radio access (Universal Terrestrial Radio Access, UTRA), and the like. UTRA includes wideband CDMA (Wideband Code Division Multiple Access, WCDMA) and other CDMA variants. TDMA systems may implement radio technologies such as the global system for mobile communications (Global System for Mobile Communication, GSM). OFDMA systems may implement radio technologies such as ultra mobile broadband (UltraMobile Broadband, UMB), evolved UTRA (E-UTRA), IEEE 802.21 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, flash-OFDM, and the like. UTRA and E-UTRA are parts of the universal mobile telecommunications system (Universal Mobile Telecommunications System, UMTS). LTE and higher LTE (e.g., LTE-a) are new UMTS releases that use E-UTRA. UTRA, E-UTRA, UMTS, LTE, LTE-a and GSM are described in the literature from an organization named "third generation partnership project" (3rd Generation Partnership Project,3GPP). CDMA2000 and UMB are described in the literature from an organization named "third generation partnership project 2" (3 GPP 2). The techniques described herein may be used for the systems and radio technologies mentioned above as well as for other systems and radio technologies. However, the following description describes an NR system for purposes of example, and NR terminology is used in much of the description below, although the techniques may also be applied to applications other than NR system applications.
The following description provides examples and does not limit the scope, applicability, or configuration as set forth in the claims. Changes may be made in the function and arrangement of elements discussed without departing from the spirit and scope of the disclosure. Various examples may omit, substitute, or add various procedures or components as appropriate. For example, the described methods may be performed in an order different than described, and various steps may be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.
Referring to fig. 1, fig. 1 shows a block diagram of a wireless communication system to which embodiments of the present application are applicable. The wireless communication system includes a terminal 11 and a network device 12. The terminal 11 may also be referred to as a User terminal or a User Equipment (UE), and the terminal 11 may be a terminal-side Device such as a mobile phone, a tablet Computer (Tablet Personal Computer), a Laptop (Laptop Computer), a personal digital assistant (Personal Digital Assistant, PDA), a mobile internet Device (Mobile Internet Device, MID), a Wearable Device (Wearable Device), or a vehicle-mounted Device, which is not limited to a specific type of the terminal 11 in the embodiments of the present application. The network device 12 may be a base station and/or a core network element, where the base station may be a 5G or later version base station (e.g., a gNB, a 5G NR NB, etc.), or a base station in another communication system (e.g., an eNB, a WLAN access point, or other access points, etc.), where the base station may be referred to as a node B, an evolved node B, an access point, a base transceiver station (Base Transceiver Station, a BTS), a radio base station, a radio transceiver, a basic service set (Basic Service Set, BSS), an extended service set (Extended Service Set, ESS), a node B, an evolved node B (eNB), a home node B, a home evolved node B, a WLAN access point, a WiFi node, or some other suitable terminology in the field, and the base station is not limited to a specific technical vocabulary, and in the embodiment of the present application, the base station in the NR system is merely an example, but is not limited to a specific type of the base station.
The base stations may communicate with the terminal 11 under the control of a base station controller, which may be part of the core network or some base stations in various examples. Some base stations may communicate control information or user data with the core network over a backhaul. In some examples, some of these base stations may communicate with each other directly or indirectly over a backhaul link, which may be a wired or wireless communication link. A wireless communication system may support operation on multiple carriers (waveform signals of different frequencies). A multicarrier transmitter may transmit modulated signals on the multiple carriers simultaneously. For example, each communication link may be a multicarrier signal modulated according to various radio technologies. Each modulated signal may be transmitted on a different carrier and may carry control information (e.g., reference signals, control channels, etc.), overhead information, data, and so on.
The base station may communicate wirelessly with the terminal 11 via one or more access point antennas. Each base station may provide communication coverage for a respective corresponding coverage area. The coverage area of an access point may be partitioned into sectors that form only a portion of that coverage area. A wireless communication system may include different types of base stations (e.g., macro base stations, micro base stations, or pico base stations). The base station may also utilize different radio technologies, such as cellular or WLAN radio access technologies. The base stations may be associated with the same or different access networks or operator deployments. The coverage areas of different base stations, including coverage areas of the same or different types of base stations, coverage areas utilizing the same or different radio technologies, or coverage areas belonging to the same or different access networks, may overlap.
The communication link in the wireless communication system may include an Uplink for carrying Uplink (UL) transmissions (e.g., from the terminal 11 to the network device 12) or a Downlink for carrying Downlink (DL) transmissions (e.g., from the network device 12 to the terminal 11). UL transmissions may also be referred to as reverse link transmissions, while DL transmissions may also be referred to as forward link transmissions. Downlink transmissions may be made using licensed bands, unlicensed bands, or both. Similarly, uplink transmissions may be made using licensed bands, unlicensed bands, or both.
The MU-MIMO scheduling adopts a proportional fair algorithm, and when the MU-MIMO is scheduled in the TTI N, the priority of the users doing the MU-MIMO is respectively reduced by deltaWeight (ue_index) in the TTI N+1 along with the increase of PRB resources allocated to the users. Thus, as the priority of MU-MIMO users decreases, even though the UEs meet MU-MIMO conditions in subsequent TTIs, the final MAC layer preferentially schedules SU-MIMO because the priority is lower than that of single user multiple input multiple output (SU-MIMO) users, with no or few PRBs for MU-MIMO, resulting in less than optimal cell throughput.
As described above, in the prior art, it is difficult to obtain higher cell throughput in MU-MIMO scheduling scenario, and in order to solve at least one of the above problems, the embodiments of the present application provide a multiple-input multiple-output scheduling method, which can improve cell throughput and improve resource utilization efficiency.
Referring to fig. 2, a method for scheduling multiple users, including at least users in a first MU-MIMO user group, may be performed by a network device (e.g., a base station). As shown in fig. 2, the method includes:
and step 21, reducing the scheduling priority of a first part of users in the first MU-MIMO user group under the condition that the first MU-MIMO user group is scheduled on the first time unit.
Here, in the embodiment of the present application, when one MU-MIMO user group (referred to herein as a first MU-MIMO user group for convenience of description) is scheduled on a first time unit (such as a first scheduling TTI), the scheduling priority of each user in the first MU-MIMO user group is not reduced any more, but only the scheduling priority of a first part of the users is reduced. The number of the first portion of users is less than the total number of MU-MIMO users in the first MU-MIMO user group. That is, when the scheduling priority of a part of MU-MIMO users in the first MU-MIMO user group is reduced, the scheduling priority of other users except the first part of users in the plurality of users is kept unchanged.
Specifically, the first part of users are any one of the following:
(1) The first MU-MIMO user group is arranged with top N from high to low according to the scheduling priority 1 MU-MIMO users, the N 1 Is a preset positive integer and is less than the total number of MU-MIMO users in the first MU-MIMO user group. For example, the N 1 And 1, only reducing the scheduling priority of the user with the highest scheduling priority in the first MU-MIMO user group.
(2) Randomly selected N from the first MU-MIMO user group 2 MU-MIMO users, the N 2 Is a preset positive integer and is less than the total number of MU-MIMO users in the first MU-MIMO user group.
Here, the above N 1 、N 2 The specific value of (c) may be set according to a preset ratio of the total number of MU-MIMO users, or may be a fixed value, which is not limited herein.
And step 22, determining a target user scheduled on a second time unit according to the scheduling priority of each candidate user, and scheduling the target user on the second time unit, wherein the candidate users comprise each MU-MIMO user group and/or each SU-MIMO user in the plurality of users, and the scheduling priority of the MU-MIMO user group is equal to the highest scheduling priority of the users in the MU-MIMO user group.
Here, when scheduling is performed on a time unit subsequent to the first time unit (e.g., a second scheduling TTI subsequent to the first scheduling TTI), the network device determines, according to the scheduling priority of each candidate user, a target user scheduled on the second time unit, and schedules the target user on the second time unit. The candidate users comprise each MU-MIMO user group and/or each SU-MIMO user of the plurality of users, that is, in case the plurality of users comprise only one or more MU-MIMO user groups, the candidate users are the one or more MU-MIMO user groups; in case the plurality of users comprises MU-MIMO user groups and SU-MIMO users, both MU-MIMO user groups and SU-MIMO users are candidates.
When determining a target user from the candidate users, the scheduling priority of the MU-MIMO user group is equal to the highest scheduling priority of the users in the MU-MIMO user group. And then, selecting the candidate user with the highest scheduling priority as a target user scheduled on the second time unit according to the scheduling priority order of each candidate user. Thus, the target user scheduled on the second time unit may be a certain MU-MIMO user group or a certain SU-MIMO user.
Through the steps, the method and the device can avoid the situation that after a certain MU-MIMO user group is scheduled once, the scheduling priorities of all users in the MU-MIMO user group are reduced, but only the scheduling priorities of part of the users are adjusted, and meanwhile, the scheduling priority of the user with the highest priority is taken by the scheduling priority of the MU-MIMO user group, so that the updated scheduling priority of the MU-MIMO user group is more reasonable, the scheduled times and PRB resource allocation of the MU-MIMO user are improved, the data transmission requirement of the MU-MIMO user group can be better ensured, the overall throughput of a cell is improved, and the resource utilization efficiency is improved.
In this embodiment of the present application, the scheduling priority of the first part of users in the first MU-MIMO user group is reduced, and specifically, the scheduling priority of each user in the first part of users may be calculated according to the channel quality and the historical scheduling data volume of the MU-MIMO user, where the scheduling priority is positively related to the channel quality and negatively related to the historical scheduling data volume.
After the step 22, in the case that the target user is scheduled in the second time unit, the embodiment of the present application may further update the scheduling priority of the target user, and similarly, when the target user is any MU-MIMO user group, only reduce the scheduling priority of a second part of MU-MIMO users in the any MU-MIMO user group, where the number of the second part of MU-MIMO users is smaller than the total number of MU-MIMO users in the any MU-MIMO user group. And then, continuing the next scheduling according to the updated scheduling priority. The selection manner of the second portion MU-MIMO user may refer to the description of the selection manner of the first portion user, which is not described herein.
It can be seen that the embodiment of the application increases the priority consideration factor specific to MU-MIMO based on the traditional scheduling algorithm. After the base station MAC layer completes the scheduling of N MU-MIMO users in a certain MU-MIMO user group in the TTI N, the priority of only part of the users in the TTI N+1 is reduced when the priority is calculated. Here, each user in the MU-MIMO user group is ordered according to the scheduling priority, and the first user refers to the user with the highest scheduling priority in the MU-MIMO user group. According to the MAC scheduling algorithm, the reduction of the scheduling priority is deltaWeight (ue 1), and the priority calculation formula of the MAC scheduling (proportional fair algorithm) is as follows:
Weight＝f 1 (ChCond)/f 2 (Th), weight, user priority, chCond, current channel condition, th, current historical data traffic. Each base station manufacturer realizes different algorithms, but f is general 1 (ChCond) is proportional to ChCond and rises with ChCond good, f 2 (Th) is proportional to Th, and rises with increasing Th. As the allocation of PRB resources for users increases, th increases, so f 2 (Th) rises, resulting in a Weight drop. So TTI N schedules the user, TTI n+1 user priority drops deltaWeight (ue_index) =weight (N) -Weight (n+1).
However, in the embodiment of the present application, other users except the first portion of users in the MU-MIMO user group do not consider that the MAC layer has allocated PRB resources to them because they share PRB resources with the first portion of users, so the priority of these other users is not reduced by deltaWeight (ue_index) in TTI n+1, that is, the priority of these users remains consistent with that in TTI N.
Therefore, the priority of the general MU-MIMO user of the cell is improved compared with that of the conventional MAC algorithm, and when the priority of any one of n MU-MIMO users of the MU-MIMO user group is higher than that of the SU-MIMO user, the MU-MIMO group can be scheduled by the MAC layer preferentially, so that the scheduled times of the MU-MIMO user and PRB resource allocation are increased.
The above method is further described below by way of a more specific example. In this example, after the MU-MIMO user group is scheduled, only the scheduling priority of the user with the highest priority is lowered.
Assuming that 5 users exist in a cell, when each TTI MAC is scheduled, users UE1, UE2, UE3 and UE4 all meet MU-MIMO conditions and do MU-MIMO scheduling; the user UE5 performs SU-MIMO scheduling. Assume that the initial priority is:
Weight(UE1)>Weight(UE2)>Weight(UE3)>Weight(UE4)>Weight(UE5)。
when the TTI N schedules the MU-MIMO and the TTI n+1 calculates the priority, four users (UE 1, UE2, UE3 and UE 4) doing the MU-MIMO only the priority of the first user UE1 is reduced by deltaWeight (UE 1), and the priorities of the UE2, UE3 and UE4 are unchanged. Thus, TTI n+1UE2 has the highest priority, and the MAC layer schedules MU-MIMO preferentially. And so on, the TTI N+2 only has the priority of the first user UE2 reduced by deltaWeight (UE 2), the priorities of the UE3, the UE4 and the UE1 are unchanged, and the MAC layer still preferentially schedules MU-MIMO. The MAC layer preferentially schedules SU-MIMO only after TTI n+4 has all lower MU-MIMO user priority than SU-MIMO UE 5.
The present example MAC layer scheduling enhancement scheme is exemplified as follows, and it can be seen that MU-MIMO is scheduled with 80% probability first.
The conventional MAC layer scheduling scheme is exemplified by the following, where MU-MIMO is scheduled with a 50% probability priority, and if TTI n+1 or TTI n+3SU-MIMO UE5 occupies all PRBs after being MAC-scheduled, MU-MIMO users may not be scheduled.
Various methods of embodiments of the present application are described above. An apparatus for carrying out the above method is further provided below.
Referring to fig. 3, an embodiment of the present application further provides a network device 300, configured to schedule a plurality of users, where the plurality of users at least includes users in a first MU-MIMO user group, where the network device 300 includes:
a first updating module 301, configured to reduce a scheduling priority of a first portion of users in a first MU-MIMO user group when the first MU-MIMO user group is scheduled on a first time unit;
a first scheduling module 302, configured to determine a target user scheduled in a second time unit according to a scheduling priority of each candidate user, and schedule the target user in the second time unit, where the candidate user includes each MU-MIMO user group and/or each SU-MIMO user in the plurality of users, and the scheduling priority of the MU-MIMO user group is equal to a highest scheduling priority of users in the MU-MIMO user group.
Through the modules, the scheduling probability of the MU-MIMO user group can be improved, and cell throughput is further improved.
Optionally, the first part of users are any one of the following:
the first MU-MIMO user group is arranged with top N from high to low according to the scheduling priority 1 MU-MIMO users, the N 1 Is a preset positive integer and is smaller than the total number of MU-MIMO users in the first MU-MIMO user group;
randomly selected N from the first MU-MIMO user group 2 MU-MIMO users, the N 2 Is a preset positive integer and is less than the total number of MU-MIMO users in the first MU-MIMO user group.
Optionally, the N 1 1.
Optionally, the first scheduling module is further configured to select, according to the order of scheduling priorities of the candidate users, a candidate user with a highest scheduling priority as a target user scheduled in the second time unit.
Optionally, the first updating module is further configured to calculate a scheduling priority of each user in the first part of users according to a channel quality and a historical scheduling data amount of MU-MIMO users, where the scheduling priority is positively related to the channel quality and negatively related to the historical scheduling data amount.
Optionally, the first updating module is further configured to keep the scheduling priority of other users except for the first portion of the users in the plurality of users unchanged when reducing the scheduling priority of the portion of the MU-MIMO users in the first MU-MIMO user group.
Optionally, the network device further includes:
and a second updating module, configured to reduce, when the target user is scheduled on the second time unit, a scheduling priority of the target user, where, when the target user is any MU-MIMO user group, only a scheduling priority of a second part of MU-MIMO users in the any MU-MIMO user group is reduced, and the number of the second part of MU-MIMO users is smaller than the total number of MU-MIMO users in the any MU-MIMO user group.
The device in this embodiment is a device corresponding to the above method, and the implementation manners in the above embodiments are all applicable to the embodiment of the device, so that the same technical effects can be achieved. The above device provided in this embodiment of the present application can implement all the method steps implemented in the above method embodiment, and can achieve the same technical effects, and detailed descriptions of the same parts and beneficial effects as those in the method embodiment in this embodiment are omitted herein.
Referring to fig. 4, an embodiment of the present application further provides a network device 400, configured to schedule a plurality of users, where the plurality of users at least includes users in a first MU-MIMO user group, including: a transceiver 401 and a processor 402;
the processor 402 is configured to schedule a plurality of users, where the plurality of users at least includes users in a first MU-MIMO user group, and reduce a scheduling priority of a first part of users in the first MU-MIMO user group when the first MU-MIMO user group is scheduled on a first time unit; and determining the target users scheduled on the second time unit according to the scheduling priority of each candidate user.
The transceiver 401 is configured to schedule the target user over the second time unit.
Wherein the candidate users comprise each MU-MIMO user group and/or each SU-MIMO user in the plurality of users, and the scheduling priority of the MU-MIMO user group is equal to the highest scheduling priority of the users in the MU-MIMO user group.
Optionally, the first part of users are any one of the following:
the first MU-MIMO user group is arranged with top N from high to low according to the scheduling priority 1 MU-MIMO users, the N 1 Is a preset positive integer and is smaller than the total number of MU-MIMO users in the first MU-MIMO user group;
randomly selected N from the first MU-MIMO user group 2 MU-MIMO users, the N 2 Is a preset positive integer and is less than the total number of MU-MIMO users in the first MU-MIMO user group.
Optionally, the N 1 1.
Optionally, the processor is further configured to select, according to the order of scheduling priorities of the candidate users, a candidate user with a highest scheduling priority as the target user scheduled in the second time unit.
Optionally, the processor is further configured to calculate a scheduling priority of each user in the first part of users according to a channel quality and a historical scheduling data amount of MU-MIMO users, where the scheduling priority is positively related to the channel quality and negatively related to the historical scheduling data amount.
Optionally, the processor is further configured to maintain the scheduling priority of other users except for the first portion of the users in the plurality of users unchanged when reducing the scheduling priority of the portion of MU-MIMO users in the first MU-MIMO user group.
Optionally, the processor is further configured to reduce a scheduling priority of the target user when the target user is scheduled in the second time unit, where when the target user is any MU-MIMO user group, only a scheduling priority of a second part of MU-MIMO users in the any MU-MIMO user group is reduced, and the number of the second part of MU-MIMO users is smaller than the total number of MU-MIMO users in the any MU-MIMO user group.
The device in this embodiment is a device corresponding to the above method, and the implementation manners in the above embodiments are all applicable to the embodiment of the device, so that the same technical effects can be achieved. The above device provided in this embodiment of the present application can implement all the method steps implemented in the above method embodiment, and can achieve the same technical effects, and detailed descriptions of the same parts and beneficial effects as those in the method embodiment in this embodiment are omitted herein.
Referring to fig. 5, the embodiment of the present application further provides a network device 500, including a processor 5201, a memory 502, and a computer program stored in the memory 502 and capable of running on the processor 501, where the computer program when executed by the processor 501 implements each process of the method embodiment executed by the network device and achieves the same technical effects, and for avoiding repetition, a description is omitted herein.
The embodiment of the application further provides a computer readable storage medium, on which a computer program is stored, where the computer program when executed by a processor implements each process of the above-mentioned embodiment of the mimo scheduling method, and the same technical effects can be achieved, so that repetition is avoided, and no further description is given here. Wherein the computer readable storage medium is selected from Read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), magnetic disk or optical disk.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art in the form of a software product stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk), including several instructions for causing a terminal (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the method described in the embodiments of the present application.
The embodiments of the present application have been described above with reference to the accompanying drawings, but the present application is not limited to the above-described embodiments, which are merely illustrative and not restrictive, and many forms may be made by those of ordinary skill in the art without departing from the spirit of the present application and the scope of the claims, which are also within the protection of the present application.

Claims (16)

1. A multiple-input multiple-output scheduling method, applied to scheduling a plurality of users, where the plurality of users at least includes users in a first MU-MIMO user group, comprising:
under the condition that a first MU-MIMO user group is scheduled on a first time unit, reducing the scheduling priority of a first part of MU-MIMO users in the first MU-MIMO user group;
and determining a target user scheduled on a second time unit according to the scheduling priority of each candidate user, and scheduling the target user on the second time unit, wherein the candidate users comprise each MU-MIMO user group and/or each SU-MIMO user in the plurality of users, and the scheduling priority of the MU-MIMO user group is equal to the highest scheduling priority of the users in the MU-MIMO user group.
2. The method of claim 1, wherein the first portion of users are any of:
the first MU-MIMO user group is arranged with top N from high to low according to the scheduling priority 1 MU-MIMO users, the N 1 Is a preset positive integer and is smaller than the total number of MU-MIMO users in the first MU-MIMO user group;
randomly selected N from the first MU-MIMO user group 2 MU-MIMO users, the N 2 Is a preset positive integer and is less than the total number of MU-MIMO users in the first MU-MIMO user group.
3. The method of claim 2, wherein the N is 1 1.
4. The method of claim 1, wherein determining the target users scheduled on the second time unit based on the scheduling priorities of the candidate users comprises:
and selecting the candidate user with the highest scheduling priority as the target user scheduled on the second time unit according to the scheduling priority sequence of each candidate user.
5. The method of claim 1, wherein the reducing the scheduling priority of the first portion of users in the first MU-MIMO user group comprises:
and calculating the scheduling priority of each user in the first part of users according to the channel quality and the historical scheduling data quantity of the MU-MIMO user, wherein the scheduling priority is positively related to the channel quality and negatively related to the historical scheduling data quantity.
6. The method of claim 1, wherein the scheduling priorities of the users of the plurality of users other than the first portion of users are maintained while the scheduling priorities of the portion of MU-MIMO users of the first group of MU-MIMO users are reduced.
7. The method as recited in claim 1, further comprising:
and reducing the scheduling priority of the target user under the condition that the target user is scheduled on the second time unit, wherein when the target user is any MU-MIMO user group, the scheduling priority of only a second part of MU-MIMO users in the any MU-MIMO user group is reduced, and the number of the second part of MU-MIMO users is smaller than the total number of MU-MIMO users in the any MU-MIMO user group.
8. A network device comprising a transceiver and a processor, wherein,
the processor is configured to schedule a plurality of users, where the plurality of users at least includes users in a first MU-MIMO user group, and reduce a scheduling priority of a first part of users in the first MU-MIMO user group when the first MU-MIMO user group is scheduled on a first time unit; determining target users scheduled on the second time unit according to the scheduling priority of each candidate user;
the transceiver for scheduling the target user over the second time unit;
wherein the candidate users comprise each MU-MIMO user group and/or each SU-MIMO user in the plurality of users, and the scheduling priority of the MU-MIMO user group is equal to the highest scheduling priority of the users in the MU-MIMO user group.
9. The network device of claim 8, wherein the first portion of users are any of:
the first MU-MIMO user group is from high to high according to the scheduling priorityLow ordered top N 1 MU-MIMO users, the N 1 Is a preset positive integer and is smaller than the total number of MU-MIMO users in the first MU-MIMO user group;
randomly selected N from the first MU-MIMO user group 2 MU-MIMO users, the N 2 Is a preset positive integer and is less than the total number of MU-MIMO users in the first MU-MIMO user group.
10. The network device of claim 9, wherein the N is 1 1.
11. The network device of claim 8, wherein the processor is further configured to select a candidate user with a highest scheduling priority as the target user scheduled in the second time unit according to a scheduling priority order of each candidate user.
12. The network device of claim 8, wherein the network device,
the processor is further configured to calculate a scheduling priority for each user in the first portion of users according to a channel quality and a historical scheduling data amount of MU-MIMO users, where the scheduling priority is positively related to the channel quality and negatively related to the historical scheduling data amount.
13. The network device of claim 8, wherein the network device,
the processor is further configured to maintain, when the scheduling priority of a portion of MU-MIMO users in the first MU-MIMO user group is reduced, the scheduling priority of other users except for the first portion of users in the plurality of users unchanged.
14. The network device of claim 8, wherein the network device,
the processor is further configured to reduce a scheduling priority of the target user when the target user is scheduled on the second time unit, where when the target user is any MU-MIMO user group, only a scheduling priority of a second part of MU-MIMO users in the any MU-MIMO user group is reduced, and the number of the second part of MU-MIMO users is smaller than the total number of MU-MIMO users in the any MU-MIMO user group.
15. A network device, comprising: a processor, a memory and a program stored on the memory and executable on the processor, which when executed by the processor, performs the steps of the method according to any one of claims 1 to 7.
16. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, implements the steps of the method according to any one of claims 1 to 7.
CN202210931952.XA 2022-08-04 2022-08-04 Multi-input multi-output scheduling method and equipment Pending CN117580182A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210931952.XA CN117580182A (en) 2022-08-04 2022-08-04 Multi-input multi-output scheduling method and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210931952.XA CN117580182A (en) 2022-08-04 2022-08-04 Multi-input multi-output scheduling method and equipment

Publications (1)

Publication Number Publication Date
CN117580182A true CN117580182A (en) 2024-02-20

Family

ID=89861195

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210931952.XA Pending CN117580182A (en) 2022-08-04 2022-08-04 Multi-input multi-output scheduling method and equipment

Country Status (1)

Country Link
CN (1) CN117580182A (en)

Similar Documents

Publication Publication Date Title
CN109906576B (en) Identifying resources for transmitting a first uplink channel
US20200162219A1 (en) Apparatus and method for controlling resource allocation in a wireless communication network
US8190168B2 (en) Enhanced scheduling techniques for wireless communication networks
JP5959831B2 (en) Wireless communication system, wireless base station apparatus, and wireless communication method
CN108112076B (en) Method and device for configuring uplink signal
EP2890038B1 (en) Radio base station apparatus, mobile terminal apparatus and radio communication method
US10264592B2 (en) Method and radio network node for scheduling of wireless devices in a cellular network
CN116915374A (en) Method and apparatus for determining a resource pool
US8320479B2 (en) Ranking and grouping of transmissions in communication system
US9236937B2 (en) Radio base station and communication control method including downlink radio resource allocation
WO2009116489A1 (en) Wireless communication system, base station, resource block allocation method, and program
CN102215580A (en) Method of handling sounding reference signal transmission enhancement and related communication device
JP5162474B2 (en) Base station apparatus, mobile station, radio communication system, and communication control method
CN102215581A (en) Method of handling sounding reference signal transmission enhancement and related communication device
JP5993422B2 (en) User terminal, radio base station, and radio communication method
WO2019110017A1 (en) Communication method and system
US20160360542A1 (en) Efficient optimal group id management scheme for mu-mimo systems
CN117580182A (en) Multi-input multi-output scheduling method and equipment
EP2854301B1 (en) A method of operating a wireless communications system, a corresponding antenna controller, and radio access node
WO2015084222A1 (en) Physical downlink control channel power coordination
CN102215582A (en) Method of handling sounding reference signal transmission enhancement and related communication device
WO2012002403A1 (en) Radio base station and communication control method
CN110730464A (en) Cross link interference measurement period configuration method, network side equipment and user terminal
JP5635824B2 (en) Radio base station and communication control method
JP5795723B2 (en) Radio transmission apparatus and transmission control method

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