Jianpo Li* and Qiwei Wang*Power Allocation Method of Downlink Non-orthogonal Multiple Access System Based on α Fair Utility FunctionAbstract: The unbalance between system ergodic sum rate and high fairness is one of the key issues affecting the performance of non-orthogonal multiple access (NOMA) system. To solve the problem, this paper proposes a power allocation algorithm to realize the ergodic sum rate maximization of NOMA system. The scheme is mainly achieved by the construction algorithm of fair model based on α fair utility function and the optimal solution algorithm based on the interior point method of penalty function. Aiming at the construction of fair model, the fair target is added to the traditional power allocation model to set the reasonable target function. Simultaneously, the problem of ergodic sum rate and fairness in power allocation is weighed by adjusting the value of α. Aiming at the optimal solution algorithm, the interior point method of penalty function is used to transform the fair objective function with unequal constraints into the unconstrained problem in the feasible domain. Then the optimal solution of the original constrained optimization problem is gradually approximated within the feasible domain. The simulation results show that, compared with NOMA and time division multiple address (TDMA) schemes, the proposed method has larger ergodic sum rate and lower Fairness Index (FI) values. Keywords: Ergodic Sum Rate , NOMA , Power Allocation , α Fair Utility Function 1. IntroductionThe IMT-2020 (5G) promotion group put forward that 5G would make higher requirements for future wireless networks in White Paper on 5G Concept, that is, the rate should reach 0.1 to 1 Gb/s among users, the equipment connection capability should reach [TeX:] $$10^{2} / \mathrm{km}^{2}$$, and the spectrum efficiency is 5 to 15 times higher than the 4G. In order to meet people's growing mobile service demands, there is an urgent need to improve existing multiple access technologies [1]. Against this background, SAITO Y et al. proposed another technology called non-orthogonal multiple access technology. Non-orthogonal multiple access (NOMA) technology can achieve the balance between system ergodic sum rate and user fairness [2]. By studying some main technologies in the new multiple access technologies, it provides certain theoretical references for the further development of multiple access technologies and promotes the development of mobile communications systems in the future. The NOMA system uses the power multiplexing technology to transmit multiple user signals. The receiver achieves correct demodulation of the received signal through serial interference cancellation technology [3]. The traditional orthogonal multiple access (OMA) technology is limited by orthogonal resources and it is difficult to meet the need of the increasing users number. In order to improve the user fairness, generally, the low power is allocated to users with good channel gain and the high power is allocated to those with poor channel gain [4]. Recently, in some NOMA systems series, user fairness issues have received attention [5]. As discussed in [6- 8], some fixed power allocation methods are adopted. This scheme implements power allocation using a recursive iteration algorithm, where the recursive attribution is a number greater than zero and less than one. The user with less channel condition will be allocated more power. The difference in power between the two users also depends on the recursive attribution size. These parameters are set by the system and are fixed. It can guarantee that the users with poorer channel gain are allocated more power, but these users with poorer channel conditions may experience poor fairness. In order to improve the user fairness, the cooperation scheme is considered after the downlink of NOMA. For the users in bad condition, the user has strong data forwarding capability, but it will increase the cost of additional channel resources (that is, Special time slot for collaboration). In order to improve user fairness, at the base station side, it is suitable to adopt an appropriate power allocation scheme for the superimposed encoded user information [9]. The maximizing power allocation scheme is adopted in [10] to optimize the instantaneous transmission rate of the signal, so that the minimum value of the signal instantaneous transmission rate is maximized. In order to minimize the occurrence of interrupt events, the interrupt transmission probability is optimized by minimizing the power allocation scheme [11]. In order to improve the fairness, the weight vector is used to adjust the level of fairness [12]. However, the user with the worst channel gain may affect the system throughput, and the weight vector optimization is more challenging. Designing an optimal power allocation scheme is a challenging problem. A proportional fair distribution scheme is adopted in [13,14]. All the users can get the service. The system throughput is high. It is a compromise between user fairness and cell throughput, but the channel state needs to be tracked, and the algorithm complexity is high. In view of the problems of the above proposed schemes, the preconditions for applying the method in this paper are the channel state information under ideal conditions, and the maximum instantaneous rate and fair utility function to achieve the total throughput maximization power allocation scheme. The proposed method is to adjust the user rate according to the instantaneous channel state information (CSI). Firstly, the optimization problem is transformed into an equivalence problem. Then by setting some parameters to represent a set of user sum rate allocation problems, then constructing a penalty function by the interior point method, and gradually adjusting the penalty factor to solve the extreme point, and then get the optimal solution. 2. System Model and Basic Principle2.1 NOMA Downlink Signal ModelIn the downlink of NOMA system, all the user transmission information in the multiplexed state on the single orthogonal sub-band is linearly superimposed to obtain the sum of the modulated signals. It is shown as follows:
where x is the sum of all modulated signals on the sub-band, K is the total number of users multiplexed on this sub-band, [TeX:] $$\boldsymbol{S}_{\boldsymbol{k}}$$ is the modulated information of user k and satisfies [TeX:] $$E\left\lceil\left|s_{k}\right|^{2}\right]=1$$, [TeX:] $$P_{k}$$ is the power for user k. The power sum satisfies formula (2), where P is the sum of all powers in the band.
Therefore, the signal [TeX:] $$y_{k}$$ obtained by user k in the sub band at the receiving end can be obtained, which is recorded as
where [TeX:] $$\boldsymbol{h}_{k}$$ is the channel gain from the base station to the receiver k on the subcarriers, [TeX:] $$\boldsymbol{n}_{k}$$ is the channel noise. Assume that [TeX:] $$h_{k}=d_{k}^{-\beta / 2} g_{k}$$, [TeX:] $$oldsymbol{g}_{k}$$ is a normalized Rayleigh fading channel gain, is the path fading factor, [TeX:] $$d_{k}$$ is the distance between base station and user k, satisfying [TeX:] $$d_{1}>d_{2}>\ldots>d_{k}$$. Here, the noise is additive white Gaussian noise with zero mean and variance of [TeX:] $$\delta^{2}$$. In addition, the user channel gain and noise are independent for each other. If the base station can get CSI of some terminals, according to the requirement of NOMA power multiplexing, the base station sorts the signals received at the terminal according to the channel gain. If [TeX:] $$\left|h_{1}\right|^{2} \leq\left|h_{2}\right|^{2} \leq \ldots \leq\left|h_{k}\right|^{2}$$, the power is assigned in the order of [TeX:] $$p_{1} \geq p_{2} \geq \ldots \geq p_{k}$$. This method can ensure that each terminal user can reliably decode its information [15]. At the receiving end, the serial interference cancellation (SIC) technology is used to accomplish signal decoding. The received signals are ranked according to the signal-to-interference-noise ratio (SINR) or the power from the largest to the smallest. Then, the receiver selects the strongest signal among the undetected signals [16]. The SINR of user signal l decoded at terminal k is
where [TeX:] $$H_{k}=\left|h_{k}\right|^{2}, \forall k \in[1: K]$$. It can be seen that [TeX:] $$H_{k}$$ is exponentially distributed, with the meaning of [TeX:] $$d_{k}^{-\beta}$$. According to the SIC principle, the users {k+1, K}, whose signals are weaker than the user k. They cannot be detected and eliminated. These signals can be considered as noise to the user signal. The rate of user k is as follows
(5)[TeX:] $$R_{k}\left(p_{k}\right)=\ln \left(1+\frac{H_{k} p_{k}}{1+H_{k} \sum_{i=k+1}^{K} p_{i}}\right), k \in[1: K]$$2.2 Fair Utility FunctionOne of the main purposes of network resource allocation is to achieve the fair distribution of resources among all the users. Usually some fairness assessment methods can be used to measure the fairness of resource allocation. These methods include the max-min fairness criterion and the proportional fairness criterion [17]. This paper uses fairness to measure the fairness degree. Under the concept of fairness, the resource allocation is determined by maximizing the constant elasticity of the fair utility function [TeX:] $$\boldsymbol{u}_{\alpha}$$ ( is a non-negative parameter) [18]. For the fairness model, the fair utility function is as follows.
(6)[TeX:] $$u_{\alpha}(x)=\left\{\begin{array}{ll}\frac{x^{1-\alpha}}{1-\alpha}, \text { for } \alpha \geq 0, \alpha \neq 1 \\ \ln (x), \text { for } \alpha=1\end{array}\right.$$where can be data throughput or ergodic rate, [TeX:] $$x \in R_{+}^{n}$$, is the fairness indicator to achieve multiple fairness among the users and unify the expression of fair resource distribution. When =0, it means there is no fairness requirement among the users in the cell, [TeX:] $$u_{\alpha}(x)=x$$. With the increasing of , the user fairness also increases. When [TeX:] $$\alpha \rightarrow \infty$$, it means that the users in the cell are absolutely fair. 2.3 Interior Point Method of Penalty FunctionThe interior point method is used to solve the optimal value of the power allocation under certain restrictions. The interior point method is characterized by defining the constructed unconstrained objective function in a feasible domain [19]. The objective function is defined as
For the calculation of the optimization problem, the general expression for the constructed the penalty function is as follows
or
where [TeX:] $$\boldsymbol{r}^{(k)}$$ is the penalty factor, it is a descending positive sequence, and [TeX:] $$\lim _{k \rightarrow \infty} r^{(k)}=0$$. The second item of the above penalty function expression is called penalty item or obstacle item. When the iteration point is within the feasible domain, [TeX:] $$g_{u}(X) \geq 0,(u=1,2,3,4, \ldots, m)$$. Because [TeX:] $$r^{(k)}>0$$, the penalty term is positive. When the design point moves from the interior of the feasible region to the constraint boundary, the value of the penalty term increases sharply and tends to infinity. The result is that the value of the penalty function also increases sharply until infinity. So the constraint edge is never touched during the iteration. 3. System Power Allocation Method Based on Fair Utility FunctionThe problem of maximizing the ergodic sun rate can be solved by optimizing the power allocation through fairness. It is about the fair distribution of resources achieved by the user rate R, which means that it is the fairness between users. The optimization goal of the NOMA downlink system is to maximize the fair utility function that maximizes the ergodic sum rate as the dependent variable
(10a)[TeX:] $$\max _{\left\{p_{k}\right\}} \sum_{k=1}^{K} u_{\alpha}\left[R_{k}\left(p_{k}\right)\right]$$
where [TeX:] $$p_{k}$$ is a real number, and it is an optimized variable of the objective function. Constraint (10b) indicates the constraint condition of maximum allowed transmission power at the base station. Constraint (10c) ensures that all the users on the subcarriers can transmit normally. The maximum ergodic sum rate that satisfies user fairness can be achieved under the above constraint conditions. The interior point method is introduced to solve the above formula (10a). The interior point method is used to solve the minimum value of the objective function, so the above formulas need to be transformed, which is shown as follows
(11a)[TeX:] $$f\left(p_{k}\right)=\min _{\left\{p_{k}\right\}}-\sum_{k=1}^{K} u_{\alpha}\left[R_{k}\left(p_{k}\right)\right]$$
Due to the interference between users, the above problems are non-convex. So, it is difficult to solve the problem directly and obtain the optimal solution. Constructing a penalty function from the above formulas and constraints by using the interior point method can solve this problem.
(12)[TeX:] $$\varphi\left(p_{k}, r\right)=-\sum_{k=1}^{K} u_{\alpha}\left[\log _{2}\left(1+\frac{H_{k} p_{k}}{1+H_{k} \sum_{i=k+1}^{K} p_{i}}\right)\right]$$According to the property of fair utility function, there are some different situations. [TeX:] $$(1) $\alpha \geq 0, \alpha \neq 1$$ The constructed penalty function is
(13)[TeX:] $$\varphi\left(p_{k}, r\right)=-\sum_{k=1}^{K} \frac{\left(\log _{2}\left(1+\frac{H_{k} p_{k}}{1+H_{k} \sum_{i=k+1}^{K} p_{i}}\right)\right)}^{1-\alpha}{1-\alpha}-r \ln \left[P-\sum_{i=1}^{K} p_{i}\right]$$By taking the derivative of [TeX:] $$p_{k}$$ for formula (13), it can get the formula (14)
(14)[TeX:] $$\frac{\partial \varphi}{\partial p_{k}}=-\left[\log _{2}\left(1+\frac{H_{k} p_{k}}{1+H_{k} \sum_{i=k+1}^{K} p_{i}}\right)\right]^{-\alpha} \frac{H_{k}}{\left(1+H_{k} \sum_{i=k}^{K} p_{i}\right) \ln 2}+\sum_{m=1}^{k-1}\left\{\left[\log _{2}\left(1+\frac{H_{m} p_{m}}{1+H_{m} \sum_{i=m+1}^{K} p_{i}}\right)\right]^{-\alpha} \frac{p_{m} H_{m} H_{m}}{\left(1+H_{m} \sum_{i=m}^{K} p_{i}\right)\left(1+H_{m} \sum_{i=m+1}^{K} p_{i}\right) \ln 2}\right\}$ $+\frac{r}{P-\sum_{i=1}^{K} p_{i}} \quad k \neq 1$$When k = 1, [TeX:] $$p_{1}$$ is the power allocated for the first user signal, the partial derivative is
(15)[TeX:] $$\frac{\partial \varphi}{\partial p_{1}}=-\left[\log _{2}\left(1+\frac{H_{1} p_{1}}{1+H_{1} \sum_{i=2}^{K} p_{i}}\right)\right]^{-\alpha} \frac{H_{1}}{\left(1+H_{1} \sum_{i=1}^{K} p_{i}\right) \ln 2}+\frac{r}{P-\sum_{i=1}^{K} p_{i}} \quad k=1$$Simplify formula (14) to get formula (16)
(16)[TeX:] $$\frac{\partial \varphi}{\partial p_{k}}=-\left[\log _{2}\left[1+\frac{H_{k} p_{k}}{1+H_{k} \sum_{i=k+1}^{K} p_{i}}\right)\right]^{-\alpha} \frac{H_{k}}{\left(1+H_{k} \sum_{i=k}^{K} p_{i}\right) \ln 2}+\left[\log _{2}\left(1+\frac{H_{k-1} p_{k-1}}{1+H_{k-1} \sum_{i=k}^{K} p_{i}}\right)\right]^{-\alpha} \frac{H_{k-1}}{\left(1+H_{k-1} \sum_{i=k-1}^{K} p_{i}\right) \ln 2}+\frac{\partial \varphi}{\partial p_{k-1}}$$From the above, when the allocated power is infinitely close to the total power of the sub-band, the objective function can get the optimal solution, which satisfies with
where is the difference between the specified power and the allocated power. Formula (18) can be obtained to make the partial derivative equal to zero.
Substituting Eq. (17) into Eq. (15), the power expression [TeX:] $$p_{1}^{*}$$ for the first user can be obtained.
(19)[TeX:] $$p_{1}^{*}=\frac{1+H_{1}(P-\eta)}{H_{1}}\left(1-\frac{1}{2^{\sqrt[\alpha]{\frac{\eta H_{1}}{r \ln 2\left[1+H_{1}(P-\eta)\right]}}}}\right)$$Substituting (19) and (18) into [TeX:] $$\frac{\partial \varphi}{\partial p_{2}}=0$$, the power expression [TeX:] $$p_{2}^{*}$$ for the second user can be obtained.
(20)[TeX:] $$p_{2}^{*}=\frac{1+H_{2}\left(P-\eta-p_{1}\right)}{H_{2}}\left(1-\frac{1}{2^{\sqrt[\alpha]{\frac{\varepsilon H_{2}}{r \ln 2\left[1+H_{2}\left(P-\eta-p_{1}\right)\right]}}}}\right)$$By repeating the above steps, the method sequentially obtains the power allocation scheme for user 3, user 4, … , user K in turn. This is also the decoding order for the NOMA receiver. So, the power allocation scheme can be defined as
(21)[TeX:] $$p_{k}^{*}=\frac{1+H_{k}\left(P-\eta-\sum_{i=1}^{k-1} p_{i}\right)}{H_{\mathrm{k}}}\left(1-\frac{1}{2^{\sqrt[\alpha]{\frac{\eta H_{k}}{r \ln 2\left[1+H_{k}\left(P-\eta-\sum_{i=1}^{k-1} p_{i}\right)\right]}}}}\right)$$(2) =1 Through the same method, the user power expression can be solve. The constructed penalty function is
(22)[TeX:] $$\varphi\left(p_{k}, r\right)=-\sum_{k=1}^{K} \ln \left(\log _{2}\left(1+\frac{H_{k} p_{k}}{1+H_{k} \sum_{i=k+1}^{K} p_{i}}\right)\right)-r \ln \left[P-\sum_{i=1}^{K} p_{i}\right]$$In the same way, taking the derivative of for formula (22), the power expression for the user can be obtained as formula (23).
(23)[TeX:] $$p_{k}^{*}=\frac{1+H_{k}\left(P-\eta-\sum_{i=1}^{k-1} p_{i}\right)}{H_{k}}\left(1-\frac{1}{\frac{\eta H_{k}}{2^{r \ln 2\left[1+H_{k}\left(P-\varepsilon-\sum_{i=1}^{k-1} p_{i}\right)\right]}}}\right)$$From [TeX:] $$p_{k}^{*}$$ expression formula, the optimal solution of the objective function under the condition of fixed can be calculated by the following steps. where C is the reduction factor of the penalty factor, is the convergence accuracy, is the iteration number. The initial penalty factor [TeX:] $$r^{1}>0, \varepsilon>0$$. The initial point in the feasible domain is [TeX:] $$p_{k}\left(r^{1}\right)$$. As , construct the penalty function [TeX:] $$\varphi\left[p_{k}\left(r^{t}\right), r^{t}\right]$$. Starting from point [TeX:] $$p_{k}^{t}$$, the unconstrained optimization method is used to solve the extreme point [TeX:] $$p_{k}\left(r^{t}\right)$$ of the penalty function [TeX:] $$\varphi\left[p_{k}\left(r^{t}\right), r^{t}\right]$$. If [TeX:] $$\left|\frac{\varphi\left(p_{k}^{t}, r^{t}\right)-\varphi\left(p_{k}^{t-1}, r^{t-1}\right)}{\varphi\left(p_{k}^{t-1}, r^{t-1}\right)}\right| \leq \varepsilon$$ is satisfied, The algorithm stops iterative calculation and uses [TeX:] $$p_{k}\left(r^{t}\right)$$ as the optimal solution of the function [TeX:] $$f\left(p_{k}\right)$$. Otherwise, it takes [TeX:] $$r^{t+1}=C r^{t}, t=t+1$$, and continues to calculate until the termination condition is satisfied. 4. Simulation Results and AnalysisTo assess quantitative fairness, a widely used Fairness Index (FI) is defined as
(24)[TeX:] $$F I\left(R_{k}\right)=\left(\sum_{k=1}^{K} R_{k}\right)^{2} / K\left(\sum_{k=1}^{K} R_{k}\right)^{2}$$The FI can be any value within the interval . The greater the FI value is, the higher the fairness level is. When FI=1, it means that the users in the cell are absolutely fair. When [TeX:] $$F I \rightarrow 0$$, it means that the users are completely unfair. Assumed the large-scale fade gain is Rayleigh distributed, which is [TeX:] $$g i \sim C N(0,1)$$. The user noise is an additive white Gaussian variable with the zero mean and unit variance. The distance between the base station and user k is [TeX:] $$d_{k}=1.5^{K-k}$$. The path loss index is 2, which reflects the good propagation conditions. Fig. 1 shows the relation between ergodic sum rate and SINR for TDMA and NOMA system at different values, where the user number is 5. Fig. 1 shows that as the SNR increases, the system ergodic sum rate increases. Under the same conditions, the ergodic sum rate of the NOMA system is better than that of TDMA system. When =5, the system performance is the best, and the ergodic sum rate of the NOMA system is increased by 49.9% compared to the TDMA system. Fig. 2 shows the relation between Fairness Index and SINR for TDMA and NOMA system at different values, where the user number is 5. Fig. 2 shows that as the SNR increases, the system FI of TDMA and NOMA also increases. Under the same conditions, the TDMA system FI value is superior to the NOMA system. The larger is, the more fair the system is. Table 1 shows the difference about the system ergodic sum rate and FI between NOMA system and TDMA system under different values. Table 1.
In order to compare the NOMA and TDMA solutions fairly, Fig. 3 shows the relation between ergodic sum rate and SNR for TDMA and NOMA system at different FI values, where the user number is 5. Fig. 3 shows that as the SINR increases, the system ergodic sum rate of TDMA and NOMA increases. Under the same conditions, the ergodic sum rate of the NOMA system is significantly better than that of TDMA system. When FI=0.6, the system performance is the best, and the ergodic sum rate of the NOMA system is increased by 40.2% compared to the TDMA system. Fig. 4 shows the relation between ergodic sum rate and FI for TDMA and NOMA system at different user values, where SINR=20dB. The detailed results are shown in Table 2. Table 2.
Fig. 4 and Table 2 show that the ergodic sum rate of TDMA and NOMA decreases as the FI value increases. Under the same conditions, the NOMA system ergodic sum rate is superior to the TDMA system. As shown in Figs. 3 and 4, it can be seen that NOMA provides a significant increase in ergodic sum rate performance over the TDMA scheme at the same required level of fairness. 5. ConclusionFor the NOMA power allocation part, a power allocation method based on fairness to achieve the maximum ergodic sum rate is proposed. The computational complexity is reduced evidently by penalty function interior point method. It approaches the solution of objective function within the feasible region. This scheme proves the superiority of fair utility function under a single antenna and optimizes the ergodic sum rate under the condition of satisfying fairness among users. This approach achieves user fairness and maximizes ergodic sum rate balance. The numerical results show that compared with the NOMA and TDMA methods using this method, the performance of NOMA is obviously better than that of TDMA. For example, when =0.5, the average ergodic sum rate of NOMA is increased by 49.9% compared with TDMA. When FI=1, the average ergodic sum rate increased by 31% compared with TDMA. BiographyJianpo Lihttps://orcid.org/0000-0003-3242-9613He was born in China in 1980. He received his B.S., M.S., and Ph.D. from the Department of Communication Engineering, Jilin University, China, in 2002, 2005, and 2008, respectively. In 2008, he joined the School of Computer Science, Northeast Electric Power University, where he is currently a professor. His research interests are wireless sensor networks, 5G communication, and intelligent signal processing. BiographyReferences
|