Processing math: 0%
Energy Efficiency Optimization and Resource Allocation of Cross-Layer Broadband Wireless Communication System | IEEE Journals & Magazine | IEEE Xplore

Energy Efficiency Optimization and Resource Allocation of Cross-Layer Broadband Wireless Communication System


Wireless communication energy efficiency and resource optimization model.

Abstract:

Green energy-saving communication is one of the important research topics for the development of 5G technology. Under the premise of widespread distribution of intensive ...Show More
Topic: Green Communications on Wireless Networks

Abstract:

Green energy-saving communication is one of the important research topics for the development of 5G technology. Under the premise of widespread distribution of intensive base stations, system resource allocation and energy efficiency optimization are the keys to improving system performance. Therefore, how to effectively control system energy consumption and resource allocation has become the key to whether 5G technology can achieve effective application effects. In order to improve the energy efficiency performance of the cross-layer broadband wireless communication network system, this study combines the analysis of the broadband wireless communication system to optimize the energy efficiency of the cross-layer wireless communication system. Simultaneously, with the help of resource allocation technology, this study optimizes the multi-user underlying transport layer of the FDD-OFDMA system. In addition, this study explores the most reasonable system resource allocation method and achieves reasonable resource allocation through the optimization of energy efficiency resources in massive MIMO-OFDMA downlink systems. Finally, this study sets up a controlled experiment to analyze the algorithm's energy efficiency performance. The research shows that the method proposed in this paper has certain effects and can provide a reference for subsequent related research.
Topic: Green Communications on Wireless Networks
Wireless communication energy efficiency and resource optimization model.
Published in: IEEE Access ( Volume: 8)
Page(s): 50740 - 50754
Date of Publication: 03 March 2020
Electronic ISSN: 2169-3536

Funding Agency:

Author image of Zuolin Dong
Electronic and Information Engineering College, Henan Institute of Technology, Xinxiang, China
Zuolin Dong was born in Nanyang, Henan, in February 1970. He received the bachelor’s degree in engineering from the Beijing University of Technology and the master’s degree in engineering from Xi’an Jiaotong University. He is currently an Associate Professor and the Deputy Director of the Instruction Center of Innovation and staring a business in Henan Institute of Technology. He is an Outstanding Young Expert in science ...Show More
Zuolin Dong was born in Nanyang, Henan, in February 1970. He received the bachelor’s degree in engineering from the Beijing University of Technology and the master’s degree in engineering from Xi’an Jiaotong University. He is currently an Associate Professor and the Deputy Director of the Instruction Center of Innovation and staring a business in Henan Institute of Technology. He is an Outstanding Young Expert in science ...View more
Author image of Jiahong Wei
College of Electrical Engineering and Automation, Henan Institute of Technology, Xinxiang, China
Jiahong Wei was born in Jinzhou, Liaoning, in December 1983. She received the Ph.D. degree from the Dalian University of Technology. She is currently a Lecturer with the Henan Institute of Technology. She has participated in three national level projects, two provincial level projects, and one school level project, and published seven articles in important journals at home and abroad including two articles cited by SCI an...Show More
Jiahong Wei was born in Jinzhou, Liaoning, in December 1983. She received the Ph.D. degree from the Dalian University of Technology. She is currently a Lecturer with the Henan Institute of Technology. She has participated in three national level projects, two provincial level projects, and one school level project, and published seven articles in important journals at home and abroad including two articles cited by SCI an...View more
Author image of Xiaoyu Chen
Electronic and Information Engineering College, Henan Institute of Technology, Xinxiang, China
Xiaoyu Chen was born in Xinxiang, Henan, in December 1983. He received the bachelor’s degree in engineering from the PLA University of Information Engineering and the master’s degree in engineering from the Wuhan University of Technology. He is currently a Teacher with the Henan Institute of Technology. He has presided over one prefecture-level project, participated in five provincial and ministerial level projects and tw...Show More
Xiaoyu Chen was born in Xinxiang, Henan, in December 1983. He received the bachelor’s degree in engineering from the PLA University of Information Engineering and the master’s degree in engineering from the Wuhan University of Technology. He is currently a Teacher with the Henan Institute of Technology. He has presided over one prefecture-level project, participated in five provincial and ministerial level projects and tw...View more
Author image of Pengfei Zheng
College of Electronic and Electrical Engineering, Henan Normal University, Xinxiang, China
Pengfei Zheng was born in Sanmenxia, Henan, China, in November 1994. He received the bachelor’s degree from Henan Normal University, where he is currently pursuing the master’s degree with the College of Electronic and Electrical Engineering. He participates in five fund projects.
Pengfei Zheng was born in Sanmenxia, Henan, China, in November 1994. He received the bachelor’s degree from Henan Normal University, where he is currently pursuing the master’s degree with the College of Electronic and Electrical Engineering. He participates in five fund projects.View more

CCBY - IEEE is not the copyright holder of this material. Please follow the instructions via https://creativecommons.org/licenses/by/4.0/ to obtain full-text articles and stipulations in the API documentation.
SECTION I.

Introduction

The rising demand of people in the era of big data has led to the continuous development of Internet technology, which has increasingly higher requirements for the speed of information transmission. From the first 1G technology to the GSM network 2G technology, to the TD-SCDMA network 3G technology, and to the 4G technology after 2010, the development of each generation of communication technology means that network data transmission speed requirements are getting higher and higher, and the network speed is getting faster and faster, which puts forward higher requirements for network system performance. At present, people have gradually entered the 5G era, and the speed of the 5G era is far faster than the 4G era. Therefore, the system performance needs to be further improved, especially when the system has resource allocation problems and energy consumption problems during operation [1].

From the actual situation, 4G technology has been unable to meet the current data transmission speed requirements of various software and website systems. Therefore, while continuing to promote the development of 4G technology, communication research institutions around the world have taken the development of 5G technology as the new communication development direction, which has now reached the application level and is gradually promoted [2]. With the large-scale promotion of 5G technology, the problems it faces also need to be resolved. The main issues are system resource allocation and energy efficiency optimization. In particular, under the premise of widespread distribution of dense base stations, how to effectively control system energy consumption and resource allocation has become the key to whether 5G technology can achieve effective application effects.

5G technology is a high-speed information transmission network technology after 2020, which has great flexibility and has strong support for instant information transmission. In particular, with the rapid development of wireless network control remote object technology and the support of 5G technology, the business needs of different network environments can be met. At present, 5G technology-related standards have been formulated and pilots have been launched in multiple cities. In view of the development law of mobile technology, 5G technology has greatly improved in frequency utilization rate, energy efficiency, resource utilization and data transmission speed, and dense base stations will further increase network coverage and greatly improve user experience. From the perspective of transmission rate, the transmission rate of 5G technology can reach at least 10Gbs, which is equivalent to 10 times of the current 4G network. Moreover, the transmission rate of some specific services can reach at least 100Gbs, and there is a smaller time delay in the data transmission process, which is at least 5–10 times shorter than the 4G network in terms of time delay. 5G networks are dense networks, and base stations are more densely arranged. Therefore, in the 5G era, green energy-saving communication is one of the important research topics for the development of 5G technology.

Aiming at the distribution of network resources, the currently popular method is dynamic resource allocation technology, which mainly allocates system resources based on channel status and interference received by signals, adjusts parameters, and optimizes data transmission schemes. This technology can not only obtain higher spectrum efficiency, but also effectively meet the various needs of customers. It is currently the most advanced and widely used communication free allocation technology [3]. In the 5G network era, the optimization of communication technology is to rationally allocate system resources so as to achieve the rational use of system resources and take the maximum throughput or the minimum system energy consumption as the objective function. For green communications in the 5G era, the most important thing is system energy efficiency. Therefore, constructing an objective function based on maximizing the energy efficiency of the system is the main problem of the resource allocation algorithm [4].

This study combines the analysis of broadband wireless communication systems to optimize the energy efficiency of cross-layer and cross-band wireless communication systems. Moreover, in this study, the resource allocation technology is used to optimize the multi-user lower-level transport layer of the FDD-OFDMA system, and to explore the most reasonable system resource allocation method. In addition, this study achieves reasonable resource allocation by optimizing the energy efficiency resources of the massive MIMO-OFDMA downlink system, thereby promoting the optimal energy efficiency of cross-layer broadband wireless communication systems in the 5G era. This study combines the analysis of broadband wireless communication systems to optimize the energy efficiency of cross-layer and cross-band wireless communication systems. Moreover, with the help of resource allocation technology, the multi-user lower-layer transport layer of the FDD-OFDMA system is optimized. At the same time, this study explores the most reasonable system resource allocation method to achieve reasonable resource allocation by optimizing the energy efficiency resources of the massive MIMO-OFDMA downlink system. In the research, the focus is on energy efficiency optimization and resource allocation for cross-layer wireless communication systems in wireless communication systems, and optimization analysis is performed using multi-user parallel data transmission processes in common network communication systems as an example, and analysis of energy efficiency impact parameters is carried out. In addition, simulation verification of system resource optimization is performed to simulate energy efficiency optimization problems in large-scale network environments.

SECTION II.

Related Work

Wireless communication devices such as mobile phones have been popularized, which has promoted the further development of wireless mobile communication technology. Moreover, the current 4G technology has been popularized around the world. However, due to special reasons, very few areas cannot deploy base stations and lack 4G network coverage. From a broad perspective, most people’s wireless communication speed transmission needs are basically met. However, with the continuous development of science and technology and the increase in data volume, people have higher and higher requirements for data transmission speed, and especially in the 5G era, the data information transmission speed has increased 10 times directly. In this background, wireless communication energy consumption has increased significantly. Therefore, the greenhouse gas generated by energy consumption during the operation of the wireless communication system has caused some impact on the earth’s ecology and caused widespread concern in the society. Studies show that the current greenhouse gas pollution caused by mobile communication systems has accounted for 3% of global greenhouse gas pollution. And, with the advent of the 5G era, greenhouse gas emissions from communications systems will further increase. Currently, it is increasing at a rate of about 20% every year [5]. In addition, the slow development of battery technology is also an important cause of energy consumption, so people pay more attention to the study of energy consumption. The green communication section can maximize the improvement of energy efficiency, and in the study, the main price energy consumption is defined as the number of bits consumed per unit energy transmission. In the 5G era, it is necessary to face high-energy data transmission, so the green communication resource allocation technology will be the top priority in the 5G era [6]. Literature proposed that the maximum energy effect was used as the objective function [7]. This algorithm was named BSAA algorithm, and the basic idea of the algorithm was to reasonably allocate the rate vector by dichotomy to achieve the desired result required by the objective function. People have studied the OFDMA communication problem earlier. In literature, the energy consumption problem in the OFDMA system is modeled, and the model is optimized. On the basis of continuous research on the energy efficiency of communication networks, literature optimizes energy efficiency based on Massive MIMO systems, and provides a reference direction for the development of green communication technologies [8]. In literature, a non-cooperative game method was used to analyze the energy consumption of communication network systems. Literature used the fractional programming method to transform the energy consumption function into a fractional form. Furthermore, model optimization processing is performed on this basis. Literature used Dinkelbach algorithm to study the energy efficiency of communication network systems, and established corresponding models for analysis, and formulated corresponding strategies [9].

With the increasing emphasis on the natural environment, energy efficiency issues have received widespread attention from experts at home and abroad, and most experts and scholars have also started to apply the Dinkelbach algorithm in system models and have achieved certain results [10]. For a communication system, there are many users in the system with hierarchical characteristics, that is, all users are not in the same fading state, so each subcarrier can be allocated to the corresponding channel according to the actual situation, and data transmission is performed according to the condition [11]. This method is currently the more common OFDMA access method. OFDMA access method mainly aims at allocating parameter resources such as subcarriers, transmit power, and rate to users when optimizing targets. By optimizing these parameter resources, higher power utilization and first-level spectrum utilization can be obtained. In actual research, the dynamic resources in OFDMA access methods can be summarized according to the optimization target differences [12], mainly including the following three: The first type is an algorithm that takes the maximum throughput of the system as the objective function, which is named the RA algorithm [13]. Aiming at the research of this algorithm, the literature studies the allocation of subcarriers in the United States and stipulated that each subcarrier was allocated to the user with the highest channel gain, and the water injection algorithm was used to allocate the subcarrier power so that it can reach the maximum throughput. On this basis, it can provide relevant basis for the allocation of subcarriers. Moreover, the traversing capacity of the model built on this basis only considers the number of bits sent by the transmitting end per second, but the packet error rate in this process is ignored [14]. From the actual situation, it can be seen that the packet error rate can be ignored only when the transmitting end has fully understood the status information. Similarly, in literature, the laboratory of the incomplete information of the transmitting end is known as the research channel, and the maximum effective output of the system is used as the objective function of the model [15]. Under the assumption that the information at the transmitting end is completely unknown, literature proposed a resource allocation algorithm that maximizes as the objective function [16]. Literature researched and analyzed the problem of minimum system function energy consumption of the system model and combined the Lagrange function to solve the model optimal solution. From the actual situation, the algorithm needs to search for two Lagrangian functions at the same time, so the system is difficult to run, and it is limited to the theoretical research process and cannot be applied to practice. From a practical point of view, the optimization analysis of the system scheme by the suboptimal solution is a simpler solution, and the algorithm is less difficult to run. It can be subdivided into distributed algorithms, heuristic algorithms, and convex optimization algorithms. Among them, distributed algorithms mainly allocate joint problems such as power and number of bits [17]. During the system operation, the degree of freedom of resource allocation is reduced, the complexity of the system operation is abnormally reduced, and the system operation efficiency is improved [18]. Literature proposed a distributed resource allocation algorithm with minimum system power consumption as the objective function [19]. First, the number of subcarriers is determined according to the system user rate renewal and the average signal-to-noise ratio, and then the specific subcarriers are allocated power according to the algorithm. With the continuous development of technologies for network system energy efficiency optimization and resource allocation, experts and scholars take complexity as one of the important parameters for model research. Moreover, more heuristic optimization algorithms appear on this basis. The common algorithms include simulated annealing algorithm, genetic algorithm, particle swarm algorithm, etc [20].

The convex optimization algorithm is also an effective algorithm to reduce the complexity in the energy efficiency model of the communication system [21]. This algorithm mainly combines the convex optimization theory to downgrade the complex problem, so that the complex problem becomes several independent sub-problems. As long as the results of the sub-questions are solved and synthesized, the final answer of the original question can be obtained. Compared with the above algorithms, the convex optimization algorithm has good performance, and is higher than the above algorithms in speed and effect [22]. Literature researched the maximum and minimum criterion resource allocation of the system, constructed an optimization model, achieved the system’s proportional fairness at the minimum transmission rate, and increased system capacity as the optimization goal [23]. Through this algorithm, each user can basically obtain the same rate, thereby ensuring absolute fairness among users in the system. However, this system cannot effectively increase the system capacity, so there are still some problems. In order to balance the absolute fairness of system users, the literature studied the resource allocation algorithm based on proportional fairness in downlink OFDMA system [24]. Through simulation analysis, multiple parameters of the system are studied and analyzed, and it is proved that the algorithm has good performance with a slight reduction in throughput and can effectively maintain system fairness [25]. Literature carried out research and analysis on weight and rate maximization. Through this algorithm, a weight coefficient can be introduced for each user, and resources are allocated according to their respective weights. Based on this, the actual needs of different users can be met, and the system can be diversified [26].

SECTION III.

Problem Description and Algorithm Construction

A. Problem Description

This study takes a typical multi-line user MIMO-OFDMA wireless communication system as an example. It is set that the base stations in the network system are configured with a total of M antennas for signal transmission. Furthermore, there are K locations that are communicatively connected to the base station through a single antenna. We assume that a total of N subcarriers are divided into V frequency blocks (including N \mathord {\left /{ {\vphantom {N V}} }\right. } V subcarriers) in this system. These frequency blocks are the smallest unit of resource scheduling in the communication system. Combining the channel reciprocity of the network system, we can know the uplink channel matrix G_{\upsilon } =H_{\upsilon } D^{1 \mathord {\left /{ {\vphantom {1 2}} }\right. } 2} , Where H_{\upsilon } represents the user-to-base station M\times K fast fading matrix on the frequency block, D^{1 \mathord {\left /{ {\vphantom {1 2}} }\right. } 2}=diag\left \{{{\sqrt {\beta _{1}},\cdots,\sqrt {\beta _{k}}} }\right \} represents the K\times K angular matrix, and the diagonal element \sqrt {\beta _{k}} is the slow fading coefficient from the base station to obtain the downlink channel matrix G_{\upsilon }^{T} =D^{1 \mathord {\left /{ {\vphantom {1 2}} }\right. } 2} H_{\upsilon }^{T} ,Then, the signal matrix of the V-th frequency space received by the user can be expressed as follows:\begin{align*} y_{\upsilon,k}=&g_{\upsilon,k}^{T} \sum \limits _{k=1}^{K} {\sqrt {p_{\upsilon,k}}} f_{\upsilon,k} x_{\upsilon,k} +z_{\upsilon,k} \\=&g_{\upsilon,k}^{T} \sqrt {p_{\upsilon,k}} f_{\upsilon,k} x_{\upsilon,k} +g_{\upsilon,k}^{T} \sum \limits _{i=1,i\ne k}^{K} {\sqrt {p_{\upsilon,i} }} f_{\upsilon,i} x_{\upsilon,i} +z_{\upsilon,k} \\ {}\tag{1}\end{align*} View SourceRight-click on figure for MathML and additional features.

In the formula, g_{\upsilon,k} represents the kth column of the matrix g_{\upsilon } , f_{\upsilon,k} represents the precoding matrix of user k on frequency block V, and x_{\upsilon,k} represents the transmission signal of user k on frequency block V.. There are two equal signs in the above formula, and the second equal sign part indicates the user’s desired signal in the system and the interference and other Gaussian white noise that the user receives in the system.

Based on the above analysis, it can be known that the signals received by users will be subject to multiple interferences, and the signals between multiple users may interfere with each other. Therefore, these mutual interferences need to be eliminatePrecoding matrix F_{\upsilon } =G_{\upsilon } {}^\ast \left ({{G_{\upsilon }^{T} G_{\upsilon } {}^\ast } }\right)^{-1} by zero-forcing precoding.In the formula, F_{\upsilon } =\left [{ {F_{\upsilon,1},\cdots,F_{\upsilon,{\textrm K}}} }\right] . Therefore, g_{\upsilon,k}^{T} F_{\upsilon,i} =\delta _{ki},\delta _{ki} =\begin{cases} 1,&k=i \\ 0,&k\ne i \\ \end{cases} .

Then, the signal matrix that has received the Vth frequency space can be expressed as follows:\begin{equation*} r_{\upsilon,k} ={\textrm E}\left \{{{W\log _{2} \left [{ {1+\frac {p_{\upsilon,k} }{WN_{0} \left [{ {\left ({{G_{\upsilon }^{T} G_{\upsilon } \ast } }\right)^{-1}} }\right]_{kk}}} }\right]} }\right \}\tag{2}\end{equation*} View SourceRight-click on figure for MathML and additional features.

According to the above formula, the lower bound of the frequency of the signal received by the user in the Vth frequency space is:\begin{equation*} r_{\upsilon,k} \ge W\log _{2} \left [{ {1+\frac {p_{\upsilon,k}}{WN_{0} {\textrm E}\left \{{{\left [{ {\left ({{G_{\upsilon }^{T} G_{\upsilon } \ast } }\right)^{-1}} }\right]_{kk}} }\right \}}} }\right]\tag{3}\end{equation*} View SourceRight-click on figure for MathML and additional features.

In the formula, \begin{align*} {\mathrm{ E}}\left \{{{\left [{ {\left ({{G_{\upsilon }^{T} G_{\upsilon } \ast } }\right)^{-1}} }\right]_{kk}} }\right \}=&\frac {1}{\beta _{k}}{\textrm E}\left \{{{\left [{ {\left ({{H_{\upsilon }^{T} H_{\upsilon } \ast } }\right)^{-1}} }\right]_{kk}} }\right \} \\=&\frac {1}{K\beta _{k}}{\textrm E}\left \{{{tr\left [{ {\left ({{H_{\upsilon }^{T} H_{\upsilon } \ast } }\right)^{-1}} }\right]} }\right \}\tag{4}\end{align*} View SourceRight-click on figure for MathML and additional features.

Since {\textrm E}\left \{{{tr\left [{ {\left ({{W^{-1}} }\right)} }\right]} }\right \}=\frac {m}{t-m} , where W-W_{m} \left ({{t,I_{t}} }\right) is the central complex Wishart matrix with degrees of freedom t\left ({{t>m} }\right) , {\textrm E}\left \{{{tr\left [{ {\left ({{H_{\upsilon }^{T} H_{\upsilon } \ast } }\right)^{-1}} }\right]} }\right \}=\frac {K}{M-K} .

In summary, the lower bound of the rate of user k on the frequency block u can be expressed as:\begin{equation*} r_{\upsilon,k} =W\log _{2} \left [{ {1+\frac {p_{\upsilon,k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right]\tag{5}\end{equation*} View SourceRight-click on figure for MathML and additional features.

Parametric simulation analysis through experiments, Figure 1 shows the system throughput of summing the number of users and the number of frequency blocks in the cases shown in equations (2) and (5). In this figure, K=12 is set, and then the theoretical value of the number of users is summed, and the formula (5) is summed by the derived value. It is not difficult to derive from Figure 1 that the lower bound of the theoretical value is very close to the rate value derived by the formula, which can be assumed to be equal by default. Therefore, in this study, this value is used instead of the theoretical value.

FIGURE 1. - Throughput comparison chart.
FIGURE 1.

Throughput comparison chart.

It can be known from formula (5) that the user’s allocation rate on a single frequency is closely related to the user’s large-scale fading. Then, the rate obtained by user k allocation can be expressed as:\begin{align*} r_{k}=&m_{k} W\log _{2} \left [{ {1+\frac {p_{\upsilon,k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right] \\\approx&m_{k} W\log _{2} \left [{ {\frac {p_{k} \left ({{M-K} }\right)\beta _{k} }{WN_{0}}} }\right]\tag{6}\end{align*} View SourceRight-click on figure for MathML and additional features.

In the above formula, m_{k} represents the number of frequency blocks allocated by user k, and p_{k} represents the power allocated by user K in any one of m_{k} frequency blocks. Then, the lower bound of the energy efficiency function in this system can be expressed as:\begin{equation*} U=\frac {\sum \limits _{k=1}^{K} {T_{k}}}{\sum \limits _{k=1}^{K} {m_{k} p_{k} +Mp_{c}}}=\frac {\sum \limits _{k=1}^{K} {m_{k} W\log _{2}} \left [{ {\frac {p_{k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right]}{\sum \limits _{k=1}^{K} {m_{k} p_{k} +Mp_{c}}}\tag{7}\end{equation*} View SourceRight-click on figure for MathML and additional features.

According to the analysis, it can be known that the corresponding maximization problem in the energy efficiency resource allocation of the massive MIMO-OFDMA system existing in the downlink users can be expressed as follows:

Optimization problem \max \limits _{P,m,M} U\left ({{P,m,M} }\right)

Restrictions:\begin{align*}&\begin{cases} \displaystyle {T_{k} \ge R_{\min }} \\ \displaystyle {\sum \limits _{k=1}^{K} {m_{k}} =V} \end{cases} \\&\begin{cases} \displaystyle {m_{k} W\log _{2} \left [{ {\frac {p_{k} \left ({{M-K} }\right)\beta _{k} }{WN_{0}}} }\right]\ge R_{\min }} \\ \displaystyle {\sum \limits _{k=1}^{K} {m_{k}} =V} \\ \displaystyle \end{cases}\tag{8}\end{align*} View SourceRight-click on figure for MathML and additional features.

In the formula, p=\left [{ {p_{1},\cdots,p_{k},\cdots,p_{K}} }\right]^{T} represents the transmission power vector, m = [{m_{1},\cdots,m_{k},\cdots,m_{K}}]^{T} represents the vector of frequency block numbers allocated to the user, and \textrm {R}_{\min } is the minimum rate constraint of the user.

B. Energy-Efficient Resource Allocation for Massive MIMO OFDMA Downlink Systems

From the problem described by equation (8), it can be known that the allocation of the number of user frequency blocks is mainly required in the system resource allocation. Therefore, the traditional exhaustive mode will lead to a huge amount of system operation data and high complexity, which is difficult to implement in a computer. Therefore, the resource allocation algorithm needs to be optimized and its optimization process is performed step by step. First, the bandwidth of each user is determined, and then the power allocation and the number of base station antennas are allocated.

Firstly, a bandwidth allocation algorithm (BABEE) based on maximizing energy efficiency under the minimum rate requirement is proposed. Based on the signal-to-noise ratio bandwidth allocation algorithm (BABS), the algorithm mainly uses the average signal-to-noise ratio and bit rate received by the user as parameters to calculate the number of subcarriers obtained by the user. The optimization process of the bandwidth allocation objective function can be expressed as follows:\begin{equation*} m_{k} =\max \limits _{m} \frac {\sum \limits _{k=1}^{K} {m_{k} W\log _{2}} \left [{ {\frac {p_{k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right]}{\sum \limits _{k=1}^{K} {m_{k} p_{k} +Mp_{c}}}\tag{9}\end{equation*} View SourceRight-click on figure for MathML and additional features.

In order to meet the minimum user rate requirements during system operation, it may not be possible to achieve effective bandwidth matching based on the above formula. Therefore, the bandwidth needs to be allocated and processed first. The algorithm can be described as follows:

The user transmit power vector P_{0} is initialized, and the initialized rate allocation R_{0} is obtained according to P_{0} .

1)

m_{k} \leftarrow \left \lceil{ {\frac {R_{\min }}{R_{0} \left ({k }\right)}} }\right \rceil

2)

while\sum \limits _{k=1}^{K} {m_{k} >V}

3)

\left \{{{k^\ast \leftarrow \mathop {\arg \max }\limits _{1\le k\le K} m_{k},m_{k}.\leftarrow 0} }\right \}

4)

end while

5)

while \sum \limits _{k=1}^{K} {m_{k} < V}

6)

do{\begin{array}{cccccccccccccccccccc} {Q_{k} =\frac {\left ({{m_{k} +1} }\right)W\log _{2} \left [{ {\frac {p_{k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right]}{\left ({{m_{k} +1} }\right)p_{k} +Mp_{c}}-\frac {m_{k} W\log _{2} \left [{ {\frac {p_{k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right]}{m_{k} p_{k} +Mp_{c}}} \\ {l\leftarrow \mathop {\arg \max Q_{k}}\limits _{1\le k\le K}} \\ {m_{l} =m_{l} +1} \\ \end{array}}

7)

end while

Based on the above research, a new energy efficiency maximization resource allocation algorithm (RABEE) based on the minimum rate requirement is proposed, that is, after the bandwidth is reasonably allocated, the power and the number of antennas are allocated to promote the optimal energy efficiency of the system. From a formal point of view, the energy efficiency function is a fractional form, so the energy efficiency function needs to be processed first to make it into a subtractive form, and then it is turned into a solution to a convex optimization problem. Combining the properties of fractional form, the objective function can be expressed as:\begin{equation*} R\left ({{P,M} }\right)-q\ast \left [{ {P_{T} \left ({P }\right)+P_{C} \left ({M }\right)} }\right]\end{equation*} View SourceRight-click on figure for MathML and additional features.

In the formula, \begin{equation*} q\ast =\frac {R\left ({{P^\ast,M^\ast } }\right)}{P_{T} \left ({{P^\ast } }\right)+P_{C} \left ({{M^\ast } }\right)}=\max \limits _{M,P} \frac {R\left ({{P,M} }\right)}{P_{T} \left ({P }\right)+P_{C} \left ({M }\right)}\end{equation*} View SourceRight-click on figure for MathML and additional features.

Therefore, the objective function can be transformed into an optimization problem as follows:\begin{align*} F\left ({q }\right)=&\max \limits _{M,P} R\left ({{P,M} }\right)-q\left [{ {P_{T} \left ({P }\right)+P_{C} \left ({M }\right)} }\right] \\[4pt]=&\max \limits _{M,P} \sum \limits _{k=1}^{K} {m_{k}} W\log _{2} \left [{ {\frac {p_{k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right] \\[4pt]&- \, q\left ({{\sum \limits _{k=1}^{K} {m_{k} p_{k} +Mp_{c}}} }\right)\tag{10}\end{align*} View SourceRight-click on figure for MathML and additional features.

Restrictions m_{k} W\log _{2} \left [{ {\frac {p_{k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right]\ge R_{\min }

We assume that \begin{align*} f=&R\left ({{P,M} }\right)-q\left [{ {P_{T} \left ({P }\right)+P_{C} \left ({M }\right)} }\right] \\[4pt]=&\sum \limits _{k=1}^{K} {m_{k}} W\log _{2} \left [{ {\frac {p_{k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right] \\[4pt]&- \, q\left ({{\sum \limits _{k=1}^{K} {m_{k} p_{k} +Mp_{c}}} }\right)\tag{11}\end{align*} View SourceRight-click on figure for MathML and additional features.

The Hessian matrix of function f is \begin{equation*} H\left ({f }\right)=\left [{ {{\begin{array}{cccccccccccccccccccc} {-\frac {m_{k} W}{p_{k}^{2} In2}} & 0 \\ 0 & {-\sum \limits _{k=1}^{K} {\frac {m_{k} W}{\left ({{M-K} }\right)In2}} } \\ \end{array}}} }\right]\tag{12}\end{equation*} View SourceRight-click on figure for MathML and additional features.

From the above, we know that H\left ({f }\right) is a negative definite matrix. In this case, the function f is concave for \left ({{P,M} }\right) , and the objective function can be converted into a convex optimization problem. Lagrange function can be expressed as:\begin{align*}&\hspace {-1.2pc} L\left ({{\lambda,P,M} }\right) \\[4pt]=&\sum \limits _{k=1}^{K} {m_{k} W\log _{2}} \left [{\! {\frac {p_{k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} \!}\right] \!-\!q\left ({{\sum \limits _{k=1}^{K} {m_{k} p_{k} +Mp_{c}}} }\right) \\[4pt]&+\,\sum \limits _{k=1}^{K} {\lambda _{k}} \left \{{{m_{k} W\log _{2} \left [{ {\frac {p_{k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right]-R_{\min }} }\right \}\tag{13}\end{align*} View SourceRight-click on figure for MathML and additional features.

In the formula, \lambda _{k} \ge 0 is the Lagrangian multiplier corresponding to the constraint in formula (10). The dual problem of equation (10) can be expressed as:\begin{equation*} \min \limits _{\lambda \ge 0} \max \limits _{P,M} L\left ({{\lambda,P,M} }\right)\tag{14}\end{equation*} View SourceRight-click on figure for MathML and additional features.

When \lambda is given and the KKT condition is adopted, the optimal transmission power P^\ast and the number of base station antennas M* can be expressed as:\begin{align*} \frac {\partial L}{\partial p_{k}}=&\frac {m_{k} W}{In2\times p_{k}}-qm_{k} +\frac {\lambda _{k} m_{k} W}{In2\times p_{k}}=0\Rightarrow p_{k}{}^\ast \\=&\frac {\left ({{1+\lambda _{k}} }\right)W}{In2\times q} \tag{15}\\ \frac {\partial L}{\partial M}=&\frac {W\sum \limits _{k=1}^{K} {m_{k}} }{In2\times \left ({{M-K} }\right)}-qp_{c} +\frac {W\sum \limits _{k=1}^{K} {\lambda _{k} m_{k}}}{In2\times \left ({{M-K} }\right)} \\=&0\Rightarrow M\ast =\frac {\left ({{V+\sum \limits _{k=1}^{K} {m_{k} \lambda _{k}}} }\right)W}{In2\times qp_{c}}+K\tag{16}\end{align*} View SourceRight-click on figure for MathML and additional features.

The Lagrange multiplier \lambda is obtained by recursion:\begin{align*}\lambda _{k} \left ({{j+1} }\right)& =\Biggl [{ \lambda _{k} \left ({j }\right)-\delta \times \Biggl [{ {m_{k} W\log _{2} \left ({{\frac {p_{k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right)}}} \\& \qquad \qquad \qquad \qquad \qquad \qquad { -\, {\vphantom {\left [{ {m_{k} W\log _{2} \left ({{\frac {p_{k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right)}}\right.} {\vphantom {\left [{ {m_{k} W\log _{2} \left ({{\frac {p_{k} \left ({{M-K} }\right)\beta _{k}}{WN_{0}}} }\right)}}\right.}{R_{\min }} }\Biggr] }\Biggr]^{+} } \tag{17}\end{align*} View SourceRight-click on figure for MathML and additional features.

In the above formula, \delta represents the number of iterations, and m represents the iteration step size. Based on this, an iterative algorithm for energy efficiency maximization resource allocation (RABEE) based on the minimum rate requirement is proposed. The specific algorithm is described as follows:

1)

Initialization P^\ast =P_{0},M^\ast =M_{0},q^\ast =0,\lambda =0.\delta =\delta _{0},\varepsilon =0.01

2)

whileR\left ({{P^\ast,M^\ast } }\right )-q^\ast \left [{ {P_{T} \left (P^{ast}\right )+P_{C} \left ({{M^\ast } }\right )} }\right ]>\varepsilon

3)

\left \{{{do q^\ast \leftarrow \frac {R\left ({{P^\ast,M^\ast } }\right)}{\left [{ {P_{T} \left ({{P^\ast } }\right)+P_{C} \left ({{M^\ast } }\right)} }\right]}} }\right \}

4)

The Lagrangian multiplier is updated.

5)

The power allocation is calculated.

6)

The number of base station antennas is calculated.

7)

Return\,\, q^\ast,P^\ast,M^\ast

Based on the above analysis, an energy-efficient multi-user power allocation based on the water injection algorithm is proposed. The water injection algorithm is used to allocate resources to the multi-user MIMO energy efficiency system. By formula \begin{equation*} \frac {\partial U\left ({{P,\textrm {m, M}} }\right)}{\partial p_{k}}\left |{ {p=p^\ast =0} }\right.\tag{18}\end{equation*} View SourceRight-click on figure for MathML and additional features.

The following formula can be obtained \begin{equation*} p_{k} ^\ast =\frac {W}{U\ast \ln 2}-\frac {WN_{o}}{\left ({{M-K} }\right)\beta _{k}}\tag{19}\end{equation*} View SourceRight-click on figure for MathML and additional features.

Then, the optimal energy efficiency allocation process can be expressed as follows:\begin{align*} p_{k} {}^\ast =\begin{cases} \displaystyle \frac {W}{U\ast \ln 2}-\frac {WN_{o}}{\left ({{M-K} }\right)\beta _{k} }& when~U^\ast \!< \!\frac {({M\!-\!K})\beta _{k}}{N_{o} \ln 2} \\ \displaystyle 0& otherwise \\ \displaystyle \end{cases}\!\!\!\!\!\!\!\!\! \\ {}\tag{20}\end{align*} View SourceRight-click on figure for MathML and additional features.

Definition \begin{equation*} f\left ({\mu }\right)=U\left ({{P\left ({\mu }\right)} }\right)\tag{21}\end{equation*} View SourceRight-click on figure for MathML and additional features.

The specific algorithm is described as follows:

1)

\mu _{1} =\min \frac {WN_{0}}{\left ({{M-K} }\right)}\beta _{k}

2)

\mu _{2} =\mu _{1} {}^\ast \alpha,\alpha >1

3)

while f'\left ({{\mu _{2}} }\right)>0

4)

do~\mu _{1} \leftarrow \mu _{2},\mu _{2} \leftarrow \mu _{2} ^\ast \alpha

5)

While no convergence

6)

do \mu =\frac {\mu _{1} +\mu _{2}}{2}

7)

if f'\left ({\mu }\right)>0

8)

then \mu _{1} \leftarrow \mu

9)

else \mu _{2} \leftarrow \mu

10)

return \mu \,\,and \,\,p_{k}^{^\ast } =\left [{ {\mu -\frac {MN_{0} }{\left ({{M-K} }\right)\beta _{k}}} }\right]^{+}

SECTION IV.

System Model

In this study, a typical wireless communication network that is relatively common is taken as an example for analysis, and the network system is set to cover L cells. Moreover, each cell is equipped with a corresponding base station, which has N antennas and K single-antenna users. The structure diagram is shown in Figure 2.

FIGURE 2. - System model.
FIGURE 2.

System model.

The signal strength received by user k can be expressed as follows:\begin{equation*} y_{k} =\sum \limits _{l=1}^{L} {h_{kl}} x_{l} +n_{k}\tag{22}\end{equation*} View SourceRight-click on figure for MathML and additional features.

In the formula, h_{kl} \in {\mathbb C}^{1\times N} represents the channel matrix from the first base station to the k-th user, and the elements obey CN\left ({{0,1} }\right);x_{l} \in {\mathbb C}^{N\times 1} represents the transmitted signal of the first base station, and n_{k} represents observing CN\sim \left ({{0,\sigma ^{2}} }\right)_{n} -additive white noise.

It is assumed that there is a cooperative operation for all base stations in the cell. Therefore, the signal sent by the system to the user K can be expressed as s_{k} . \left \|{ {s_{k}} }\right \|=1,w_{kl} represents the transmit power from the first base station to the k-th user in the system, \left \|{ {w_{kl}} }\right \|=1 .The transmission signal x_{l} can be expressed as follows:\begin{equation*} x_{l} =\sum \limits _{k=1}^{K} {w_{kl}} \sqrt {p_{kl} s_{k}}\tag{23}\end{equation*} View SourceRight-click on figure for MathML and additional features.

In the above formula, p_{kl} represents the transmission power from the first base station to the k-th user in the system. Based on the above analysis, the signal received by user k can be expressed as follows:\begin{align*} y_{k} =\sum \limits _{l=1}^{L} {h_{kl}} x_{l} \sqrt {p_{kl} s_{k}} +\sum \limits _{k'=1,k'\ne k}^{K} {\sum \limits _{l=1}^{L} {h_{kl}} w_{k'l}} \sqrt {p_{k'l} s_{k'}} +n_{k} \\ {}\tag{24}\end{align*} View SourceRight-click on figure for MathML and additional features.

In the above formula, the front part of the plus sign indicates the expected signal of user k in the system, and the back part of the plus sign indicates the interference of other users received by user k in the system. The signal-to-noise ratio received by user k at work can be expressed as follows:\begin{equation*} SINR_{k} =\frac {\left \|{ {\sum \limits _{l=1}^{L} {h_{kl}} w_{kl} \sqrt {p_{kl} }} }\right \|^{2}}{\left \|{ {\sum \limits _{k'=1,k'\ne k}^{K} {\sum \limits _{l=1}^{L} {h_{kl}} w_{k'l}} \sqrt {p_{k'l}}} }\right \|^{2}+\sigma _{n}^{2}}\tag{25}\end{equation*} View SourceRight-click on figure for MathML and additional features.

Encoding is performed by zero-forcing (zF) precoding. The precoding matrix F_{l} =\left [{ {f_{1l},\cdots,f_{kl}} }\right] transmitted by the first base station in the system can be expressed as:\begin{equation*} F_{l} =H_{l}^{H} \left ({{H_{l} H_{l}^{H}} }\right)^{-1}\tag{26}\end{equation*} View SourceRight-click on figure for MathML and additional features. In the above formula, H_{l} \in {\mathbb C}^{K\times N} represents the channel matrix from the first base station to all users in the system. The precoding matrix w_{kl} of the channel matrix from the first base station to the k users in the system can be expressed as follows:\begin{equation*} w_{kl} =\frac {f_{kl}}{\left \|{ {f_{kl}} }\right \|}\tag{27}\end{equation*} View SourceRight-click on figure for MathML and additional features.

The signal received by user k can be described as:\begin{equation*} y_{k} =\sum \limits _{l=1}^{L} {\frac {\sqrt {p_{kl}}}{\left \|{ {f_{kl}} }\right \|}} s_{k} +n_{k}\tag{28}\end{equation*} View SourceRight-click on figure for MathML and additional features.

The reachable rate of user k is expressed as follows:\begin{align*} r_{k}=&\log _{2} \left ({{1+\left \|{ {\sum \limits _{l=1}^{L} {\frac {\sqrt {p_{kl} }}{\left \|{ {f_{kl}} }\right \|N_{0}}}} }\right \|^{2}} }\right) \\\approx&\log _{2} \left ({{\left \|{ {\sum \limits _{l=1}^{L} {\frac {\sqrt {p_{kl}}}{\left \|{ {f_{kl}} }\right \|N_{0}}}} }\right \|^{2}} }\right)\tag{29}\end{align*} View SourceRight-click on figure for MathML and additional features.

In the above formula, N_{0} represents the noise density. It is not difficult to see from the above formula that the relationship between the user’s reachable rate and the number of base station antennas is not explicit, so it is difficult to draw a practical relationship between the two. Assuming that the fixed value of power consumption can be expressed as P_{C} , the transmission power matrix can be expressed as:\begin{equation*} P=\left [{ {{\begin{array}{cccccccccccccccccccc} {p_{1,1}} & \cdots & {h_{1,L}} \\ \vdots & \ddots & \vdots \\ {p_{K,1}} & \ddots & {P_{K,L}} \\ \end{array}}} }\right]\tag{30}\end{equation*} View SourceRight-click on figure for MathML and additional features.

Based on the above analysis, the system energy efficiency can be expressed as:\begin{equation*} U\left ({P }\right)\!=\!\frac {\sum \limits _{k=1}^{K} {r_{k}}}{\sum \limits _{l=1}^{L} {\sum \limits _{k=1}^{K} {p_{kl}} +P_{C}}}\!=\!\frac {\sum \limits _{k=1}^{K} {\log _{2}} \left ({\!{\left \|{ {\sum \limits _{k=1}^{K} {\frac {\sqrt {p_{kl}}}{\left \|{ {f_{kl}} }\right \|N_{0}}}} }\right \|^{2}} \!}\right)}{\sum \limits _{l=1}^{L} {\sum \limits _{k=1}^{K} {p_{kl}} +P_{C}}}\tag{31}\end{equation*} View SourceRight-click on figure for MathML and additional features.

Considering maximizing system energy efficiency as an optimization goal, it can be expressed as:\begin{equation*} \underbrace {\max }_{p}U\left ({P }\right)\tag{32}\end{equation*} View SourceRight-click on figure for MathML and additional features.

SECTION V.

Energy Efficiency Resource Allocation

A. Optimized Algorithm

According to the nature of score planning, the original score optimization problem can be transformed into a subtractive form. Based on this, an iterative algorithm can be obtained. In the study, multiple cells can be regarded as an extension of two cells. In the same way, the system base station cooperation problem can be regarded as the cooperation problem between two base stations, and the objective function can be expressed as \begin{align*} F\left ({q }\right)& =\underbrace {\max }_{p}\sum \limits _{k=1}^{K} {\log _{2}} \left ({{\left \|{ {\sum \limits _{l=1}^{L} {\frac {\sqrt {p_{kl}}}{\left \|{ {f_{kl}} }\right \|N_{0}}}} }\right \|^{2}} }\right) \\[-2pt]& \qquad \qquad \qquad \qquad \quad \, { -\,q\left ({{\sum \limits _{l=1}^{L} {\sum \limits _{k=1}^{K} {p_{kl}} +P_{C}}} }\right) } \tag{33}\end{align*} View SourceRight-click on figure for MathML and additional features.

If \begin{align*} f=\sum \limits _{k=1}^{K} {\log _{2}} \left ({{\left \|{ {\sum \limits _{l=1}^{L} {\frac {\sqrt {p_{kl}}}{\left \|{ {f_{kl}} }\right \|N_{0}}}} }\right \|^{2}} }\right)-q\left ({{\sum \limits _{l=1}^{L} {\sum \limits _{k=1}^{K} {p_{kl}} +P_{C}} } }\right) \\ {}\tag{34}\end{align*} View SourceRight-click on figure for MathML and additional features.

then, \begin{align*}&\hspace {-0.6pc}\frac {\partial ^{2} f}{\partial p_{kl}^{2}} \\[-2pt]&=-\frac {\left ({{\sum \limits _{l=1}^{L} {\frac {\sqrt {p_{kl}}}{\left \|{ {f_{kl}} }\right \|N_{0}}}} }\right)^{2}\!\!\frac {p_{kl}^{-1}}{\left \|{ {f_{kl}} }\right \|N_{0}}\!+\!p_{kl}^{-\frac {3}{2}}\!\left ({{\sum \limits _{l=1}^{L} {\frac {\sqrt {p_{kl}}}{\left \|{ {f_{kl}} }\right \|N_{0}}}} }\right)\!\!\left \|{ {\sum \limits _{l=1}^{L} {\frac {\sqrt {p_{kl}}}{\left \|{ {f_{kl}} }\right \|N_{0}}}} }\right \|^{2}}{2\left \|{ {\sum \limits _{l=1}^{L} {\frac {\sqrt {p_{kl}}}{\left \|{ {f_{kl}} }\right \|N_{0}}}} }\right \|^{2}\left \|{ {f_{kl} } }\right \|N_{0} \ln 2} \\ {}\tag{35}\end{align*} View SourceRight-click on figure for MathML and additional features.

From the above analysis, it can be known that the function f is concave with respect to P, and can be solved by the standard optimization problem solving method, and the optimal transmission power is expressed as follows:\begin{equation*} p_{kl} =\frac {1}{q\ln 2}\frac {1}{\frac {\left \|{ {f_{kl}} }\right \|^{2}}{\sum \limits _{l'=1,l'\ne l}^{L} {\left \|{ {f_{kl'}} }\right \|^{2}+1}}}\tag{36}\end{equation*} View SourceRight-click on figure for MathML and additional features.

Based on the above analysis, a most energy-efficient method is proposed, that is, optimizing P^\ast and q^\ast . The algorithm process can be described as follows:

1)

initialization P^\ast =P_{0,} q^\ast =0,\varepsilon =0.01

2)

while \sum \limits _{k=1}^{K} {\log _{2}} \left ({{\left \|{ {\sum \limits _{l=1}^{L} {\frac {\sqrt {p^\ast _{kl}}}{\left \|{ {f_{kl}} }\right \|N_{0}}}} }\right \|^{2}} }\right)-q^\ast \left ({{\sum \limits _{l=1}^{L} {\sum \limits _{k=1}^{K} {p^\ast _{kl}} \!+\!P_{C}}}\! }\right) >\varepsilon

3)

doq^\ast \leftarrow \frac {\sum \limits _{k=1}^{K} {\log _{2}} \left ({{\left \|{ {\sum \limits _{k=1}^{K} {\frac {\sqrt {p^\ast _{kl}}}{\left \|{ {f_{kl} } }\right \|N_{0}}}} }\right \|^{2}} }\right)}{\sum \limits _{l=1}^{L} {\sum \limits _{k=1}^{K} {p^\ast _{kl}} +P_{C}}}

4)

Equation (36) is used to get the power distribution

5)

Returnq^\ast.P^\ast

B. Minimum Power Algorithm Description

Aiming at the user’s signal-to-noise ratio constraint, an algorithm for minimizing the transmission power of the system is proposed. Assuming the noise density can be expressed as 1, the power allocation algorithm can be expressed as:

Optimization issues: \min \limits _{p\succ _{-} 0} \sum \limits _{k=1}^{K} {\sum \limits _{l=1}^{L} {p_{kl}}}

Restrictions \left \|{ {\sum \limits _{l=1}^{2} {\frac {\sqrt {p_{kl}}}{\left \|{ {f_{kl}} }\right \|}}} }\right \|\ge \gamma _{k}

The resulting power allocation is:\begin{equation*} p_{kl} =\left ({{\frac {\sum \limits _{l'=1,l'\ne l}^{2} {\left \|{ {f_{kl}} }\right \|^{2}\left \|{ {f_{kl}} }\right \|}}{\sum \limits _{l=1}^{2} {\left \|{ {f_{kl}} }\right \|^{2}}}} }\right)^{2}\gamma _{k}\tag{37}\end{equation*} View SourceRight-click on figure for MathML and additional features.

This study mainly analyzes two layers of heterogeneous networks. The study area is set as the central macro cell, and there are S\left ({{S\ge 0} }\right) small cell access points, and the access point can be expressed as SCA_{s} . The macro base station is equipped with N_{BS} transmitting antennas to communicate with K geographically dispersed single-antenna mobile users, and each configuration point is configured with N_{SCA} (\left ({{1\le N_{SCA} \le 4} }\right)) antennas to communicate with K_{s} geographically dispersed single-antenna mobile users(\left ({{SK_{s} =K} }\right)) . Then, the signal received by the user k of the s-th SCA_{s} can be expressed as:\begin{align*} y_{k}=&\sqrt {p_{k,0}} g_{k} w_{k,0} x_{k,0} +\sum \limits _{i=1,i\ne k}^{K} {\sqrt {p_{i,0}} g_{k} w_{i,0} x_{i,0}} \\&+\,\sqrt {p_{k,s}} h_{k,s} w_{k,s} x_{k,s} +\sum \limits _{m=1,{{ m}}\ne k}^{Ks} {\sqrt {p_{m,s}} g_{k,s} w_{m,s} x_{m,s}} \\&+\,\sum \limits _{{ j=1,j\ne s}}^{S} {\sum \limits _{l=1}^{Ks} {\sqrt \alpha \sqrt {p_{l,j}} h_{l,j} w_{l,j} x_{l,j}} +n_{k}}\tag{38}\end{align*} View SourceRight-click on figure for MathML and additional features.

Among them, p_{k,0} , o represents the transmitting power m of the macro base station to the user g_{k} =\sqrt {\beta _{k}} h_{k,0},\beta _{k} represents the large-scale fading factor of the user k, and h_{k,0} \in C^{1\times N_{BS}} BS represents the small-scale fading factor of the macro base station to the user k, and its elements obey CN\left ({{0,1} }\right) . w_{k,0} \in C^{N_{BS} \times 1} represents the precoding matrix used by the macro base station for user k, \left \|{ {w_{k,0}} }\right \|_{F}^{2} =1 . x_{k,0} represents the signal transmitted by the macro base station to user k. p_{k,{\textrm s}} represents the transmission power of the S-th s to the user k. h_{k,{\textrm s}} \in C^{1\times N_{SCA}} CA represents the small-scale fading factor from the s-th SCA_{s} to the user k, and its elements obey CN\left ({{0,1} }\right) . w_{k,\textrm {s}} \in C^{N_{SCA} \times 1} represents the s-th precoding matrix used for user k, \left \|{ {w_{k,\textrm {s}}} }\right \|_{F}^{2} =1 . x_{k,\textrm {s}} represents the transmission signal SCA_{s} to user k. \alpha \left ({{\alpha < 1} }\right) represents the long-term average power from other small cell access points to the user’s k-channel. n_{k} \sim CN\left ({{0,\sigma ^{2}} }\right) is additive white Gaussian noise.

Based on the above analysis, assuming that the macro cell and g mainly eliminate mutual interference between users through zero-forcing precoding, the following formula can be obtained.\begin{align*} \overline G=&\left [{ {g_{1}^{H},g_{2}^{H},\cdots,g_{k-1}^{H},g_{k+1}^{H},\cdots,g_{K}^{H}} }\right]^{H} \\ \overline H=&\left [{ {h_{1,s}^{H},h_{2,s}^{H},\cdots,h_{k-1,s}^{H},h_{k+1,s}^{H},\cdots,h_{Ks,s}^{H}} }\right]^{H}\end{align*} View SourceRight-click on figure for MathML and additional features.

Then, \begin{align*} w_{k,0}=&\left [{ {I-\overline G {}^{H}\left ({{\overline {GG} {}^{H}} }\right)^{-1}\overline G} }\right]G_{k,0}^{H} \\ w_{k,s}=&\left [{ {I-\overline H {}^{H}\left ({{\overline {HH} {}^{H}} }\right)^{-1}\overline H} }\right]H_{k,s}^{H}\end{align*} View SourceRight-click on figure for MathML and additional features.

Therefore, the formula (38) can be expressed as follows:\begin{align*} y_{k} & =\sqrt {p_{k,0}} g_{k} w_{k,0} x_{k,0} +\sqrt {p_{k,s}} h_{k,s} w_{k,s} x_{k,s} \\&\qquad \qquad \quad { +\,\sum \limits _{j=1,j\ne s}^{S} {\sum \limits _{l=1}^{Ks} {\sqrt \alpha \sqrt {p_{l,j}} h_{k,j} w_{l,j} x_{l,j}} +n_{k}} } \tag{39}\end{align*} View SourceRight-click on figure for MathML and additional features.

From the actual situation, the transmission power of other cells is very small compared to the macro cell, so it can be ignored. When only the interference from the macro cell to other cells is considered, the data rate obtained by the user k from the macro base station is expressed as follows:\begin{equation*} r_{k}^{B} =E\left \{{{\log _{2} \left [{ {1+\frac {p_{k,0} \left \|{ {g_{k} w_{k,0}} }\right \|^{2}}{\sigma ^{2}}} }\right]} }\right \}\tag{40}\end{equation*} View SourceRight-click on figure for MathML and additional features.

The data power obtained by user K from other cells can be expressed (41), as shown at the bottom of this page.

Based on this, the energy efficiency and resource allocation problems in a MIMO heterogeneous network can be described as follows:

The optimization goals are:\begin{align*}&\hspace {-.5pc}\max \limits _{P,\overline p,N_{BS}} U\left ({{P,\overline p,N_{BS}} }\right) \\& \qquad \quad { =\frac {\sum \limits _{k=1}^{K} {\left \{{{r_{k}^{B} +r_{k}^{S}} }\right \}} }{\sum \limits _{k=1}^{K} {p_{k,0} +N_{BS} p_{C}^{BS} +\sum \limits _{k=1}^{K} {\sum \limits _{s=1}^{S} {p_{k,s} +\rho SN_{SCAP_{C}^{SCA}}}}}} }\end{align*} View SourceRight-click on figure for MathML and additional features.

SECTION VI.

Simulation Results and Algorithm Complexity Analysis

In this simulation, the cell radius is set to a hexagon with a circumscribed circle of 1000m. A certain number of base stations are arranged in this area, and users are randomly distributed within a range of 100m with the base station as the center. The large-scale fading from the kth user to the base station can be expressed as. In the formula, is a log-normal random variable with a standard deviation of, is the distance of the user from the base station, and u is the path loss in the transmission process.

In order to facilitate the comparison of algorithm performance in the experiment, this study defines that the BABS algorithm mainly performs loan allocation, while the RABEE algorithm mainly performs power allocation and base station antenna allocation and uses the average allocation method to process the bandwidth in the EMPMA algorithm. The allocation of power and the number of base station antennas is performed by the EMMPA algorithm because the algorithm is not affected by any constraints when performing energy efficiency calculations.

As shown in Figure 3, the results of a system’s energy efficiency analysis when users have different low-rate requirements in the system are shown. It can be seen from the figure that compared to the EMMPA algorithm, and BABS algorithm, the performance of the proposed algorithm is not high or low. The reason is that the EMMPA algorithm is not affected by any constraints when performing energy efficiency calculations. Therefore, the performance of EMMPA algorithm is the best among the three algorithms. The BABS algorithm is a bandwidth allocation algorithm based on the signal-to-noise ratio, and the algorithm needs to pass the average signal-to-noise ratio and bit rate of the system users. Therefore, a certain constraint is received during the operation. Once all users have obtained sufficient carriers during operation, the algorithm first ensures that their own needs are met. After that, the remaining subcarriers are allocated to effectively reduce the total power sent by the system. Through analysis, it can be seen that this algorithm has certain disadvantages in improving energy efficiency compared to the proposed algorithm. As can be seen from the figure, when the number of users continues to increase, the energy efficiency performance of the two algorithms is gradually approaching, and the bandwidth that can be allocated to each user also gradually decreases as the number of users increases. For the EMPPA algorithm, the rate requirements are not high, but the average allocation of bandwidth will cause the bandwidth allocated by users with better channels in the system to show a downward trend, thereby reducing system energy efficiency. When the value of R_{\min } is different, the performance of EMMPA algorithm in energy efficiency performance has a certain stable correlation. The reason for this result is that the bandwidth and energy efficiency optimization of the algorithm are related to the value of R_{\min } . However, the energy efficiency performance of the BABS algorithm has a positive correlation with R_{\min } , because the bandwidth allocation process of the algorithm first needs to be initialized by m_{k} \leftarrow \frac {R_{\min }}{R_{0} \left ({k }\right)} , and then the remaining bandwidth is allocated by the minimum transmit power. Therefore, when R_{\min } becomes smaller, the initial bandwidth allocation will become smaller, and most of the remaining bandwidth is mainly used for the allocation process of minimizing the transmission power, thereby reducing the energy efficiency performance.

FIGURE 3. - Energy efficiency performance of each algorithm for different numbers of users.
FIGURE 3.

Energy efficiency performance of each algorithm for different numbers of users.

Figure 4 shows the change in throughput performance for different numbers of users. As can be seen from Figure 4, the proposed algorithm has good performance and throughput. This result is due to the fact that the EMPPA algorithm does not place any requirements on the user rate during the operation, and only requires maximizing the energy efficiency of the system, which results in a lower system throughput. The BABS algorithm allocates bandwidth by minimizing transmit power, so compared to the proposed algorithm, the BABS algorithm has lower energy efficiency performance. It can also be seen from Figure 4 that when the number of users continues to increase, the system throughput shows an upward trend, that is, as the number of users increases, the system’s multi-user diversity characteristics become more obvious. It can be seen that the proposed algorithm is not close to have good system energy efficiency performance, and also has certain advantages in terms of throughput performance.

FIGURE 4. - Throughput performance of each algorithm for different numbers of users.
FIGURE 4.

Throughput performance of each algorithm for different numbers of users.

Figure 5 is the performance analysis chart of the optimal base station antenna number of each algorithm under the condition of different number of users. It can be seen from Figure 5 that when the number of users shows an upward trend, the optimal base station antenna number of the system also shows an increasing trend. The EMMPA algorithm lacks an optimal number of antennas, so it can only be optimized for optimal energy efficiency by changing the transmit power.

FIGURE 5. - Optimal base station antenna number performance of each algorithm for different numbers of users.
FIGURE 5.

Optimal base station antenna number performance of each algorithm for different numbers of users.

Figure 6 shows the relationship between the transmission power performance and the number of users. It can be known from Fig. 6 that when the number of users shows an increasing trend, the transmission power required by the BABS algorithm and the proposed algorithm itself will increase as the number of users increases. The reason for this is that the BABS algorithm and the proposed algorithm are based on the minimum user rate requirements in the system. Compared to these two algorithms, the EMPPA algorithm is not subject to any conditions.

FIGURE 6. - Transmit power performance of each algorithm in different number of users.
FIGURE 6.

Transmit power performance of each algorithm in different number of users.

Figure 7 shows the comparison of the energy efficiency performance of the algorithm in on different frequency blocks. As can be seen from Fig. 7, the energy efficiency performance of the proposed algorithm increases with the number of frequency blocks during operation. Compared with the proposed algorithm, the energy efficiency performance of the BABS algorithm and the EMMPA algorithm does not show a rapid increase with the increase in the number of frequency blocks during operation. The reason for this is that the proposed algorithm uses the BABEE bandwidth allocation algorithm, which can effectively use the system’s frequency diversity, thereby directly increasing the speed at which the energy efficiency increases with frequency. However, this situation does not occur with the BABS algorithm and the EMPPA algorithm.

FIGURE 7. - Energy efficiency performance of each algorithm under different frequency block numbers.
FIGURE 7.

Energy efficiency performance of each algorithm under different frequency block numbers.

Similar to the previous research, when conducting complexity research, the cell radius is set to a hexagon with a circumscribed circle of 1000m. A certain number of base stations are arranged in this area, and users are randomly distributed within a range of 100m with the base station as the center. The large-scale fading from the kth user to the base station can be expressed as. In the formula, is a log-normal random variable with a standard deviation of, is the distance of the user from the base station, and u is the path loss in the transmission process.

The BABS algorithm is a bandwidth allocation algorithm based on the signal-to-noise ratio. When the bandwidth is allocated to k users and the number of iterations is V, the computational complexity of the bandwidth allocation can be expressed as O\left ({{KV} }\right) . The computational complexity of bandwidth allocation can be expressed as O\left [{ {1+K\left ({{V-\sum \limits _{k=1}^{K} {\left \lceil{ {\frac {R_{\min }}{R_{0} \left ({k }\right)}} }\right \rceil }} }\right)} }\right] . We set the computational complexity of updating the Lagrangian factor in the proposed algorithm to O\left ({{I_{\lambda }} }\right) , and the computational complexity of the number of base station antennas and power allocation to O\left ({{I_{AP}} }\right) . Therefore, the complexity of the proposed algorithm is O\left ({{KI_{AP},I_{\lambda }} }\right) . The computational complexity of bandwidth allocation in the EMMPA algorithm is O\left [{ {1+K\left [{ {\bmod \left ({{\frac {V}{K}} }\right)} }\right]} }\right] , where mod represents division and remainder. In power allocation, the step size factor is assumed to be \alpha . To get the globally optimal \mu ^\ast , it needs at least \left \lceil{ {\log _{2} \left [{ {\frac {\left ({{\alpha -1} }\right)\mu ^\ast }{\varepsilon }-1} }\right]} }\right \rceil iterations, where \left |{ {\mu -\mu ^\ast } }\right |< \varepsilon . Therefore, the computational complexity of this power allocation is O\left \{{{K\left \lceil{ {\log _{2} \left [{ {\frac {\left ({{\alpha -1} }\right)\mu ^\ast }{\varepsilon }-1} }\right]} }\right \rceil } }\right \} . In summary, the computational complexity of the BABS algorithm is O\left ({{KV+KI_{AP} \cdot I_{\lambda }} }\right) , the computational complexity of the algorithm in this paper is \begin{equation*} O\left \{{{1+K\left ({{V-\sum \limits _{k=1}^{K} {\left \lceil{ {\frac {R_{\min }}{R_{0} \left ({k }\right)}} }\right \rceil }} }\right)}}\right. {+KI_{AP} \cdot I_{\lambda }} \Bigg \},\end{equation*} View SourceRight-click on figure for MathML and additional features. and the computational complexity of the EMMPA algorithm is \begin{equation*} O\left \{{{1+K\left [{ {\bmod \left ({{\frac {V}{K}} }\right)} }\right]+K\left \lceil{ {\log _{2} \left [{ {\frac {\left ({{\alpha -1} }\right)\mu ^\ast }{\varepsilon }-1} }\right]} }\right \rceil } }\right \}.\end{equation*} View SourceRight-click on figure for MathML and additional features.

Assuming that the circuit power in the system can be expressed as P_{C} =1W , the user-initialized emission vector can be expressed as\begin{equation*} P_{0} =\left [{ {{\begin{array}{cccccccccccccccccccc} {0.01} & \cdots & {0.01} \\ {0.01} & \cdots & {0.01} \\ \end{array}}} }\right].\end{equation*} View SourceRight-click on figure for MathML and additional features. For reliable performance comparison analysis in the experiment, the “minimum power algorithm” is used to set the user’s signal-to-noise ratio constraints equal. In \gamma _{k} =\gamma \text{g} simulation, the highest signal-to-noise ratio that users can obtain is 30dB.

As shown in Figure 8, the relationship between the number of users and the energy efficiency performance of the communication system can be seen when the number of antennas and the signal-to-noise ratio are different. It can be seen from the observation chart that when the number of users is increasing, the energy efficiency of the system is also increasing. When the number of antennas is 100, the energy efficiency performance of the maximum EE algorithm is significantly higher. When the number of antennas is 50 and the Gamma value is 20, the energy efficiency performance of the maximum EE algorithm is significantly higher. In addition, when the number of antennas is 50Gamma and the value is 30, the energy efficiency performance of the maximum EE algorithm is significantly higher. In addition, as the number of antennas continues to increase, the energy efficiency performance of the maximum EE algorithm and the minimum power algorithm has a positive correlation with the number of antennas, and the energy efficiency performance of the minimum power algorithm has increased significantly. By analyzing the reasons for this situation, it can be known that when the number of antennas increases, the system diversity gain will increase, and at this time, the energy efficiency performance will also increase. In addition, the minimum power algorithm’s power allocation is proportional to the value of Gamma, so there is a positive correlation between the two.

FIGURE 8. - Energy efficiency performance of each algorithm for different numbers of user.
FIGURE 8.

Energy efficiency performance of each algorithm for different numbers of user.

Figure 9 shows the difference between the number of users and the performance of the spectral efficiency when the number of antennas and the drying ratio constraint are inserted at a certain difference. It can be known from Fig. 9 that when the number of users shows an increasing trend, there is a positive correlation between the spectral efficiency and them. Moreover, it can also be seen from the figure that when the number of antennas is 100, the energy efficiency performance of the maximum EE algorithm is significantly higher. When the number of antennas is 50 and the Gamma value is 20db, the energy efficiency performance of the maximum EE algorithm is significantly higher. When the number of antennas is 50 and the Gamma value is 30, the energy efficiency performance of the maximum EE algorithm is significantly higher. In addition, as the number of antennas continues to increase, the energy efficiency performance of the maximum EE algorithm and the minimum power algorithm has a positive correlation with the number of antennas, and the energy efficiency performance of the minimum power algorithm has nothing to do with the increase in the drying ratio, and the signal-to-interference and noise ratio Gamma increases significantly. The algorithm power allocation is proportional to the value of Gamma, so there is a positive correlation between the two.

FIGURE 9. - Spectral efficiency performance of each algorithm for different number of users.
FIGURE 9.

Spectral efficiency performance of each algorithm for different number of users.

Figure 10 shows the relationship between the number of users and the power performance when the number of antennas and the signal-to-drying ratio are purely different. By observing Fig. 10, it can be seen that there is a positive correlation between the system transmit power and the number of users, and a negative correlation between the system’s transmit power and the number of antennas. In addition, the following information can be obtained from the figure: when the number of antennas is 50 and the gamma value is 20db, the energy efficiency performance of the maximum EE algorithm is significantly higher. When the number of antennas is 50, the minimum power algorithm has a significantly higher transmission power. When the number of antennas is 50 and the gamma value is 20db, the energy efficiency performance of the minimum powe algorithm is significantly higher. When the value of Gamma exceeds 30db, the performance of the maximum EE algorithm exceeds the minimum power algorithm. The reason for this is that when the minimum power algorithm is constructed, the minimum system transmit power is used as the objective function of the model operation, so its own transmit power is smaller than other algorithms. It can also be seen from the figure that the transmission power of the maximum EE algorithm and the minimum power algorithm are negatively related to the number of antennas, and the transmission power of the minimum power algorithm has a positive correlation with Gamma.

FIGURE 10. - Transmit power performance of each algorithm for different numbers of users.
FIGURE 10.

Transmit power performance of each algorithm for different numbers of users.

As shown in Figure 11, when the number of users is fixed at 20, the function relationship between the number of antennas and different algorithms is not difficult to see from the figure. When the number of antennas shows an increasing trend, the energy efficiency performance of the maximum EE algorithm increases. In addition, the comparison between the maximum EE algorithm and the minimum power algorithm shows that the maximum EE algorithm has better energy efficiency performance. The reason for analysis is that increasing the number of antennas will directly increase the diversity gain of the system, and the optimization objective function of the maximum EE algorithm is set to the system energy efficiency, so its energy efficiency is significantly higher. In addition, when the number of antennas is less than 30, the energy efficiency performance of the minimum power algorithm has a positive correlation with the number of antennas, and when the number of antennas exceeds 30, the energy efficiency of the algorithm shows a stable state. When the number of antennas is set to 20 and the Gamma value is 20dB, the performance of the minimum power algorithm is significantly higher and exceeds the energy efficiency performance when the Gamma value is 30dB. The reason is that when the number of antennas is 20, to increase the value of Gamma to 30db requires more transmit power, which results in a decrease in system energy efficiency. When the number of antennas exceeds 20, the increase of Gamma will directly cause the energy efficiency of the power algorithm to increase.

FIGURE 11. - Energy efficiency performance of each algorithm under different antenna numbers.
FIGURE 11.

Energy efficiency performance of each algorithm under different antenna numbers.

Figure 12 shows the relationship between the number of antennas and the spectral efficiency performance when the number of users is 20. It can be seen from FIG. 12 that when the number of antennas shows an increasing trend, the spectral efficiency of the maximum EE algorithm has the same increasing trend. Moreover, the minimum power algorithm also requires total power allocation as the user’s signal-to-noise ratio dries, so the performance of the algorithm will also show the same trend as the gamma increases. In addition, it can be seen from the figure that when the Gamma value is 20dB, compared with the energy efficiency performance of the maximum EE algorithm and the minimum power algorithm, the maximum EE algorithm is obviously more advantageous. When the Gamma value is 30dB, the number of users can be divided into two cases: excess 30 and less than 30. When the number of users is less than 30, the performance of the minimum power algorithm is higher than the maximum EE algorithm. When the number of users exceeds 30, the performance of the maximum EE algorithm is higher than the minimum power algorithm.

FIGURE 12. - Spectral efficiency performance of each algorithm under different number of antennas.
FIGURE 12.

Spectral efficiency performance of each algorithm under different number of antennas.

Figure 13 shows the relationship between the number of antennas and the transmission power when the number of users is 20. As can be seen from Figure 13, there is a clear negative correlation between the transmission power of the communication system and the number of antennas. The reason is that an increase in the number of antennas will directly increase the diversity gain of the system, which will directly result in a decrease in transmit power. In addition, it can be seen from the figure that when the Gamma value is 20dB, compared with the energy efficiency performance of the maximum EE algorithm and the minimum power algorithm, the minimum power algorithm has obvious advantages. When the Gamma value is 30dB, the number of users can be divided into two cases: excess 30 and less than 30. When the number of users is less than 30, the performance of the maximum EE algorithm is higher than the minimum power algorithm. However, when the number of users exceeds 30, the performance of the minimum power algorithm is higher than the maximum EE algorithm.

FIGURE 13. - Transmit power performance of each algorithm under different antenna numbers.
FIGURE 13.

Transmit power performance of each algorithm under different antenna numbers.

SECTION VII.

Conclusion

This study combines the analysis of broadband wireless communication systems to optimize the energy efficiency of cross-layer and cross-band wireless communication systems. Moreover, with the help of resource allocation technology, the multi-user lower-layer transport layer of the FDD-OFDMA system is optimized. At the same time, this study explores the most reasonable system resource allocation method to achieve reasonable resource allocation by optimizing the energy efficiency resources of the massive MIMO-OFDMA downlink system. In the research, the focus is on energy efficiency optimization and resource allocation for cross-layer wireless communication systems in wireless communication systems, and optimization analysis is performed using multi-user parallel data transmission processes in common network communication systems as an example, and analysis of energy efficiency impact parameters is carried out. In addition, simulation verification of system resource optimization is performed to simulate energy efficiency optimization problems in large-scale network environments. Finally, a comparative experiment is set up to verify the energy efficiency performance. The research results show that the method proposed in this paper has certain effects and can provide a reference direction for subsequent energy efficiency optimization research. This article studies the energy efficiency resource allocation of multi-cell cooperative massive MIMO systems. Assuming that the base stations in the multi-cell cooperative wireless communication system cooperate fully and adopt ZF precoding, a resource allocation method is proposed based on maximizing the energy efficiency of the system. The energy efficiency function is optimized by jointly adjusting the number of antennas of the macro base station, the transmit power of the macro base station, and the transmit power of the small cell access point. The main factors affecting the communication resources between cells are the mutual influence of cell base stations and the operation of invalid base stations caused by dense base stations. This study minimizes these influencing factors, and simulations show that the method proposed in this paper has certain effects.

Author image of Zuolin Dong
Electronic and Information Engineering College, Henan Institute of Technology, Xinxiang, China
Zuolin Dong was born in Nanyang, Henan, in February 1970. He received the bachelor’s degree in engineering from the Beijing University of Technology and the master’s degree in engineering from Xi’an Jiaotong University. He is currently an Associate Professor and the Deputy Director of the Instruction Center of Innovation and staring a business in Henan Institute of Technology. He is an Outstanding Young Expert in science and technology in Xinxiang and a Senior Assessor of national vocational skills appraisal. He has presided over and participated in three provincial and ministerial level projects, four prefecture-level projects, and seven school level projects, and published seven teaching materials and more than ten academic articles in journals at all levels. He is a member of the Communist Party of China.
Zuolin Dong was born in Nanyang, Henan, in February 1970. He received the bachelor’s degree in engineering from the Beijing University of Technology and the master’s degree in engineering from Xi’an Jiaotong University. He is currently an Associate Professor and the Deputy Director of the Instruction Center of Innovation and staring a business in Henan Institute of Technology. He is an Outstanding Young Expert in science and technology in Xinxiang and a Senior Assessor of national vocational skills appraisal. He has presided over and participated in three provincial and ministerial level projects, four prefecture-level projects, and seven school level projects, and published seven teaching materials and more than ten academic articles in journals at all levels. He is a member of the Communist Party of China.View more
Author image of Jiahong Wei
College of Electrical Engineering and Automation, Henan Institute of Technology, Xinxiang, China
Jiahong Wei was born in Jinzhou, Liaoning, in December 1983. She received the Ph.D. degree from the Dalian University of Technology. She is currently a Lecturer with the Henan Institute of Technology. She has participated in three national level projects, two provincial level projects, and one school level project, and published seven articles in important journals at home and abroad including two articles cited by SCI and EI, and five articles belonging to Chinese core journal. She is a member of the Communist Party of China.
Jiahong Wei was born in Jinzhou, Liaoning, in December 1983. She received the Ph.D. degree from the Dalian University of Technology. She is currently a Lecturer with the Henan Institute of Technology. She has participated in three national level projects, two provincial level projects, and one school level project, and published seven articles in important journals at home and abroad including two articles cited by SCI and EI, and five articles belonging to Chinese core journal. She is a member of the Communist Party of China.View more
Author image of Xiaoyu Chen
Electronic and Information Engineering College, Henan Institute of Technology, Xinxiang, China
Xiaoyu Chen was born in Xinxiang, Henan, in December 1983. He received the bachelor’s degree in engineering from the PLA University of Information Engineering and the master’s degree in engineering from the Wuhan University of Technology. He is currently a Teacher with the Henan Institute of Technology. He has presided over one prefecture-level project, participated in five provincial and ministerial level projects and two school level projects, and published two teaching materials and more than ten academic articles in journals at all levels. He is a member of the Communist Party of China.
Xiaoyu Chen was born in Xinxiang, Henan, in December 1983. He received the bachelor’s degree in engineering from the PLA University of Information Engineering and the master’s degree in engineering from the Wuhan University of Technology. He is currently a Teacher with the Henan Institute of Technology. He has presided over one prefecture-level project, participated in five provincial and ministerial level projects and two school level projects, and published two teaching materials and more than ten academic articles in journals at all levels. He is a member of the Communist Party of China.View more
Author image of Pengfei Zheng
College of Electronic and Electrical Engineering, Henan Normal University, Xinxiang, China
Pengfei Zheng was born in Sanmenxia, Henan, China, in November 1994. He received the bachelor’s degree from Henan Normal University, where he is currently pursuing the master’s degree with the College of Electronic and Electrical Engineering. He participates in five fund projects.
Pengfei Zheng was born in Sanmenxia, Henan, China, in November 1994. He received the bachelor’s degree from Henan Normal University, where he is currently pursuing the master’s degree with the College of Electronic and Electrical Engineering. He participates in five fund projects.View more

References

References is not available for this document.