CN110392378A - The power distribution method compromised in the more cluster NOMA systems of downlink - Google Patents

The power distribution method compromised in the more cluster NOMA systems of downlink Download PDF

Info

Publication number
CN110392378A
CN110392378A CN201910777897.1A CN201910777897A CN110392378A CN 110392378 A CN110392378 A CN 110392378A CN 201910777897 A CN201910777897 A CN 201910777897A CN 110392378 A CN110392378 A CN 110392378A
Authority
CN
China
Prior art keywords
cluster
power
base station
clusters
users
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910777897.1A
Other languages
Chinese (zh)
Other versions
CN110392378B (en
Inventor
李兴旺
李晓静
张丹青
彭成章
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Henan University of Technology
Original Assignee
Henan University of Technology
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 Henan University of Technology filed Critical Henan University of Technology
Priority to CN201910777897.1A priority Critical patent/CN110392378B/en
Publication of CN110392378A publication Critical patent/CN110392378A/en
Application granted granted Critical
Publication of CN110392378B publication Critical patent/CN110392378B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0473—Wireless resource allocation based on the type of the allocated resource the resource being transmission power
    • 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
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

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

Abstract

The invention discloses the power distribution method compromised in the more cluster NOMA systems of downlink, be suitable for include 1 base station andMKThe downlink NOMA system of a user, and base station and user configure lowest power and the attainable maximum power of single cluster needed for single-antenna base station calculates single cluster according to the minimum speed limit demand of channel condition and each user, establish the power distribution optimization problem for maximizing the compromise of rate and energy efficiency, first solve the power distribution that the compromise of rate and energy efficiency is maximized in single cluster, obtain the relationship in single cluster between the general power of the maximum value and the cluster of rate and energy efficiency compromise, based on this result, power distribution between cluster is converted by the power distribution between user in optimization problem, solve cluster between power distribution and according to this result be each user's distribution power.

Description

Compromise power distribution method in downlink multi-cluster NOMA system
Technical Field
The invention relates to the field of communication, in particular to a compromise power allocation method in a downlink multi-cluster NOMA system.
Background
With the rapid development of mobile communications, it has been difficult for conventional multiple access techniques to meet the explosive growth of wireless data traffic. Therefore, the fifth generation mobile communication employs a Non-Orthogonal Multiple Access (NOMA) technology with higher system throughput and higher spectral efficiency. Compared with the research of the traditional multiple access technology in time domain, frequency domain and code domain, the NOMA technology introduces a new dimension, namely power domain, distributes different powers for a plurality of users at a base station end, then superposes the signals of the users on the same time-frequency resource, and after receiving the signals, the users adopt the Successive Interference Cancellation (SIC) technology to detect the expected received signals. Power allocation not only relates to the detection order of each user signal, but also affects the reliability and effectiveness of the system, and therefore, power allocation in NOMA is one of the research hotspots in recent years.
Many documents have studied power allocation in single cell downlink NOMA systems, where the targets of power allocation are of three types: maximize sum rate, maximize energy efficiency, and maximize fairness. The power distribution scheme for maximizing the sum rate takes the total power or the rate of a single user as a constraint condition, solves the power distributed to each user by taking the sum rate of the maximized user as a target, and also solves the power distributed to each user by taking the ratio of the sum rate of the maximized user to the total power as a target by taking the sum rate of the maximized user or the rate of the single user as a constraint condition. In recent years, many documents have studied the relationship between energy efficiency and sum rate. The document "Energy efficiency and spectral-efficiency depletion in downlink NOMA systems" studies a compromised power allocation scheme in a multi-cluster NOMA system, however each cluster contains only two users.
Disclosure of Invention
The invention provides a compromise power allocation method in a downlink multi-cluster NOMA system, which is suitable for the downlink NOMA system comprising 1 base station and MK users, wherein the base station and the users are both provided with a single antenna.
The method comprises the steps of calculating the minimum power required by a single cluster and the maximum power which can be achieved by the single cluster by a base station according to channel conditions and the minimum speed requirement of each user, establishing an optimization problem of compromise between the maximized speed and the energy efficiency by taking the total power of the base station and the minimum speed requirement of the user as constraint conditions, solving power distribution of the maximized user in the single cluster and the compromise between the speed and the energy efficiency to obtain the relation between the maximum value of the compromise between the single cluster speed and the energy efficiency and the total power of the cluster, converting power distribution among the users in the optimization problem into power distribution among the clusters based on the result, solving power distribution among the clusters and distributing power for each user according to the result.
In summary, the compromised power allocation method in the downlink multi-cluster NOMA systems proposed in the present invention is applicable to downlink NOMA systems including 1 base station and MK users, and the base station and the users are both configured with a single antenna, and includes the following steps:
a, a base station clusters users according to channels from the base station to MK users, each cluster comprises M users, the M users are divided into K clusters, and u is usedkmDenotes the mth user in the kth cluster, K1, 2kmIs hkm，|hk1|2≥|hk2|2≥…≥|hkM|2The base station allocates a sub-band for each cluster, and the sub-bands among the clusters are orthogonal;
b, the base station calculates the minimum power required by a single cluster and the maximum power which can be reached by the single cluster;
c, the base station establishes an optimization problem of compromise between the maximum rate and the energy efficiency, and simplifies the optimization problem;
d, the base station solves the simplified optimization problem in the step C to obtain the power distributed to the kth cluster;
e, the base station is uk1Distributing powerBase station is ukmDistribution power pkm0K1, 2,., K, M2, 3., M, K is the total number of clusters, M is the total number of users in each cluster.
Further, the step B specifically includes:
b1, with pkmIndicating a base station as ukmDistributed power，pk1≤pk2≤…≤pkM，pkIs the total power allocated by the base station for the kth cluster, using rkmRepresents ukmThe minimum rate requirement of (a) is,represents ukmMinimum rate requirement rkmThe corresponding signal-to-interference-and-noise ratio is calculated by the base station to obtain pkmIs taken to satisfy σ2Is the variance of the noise received by the user, and therefore ukmThe minimum power required is K is the total number of clusters, M is the total number of users in each cluster;
b2, the base station obtains p according to the step B1kmSatisfied condition andcalculating to obtain the lowest power p required by the kth clusterkmin， PmaxIs the maximum transmit power of the base station, K is the total number of clusters, M is the total number of users in each cluster;
b3, the base station calculates the maximum power that the kth cluster can reachK is the total number of clusters.
Further, the step C specifically includes:
c1, the base station sets up an optimization problem that maximizes the compromise of rate and energy efficiency,
wherein beta is a weighting factor for rate, 1-beta is a weighting factor for energy efficiency, 0 < beta < 1,constraint conditionsMeans that the sum of the power of all users cannot exceed PmaxConstraint pkm≥pkm0A rate requirement for guaranteeing users, K1, 2,., K, M1, 2., M, K being the total number of clusters, M being the total number of users in each cluster;
c2, the base station reduces the optimization problem in the formula (1) to,
wherein, constraint conditionsMeans that the sum of the powers of all clusters cannot exceed PmaxConstraint pk≥pkminFor ensuring the kthUser rate requirements of individual clusters.
Further, the step D specifically includes:
d1, usingExpressed as the power allocated for the kth cluster, order
Wherein, for the kth cluster, the base station calculatesAndk is the total number of clusters;
d2, if ηk(pkmin) Is greater than 0 andpower is allocated to the kth clusterIf etak(pkmax) Is < 0 andpower is allocated to the kth clusterK is the total number of clusters;
d3, if ηk(pkmin) Is greater than 0 andthen calculate λk(pkmax) And λk(pkmin)，λk(pkmin)＞λk(pkmax) Then, power is allocated to the clusterOtherwise, not allocating power to the cluster, where K is 1,2, …, and K is the total number of clusters;
d4, if ηk(pkmax) Is < 0 andcalculating lambdak(pk) Maximum time pkBy taking the value of (a), pk' represents, let pkmax＝pk', K-1, 2, K being the total number of clusters;
d5, placing the clusters without power distribution into the set A;
d6, for any cluster a in the set A, if etaa(pamax) Greater than 0 and etaa(pamin) If the cluster is less than 0, the cluster is placed in a set B;
d7, for any cluster B in the set B, the base station solves etab(pb) When p is 0bBy taking the value of (a), pb *That is, if equation (3) is satisfied, power p is allocated to cluster bb＝pbminIf the cluster is deleted from the set A and the formula (4) is satisfied, the cluster is deleted in the section [ p ]bmin,pb *]To find out lambdab(pb) P corresponding to the maximum value ofbBy pb' to, compare λb(pbmax) And λb(pb'), if λb(pbmax)＜λb(pb') let pbmax＝pb′；
D8, calculating for the clusters in the set Aa belongs to A, and selectsIs represented by cluster m, and power is allocated to the cluster corresponding to the maximum value in the groupAnd deleting the cluster from the set A;
d9, if the sum of the power allocated to the clusters with allocated power is lower than PmaxThe remaining power is denoted by p ', if p' > p for any cluster a in set AamaxCalculatingOtherwise calculateSelect outIs represented by cluster n, if p' > pnmaxA 1 is to pnmaxAllocating p 'to the cluster n, otherwise, allocating p' to the cluster n and deleting the cluster from the set A;
d10, repeating the step D9 until all power is allocated or the set A is empty.
Advantageous effects
The scheme disclosed by the invention expands the power distribution scheme with compromise between the maximum rate and the energy efficiency in the NOMA system to the scene that each cluster comprises a plurality of users, and under the condition of meeting the minimum rate requirement of all the users, the compromise between the maximum system and the rate and the energy efficiency is suitable for more scenes than the existing scheme.
Drawings
FIG. 1 is a system model of an implementation of the present invention;
fig. 2 is a flow chart of the present invention.
Detailed Description
An embodiment of the present invention is given below, and the present invention will be described in further detail. As shown in fig. 1, consider a single-cell downlink NOMA system including 1 base station and MK users, both of which are configured with a single antenna. The users are divided into K clusters, each cluster containing M users, ukmDenotes the mth user in the kth cluster, K being 1,2, …, K, M being 1,2, …, M. Base station to ukmIs hkm，|hk1|2≥|hk2|2≥…≥|hkM|2. The base station allocates the total power p for the kth clusterkWherein u iskmHas a power of pkm，pk1≤pk2≤…≤pkM，The base station allocates a sub-band for each cluster, and the sub-bands among the clusters are orthogonal.
By ykmRepresents ukmOf the received signal, ykmIs expressed in the form of
Wherein x iskmIs ukmDesired received signal of nkmIs ukmReceived white Gaussian noise with mean value of zero and variance of sigma2。
uk1First detecting xkMAnd eliminating the signal pair yk1The interference caused, and then x is detectedk(M-1)And eliminating the signal pair yk1The interference caused by this, in turn, detects other signals and cancels these signal pairs yk1The interference caused until x is detectedk1。
ukmDetecting xkiThe Signal to Interference and Noise Ratio (SINR) is expressed as
ukmPer unit bandwidth rate Rkm(pkm) Is expressed in the form of
The sum of the unit bandwidth rates of all users in the kth cluster is
The sum of the unit bandwidth rates of MK users in the system is
Let r be0Is the minimum requirement for SINR when correctly detecting signals, rkmIs ukmSINR r corresponding to the lowest unit bandwidth rate requirementkm≥r0Therefore, the following equation is required to be satisfied
In formula (6), j is 1,2, …, M is 1,2, …, M. Thus can be derived, pkmIs taken to satisfy
Order toj≤m，l(|hkj|2) Is | hkj|2A monotonically decreasing function. Due to | hk1|2≥|hk2|2≥…≥|hkM|2When j is m, l (| h)kj|2) A maximum value is reached. And because rkm≥r0Therefore, the formula (9) holds
In this case, the formula (8) can be represented as
Let the equality sign in equation (10) be true and m be 1 to obtain uk1Minimum power required pk10Is composed of
Let the equality sign in equation (10) be true and m be 2, yielding uk2Minimum power required pk20And pk1In a relationship of
Let the equality sign in equation (10) be true and m be 3 to obtain uk3Minimum power required pk30And pk1In a relationship of
Let the equality sign in equation (10) be true and m be 4, yielding uk4Minimum power required pk40And pk1In a relationship of
Let the equality sign in equation (10) be true and m be 5 to obtain uk5Minimum power required pk50And pk1In a relationship of
Obtained by induction method, M is 2,3, …, when M is ukmMinimum power required pkm0And pk1In a relationship of
When equation (16) is satisfied, ukmJust to the required minimum rate. U is obtained by bringing formula (11) into formula (16)kmMinimum power required pkm0Is composed of
So that the lowest total power p required for the kth clusterk0Is composed of
By PminRepresenting the minimum total power required to meet the minimum rate requirements of all users,
the rate vs. energy efficiency trade-off is formulated as
Where β is a weighting factor for rate, 1- β is a weighting factor for energy efficiency, 0 < β < 1.
It is known from the document "On the optimization of power allocation for nonma downlink with induced qos constraints" that for a single cluster, the sum rate of all users in the cluster can be maximized for the second to mth users in the cluster just meeting the minimum rate requirement, while allocating the remaining power to the first user. Thus, the total power of the kth cluster is pkThe base station is uk1Distributing powerIs ukmDistribution power pkm0K is 1,2, …, K, M is 2,3
Wherein, when the compromise between the speed and the energy efficiency in the cluster is maximum
The targets of the power allocation are: at a given total power Pmax(Pmax≥Pmin) And under the condition of meeting the speed requirement of each user, the inter-cluster power p is adjustedkK1, 2, …, K, a trade-off that maximizes the rate and energy efficiency of the system, formulated as
Wherein C1 represents that the total power of the base station is not higher than PmaxC2 is used to ensure minimum for the userThe rate requirement.
The optimal solution of the optimization problem in the formula (23) cannot be directly given, the optimization problem is decomposed into a plurality of subproblems, the power distribution which maximizes compromise between single cluster rate and energy efficiency is firstly solved, and the power distribution is expressed as a formula
The above optimization problem is to find λk(pk) Maximum time corresponding pkThe value of (a). Followed by analysis of lambdak(pk) The increase or decrease of (2). Lambda is foundk(pk) With respect to pkThe partial derivative of (a) of (b),
wherein, Deltak6＝Δk4-Δk3If, ifThen
Order toAnd isThen formula (26) can be written as
βηk(pk)＞θk(pk) (27)
Namely, it isEquivalent to β ηk(pk)＞θk(pk). From the above analysis, λ can be derivedk(pk) The increase and decrease of (A) are as follows:
if etakIs greater than 0 andλk(pk) Is pkIs a monotonically increasing function of.
If etakIs greater than 0 andλk(pk) Is pkIs a monotonically decreasing function of (a).
If etakIs < 0 andλk(pk) Is pkIs a monotonically increasing function of.
If etakIs < 0 andλk(pk) Is pkIs a monotonically decreasing function of (a).
Separately calculate etak(pk) And thetak(pk) With respect to pkThe partial derivative of (a) of (b),
because of the fact thatAndis always true, so ηk(pk) And thetak(pk) Is pkIs a monotonically increasing function of. The derivation can be obtained by the following steps,when the temperature of the water is higher than the set temperature,is pkIs a monotonically decreasing function of (a).
To simplify the analysis, letBy pkmaxRepresents the maximum power of the k-th cluster,next, p is analyzedk∈[pkmin,pkmax]When is lambdak(pk) The increase or decrease of (2).
If etak(pkmin) Is greater than 0 andthen p isk∈[pkmin,pkmax]When is lambdak(pk) Is pkIs a monotonically decreasing function of (a).
If etak(pkmin) Is greater than 0 andthen p isk∈[pkmin,pkmax]When is lambdak(pk) Is pkIs a monotonically increasing function of.
If etak(pkmin) Is greater than 0 andthen p isk∈[pkmin,pkmax]When, with pkIncrease of (a)k(pk) Is pkIs decreasing and then increasing.
If etak(pkmax) Is < 0 andthen p isk∈[pkmin,pkmax]When is lambdak(pk) Is pkMonotonically decreasing in (2)A function.
If etak(pkmax) Is < 0 andthen p isk∈[pkmin,pkmax]When is lambdak(pk) Is pkIs a monotonically increasing function of.
If etak(pkmax) Is < 0 andthen p isk∈[pkmin,pkmax]When, with pkIncrease of (a)k(pk) Is pkIs incremented and then decremented.
If etak(pkmax) Greater than 0 and etak(pkmin) < 0, there must be a unique pk *∈[pkmin,pkmax]So that ηk(pk *)＝0。
Due to ηk(pk) Is a monotonically increasing function, pk∈[pkmin,pk *]Then ηk(pk) Is less than 0. If it isThen p isk∈[pkmin,pk *]When is lambdak(pk) Is pkIs a monotonically decreasing function of (a). If it isThen p isk∈[pkmin,pk *]When is lambdak(pk) Is pkIs a monotonically increasing function of. If it isThen p isk∈[pkmin,pk *]When, with pkIncrease of (a)k(pk) Is pkIs incremented and then decremented.
Due to ηk(pk) Is a monotonically increasing function, pk∈[pk *,pkmax]Then ηk(pk) Is greater than 0. If it isThen p isk∈[pk *,pkmax]When is lambdak(pk) Is pkIs a monotonically increasing function of. If it isThen p isk∈[pk *,pkmax]When is lambdak(pk) Is pkIs a monotonically decreasing function of (a). If it isThen p isk∈[pk *,pkmax]When, with pkIncrease of (a)k(pk) Is pkIs decreasing and then increasing.
Table 1 shows pk∈[pkmin,pkmax]Time lambdak(pk) The increase or decrease of (2). Referring to table 1, the following conclusion holds:
pk∈[pkmin,pkmax]when condition 1 or condition 4 in table 1 is satisfied, i.e., λk(pk) Is pkIs assigned the lowest power p for the clusterkminThe trade-off between rate and energy efficiency of the cluster can be maximized.
pk∈[pkmin,pkmax]When condition 2 or condition 5 is satisfied, i.e. λk(pk) Is pkIs assigned the highest power p for the clusterkmaxThe trade-off between rate and energy efficiency of the cluster can be maximized.
pk∈[pkmin,pkmax]And when condition 3 is satisfied, λ is comparedk(pkmax) And λk(pkmin) If λk(pkmax)＞λk(pkmin) Then power p is allocated to the clusterkmaxOtherwise, allocating power pkmin。
pk∈[pkmin,pkmax]When condition 6 is satisfied, λ is foundk(pk) Maximum time pkBy taking the value of (a), pk' to indicate, the power p is allocated to the clusterk′。
If conditions 7 and 11 are satisfied simultaneously, λ isk(pk) Is pkIs a monotonically decreasing function of, assigns pkmin。
If conditions 8 and 10 are satisfied simultaneously, λ isk(pk) Is pkIs assigned p as a monotonically increasing function ofkmax。
If conditions 9 and 12 are satisfied simultaneously, λk(pk) Increment, decrement, and then increment, at pkmin,pk *]Finding lambda internallyk(pk) Maximum time pkBy taking the value of (a), pk' to, compare λk(pkmax) And λk(pk'), if λk(pkmax)＞λk(pk') then allocate power p for the clusterkmaxOtherwise, allocating power pk′。
Of the 12 conditions in table 1, only the above three possible combinations are simultaneously true, and no other combinations exist.
TABLE 1pk∈[pkmin,pkmax]Time lambdak(pk) The increase or decrease of (2).
The power allocation method for maximizing the compromise of rate and energy efficiency of a single cluster is given above. Next, a power allocation method between clusters is given to maximize compromise, and the specific steps are as follows:
step 1, first calculate p for each clusterkminAnd pkmaxCalculatingAndif etak(pkmax) Greater than 0 and etak(pkmin) If < 0, find out etak(pk) When p is 0kBy taking the value of (a), pk *And (4) showing.
Step 2, if the condition 1 or the condition 4 is met, directly distributing power p to the clusterkmin(ii) a If condition 3 is satisfied, λ is calculatedk(pkmax) And λk(pkmin) If λk(pkmin)＞λk(pkmax) Then the power p is allocated directly to the clusterkminOtherwise, putting the cluster into the set A and turning to the step 3; if class 6 is satisfied, then the calculation is such that λk(pk) Maximum time pkBy taking the value of (a), pk' represents, let pkmax＝pk', put the cluster into set A and go to step 3; if the classification 2 and the classification 5 are met, putting the cluster into the set A and turning to the step 3; if both condition 7 and condition 11 are satisfied, then power p is allocated directly to the clusterkmin(ii) a If the condition 8 and the condition 10 are met simultaneously, putting the cluster into the set A and turning to the step 3; if both condition 9 and condition 12 are satisfied, [ p ] iskmin,pk *]Finding lambda internallyk(pk) Maximum time pkBy taking the value of (a), pk' to, compare λk(pkmax) And λk(pk'), if λk(pkmax)＞λk(pk') put the cluster into set A and go to step 3 if lambdak(pkmax)＜λk(pk') let pkmax＝pk', put the cluster in set A and proceed to step 3.
Step 3, for the clusters in the set A, calculatinga belongs to A, and selectsIs represented by cluster m, and power p is allocated to the clustermmaxAnd the cluster is deleted from set a.
Step 4, if the sum of the power distributed to the clusters with distributed power is lower than PmaxThe remaining power is denoted by p ', if p' > p for any cluster a in set AamaxCalculatingOtherwise calculateSelect outIs represented by cluster n, if p' > pnmaxA 1 is to pnmaxAnd allocating p 'to the cluster n, otherwise, allocating p' to the cluster n, deleting the cluster from the set A, and repeating the steps until all power is allocated or the set A is an empty set.
The four steps are a power distribution method among clusters, andrepresents the power allocated by the base station for the kth cluster, the base station is uk1Distributing powerBase station is ukmDistribution power pkm0K1, 2,., K, M2, 3., M, K is the total number of clusters, M is the total number of users in each cluster.
With reference to the flowchart of the present invention, that is, fig. 2, the specific steps of the compromise power allocation method in the downlink multi-cluster NOMA system are as follows:
a, the base station according to its own channel to MK usersClustering users, wherein each cluster comprises M users, and is divided into K clusters in total, and u is usedkmDenotes the mth user in the kth cluster, K1, 2, …, K, M1, 2, …, M, base station to ukmIs hkm，|hk1|2≤|hk2|2≤…≤|hkM|2The base station allocates a sub-band for each cluster, and the sub-bands among the clusters are orthogonal;
b, the base station calculates the minimum power required by a single cluster and the maximum power which can be reached by the single cluster;
c, the base station establishes an optimization problem of compromise between the maximum rate and the energy efficiency, and simplifies the optimization problem;
d, the base station solves the simplified optimization problem in the step C to obtain the power distributed to the kth cluster;
e, the base station is uk1Distributing powerBase station is ukmDistribution power pkm0K1, 2,., K, M2, 3., M, K is the total number of clusters, M is the total number of users in each cluster.
The above embodiments are merely illustrative of the present invention, and those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims (1)

1. The compromise power allocation method in the downlink multi-cluster NOMA system is characterized in that: the method is suitable for a downlink NOMA system comprising 1 base station and MK users, wherein the base station and the users are both provided with a single antenna, and the method comprises the following steps:
a, a base station clusters users according to channels from the base station to MK users, each cluster comprises M users, the M users are divided into K clusters, and u is usedkmDenotes the mth user in the kth cluster, K1, 2kmIs hkm，|hk1|2≥|hk2|2≥…≥|hkM|2The base station allocates a sub-band for each cluster, and the sub-bands among the clusters are orthogonal;
b, the base station calculates the minimum power required by a single cluster and the maximum power which can be reached by the single cluster, and the specific process is as follows:
b1, with pkmIndicating a base station as ukmAllocated power, pk1≤pk2≤…≤pkM，pkIs the total power allocated by the base station for the kth cluster, using rkmRepresents ukmThe base station calculates p to obtain the Signal to Interference and Noise Ratio (SINR) corresponding to the minimum rate requirementkmIs taken to satisfyσ2Is the variance of the noise received by the user, and therefore ukmThe minimum power required is K is the total number of clusters, M is the total number of users in each cluster;
b2, the base station obtains p according to the step B1kmSatisfied condition andcalculating to obtain the lowest power p required by the kth clusterkmin， PmaxIs the most basic stationLarge transmit power, K being the total number of clusters, M being the total number of users in each cluster;
b3, the base station calculates the maximum power that the kth cluster can reachK is the total number of clusters;
c, the base station establishes an optimization problem of compromise between the maximum rate and the energy efficiency, and simplifies the optimization problem, and the specific process is as follows:
c1, the base station sets up an optimization problem that maximizes the compromise of rate and energy efficiency,
wherein beta is a weighting factor for rate, 1-beta is a weighting factor for energy efficiency, 0 < beta < 1,constraint conditionsMeans that the sum of the power of all users cannot exceed PmaxConstraint pkm≥pkm0For guaranteeing the rate requirements of the user;
c2, the base station reduces the optimization problem in the formula (1) to,
wherein, constraint conditionsMeans that the sum of the powers of all clusters cannot exceed PmaxConstraint pk≥pkminUser rate requirements for guaranteeing a kth cluster;
d, the base station solves the simplified optimization problem in the step C formula (2) to obtain the power distributed to the kth clusterK is the total number of clusters, and the specific process is as follows:
d1, usingExpressed as the power allocated for the kth cluster, order
Wherein, Deltak6＝Δk4-Δk3， For the kth cluster, the base station calculatesAndk is the total number of clusters;
d2, if ηk(pkmin) Is greater than 0 andpower is allocated to the kth clusterIf etak(pkmax) Is < 0 andpower is allocated to the kth clusterK is the total number of clusters;
d3, if ηk(pkmin) Is greater than 0 andthen calculate λk(pkmax) And λk(pkmin)，λk(pkmin)＞λk(pkmax) Then, power is allocated to the clusterOtherwise, no power is allocated for the cluster, K being 1, 2., K being the total number of clusters;
d4, if ηk(pkmax) Is < 0 andcalculating lambdak(pk) Maximum time pkBy taking the value of (a), pk' represents, let pkmax＝pk', K-1, 2, K being the total number of clusters;
d5, placing the clusters without power distribution into the set A;
d6, for any cluster a in the set A, if etaa(pamax) Greater than 0 and etaa(pamin) If the cluster is less than 0, the cluster is placed in a set B;
d7 for in set BArbitrary cluster b, base station solving etab(pb) When p is 0bBy taking the value of (a), pb *That is, if equation (3) is satisfied, power is allocated to cluster bDeleting the cluster from the set A, and if the formula (4) is satisfied, determining that the cluster is in the interval [ p ]bmin,pb *]To find out lambdab(pb) P corresponding to the maximum value ofbBy pb' to, compare λb(pbmax) And λb(pb'), if λb(pbmax)＜λb(pb') let pbmax＝pb′；
D8, calculating for the clusters in the set ASelect outIs represented by cluster m, and power is allocated to the cluster corresponding to the maximum value in the groupAnd deleting the cluster from the set A;
d9, if the sum of the power allocated to the clusters with allocated power is lower than PmaxThe remaining power is denoted by p ', if p' > p for any cluster a in set AamaxCalculatingOtherwise calculateSelect outIs represented by cluster n, if p' > pnmaxA 1 is to pnmaxTo a cluster n, i.e.Otherwise, allocating p' to the cluster n and deleting the cluster from the set A;
d10, repeating the step D9 until all power is allocated or the set A is an empty set;
e, the base station is uk1Distributing powerBase station is ukmDistribution power pkm0K1, 2,., K, M2, 3., M, K is the total number of clusters, M is the total number of users in each cluster.
CN201910777897.1A 2019-08-22 2019-08-22 Compromise power distribution method in downlink multi-cluster NOMA system Active CN110392378B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910777897.1A CN110392378B (en) 2019-08-22 2019-08-22 Compromise power distribution method in downlink multi-cluster NOMA system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910777897.1A CN110392378B (en) 2019-08-22 2019-08-22 Compromise power distribution method in downlink multi-cluster NOMA system

Publications (2)

Publication Number Publication Date
CN110392378A true CN110392378A (en) 2019-10-29
CN110392378B CN110392378B (en) 2022-03-29

Family

ID=68289125

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910777897.1A Active CN110392378B (en) 2019-08-22 2019-08-22 Compromise power distribution method in downlink multi-cluster NOMA system

Country Status (1)

Country Link
CN (1) CN110392378B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112584403A (en) * 2020-11-02 2021-03-30 河南理工大学 Joint optimization method for maximum rate and minimum power of NOMA small cell
CN113056014A (en) * 2021-03-12 2021-06-29 北京电信易通信息技术股份有限公司 Power distribution method for downlink IRS-NOMA multi-cluster users
CN113286353A (en) * 2021-07-26 2021-08-20 北京电信易通信息技术股份有限公司 Power distribution method and system for downlink NOMA video users

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180234867A1 (en) * 2017-02-14 2018-08-16 National Tsing Hua University Joint user clustering and power allocation method and base station using the same
CN109819508A (en) * 2019-03-18 2019-05-28 田心记 Power distribution method in downlink NOMA system
CN109890073A (en) * 2019-03-18 2019-06-14 田心记 Power distribution method in single antenna downlink NOMA system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180234867A1 (en) * 2017-02-14 2018-08-16 National Tsing Hua University Joint user clustering and power allocation method and base station using the same
CN109819508A (en) * 2019-03-18 2019-05-28 田心记 Power distribution method in downlink NOMA system
CN109890073A (en) * 2019-03-18 2019-06-14 田心记 Power distribution method in single antenna downlink NOMA system

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
冯军等: "WSN虚拟MIMO的非均匀多簇策略研究", 《南华大学学报(自然科学版)》 *
廖晗等: "基于非正交多址的认知MIMO网络次用户系统容量优化", 《计算机应用》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112584403A (en) * 2020-11-02 2021-03-30 河南理工大学 Joint optimization method for maximum rate and minimum power of NOMA small cell
CN112584403B (en) * 2020-11-02 2022-11-01 河南理工大学 Joint optimization method for maximum rate and minimum power of NOMA small cell
CN113056014A (en) * 2021-03-12 2021-06-29 北京电信易通信息技术股份有限公司 Power distribution method for downlink IRS-NOMA multi-cluster users
CN113056014B (en) * 2021-03-12 2021-10-19 北京电信易通信息技术股份有限公司 Power distribution method for downlink IRS-NOMA multi-cluster users
CN113286353A (en) * 2021-07-26 2021-08-20 北京电信易通信息技术股份有限公司 Power distribution method and system for downlink NOMA video users

Also Published As

Publication number Publication date
CN110392378B (en) 2022-03-29

Similar Documents

Publication Publication Date Title
CN110392378B (en) Compromise power distribution method in downlink multi-cluster NOMA system
CN109819508B (en) Power distribution method in downlink NOMA system
CN108462950B (en) NOMA-based D2D communication combined sub-channel and power distribution method
CN108616997B (en) Power distribution method in NOMA system
CN101772176B (en) Interference coordination method and access network device
CN108495337B (en) NOMA-based wireless energy-carrying communication system maximum safety rate optimization method
CN104507144B (en) Wireless take can junction network joint relay selection and resource allocation methods
CN109996264B (en) Power allocation method for maximizing safe energy efficiency in non-orthogonal multiple access system
CN109890073B (en) Power distribution method in single-antenna downlink NOMA system
CN109982341B (en) V2V broadcast resource allocation method based on hypergraph theory
CN109005592A (en) Power distribution method in single antenna NOMA system
CN106211302A (en) Non-orthogonal multiple accesses isomery UNE resource allocation methods
CN102869018A (en) Channel and power joint distribution method for guaranteeing communication continuity in cognitive radio
CN109714818B (en) Power distribution method in single-cell NOMA system
CN110493811B (en) Radar communication integrated system steady resource allocation method based on radio frequency stealth
CN106060872A (en) D2D and cellular network coexisting heuristic proportional fairness scheduling method
CN103079278A (en) Method for allocating downlink resources of OFDMA (Orthogonal Frequency Division Multiple Access)-WLAN (Wireless Local Area Network) system based on user satisfaction degrees
CN107241180B (en) Efficient resource allocation method supporting information and energy simultaneous transmission
Kosek-Szott et al. An efficient backoff procedure for IEEE 802.11 ax uplink OFDMA-based random access
CN109451569A (en) A kind of resource allocation methods wirelessly taken in energy heterogeneous network
CN110505028B (en) Power distribution method for maximizing energy efficiency in uplink NOMA system
CN113055322B (en) Uplink and downlink communication method and device for 5G private network and public network
CN109618404A (en) The power distribution method of user rate is improved in NOMA system
CN110493875B (en) Power distribution method for maximizing energy efficiency in downlink NOMA (non-orthogonal multiple access) system
CN112954806A (en) Chord graph coloring-based joint interference alignment and resource allocation method in heterogeneous network

Legal Events

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