WO2014067158A1 - Procédé d'ordonnancement, dispositif et station de base - Google Patents

Procédé d'ordonnancement, dispositif et station de base Download PDF

Info

Publication number
WO2014067158A1
WO2014067158A1 PCT/CN2012/084073 CN2012084073W WO2014067158A1 WO 2014067158 A1 WO2014067158 A1 WO 2014067158A1 CN 2012084073 W CN2012084073 W CN 2012084073W WO 2014067158 A1 WO2014067158 A1 WO 2014067158A1
Authority
WO
WIPO (PCT)
Prior art keywords
pairing
user
group
paired
channel
Prior art date
Application number
PCT/CN2012/084073
Other languages
English (en)
Chinese (zh)
Inventor
李亮亮
朱孝龙
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to PCT/CN2012/084073 priority Critical patent/WO2014067158A1/fr
Priority to CN201280021983.6A priority patent/CN103703854B/zh
Publication of WO2014067158A1 publication Critical patent/WO2014067158A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/121—Wireless traffic scheduling for groups of terminals or users
    • 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/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality

Definitions

  • the present invention relates to the field of communications, and in particular, to a scheduling method, apparatus, and base station.
  • MIMO Multiple Input Multiple Output
  • MU- ⁇ Multi User-Multiple Input Multiple Output
  • the method of using the MU MIM0 technology in the prior art is to ensure that the channel quality of the entire network user is not lower than a certain threshold or the rate is not lower than a certain threshold, in the case of known global information. Iterate through all possible user pairings and resource allocations and obtain a global optimal solution through exhaustive search.
  • the computational complexity of this method is very high and can be used as a theoretical upper limit, but it cannot be implemented in the product.
  • the amount of information that needs to be exchanged between base stations is very large, and there is a problem of delay.
  • Another method of using the MU MIM0 technology in the prior art is to independently adopt the MU MIM0 technology for each cell, such as first user pairing and then resource allocation, or first resource allocation and then user pairing.
  • the invention provides a scheduling method, a device and a base station, which solves the problem that the MU MIM0 technology is used independently for each cell and the cells lack cooperation among the cells in the prior art, and the interference information between the cells is used to improve The average cell throughput and the throughput of edge users.
  • the embodiment of the present invention provides a scheduling method, where the method includes: pre-pairing all candidate users on a to-be-scheduled channel, and obtaining a pre-pairing result corresponding to the to-be-scheduled channel, where the The scheduling channel is any one of the channels to be scheduled, the pre-pairing result includes at least one pre-pairing group; and the pre-pairing node corresponding to the to-be-scheduled channel, according to channel quality information of the to-be-scheduled channel And channel response information and high-interference indication information of inter-cell interaction, calculating a signal to interference and noise ratio of each paired user of each pre-pairing group in the pre-pairing result; according to each pre-pairing group in the pre-pairing result a paired user's signal-to-noise ratio, after processing each of the pre-paired groups, obtaining all final suitable matching groups, and calculating the weights of all the final suitable matching groups and correspondingly matching the maximum weights to the final fit
  • the scheduling channel is
  • the pre-pairing result corresponding to the to-be-scheduled channel is determined according to channel quality information, channel response information, and inter-cell interaction of the to-be-scheduled channel.
  • the interference indication information, the calculation of the signal to interference and noise ratio of each paired user of each pre-paired group in the pre-pairing result specifically: calculating, according to the high-interference indication information of the inter-cell interaction, all neighboring users to the local cell Calculating the interference power of each of the pre-paired groups in the pre-pairing result according to the interference power of the neighboring cell, the channel quality information of the to-be-scheduled channel, and the channel response information of all neighboring users Generating the useful signal power; calculating the signal dry noise of each paired user of each pre-paired group in the pre-pairing result according to the normalized useful signal power of each paired user of each pre-pairing result in the pre-pairing result ratio.
  • the second possible implementation In the current mode, after processing the respective pre-paired groups according to the signal-to-noise ratio of each paired user of each pre-matching group in the pre-matching result, all final suitable matching groups are obtained, and the calculation is performed. Determining, by the first matching user, the final matching pairing group corresponding to the maximum weight, and determining whether the each pre-matching group is a preliminary suitable matching group.
  • the group constitutes a preliminary suitable pairing result; calculating an instantaneous rate of each paired user in each of the preliminary suitable matching groups of the preliminary suitable pairing result; determining whether each of the preliminary suitable matching groups is a final suitable pairing result, if the preliminary suitable pairing The instantaneous rate of each paired user in the group is not less than the preset instantaneous rate threshold or meets its quality of service QoS guarantee conditions.
  • the preliminary suitable matching group is the final suitable matching group, and all the final suitable matching groups constitute a final suitable matching result; calculating the weight of each final suitable matching group in the final suitable matching result, the weight of the final suitable matching group a sum of instantaneous rates of all paired users in the final suitable pairing group, or a sum of proportional fairness coefficients of all paired users in the final suitable pairing result; selecting the maximum weight among the weights of each of the final suitable matching groups a value, and determining the final suitable pairing group corresponding to the maximum weight as the first pairing user of the to-be-scheduled channel.
  • an embodiment of the present invention provides a scheduling apparatus, where the apparatus includes: a pre-pairing module, configured to pre-pair all candidate users on a to-be-scheduled channel, and obtain a pre-corresponding to the to-be-scheduled channel.
  • a pre-pairing module configured to pre-pair all candidate users on a to-be-scheduled channel, and obtain a pre-corresponding to the to-be-scheduled channel.
  • the tuning channel is any one of all channels to be scheduled
  • the pre-pairing result includes at least one pre-pairing group, and transmitting a pre-pairing result corresponding to the to-be-scheduled channel to a signal-to-noise ratio a generating module; a signal-to-noise-ratio generating module, configured to receive, from the pre-pairing module, a pre-pairing result corresponding to the to-be-scheduled channel, according to the pre-pairing result corresponding to the to-be-scheduled channel, according to the to-be-scheduled channel
  • the channel quality information, the channel response information, and the high-interference indication information of the inter-cell interaction calculate a signal to interference and noise ratio of each paired user of each pre-paired group in the pre-pairing result, and each of the pre-pairing results
  • the signal to interference and noise ratio of each paired user of the pre-pairing group is transmitted to the weight generation module; the weight generation module is configured to generate the signal to interference and
  • the signal-to-noise-ratio generating module includes: a first calculating unit, configured to calculate, according to the high-interference indication information of the inter-cell interaction, all neighboring users to the local cell Transmitting power, and transmitting the interference power of all neighboring users to the local cell to the second computing unit; the second calculating unit is configured to receive all the neighboring users sent by the first computing unit to the local cell Calculating the normalization power of each pair of users in the pre-pairing result according to the interference power of the neighboring cell, the channel quality information of the to-be-scheduled channel, and the channel response information.
  • the third calculating unit is configured to receive the second computing unit to transmit The normalized useful signal power of each paired user of each pre-paired group in the pre-pairing result, according to each pre-matching
  • the normalized useful signal power of each paired user of the pairing group is calculated, and the signal to interference and noise ratio of each paired user of each of the pre-paired groups in the pre-paired result is calculated.
  • the weight generating module includes: the first determining unit is configured to determine whether the each pre-pairing group is Initially suitable for the pairing group, when the signal-to-noise ratio of each paired user of the pre-matching group is greater than or equal to a preset signal-to-noise ratio threshold, determining that the pre-matching group is the preliminary suitable matching group, All preliminary suitable pairing groups constitute a preliminary suitable pairing result, and the preliminary suitable pairing result is transmitted to the first calculating unit; the first calculating unit is configured to receive the preliminary suitable pairing result from the first determining unit, and calculate the The instantaneous rate of each paired user in each preliminary suitable pairing group that is initially suitable for the pairing result, and each preliminary suitable pairing of the preliminary suitable pairing result The instantaneous rate of each paired user in the group is transmitted to the second determining unit; the second determining unit is configured to receive, from the first calculating unit, the instantaneous rate of each paired user in the group
  • an embodiment of the present invention provides a base station, where the base station includes: a network interface; a processor; a memory; an application physically stored in the memory, where the application includes: And the system performs the following steps: pre-pairing all candidate users on the to-be-scheduled channel, and obtaining a pre-pairing result corresponding to the to-be-scheduled channel, where the to-be-scheduled channel is any of all to-be-scheduled channels a channel, the pre-pairing result includes at least one pre-pairing group; for the pre-pairing result corresponding to the to-be-scheduled channel, channel quality information, channel response information, and inter-cell interaction height of the to-be-scheduled channel are determined
  • the interference indication information calculating a signal-to-noise ratio of each paired user of each pre-matching group in the pre-pairing result; according to a signal-to-interference ratio of each paired user of each pre-pairing group in the pre-pairing result
  • the application is configured to enable the processor and the system to perform the pre-pairing result corresponding to the to-be-scheduled channel, according to the to-be-scheduled channel
  • the channel quality information, the channel response information, and the high interference indication information of the inter-cell interaction, and the instruction for calculating the signal-to-noise ratio of each paired user of each pre-paired group in the pre-pairing result is: according to the inter-cell interaction
  • the high-interference indication information is used to calculate the interference power of all neighboring users to the local cell; and the pre-pairing result is calculated according to the interference power of the neighboring cell, the channel quality information of the to-be-scheduled channel, and the channel response information.
  • Normalized useful signal power for each paired user of each of the pre-paired groups calculating the pre-paired result based on the normalized useful signal power of each paired user of each of the pre-paired groups The signal to interference and noise ratio of each paired user of each pre-paired group.
  • the signal to interference and noise ratio of each paired user according to each pre-pairing group in the pre-pairing result After processing the respective pre-pairing groups, obtaining all final suitable matching groups, and calculating weights of all the final suitable matching groups, and determining the final suitable matching group corresponding to the maximum weight as the to-be-scheduled
  • the instruction of the first pairing user of the channel is: determining whether the respective pre-pairing groups are preliminary suitable matching groups, and the signal-to-noise ratio of each pairing user of the pre-pairing group is greater than or equal to a preset signal dry noise.
  • the threshold Comparing the threshold, determining that the pre-matching group is the preliminary suitable matching group, and all the preliminary suitable matching groups constitute a preliminary suitable pairing result; and calculating whether the pair of the preliminary suitable matching result is the final suitable matching result, such as The instantaneous rate suitable for each paired user in the preliminary matching pairing group is not less than a preset instantaneous rate threshold value or meets the quality of service QoS guarantee condition,
  • the preliminary suitable matching group is the final suitable matching group, and all the final suitable matching groups constitute a final suitable matching result; calculating the weight of each final suitable matching group in the final suitable matching result, and the weight of the final suitable matching group is The sum of the instantaneous rates of all the paired users in the pairing group, or the sum of the proportional fairness coefficients of all the paired users in the final matching result; Selecting a maximum weight among the weights of each of the final suitable pairing groups, and determining the final suitable pairing group corresponding to the maximum weight as the first pairing user of the to-be-scheduled channel.
  • the pre-pairing result corresponding to the to-be-scheduled channel is obtained by using the scheduling method, the device, and the base station, and the pre-pairing result corresponding to the to-be-scheduled channel is obtained.
  • Channel quality information of the channel, channel response information, and high interference indication information of inter-cell interaction calculating a signal-to-noise ratio of each paired user of each pre-pairing group in the pre-pairing result; according to each pre-matching group in the pre-pairing result
  • a paired user's signal-to-noise ratio after processing each pre-paired group, all final suitable matching groups of pre-paired results are obtained, and the final suitable matching group corresponding to the weights of all final suitable matching groups and corresponding maximum weights is calculated.
  • FIG. 1 is a flowchart of a scheduling method according to Embodiment 1 of the present invention.
  • FIG. 2 is a flowchart of a scheduling method according to Embodiment 2 of the present invention.
  • FIG. 3 is a flowchart of a scheduling method according to Embodiment 3 of the present invention.
  • the pre-pairing result corresponding to the to-be-scheduled channel is obtained by performing pre-pairing on all the candidate users on the to-be-scheduled channel, and the channel quality information and channel according to the to-be-scheduled channel are obtained according to the pre-pairing result corresponding to the to-be-scheduled channel.
  • the noise ratio after processing each pre-pairing group, obtain all the final suitable matching groups of the pre-pairing result, and calculate the weights of all the final suitable matching groups and determine the final suitable matching group corresponding to the maximum weight as the to-be-scheduled channel.
  • the first pairing user performs user scheduling by using the first paired users of all the channels to be scheduled, thereby implementing interference information using inter-cell interaction, and improving the average throughput of the cell and the throughput of the edge users.
  • FIG. 1 is a flowchart of a scheduling method according to Embodiment 1 of the present invention. As shown, the embodiment of the present invention specifically includes the following steps:
  • Step 1 01 Pre-pairing all candidate users on the to-be-scheduled channel, and obtaining a pre-pairing result corresponding to the to-be-tuned channel.
  • the to-be-scheduled channel is any one of all channels to be scheduled, and the pre-pairing node includes at least one pre-pairing group.
  • the pairing result includes a plurality of pre-pairing groups; wherein the third number is two or more, and the third number is not greater than the second number.
  • the number of channels to be scheduled is the first number, for example, 6 channels to be scheduled are channel 1, channel 2, channel 3, channel 4, channel 5, and channel 6.
  • the number of candidate users is the second number, for example, 8 candidate users, namely User 1, User 2, User 3, User 4, User 5, User 6, User 7, and User 8.
  • the third number of pairs is paired for two users, and two or more users can be paired. Wherein, the third quantity is not greater than the second quantity.
  • the third number of pairs is paired for 2 users, then 2 users occupy the same channel; when the third number is paired to 2 When the user is paired, more than 2 users occupy the same channel.
  • the channel may be a channel composed of time-frequency resources in Long Term Evolution (LTE) or Long Term Evolution-Advanced (LTE-A), that is, a Resouce Block (RB); A code channel in a Universal Mobile Telecommunications System (UMTS); or other form of channel.
  • LTE Long Term Evolution
  • LTE-A Long Term Evolution-Advanced
  • RB Resouce Block
  • UMTS Universal Mobile Telecommunications System
  • Eight candidate users are paired on each channel to be scheduled, for example, two users are allowed to perform pairing, and eight candidate users are paired on each channel to be scheduled.
  • a pairing group that allows one user to pair among the eight candidate users is: user 1 and user 2, user 1 and user 3, user 1 and user 4, user 1 and user 5, user 1 and user 6.
  • each user's warranty and other users can only be paired once, and the pairing cannot be repeated.
  • Step 102 According to the pre-pairing result corresponding to the to-be-scheduled channel, according to the channel quality information of the to-be-tuned channel, the channel response information of the user equipment (User Equipment, ⁇ ), and the high interference indication of the inter-cell interaction (High The Interference Indication (H11) information calculates a Signal to Interference plus Noise Ratio (SINR) of each paired user of each pre-paired group in the pre-matching result of the to-be-scheduled channel.
  • SINR Signal to Interference plus Noise Ratio
  • step 102 specifically includes the following steps:
  • Step 201 Calculate the interference power of all neighboring users to the local cell by using the high-interference indication information of the inter-cell interaction.
  • the calculation process of the interference power of the neighboring cell scheduled by the neighboring cell in the neighboring cell is as follows: (1) Assume that the neighboring cell user] the downlink pilot signal received power (RSRP) to the cell is RSRP DL , and the downlink pilot signal has a transmit power spectral density (PSD) of s . At this time, the calculation formula of the downlink large-scale fading of the neighboring user 1 to the local cell is as shown in the formula (1 1). Among them, large-scale fading is also called path loss (PL).
  • RSRP downlink pilot signal received power
  • PSD transmit power spectral density
  • the path loss of all neighboring users is calculated, and the actual power value to the neighboring cell is the same as that of the neighboring user 1, as shown in formula (1 1 ) and Formula (1-2) is shown.
  • the calculation formula of the interference power of all the users in the plurality of neighboring cells to the own cell is as shown in (2-2).
  • the number of users in the district, ftS ; for the user, PL neighboring user i to the downlink large-scale fading of the cell, ie path loss, ⁇ « is the power of the background Gaussian white noise.
  • Step 202 Calculate, according to the interference power of the local cell, the channel quality information of the to-be-scheduled channel, and the channel response information of all neighboring users, each paired user of each pre-pairing group in the pre-pairing result. Normalized useful signal power. As shown by the formula ( 3 1 ) and the formula ( 3 2 ) ( ⁇ " ⁇ , ⁇ . - '" + + P h, m ⁇ If ⁇ ' - ⁇ ⁇ 2 I ⁇ h' Formula ( 3 1 )
  • the interference power; 1 is the unit matrix of ⁇ ⁇ ⁇ , m refers to the mth channel in the I" track.
  • af, . ., c4 u is the normalized useful signal power for each paired user on the mth channel.
  • 1 is the noise power corresponding to the normalized useful signal power of each paired user on the mth channel
  • SINR " 1 , , ., S1NR1 is the signal to interference and noise ratio of each paired user on the mth channel.
  • the process of if SINR can be performed by proposing one subcarrier from the channel, or extracting the average of thousands of subcarriers.
  • Step 1 G 3 according to the signal-to-noise ratio of the pre-paired user, process each pre-paired group 3 ⁇ 4 and calculate all the finals
  • the weight of the pairing group is suitable and the final suitable pairing group corresponding to the maximum weight is determined as the first pairing user of the channel to be scheduled.
  • the number of the final suitable matching group is less than or equal to the number of the preliminary suitable matching group, and the number of the preliminary suitable matching group is less than or equal to the number of the pre-matching group.
  • the foregoing step 103 includes the following steps:
  • Step 301 Determine whether each pre-pairing group in the pre-pairing result is a preliminary suitable matching group, and a signal-to-noise ratio of each paired user in the pre-matching group.
  • t ( ⁇ is greater than or equal to the preset signal-to-noise ratio threshold m ⁇ , as shown in equation (5)
  • the pre-matching group can be considered as the preliminary suitable matching group, and all preliminary suitable matching groups constitute a preliminary fit. Pairing results.
  • SINRr 1 SINR i ESH0LD Formula ( 5 ) where k is equal to 1, 2, ., ., or ⁇ .
  • the pre- Paired users in the pairing group are not suitable for pairing, deleting or ignoring the paired group.
  • All of the preliminary suitable matching groups obtained after the above pre-pairing result is processed in step 301 constitute a preliminary suitable pairing result.
  • the number of preliminary suitable matching groups in the preliminary suitable pairing results is less than or equal to the number of pre-matching groups in the pre-matching knots.
  • Step 302 Calculate the instantaneous rate of each paired user in each of the preliminary suitable pairing groups in the preliminary suitable pairing result.
  • users will be paired for the initial link adaptation and adaptive modulation and coding (Adapt ive Modu lati on Cod i ng, AMC), and hide one thousand 'Poisson's ratio 1 encoding transducer port .. table, Query the encoding method of each paired user.
  • the instantaneous rate of each paired user is calculated according to the encoding mode of each paired user and the capacity information of the channel to be scheduled.
  • the conversion table of the signal-to-noise ratio and the coding mode provided by each communication equipment vendor is also different.
  • Step 303 Determine whether each of the preliminary suitable matching groups is a final suitable pairing result, if the instantaneous rate of each paired user in the preliminary suitable matching group calculated above is not less than a preset instantaneous rate threshold or meets its service quality QoS. Guarantee conditions, then the initial suitable pairing group is finally suitable Pairing groups, all ultimately suitable pairing groups constitute the final suitable pairing result.
  • / ⁇ (0, ..., r (t) is the calculated instantaneous rate of each paired user in the preliminary suitable pairing group. If the calculated instantaneous rate after the N u users are paired is not lower than If a certain rate threshold meets other QoS requirements, the user may be considered to be suitable for the paired user, and the initial suitable pairing group is the final suitable matching group.
  • the formula (6) is shown.
  • the instantaneous rate of at least one paired user is less than the preset instantaneous rate threshold or does not satisfy other quality of service QoS.
  • the paired users in the preliminary suitable pairing group are not suitable for pairing, and the preliminary suitable matching group is deleted or ignored.
  • all the preliminary suitable matching groups obtained by the pre-pairing result after the processing in step 302 constitute the final suitable pairing result.
  • the number of final suitable matching groups in the final suitable pairing result is less than or equal to the number of preliminary suitable matching groups in the preliminary suitable pairing results.
  • Step 304 Calculate the weights of each of the final suitable matching groups in the final suitable pairing result.
  • the weight of the final suitable pairing group is the sum of the instantaneous rates that are finally suitable for all the paired users in the pairing group, or finally the sum of the proportional fairness coefficients of all the paired users in the pairing result.
  • the proportional fairness factor of the paired user is the ratio of the instantaneous rate of the paired user to the average rate.
  • the calculation weight can be calculated by using the proportional fairness coefficient of each paired user in addition to the calculation using the instantaneous rate of each paired user.
  • the proportional fairness coefficient of each paired user is calculated according to the instantaneous rate of each paired user in the final suitable pairing group.
  • the proportional fairness coefficient of each paired user is the ratio of the instantaneous rate of the paired user to the average rate.
  • the average rate of paired users is that the paired users are certain The average of all instantaneous rates over time.
  • the sum of the proportional fairness coefficients of all paired users in the final pairing group is calculated, and the sum of the fairness coefficients is the weight of the final suitable pairing group on the channel to be scheduled.
  • the calculation method of the weights of the other finally suitable pairing groups of the channel is similar, and even the calculation method of the weights of the final suitable pairing group of other channels is similar, and will not be described in detail here.
  • the number of preliminary suitable matching groups is less than or equal to the number of pre-matching groups; and finally the number of suitable matching groups is less than or equal to the number of preliminary suitable matching groups.
  • the above calculated weights can also be calculated by the Shannon formula.
  • the Shannon formula is a prior art. It is not described in detail here. It is worth noting that the above calculated weights can be either throughput or proportional (Proportional). Fair, PF) value, or other form of PF value.
  • channel 1 selects /3 ⁇ 4(25) equals 1.01 as the maximum weight, user 2 and user 5 are taken as the first
  • Step 104 The first paired user of all the channels to be scheduled is used to perform user scheduling.
  • the first number of first paired users are obtained.
  • the first number of first paired users are grouped, and the first pair of users who have the largest number of users participating in the pairing are selected as the second paired user group from the plurality of first paired user groups, and according to the second pairing
  • the number of user groups is the third paired user of the third paired user group and the third user group.
  • the first number of channels, the first number of first paired users are obtained, and all the first paired users are grouped, and each group ensures that the allocated users are not duplicated.
  • the first paired user group selected in the group is the second paired user group.
  • the sum of the weights of all the second pairing users in each second pairing user group is calculated separately, and the second pairing user group with the largest sum of the selected weights is the third. Pair the user group, and the paired user of the third paired user group is the third paired user.
  • the first paired user of the channel to be scheduled and the third paired user of the third paired user group are respectively compared, and if the first paired user is the same as the third paired user in the third paired user group, Selecting a channel to be scheduled corresponding to the first pairing user to perform data transmission; if the first pairing user and all the third pairing users in the third pairing user group are different, then the first pairing user corresponds to The weights of all the third paired users in the third paired user group are calculated on the to-be-scheduled channel, and the third paired user with the largest weight is selected to perform data transmission with the channel to be scheduled corresponding to the first-pair user.
  • the first paired user of channel 1 is _ (25), and the weight of 3 ⁇ 4 (25) is equal to 1
  • the first paired user of channel 2 is A4 ( 34), and ⁇ ( 34)
  • the weight is equal to 0.96;
  • the first paired user of channel 3 is As (35), and the weight of A5 (35) is equal to 0.93;
  • the first paired user of channel 4 is 3 ⁇ 4 (46), and ⁇ (46)
  • the weight of the weight is equal to 1. 17;
  • the first pairing user of channel 5 is ⁇ (36), and the weight of ⁇ (36) is equal to 1.
  • the third pairing user group ⁇ i3 ⁇ 4(35), ;3 ⁇ 4(46), 3 ⁇ 4(28) ⁇ is determined, where the third pairing user is ⁇ 5 (35), 0 (46), 3 ⁇ 4 (28).
  • the first pairing user of channel 1 is; 3 ⁇ 4 (25), and the third pairing user is 3 ⁇ 4 (35) ), 3 ⁇ 4(46), /3 ⁇ 4(28), compare 3 ⁇ 4(25) with /3 ⁇ 4(35), 3 ⁇ 4(46), /3 ⁇ 4(28), and compare the result to the first paired user of channel 1.
  • the weights of ⁇ 5 (35), 1 ⁇ 2(46), ⁇ 3 (28) are calculated on channel 1, and the calculated weight is selected as the largest value.
  • the third paired user such as 3 ⁇ 4 (35), has a weight of 0. 97.
  • the third paired user ⁇ 5 (35) is selected, that is, the user 3 and the user 5 are paired, and the data transmission is performed by using the channel 1;
  • the first paired user of channel 3 is As (35)
  • the third pairing user is ⁇ (35), 3 ⁇ 4 0 (46), ⁇ ⁇ 3 (28), 3 ⁇ 4 (35) and / 3 ⁇ 4 (35) respectively.
  • i3 ⁇ 4. (46), i3 ⁇ 4 (28) for comparison the comparison result is channel 3 If the factory and the third paired user in the third paired user group are the same, then select ⁇
  • the channel 3 is used for the data transmission channel ⁇ - the same, and will not be described in detail here.
  • step 104 specifically includes the following steps:
  • the six channels to be scheduled, and eight candidates allows the user to pair two users if the channel 1 select ⁇ . (25) is the maximum weight, then user 2 and user 5 are selected as the first pairing channel 2 (34) as the maximum weight, then user 3 and user 4 are used as the first pairing user; channel 3 is selected as A5 (35) ) is the maximum weight, then user 3 and user 5 are used as the first pairing user; channel 4 selects ⁇ (46) as the maximum weight, then user 4 and user 6 are used as the first pairing user; channel 5 selects the maximum weight , user 3 and user 6 are used as the first pairing user; channel 6 is selected as ⁇ (28 3 ⁇ 4 households and user 8 as the first pairing user dark).
  • the number of the first pair of users in all the first paired user groups is calculated separately. such as:
  • ⁇ 3 ⁇ 4( 35 ) ⁇ is a paired user group with only one paired user, ⁇ 2 . ( 46 ), 3 ⁇ 4 ( 2 ⁇ is a paired user group with two paired users, ⁇ . (35), /3 ⁇ 4(46), /3 ⁇ 4(28) ⁇ is a paired user group with three paired users.
  • the maximum value is selected from the number of the first pair of users in the first pair of user groups; then the first pair of user groups corresponding to the maximum value is used as the second pairing user group, and the first pair corresponding to the maximum value is simultaneously The user acts as the second pairing user.
  • the second pairing user group is used as the third pairing user group, and the second pairing user in the second pairing user group is used as the third pairing user;
  • the user group is two or more, the weights of all the second paired users in the second paired user group are calculated, and the weight and the largest second paired user group are used as the third paired user group, and the second pairing is performed simultaneously.
  • the second paired user within the user group acts as the third paired user.
  • ⁇ ; 5 (35), i3 ⁇ 4 0 (46), 3 ⁇ 4 (28) ⁇ are the second paired user group, that is, the paired user group having three paired users, and the number of the first paired users included is the largest, and If there is only one pairing user group including three paired users, then 5 (35), p 46), /3 ⁇ 4 (28) ⁇ will be used as the third pairing user group, and / 3 ⁇ 4 (35), p 46), A3 ( 28) As a third pairing user.
  • the second pairing user group including the three paired users is not only one, and there are two or more, the weight of the second pairing user in each second pairing user group is calculated, and the process of calculating the weight is as follows.
  • the scheduling method provided by the embodiment of the present invention performs pre-pairing on all the candidate users on the to-be-scheduled channel to obtain a pre-pairing result corresponding to the to-be-scheduled channel; and the pre-pairing result corresponding to the to-be-scheduled channel, according to the to-be-scheduled channel Channel quality information, channel response information, and high-interference indication information of inter-cell interactions, calculating a signal-to-interference ratio of each paired user of each pre-pairing group in the pre-pairing result; according to each pre-pairing group in the pre-pairing result Pairing the user's signal-to-noise ratio, after processing each pre-paired group, obtaining all the final suitable matching groups of the pre-matching results,
  • FIG. 4 is a schematic diagram of a scheduling apparatus according to Embodiment 4 of the present invention, where the scheduling apparatus is configured to perform the scheduling method provided by Embodiments 1, 2, and 3 of the present invention.
  • the scheduling apparatus provided by the embodiment of the present invention specifically includes: a pre-pairing module 41, a signal-to-noise ratio generating module 42, a weight generating module 43 and a scheduling module 44.
  • the pre-pairing module 41 is configured to pre-pair all the candidate users on the to-be-scheduled channel to obtain a pre-pairing result corresponding to the to-be-scheduled channel, and the to-be-scheduled channel is any one of all to-be-scheduled channels, and the pre-pairing result includes at least a pre-pairing group, and the pre-pairing result corresponding to the channel to be scheduled is transmitted to the signal to interference and noise ratio generating module 42.
  • the signal to interference and noise ratio generating module 42 receives the pre-pairing result corresponding to the channel to be scheduled from the pre-pairing module 41, and is configured to Pre-pairing result corresponding to the scheduling channel, calculating a signal-to-noise ratio of each paired user of each pre-pairing group in the pre-pairing result according to channel quality information, channel response information, and high-interference indication information of the inter-cell interaction And transmitting the signal-to-noise ratio of each paired user of each pre-paired group in the pre-pairing result to the weight generating module 43; the weight generating module 43 receives each pre-pairing in the pre-pairing result from the signal-to-noise-ratio generating module 42.
  • the signal to interference and noise ratio of each paired user of the group After processing each pre-pairing group, all final matching groups are obtained, and Calculating all the weights that are finally suitable for the pairing group and determining the final suitable pairing group corresponding to the maximum weight as the first pairing user of the channel to be scheduled, and transmitting the first pairing users of all the channels to be scheduled to the scheduling module 44;
  • the first paired user for receiving all the channels to be scheduled from the weight generation module 43 performs user scheduling with the first paired users of all the channels to be scheduled.
  • the signal to interference and noise ratio generation module 42 in the scheduling apparatus specifically includes: a first calculation unit 51, a second calculation unit 52, and a third calculation unit 53.
  • the first calculating unit 51 is configured to calculate interference power of all neighboring users to the local cell according to the high-interference indication information of the inter-cell interaction, and transmit the interference power of all neighboring users to the local cell to the second computing unit 52;
  • the second calculating unit 52 is configured to receive the interference power of all neighboring users sent by the first calculating unit 51 to the local cell, according to the interference power of the neighboring cell, the channel quality information of the channel to be scheduled, and the channel response information. Calculating normalized useful signal power of each paired user of each pre-paired group in the pre-pairing result, and transmitting normalized useful signal power of each paired user of each pre-matching group in the pre-matching result to the third computing unit 53.
  • the third calculating unit 53 calculates, by using the normalized useful signal power, each of the pre-paired groups in the pre-paired node according to the normalized useful signal power of each paired user of each pre-matching group in the pre-matching result. Pair the user's letter to the odds ratio.
  • the first calculating unit 51 is specifically configured to calculate the transmit power if density and the downlink pilot signal received power of the downlink pilot signal from the neighboring cell user to the local cell according to the high interference indication information of the inter-cell interaction, and calculate the neighboring cell user to the local
  • the path loss of the cell, the neighboring cell user is any user of all neighboring users; after obtaining the transmit power spectral density of the neighboring cell user, calculating the transmit power spectral density of the neighboring cell user and the path loss of the neighboring cell user to the local cell The difference is obtained, thereby obtaining the actual power value of the neighboring cell user to the local cell; calculating the sum of the actual power values of all neighboring cell users to the local cell, and the power of the background Gaussian white noise, thereby obtaining all neighboring cell users to the cell Thousands of power.
  • the weight generation module in the scheduling apparatus provided by the embodiment of the present invention
  • the calculation unit 64 and the selection unit 65 specifically includes: a first determining unit 61, a first calculating unit 62, a second determining unit 63, and a second The calculation unit 64 and the selection unit 65.
  • the first determining unit 61 is configured to determine whether each pre-pairing group is a preliminary suitable matching group. When the signal-to-noise ratio of each paired user of the pre-matching group is greater than or equal to a preset signal-to-noise ratio threshold, the pre-determination is performed.
  • the pairing group is a preliminary suitable pairing group, all the preliminary suitable pairing groups constitute a preliminary suitable pairing result, and the preliminary suitable pairing result is transmitted to the first calculating unit 62; the first calculating unit 62 is configured to receive the preliminary suitable pairing from the first determining unit 61.
  • the second determining unit 63 is configured to receive, from the first calculating unit 62, the instantaneous rate of each paired user in each of the preliminary suitable matching groups that is initially suitable for the pairing result, and determine whether each of the preliminary suitable matching groups is the final suitable pairing result, if the preliminary matching is suitable.
  • the instantaneous rate of each paired user in the group is not less than the preset instantaneous If the rate threshold or the QoS guarantee condition of the service quality is satisfied, the matching group is initially suitable for the final matching group, and all the final suitable matching groups constitute the final suitable pairing result, and the final suitable pairing result is transmitted to the second calculating unit 64;
  • the second calculating unit 64 is configured to receive the final suitable pairing result from the second determining unit 63, calculate the weight of each final suitable matching group in the final suitable pairing result, or finally the sum of the proportional fairness coefficients of all the paired users in the pairing result, and
  • the weights of each of the final suitable matching groups in the final matching result are transmitted to the selecting unit 65;
  • the selecting unit 65 is configured to receive, from the second calculating unit 64, the weights of each of the final suitable matching groups in the final suitable pairing result, and select each final suitable
  • the maximum weight of the paired group's weights, and the final suitable pairing group corresponding to the maximum weight is determined as the first paired user
  • the proportional fairness coefficient of the paired users is the ratio of the instantaneous rate of the paired users to the average rate.
  • the number of preliminary suitable matching groups in the preliminary suitable pairing result is less than or equal to the number of pre-matching groups in the pre-matching result; the number of final suitable matching groups in the final suitable pairing result is less than or equal to the preliminary in the preliminary suitable pairing result. The number of matching groups.
  • the first determining unit 61 is further configured to use at least one pairing result in the pre-pairing result.
  • the second determining unit 63 is also used if the preliminary matching result is If the instantaneous rate of the at least one paired user is less than the preset instantaneous rate threshold or does not satisfy other quality of service QoS guarantee conditions, the paired users in the preliminary matching result are not suitable for pairing, deleting or ignoring the preliminary suitable pairing result.
  • the scheduling apparatus pre-pairs all candidate users on the to-be-scheduled channel, and obtains multiple pre-pairing results corresponding to the to-be-scheduled channel; according to channel quality information, channel response information of the channel to be scheduled, and The high-interference indication information of the small-interval interaction, calculates the weight of all the final suitable pairing results corresponding to the channel to be scheduled; and determines the final suitable pairing result corresponding to the maximum weight as the first paired user of the channel to be scheduled;
  • the first paired users of all the channels to be scheduled perform user scheduling, thereby implementing interference information using inter-cell interaction, and improving the average throughput of the cell and the throughput of the edge users.
  • FIG. 7 is a schematic diagram of a base station according to Embodiment 6 of the present invention.
  • the base station is for performing the scheduling method provided by the first, second and third embodiments of the present invention.
  • the present embodiment includes a network interface 71, a processor 72, and a memory 73.
  • the system bus 74 is used to connect the network interface 7 1 , the processor 72 and the memory 73.
  • Network interface 71 is used for communication with user terminals.
  • the memory 73 may be a persistent storage such as a hard disk drive and a flash memory having a software module and a device driver.
  • the software modules are capable of executing the various functional modules of the above described method of the present invention; the device drivers can be network and interface drivers.
  • An application physically stored in the memory comprising instructions operable to cause the processor and the base station to perform the following:
  • All the candidate users are pre-paired on the to-be-scheduled channel to obtain a pre-pairing result corresponding to the to-be-scheduled channel, where the to-be-scheduled channel is any one of all to-be-scheduled channels, and the pre-pairing result includes At least one pre-pairing group; for each of the pre-pairing results corresponding to the to-be-scheduled channel, calculating, according to the channel quality information of the channel to be scheduled, the channel response information, and the high-interference indication information of the inter-cell interaction, The signal-to-noise ratio of a pair of users; according to the signal-to-noise ratio of each paired user of each pre-matching group in the pre-pairing result, after processing each pre-matching group, all final matching groups are obtained, and all final fits are calculated.
  • the weight of the pairing group is determined and the final suitable pairing group corresponding to the maximum weight is determined as the first pairing user of the channel to be scheduled; the first pairing user of all the channels to
  • an application physically stored in the memory where the application is configured to enable the processor and the base station to perform pre-pairing results corresponding to a to-be-scheduled channel, and to determine channel quality information of a channel to be scheduled And the channel response information and the high-interference indication information of the inter-cell interaction, and the instruction for calculating the signal-to-noise ratio of each paired user in each pre-pairing group in the pre-pairing result is: calculating all neighbors according to the high interference indication information of the inter-cell interaction The interference power of the zone user to the local cell; calculating the normalization of each paired user of each pre-pairing group in the pre-pairing result according to the interference power of the neighboring cell, the channel quality information of the channel to be scheduled, and the channel response information of all neighboring users The useful signal power is calculated; the signal-to-noise ratio of each paired user of each pre-paired group in the pre-pairing result is calculated according to the normalized useful signal power of each paired user of each pre-pairing group
  • an application physically stored in the memory may be configured to enable the processor and the base station to perform calculation of all neighboring users according to the high-interference indication information of the inter-cell interaction
  • the instruction of the interference power of the cell is: according to the high power interference information of the inter-cell interaction, the transmit power spectral density of the downlink pilot signal of the neighboring cell user to the local cell and the received power of the downlink pilot signal, and calculate the neighboring cell user to The path loss of the cell, the neighbor user is any user of all neighbors; after obtaining the transmit power spectral density of the neighbor user, calculate the transmit power spectral density of the neighboring cell user and the path loss of the neighboring cell user to the local cell The difference is obtained, thereby obtaining the actual power value of the neighboring cell user to the local cell; calculating the sum of the actual power values of all neighboring cell users to the local cell, and the power of the background Gaussian white noise, thereby obtaining all neighboring cell users to the cell Interference power.
  • an application physically stored in the memory the application being Performing, by the processor and the base station, a signal-to-noise ratio of each paired user of each pre-paired group in the pre-pairing result, processing each of the pre-paired groups, and obtaining all final suitable matching groups, and
  • the instructions for calculating the weights of all the final suitable matching groups and determining the final suitable matching group corresponding to the maximum weight as the first pairing user of the channel to be scheduled are: determining whether each pre-matching group is a preliminary suitable matching group, when the pre-matching group When the signal-to-noise ratio of each paired user is greater than or equal to the preset signal-to-noise ratio threshold, it is judged that the pre-matching group is the preliminary suitable matching group, and all the preliminary suitable matching groups constitute a preliminary suitable pairing result;
  • each of the preliminary suitable matching groups is the final suitable pairing result, if the initial rate suitable for each paired user in the pairing group is not less than the preset instantaneous rate threshold or meets its quality of service QoS
  • the guarantee conditions are initially suitable for the matching group to be the final suitable matching group, and all the final suitable matching groups constitute the final suitable matching result; calculate the weight of each final suitable matching group in the final matching result, and finally the weight of the matching group is finally suitable.
  • the final suitable pairing group is determined to be the first paired user of the channel to be scheduled.
  • the proportional fairness coefficient of the paired user is the ratio of the instantaneous rate of the paired user to the average rate.
  • the number of preliminary suitable matching groups in the preliminary suitable pairing result is less than or equal to the number of pre-matching groups in the pre-matching result; the number of final suitable matching groups in the final suitable pairing result is less than or equal to the preliminary in the preliminary suitable pairing result. The number of matching groups.
  • an application physically stored in the memory the application further comprising instructions operable to cause the processor and the base station to: process at least one of the paired users in the pre-pairing result When the noise ratio is less than the preset signal-to-noise ratio threshold, the paired users in the pre-pairing result are not suitable for pairing, erasing or ignoring. Pre-pairing.
  • an application physically stored in the memory, the application further comprising instructions operable to cause the processor and the base station to: if initially suitable for at least one of the paired users The instantaneous rate is less than the preset instantaneous rate threshold or is not satisfied For other service quality QoS guarantee conditions, it is judged that the paired users in the preliminary matching result are not suitable for pairing, and the preliminary suitable pairing is deleted or ignored.
  • the base station performs pre-pairing on all the candidate users on the to-be-scheduled channel, and obtains multiple pre-pairing results corresponding to the to-be-scheduled channel.
  • the high-interference indication information of the interaction calculating the weight of all the final suitable pairing results corresponding to the channel to be scheduled; and determining the final suitable pairing result corresponding to the maximum weight as the first pairing user of the channel to be scheduled;
  • the first paired user of the channel to be scheduled performs user scheduling, thereby implementing the interference information using the inter-cell interaction, and improving the average throughput of the cell and the throughput of the edge user.
  • RAM random access memory
  • ROM read only memory
  • EEPROM electrically programmable ROM
  • EEPROM electrically erasable programmable ROM
  • registers hard disk, removable disk, CDTMR0M, or technical fields. Any other form of storage medium known.

Landscapes

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

Abstract

La présente invention concerne un procédé d'ordonnancement, un dispositif et une station de base. Ledit procédé consiste : à apparier au préalable tous les utilisateurs candidats sur un canal à ordonnancer, afin d'obtenir un résultat d'appariement préalable correspondant au canal à ordonnancer; à calculer, en fonction d'informations de qualité de canal et d'informations de réponse de canal qui se rapportent au canal à ordonnancer ainsi que d'informations d'indication de brouillage élevé relatives à l'interaction entre cellules, le rapport signal/brouillage plus bruit de chaque utilisateur à apparier de chaque groupe d'appariement préalable dans le résultat d'appariement préalable; à traiter chaque groupe d'appariement préalable suivant le rapport signal/brouillage plus bruit de chaque utilisateur à apparier de chaque groupe d'appariement préalable dans le résultat d'appariement préalable, de manière à obtenir tous les groupes à apparier qui conviennent le mieux, et à calculer les poids de tous les groupes à apparier qui conviennent le mieux puis à déterminer que, parmi les groupes à apparier qui conviennent le mieux, celui qui correspond au poids maximal est un premier utilisateur à apparier du canal à ordonnancer; et à réaliser un ordonnancement des utilisateurs au moyen des premiers utilisateurs à apparier de tous les canaux à ordonnancer. Par conséquent, la présente invention permet d'utiliser les informations de brouillage qui concernent l'interaction entre cellules, et d'améliorer le débit moyen des cellules ainsi que le débit des utilisateurs en bordure.
PCT/CN2012/084073 2012-11-05 2012-11-05 Procédé d'ordonnancement, dispositif et station de base WO2014067158A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2012/084073 WO2014067158A1 (fr) 2012-11-05 2012-11-05 Procédé d'ordonnancement, dispositif et station de base
CN201280021983.6A CN103703854B (zh) 2012-11-05 2012-11-05 用户调度方法和装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2012/084073 WO2014067158A1 (fr) 2012-11-05 2012-11-05 Procédé d'ordonnancement, dispositif et station de base

Publications (1)

Publication Number Publication Date
WO2014067158A1 true WO2014067158A1 (fr) 2014-05-08

Family

ID=50363955

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/084073 WO2014067158A1 (fr) 2012-11-05 2012-11-05 Procédé d'ordonnancement, dispositif et station de base

Country Status (2)

Country Link
CN (1) CN103703854B (fr)
WO (1) WO2014067158A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105721123B (zh) * 2014-12-03 2019-04-09 电信科学技术研究院 一种用户配对及功率分配方法及装置
CN106095115B (zh) * 2016-06-30 2019-05-17 北京智能管家科技有限公司 一种应用程序调度处理方法及装置
CN114828270B (zh) * 2022-04-06 2024-04-12 中国联合网络通信集团有限公司 一种配对调度方法、装置及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101904146A (zh) * 2007-12-21 2010-12-01 摩托罗拉公司 Wimax中的上行链路协同sdma用户配对的方法
CN101989874A (zh) * 2009-07-31 2011-03-23 中兴通讯股份有限公司 一种多用户多输入多输出的配对方法及装置
CN101997583A (zh) * 2009-08-21 2011-03-30 索尼株式会社 用于协作多点传输的上行多用户mimo用户配对方法和装置
CN102340879A (zh) * 2010-07-23 2012-02-01 中兴通讯股份有限公司 一种基于mimo系统的用户调度方法及系统

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102316597B (zh) * 2010-06-30 2015-04-22 中兴通讯股份有限公司 Mimo系统中的资源调度方法和装置
CN102611535A (zh) * 2011-01-24 2012-07-25 中兴通讯股份有限公司 一种多用户多输入多输出的调度方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101904146A (zh) * 2007-12-21 2010-12-01 摩托罗拉公司 Wimax中的上行链路协同sdma用户配对的方法
CN101989874A (zh) * 2009-07-31 2011-03-23 中兴通讯股份有限公司 一种多用户多输入多输出的配对方法及装置
CN101997583A (zh) * 2009-08-21 2011-03-30 索尼株式会社 用于协作多点传输的上行多用户mimo用户配对方法和装置
CN102340879A (zh) * 2010-07-23 2012-02-01 中兴通讯股份有限公司 一种基于mimo系统的用户调度方法及系统

Also Published As

Publication number Publication date
CN103703854B (zh) 2017-06-20
CN103703854A (zh) 2014-04-02

Similar Documents

Publication Publication Date Title
Xu et al. Optimal power allocation scheme for non-orthogonal multiple access with $\alpha $-fairness
Zhou et al. Fronthaul compression and transmit beamforming optimization for multi-antenna uplink C-RAN
JP5484819B2 (ja) マルチセル協調送信方法
JP4899637B2 (ja) 無線通信システムおよび無線通信方法
KR101524689B1 (ko) 간섭 정렬을 위하여 선택적으로 간섭 채널들에 대한 정보를피드백하는 통신 시스템 및 그 방법
CN103999513B (zh) 用于mu‑mimo的上行链路功率控制
WO2010118650A1 (fr) Procédé de retour d'information de canal, terminal, station de base et système à entrés multiples/sorties multiples (mimo)
CN102186212A (zh) 一种小区间协作调度方法、系统和用户设备
Coskun et al. Three-stage resource allocation algorithm for energy-efficient heterogeneous networks
CN113473422B (zh) 一种面向b5g的无线携能d2d网络高效资源分配方法
Boviz et al. Effective design of multi-user reception and fronthaul rate allocation in 5G cloud RAN
CN114219354A (zh) 一种基于联邦学习资源分配优化方法及系统
KR102027914B1 (ko) 무선 통신 시스템에서 셀 간 간섭 제거 방법 및 장치
Zhang et al. Dynamic user-centric clustering for uplink cooperation in multi-cell wireless networks
US10893394B2 (en) Devices and methods arranged to support user communication device grouping in a communication network
WO2014183315A1 (fr) Procédé d'attribution de ressource distribuée de système de relais sans fil mimo-ofdma
Karimi et al. Lightweight user grouping with flexible degrees of freedom in virtual MIMO
WO2013000242A1 (fr) Procédé et dispositif d'allocation de ressources
WO2014067158A1 (fr) Procédé d'ordonnancement, dispositif et station de base
Chen et al. Resource allocation with CoMP transmission in ultra dense cloud-based LTE small cell networks
WO2015085494A1 (fr) Station de base et procédé de planification d'utilisateurs
CN110663234A (zh) 控制设备、网络节点及其方法
Liu et al. Hybrid multiple access and service-oriented resource allocation for heterogeneous QoS provisioning in machine type communications
Xing et al. Joint channel assignment and power allocation for noma-based d2d communications with imperfect csi
CN112888076B (zh) 一种调度方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12887797

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12887797

Country of ref document: EP

Kind code of ref document: A1