This article has been accepted for publication in a future issue of this journal, but has not been
fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TII.2019.2962035, IEEE
Transactions on Industrial Informatics
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015
Efficiency Evaluations Based on Artificial
Intelligence for 5G Massive MIMO Communication
Systems on High-Altitude Platform Stations
Mingxiang Guan∗, Zhou Wu, Yingjie Cui, Xuemei Cao, Le Wang, Jianfeng Ye, Bao Peng,
Abstract—The key technologies for applying 5G in high-
altitude platform station (HAPS) communication systems have
many outstanding advantages, especially large-scale antenna
array technology. HAPS communication systems have inherent
advantages that can perfectly complement large-scale array
antenna technology and solve the problems of many existing
ground communication systems. The chances of long-packet data
users and short-packet data users being serviced are different
due to the differing data length of each user’s packet. According
to the user’s channel environment and data length, the user
with the smallest delay is selected for transmission. Dynamic
and interdependent characteristics between systems and the
evaluation of the efficiency of wireless resources are studied
in this article. Game theory is applied to the evaluation of
the wireless resource efficiency of the system, and an efficiency
evaluation model is constructed. In addition, the efficiency of this
preliminary work is verified by simulation.
Index Terms—HAPS, Fifth Generation (5G), Multiple-Input
Multiple-Output (MIMO), Artificial Intelligence (AI), Efficiency
Evaluation.
I. I NTRODUCTION
Currently, with the unprecedented development of glob-
al aviation communication technology and wireless network
technology, a high-altitude platform information network can
∗ Mingxiang Guan is with the School of Electronic Communication Tech-
nology, Shenzhen Institute of Information Technology, Shenzhen, 518000,
China E-mail:guanmx@sziit.edu.cn
This paper is supported by the Guangdong Province higher vocational
colleges and schools, the Pearl River scholar funding scheme (2016), a
project of the Shenzhen Science and Technology Innovation Committee
(JCYJ20170817114522834, JCYJ20160608151239996), the Key laboratory
of Longgang District (LGKCZSYS2018000028), the science and technology
development center of the Ministry of Education of China (2017A15009) and
Engineering Applications of the Artificial Intelligence Technology Laboratory
(PT201701).
Zhou Wu is with the School of Electronic Communication Technology,
Shenzhen Institute of Information Technology,Shenzhen, 518000, China E-
mail:wuz@sziit.edu.cn
Yingjie Cui is with the School of Electronic Communication Technology,
Shenzhen Institute of Information Technology, Shenzhen, 518000, China E-
mail:cuiyj@sziit.edu.cn
Xuemei Cao is with the School of Electronic Communication Technology,
Shenzhen Institute of Information Technology, Shenzhen, 518000, China E-
mail:caoxm@sziit.edu.cn
Le Wang is with the School of Electronic Communication Technology,
Shenzhen Institute of Information Technology, Shenzhen, 518000, China E-
mail:wangl@sziit.edu.cn
Jianfeng Ye is with the School of Electronic Communication Technology,
Shenzhen Institute of Information Technology, Shenzhen, 518000, China E-
mail:yejf3@sziit.edu.cn
Bao Peng s with the School of Electronic Communication Technology,
Shenzhen Institute of Information Technology, Shenzhen, 518000, China E-
mail:pengb@sziit.edu.cn
1551-3203 (c) 2019 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
1
provide communication services anytime and anywhere not
only for fixed communication terminals but also for onboard,
ship-borne, HAPS 5G and personal mobile communication
terminals, as well as access to the worlds largest internet and
fifth-generation (5G) communication networks to form inter-
connecting and seamless communication networks between
space, air, sea and ground. While 4G is still progressing,
5G has become a research focus [1−2] . In the 5G era, the
development of the network society will bring about a surge
in mobile and wireless traffic with the popularization of core
services such as electronic banking, electronic teaching and
electronic medical services. This means that data traffic will
increase more than 1000 times between 2010 and 2020. In the
4G era, many devices are connected to each other all over the
world. However, in the 5G era, more than 100 billion devices
will be connected to each other. Most consumer products, in-
dustrial products, information logistics technology,and similar
devices can be connected to the network [3−6] . The 5G Internet
of Things will also be combined with cloud computing and
big data technology to make society fully intelligent. 5G is
not only the evolution of communication technology but also
an all-encompassing change in the integration of computing
and communication technology. As next-generation wireless
communication technology, the future 5G network will be an
intelligent system with multiservice, multiaccess technology
and multilevel coverage. The purpose of the development
of HAPS 5G Massive MIMO communication systems is to
provide supplementary wireless services for ground stations
and satellites. This concept is based on aircraft operating in
the stratosphere[7−12] .
The key technologies for applying 5G in HAPS communi-
cation systems have many outstanding advantages, especially
large-scale antenna array technology. HAPS communication
systems have inherent advantages that can perfectly com-
plement large-scale array antenna technology and solve the
problems of many existing ground communication systems.
The HAPS 5G Massive MIMO communication system adopts
smart antenna technology and realizes space-division multiple
access in a HAPS 5G communication system with the help of
beamforming technology to suppress interference and facilitate
space-division multiple access.
In the future HAPS 5G era, user devices of different stan-
dards and systems could access the system, and the transmit
power of different devices could be nonidentical. When the
transmit power of each users device formed by its own beam is
adjusted, another user device would be interfered with in such
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TII.2019.2962035, IEEE
Transactions on Industrial Informatics
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015
a multiuser environment. Dynamic mutual interference occurs
between user devices[10−11] . This dynamic mutual interference
will be repeated because of the adjustment of each user devices
transmit power, resulting in infinite cycles, which affects the
overall performance of the system and makes it difficult to
achieve optimal conditions. With the rapid development of
artificial intelligence (AI), many new control strategies and
optimization methods have been proposed[12−13] .
Wireless resources maintain a dynamic balance with each
other. To meet the business demands of users, a system needs
to constantly adjust its various resource allocations. However,
when the system adjusts the resource allocation of a certain
user, it will cause interference with other users so that the
HAPS system has to adjust the resource allocation of other
users. The adjustment of other user resource allocations will
in turn interfere with the service users, so that the service users
need to readjust their resource allocation. This interaction may
lead to infinite adaptation loops that seem to be beneficial
to a device but are harmful to the network. The process for
designing a highly efficient AI algorithm to evaluate the overall
efficiency of intelligent wireless resource management is also
addressed in this research.
The contributions of this paper can be summarized as
follows:
1) Aiming at the problem of system interference caused by
beamforming technology in a HAPS communication system
using Massive MIMO, an intelligent beamforming algorithm
based on game theory is proposed, and a mathematical model
of the beamforming game algorithm is constructed.
2) The adjustment of the transmit power of different users
is described using a multiuser game model.
3) A particle swarm optimization (PSO) algorithm is used
to obtain the Nash equilibrium point, which can effectively
suppress the interference between multiple users in HAPS
communication.
4) The proposed AI-based algorithm focuses on the desired
user and place spatial nulls in the direction of undesired users.
Moreover since a method of power allocation based on game
theory is proposed, the proposed algorithm can mitigate the
interference between users and increase coverage area.
II. SYSTEM MODEL AND METHODOLOGY
Assuming that the high-altitude platform end of the HAPS
communication system is equipped with m antennas. There
are a total of A users in the terrestrial community. Each client
is equipped with n antennas. These A users are randomly
distributed in the community. The multibeam anti-interference
system model is shown in Figure 1.
Then, the signal received by user l can be expressed as:
p 4βm
y = Hl Pl ul xl + n (1)
Pl represents the signal transmit power of user l. u indicates
the direction of the antenna’s transmit weight and defines the
shape of the antenna’s transmit mode. H1 represents the state
of the channel. In this section, assuming that the position of
user l is known, the direction vector ul of the antenna can be
obtained. Then, user l ’s SINR (Signal to Interference and
1551-3203 (c) 2019 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
2
Fig. 1. Diagram of the multibeam anti-interference system model
Noise Ratio) can be expressed as a function of the user’s
transmit power:
Pl uH
l Rl ul
Γl (Pl ) = PL (2)
i=1,i6=l Pi uH
i Rl ui + 1
As seen from equation (2), the SINR of each user is affected
by the interference of other users. Therefore, to suppress
interference from other users and increase their own SINR,
users need to adjust their own transmit power. However, when
users adjust their transmit power, they will interfere with other
users and affect the SINR of other users. Therefore, other users
need to adjust their transmit power to suppress interference,
improve their SINR, and in turn cause interference to the first
user. This continuous cycle will lead to an infinite number of
loops, which will affect the overall performance of the system
and make it difficult to achieve the optimum state.
Therefore, to solve this problem, this project introduces
game theory from the field of AI into the multibeam anti-
interference problem. We propose an algorithm for intelligent
beamforming based on game theory:the beamforming algo-
rithm is transformed into a mathematical model appropriate
for game theory. The transmit power adjustment of different
user beamforming algorithms is described as a multiuser game,
so that each user can reasonably adjust its own transmit
power and maximize its own value of SINR while minimizing
interference with each other.
There are several models for the distribution of the arriving
signal EAOA (Enhanced Arrival of Angle): the truncated
cosine function, an improved truncated cosine function in the
Parsons model, the double exponential distribution function,
the censored Gaussian distribution function, the compound
parameter model, etc. Here, the improved truncated cosine
function in the Parsons model is used to describe the dis-
tribution of the scattered EAOA around the receiving end.
The power angle spectrum function is obtained after many
experimental observations and calculations, which not only
facilitates mathematical operations but also has practical phys-
ical meaning.
 
π π β π
f (β) = · cos · , |β| ≤ βm ≤ (3)
2 βm 2
In equation (3), βm is the maximum arrival elevation angle.
Figure 2 is the AAOA (Azimuth Angle of Arrival) power angle
spectrum, and Figure 3 is the EAOA power angle spectrum.
III. EFFICIENCY EVALUATION ALGORITHM
Game theory in the field of AI mainly consists of four
parts: the intelligent individual participating in the game, the
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TII.2019.2962035, IEEE
Transactions on Industrial Informatics
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015
Fig. 2. AAOA power angle spectrum
Fig. 3. EAOA power angle spectrum
set of rules, the strategy used and the expected return. In
the game theoretic multibeam anti-interference mathematical
model of this project, the intelligent individuals participating
in the game are the diverse users devices in the system.
The rule is multibeam anti-interference between multiuser
devices and the set of strategies for each user is its own set
of possible transmit powers Sl = {Pl , 1 = 1, 2, . . . , L} Each
intelligent individual has an independent selection strategy and
these strategies could interact with each other. The expected
return is defined as a net utility function Ul , which can be
expressed as:
Ul = UA − UB (4)
where UA represents the user’s utility function, indicating the
benefit the user obtains. And UB represents the user’s cost
function, indicating the price the user pays for the benefit.
First, we define the utility function UA and the cost function
UB . We define the utility function as a function of the user’s
SINR, as follows:
Γl
UA = f (Γl ) =
Γl + α
where α is a constant and is the same for all users. It is defined
as a tunable parameter that determines the steepness of the
utility function curve. The cost function UB can be defined
as:
UB = λPl (6) (6)
where the constant λ represents the cost factor. It is defined as
the cost to the user when the user’s SINR is changed. Thus,
the net utility function can be expressed as:
Γl
Ul = UA − UB = − λPl
Γl + α
From equation (7), the net utility function Ul is a function
with the user’s transmit power as an independent variable. This
1551-3203 (c) 2019 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
3
project takes the intelligent beamforming algorithm of game
theory in AI as the core and makes the value of the net utility
function as large as possible, namely:
Γl
argmaxUl = argmax − λPl (8)
Γl + α
For a differentiable function, the necessary condition for
first-order optimization is that the first derivative is zero. When
uHl Rl ul
k = PL H , by taking the derivative of the net
l=1,i6=l Pi ui Rl ui +1
utility function, we can obtain:
∂Ul ∂Ul ∂Γl α ∂Γl
= · −λ= 2
−λ
∂Pl ∂Γl ∂Pl (Γ + α) ∂Pl
(9)
kα
= −λ=0
(Γ + α)2
Solving equation (9) gives an expression for power Pl
namely: r
α α
Pl = − (10)
λk k
Equation (10) further illustrates that user ls strategy is
affected by other users, and its own strategy in turn affects
other users. This is a mutual, dynamic process. Therefore, to
satisfy the net utility function requirement shown in equation
(10) and to minimize the interference between users, it is
necessary to find a Nash equilibrium point to make the system
achieve the optimal steady state. The Nash equilibrium point
provides incentive for participants in competitive conflicts to
obtain predictable and stable game outcomes, thus achieving
a balance point from which each participant is reluctant to
deviate. This project uses a particle swarm algorithm in the
AI optimization algorithm to find the Nash equilibrium point.
The particle swarm algorithm is also called the particle
swarm optimization (PSO) algorithm, and it belongs to the
category of stochastic optimization algorithms. The main idea
is to operate on the level of the individual (particles). Think of
each individual as a particle with no weight or volume in the
N-dimensional search space that flies at a certain speed within
the search space. The flight speed can be dynamically adjusted
according to the individuals and the groups experiences.
The PSO algorithm is based on a simple concept, is easy to
implement, has a fast search speed and a large search range,
requires no gradient information, and has few parameters. In
(5) particular, the features of its natural coding implementation
are particularly suitable for dealing with realistic optimization
problems. At the same time, it is firmly grounded in artificial
intelligence, which makes it suitable for scientific research
and especially suitable for engineering applications. The steps
for using the particle swarm algorithm in this project are as
follows:
(1) Randomly initialize the particle swarm.
The transmit power optimization problem for each users
device is regarded as the ”particle” in the particle group
algorithm. All particles are searched in a D-dimensional space.
(7) The position x0i and velocity vi0 of each particle are randomly
initialized in a D-dimensional space (i = 1, 2, . . . , A) since the
fitness function has only one independent variable, the spatial
dimension D is 1.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TII.2019.2962035, IEEE
Transactions on Industrial Informatics
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 4

(2) Calculate the fitness value of each particle: The winning function represents the global mutual information
Γl of the system link. For each link i, the winning function Ui
f (x) = Ul = − λPl (11) is a function represented by strategy Si . The mathematical
Γl + α
derivation of the winning function will be performed as
(3) Record the individual historically optimal position of follows.
each particle and the historically optimal position of the group.
The covariance matrix of the interference plus the noise of
(4) Update the speed pi and position pg of each particle:
link i can be expressed as:
vik+1 =ωvik + c1 r1 pki − xki + c2 r2 pkg − xki ωvik



(12)
xk+1
i =xki + vik+1 L
X √
Ri =E{( ηi,i Hi,k )
where c1 and c2 are the learning factors. We adjust the i=1,i6=l
maximum step size for learning, which is generally taken to be L
0 ∼ 4, and choose c1 = 2, c2 = 3.r1 and r2 are two random
X √
+wi )( ηi,l Hi,Xl + wi )H } (15)
functions with a range of values [0, 1] and are used to increase i=1,i6=l
the randomness of the search. ω is the inertia weight, which L
is used to adjust the searchability of the space. It reflects the
X p
=In + ηi,l Hi,l sl,l
influence of individual historical achievements on the present, i=1,i6=1
generally taking a value in the range 0.5 ∼ 1, and this project
sets it to 0.75.  
(5) Determine whether the maximum number of iterations where Sl = E xk xH k represents the covariance matrix of
is reached or the global optimal position meets the minimum the transmitted signal xl , which satisfies tr (Sl ) = 1. The
requirement. covariance matrix of the received signal can be expressed as:
The number of iterations is generally 100 4000; too few
means the solution is unstable, too many means time is wasted. E yi yiH = ρi Hi,i Si HH

i,i + Ri (16)
The number of iterations selected in this project is 2000.
The studied system model is a HAPS communication sys-  
tem with L strips of transmission links. It is assumed that the where Si = E xi xH i represents the covariance matrix of
number of antennas at the transmitting end of the system is Nt xi , which satisfies tr (Si ) = 1
and the number of antennas at the receiving end is Nr . Then, The average mutual information of link i can be expressed
the received signal of transmission link i can be expressed as: as:
L
√ X √
yi = ρi Hi,i xi + ηi,l Hi,l xl + wi (13) I (xi , yi ) = E log2 det πe ρi Hi,i Si HH
 

i,i + Ri
l=1,l6=i
− log2 [det (πeRi ]}
where xi and xl represent the t-dimensional transmitted sig-   

 − 21 H 
nal vectors of link i and Nt , respectively, and the transmitted =E log2 det Inr + ρi R−1 i H i,i si Ri H i,i
signal vector is assumed to be a cyclic symmetric complex
=E log2 det Inr + ρi Hi,i Si H−1
 

Gaussian vector; ρi denotes the signal-to-noise ratio (SNR) of i,i
(17)
linki; ηiL represents the interference-to-noise ratio (INR) of
linki; and HiL and Hi2 represent the channel matrix Nr × Nt As stated above, the winning function represents the global
between link i and the number l transmitter and the number mutual information of the system, so the winning function U
i receiver, respectively. The elements h in the channel matrix can be expressed as:
are independent of each other and obey a complex Gaussian
distribution with a mean of 0 and a variance of 1.wi is a zero- L
X L
X
mean cyclic symmetric complex
  Gaussian Nr -dimensional U (Si ) = I (xi , yi ) = E {log2 [det (Inr +
H
noise vector, assuming E wi win = I. The transmit power of i=1 i=1
(18)
link i must satisfy: L
X
−1
ρi Hi,i Si HH
i,i × (Inr + Πi,1 Hi,1 S1 HH
i,1 ) )]}
E xH
 
i xi ≤ 1 (14) 1=1,16=i

In this model, it is assumed that link i knows its own SNR ρi

and channel matrix Hij , but the interference is determined by
other links, so link i does not know the sum of the interference
and the noise covariance matrix.
Then, the wireless resource management problem of the
Massive MIMO system is mapped to the game theoretic
mathematical model. In this model, the intelligent individuals
are the different links in the system. Their aggregate strategies
are the aggregates of their own transmit signal vector choices.
where Si represents the aggregate of strategies for transport
link i, that is, the aggregate of its transmit signal vector selec-
tions. According to the definition of game theory, each user
can select a corresponding transmit signal vector to maximize
its average mutual information. In the game model of this
project, to reduce the mutual influence between different links,
the maximum average amount of mutual information of the
links is used to replace the maximum amount of global mutual

1551-3203 (c) 2019 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TII.2019.2962035, IEEE
Transactions on Industrial Informatics
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015
information, so the winning function shown in equation (18)
can be further refined:
U = argmax U (Si )
L
X
E log2 det Inr + ρi Hi,i Si HH
 
= arg max i,i × (Inr +
i=1
L and mutation operations but instead it is used to replace
X
ηi,l Hi,l ll HH −1
i,l ) )]}
l=1,l6=i
(19)
It can be seen from equations (17) to (19) that the winning
function U is a function represented by strategy Si , and the
average mutual information of each link is affected by the
interference of other links. At the same time, the transmission
signal of each link has interference effects on other users, so
although each link is an independent selection strategy, the
strategies of the links will affect each other. The strategy that
each link makes will interfere with other links, which in turn
affects the overall performance of the system. Therefore, to
meet the requirements of the winning function, it is necessary
to find a Nash equilibrium point so that the amount of global
mutual information of the system is the largest, and the amount
of interference between links is the smallest. To achieve the
Nash equilibrium point of the winning function shown in
equation (19), constructed for this problem, an iterative search
should be used by an intelligent algorithm to find the optimal
solution. Observing the winning function of equation (19),
since it is a nonlinear function of the transmitted signal, it
is difficult to obtain its derivative. Therefore, it is difficult
to find the overall optimal solutions by using the traditional
optimization algorithm to find the required objective function
value and the objective function derivative value. Therefore,
in this topic, the genetic optimization method of AI is used
to solve the problem. Because the genetic algorithm needs
to use only the objective function value for a probabilistic
search technique to find the optimal values, the process can
be described as follows:
(1) Determine the decision variables and constraints: the
decision variable in this article is Si , i = 1, 2, K, L, where L
is the number of links and its value range is 0 ≤ Sl ≤ 1, i =
1, 2, K, L..
(2) Establish an optimization model as shown in equation
(19).
(3) Determine the encoding method: Use a binary code of
length N digits to represent the decision variable. The domain
of the decision is partitioned into 2N −1 intervals, and there are
2N discrete points. Correspondingly, the encoding method can
be obtained. yi indicates the decimal value corresponding to
the binary code string. Using the corresponding decimal value,
the formula for converting the code into a decision variable
is:
yi
Si = N (20)
2 −1
(4) Determine the individual’s evaluation method: Consid-
ering that the target optimization value is always nonnegative
and that the optimization function takes its maximum value,
the individual fitness can be set to the reciprocal of the
corresponding objective functions value.
1551-3203 (c) 2019 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
5
(5) Design the genetic algorithm: The selection operator
uses a proportion to select the arithmetic operators to have
the fittest individuals stay in the next generation as often as
possible. Here, we use the optimal retention strategy to model
the survival of the fittest, that is, the current group adaptation.
The fittest individual does not participate in the crossover
the individuals with the lowest fitness generated by genetic
operations such as crossover and mutation in the current
population. Crossover operations use single-point crossover
operators, and mutation operations use a basic bit-mutation
operator.
(6) Determine the operational parameters of the genetic
algorithm: the population size is taken as M, M > 0, the
crossover probability is taken as ρ, 0 < ρ < 1, and the
probability of variation is taken as θ, 0 < θ < 1.
IV. PERFORMANCE EVALUATION
By constructing the winning function to reach the Nash
equilibrium point, an iterative search is performed using a
smart algorithm to find the optimal solution. Using a tradition-
al optimization algorithm that requires the objective function
value and the objective function derivative value, it is difficult
to globally optimize the solution. Using genetic optimization
in AI to solve the problem, only the objective function value
is needed as a search technique to search for information. In
the simulation diagram in Figure 5, the AI-based performance
evaluation is compared with the traditional scheme. The base
station uses a uniform line array of 1-25 array elements,
and the array element spacing is half the wavelength. The
learning factors c1and c2in the particle swarm optimization
(PSO) algorithm are chosen as c1 = 2 and c2 = 3. r1 and
r2 are in the range of values [0, 1] and are used to increase
the randomness of the search. The inertia weight is chosen
as 0.75.
The number of iterations is generally from 100 to 40000; If
the number of iteration is too small, then the solution becomes
unstable. The time complexity increases, if the number of
iteration is too large.Too many and time is wasted. The number
of iterations selected in this project is 200.
As shown in Figure 4, after using the AI-based anti-
interference performance evaluation, it can be seen that the
performance evaluation value decreases slowly when the
number of antennas is large. The AI-based single-user call
delay performance is used for comparison with the traditional
scheme. It can be seen from the simulation diagram in Figure
5 that after using the AI-based anti-interference performance
evaluation, the average call delay for a single user is small
when the number of antennas is large.
Assume that the path loss of the channel is 0 dB and that the
shadow fading is 8 dB. Assume that each user’s queue always
has packet transmission. The simulation runs 10000 times.
To analyze the performance of particle swarm optimization
(PSO), two classic scheduling algorithms are selected for
comparison. One is the round-robin (RR) algorithm, and the
other is the max signal-to-noise ratio (SNR) algorithm. Figure
6 shows the comparison of the system average delay of the
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TII.2019.2962035, IEEE
Transactions on Industrial Informatics
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 6

In the simulations, the tunable parameter α = 1, the cost

factor λ = 1, the number of users L = 4, the expected user
direction is 60◦ , and the direction of the user is 90◦ , 120◦ ,
150◦ , 210◦ . As shown in the figure, after the AI algorithms
are used, the gain of the antenna is improved, the range that
the beam can cover is increased, and the user can interfere
with another user with a good null steering, indicating that
the system performance can be improved greatly after using
AI algorithms.

Fig. 4. Decrease of values of the different algorithm efficiency evaluations

Fig. 7. Comparison of beam pattern performance

Two interfering sources with plane wavefronts are assumed

Fig. 5. Single-user call delay
to have directions of arrival of 10◦ and 100◦ , respectively. The
desired direction of arrival is 60◦ . The normalized array gain
comparison of the two algorithms is shown in Figure 8. From
this figure, we find that the proposed AI-based algorithm has
better array gain than the traditional beamforming algorithm,
which can focus on the desired user and place spatial nulls
in the direction of undesired users. Moreover, since power
allocation based on game theory is proposed, the proposed
algorithm can mitigate the interference between users and
increase coverage area.

Fig. 6. Comparison of average delays of three algorithm systems

three algorithms under different numbers of users. As shown

in Figure 7, the average system latency of PSO is the smallest.
PSO can select the user with the smallest delay to transmit,
according to the user’s packet length and channel environment,
and it can dynamically update the average transmission delay
of the user. According to the updated average transmission
delay, it can automatically adapt to the scheduled users and
meet the minimum delay scheduling criterion of the intelligent
fair scheduling algorithm. Fig. 8. The normalized array gain comparison between two algorithms
The spacing between the antenna elements is half of the
wavelength, and the initial transmit power is 0. The precision Figure 9 shows the power iteration process of the proposed
requirement is ε = 10−5 . algorithm with different users. From the figure, we find that
We completed 10,000 Monte Carlo experiments to verify the power of each user increases somewhat and converges to a
the performance of the algorithm. Figure 7 is a comparison of steady value quickly, which shows that the proposed algorithm
beam pattern performance. has good convergence.

1551-3203 (c) 2019 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TII.2019.2962035, IEEE
Transactions on Industrial Informatics
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 7

Fig. 12. BER comparison of three algorithms under 64 TX antennas

Fig. 9. The power iteration process with different users

TABLE I
ACCURACY OF THE TRAINING AND TEST DATA

Accuracy of training data Accuracy of test data

AI-based 99.89% 98.3%

TABLE II
ACCURACY OF THE TRAINING AND TEST DATA FOR DIFFERENT NUMBERS
OF ITERATIONS

iterations Accuracy of training data Accuracy of test data

100 98.57% 96.33%
200 99.89% 98.3%
300 99.1% 97.9%
Fig. 10. BER comparison of three algorithms under 16 TX antennas

TABLE III
ACCURACY OF THE TRAINING AND TEST DATA WITH DIFFERENT
INTERFERENCE DIRECTIONS

interference direction Accuracy of training data Accuracy of test data

90◦ 99.37% 98.13%
120◦ 99.8% 98.2%
150◦ 98.9% 97.92%
210◦ 98.93% 98.06%

Fig. 11. BER comparison of three algorithms under 32 TX antennas
Figures 10, 11 and 12 show BER comparisons of three
algorithms under different numbers of transmitting antennas:
round-robin, Max SNR and PSO. From the three figures, we
find that the PSO algorithm has the best performance among
the three algorithms. Furthermore, with the increase in the
number of transmitting antennas, the advantages of the PSO
algorithm are increasingly obvious. This shows that the PSO
algorithm can achieve better performance when combined with
massive MIMO technology.
Table 1 shows the accuracy of the training and test data with
the AI-based algorithm. We use 500 samples as training data.
The accuracy of the training data is 99.89%, and the accuracy
of the test data is 98.3%.
Table 2 shows the accuracy of the training and test data for
different numbers of iterations. From this table, we find that
the accuracy is best with 200 iterations. Even if we increase
the iterations, the accuracy cannot be improved.
Table 3 shows the accuracy of the training and test data for
different interference directions. From the table, we find that
the AI-based algorithm can have good accuracy with different
interference directions even if the angle of the interference
direction is large.
Table 4 shows the accuracy of the training and test data
for different modulation types. From the table, we find that
the AI-based algorithm can have good accuracy even if the
modulation type is 64QAM.
Figure 13 shows the accuracy of the training and test data
for different SINRs. From the figure, we find that the AI-based
algorithm can have good accuracy even if the modulation type
is 64QAM.

1551-3203 (c) 2019 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TII.2019.2962035, IEEE
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015
TABLE IV
ACCURACY OF THE TRAINING AND TEST DATA FOR DIFFERENT
MODULATION TYPES
Modulation type Accuracy of training data Accuracy of test data
4PSK 100%
8PSK 100%
16QAM 99.89%
64QAM 97.3%
Fig. 13. Accuracy of training and test data for different SINRs.
V. RESULTS AND DISCUSSION
In the HAPS 5G Massive MIMO communication system,
the chances of long-packet data users and short-packet data
users being serviced are different due to the differing data
length of each user’s packet. According to the user’s channel
environment and packet data length, the user with the smallest
delay is selected for transmission so that users with different
delays in different channel environments and for different
data lengths can obtain transmission opportunities fairly. At
the same time, the HAPS communication system resources
maintain a dynamic balance with each other.
In this article, the dynamic and interdependent characteris-
tics between systems and the efficiency evaluation of wireless
resources are studied. Game theory is applied to evaluate the
wireless resource efficiency of the system, and an efficiency
evaluation model is constructed. In addition, the efficiency of
this preliminary work is verified by simulation.
ACKNOWLEDGEMENT
This paper is supported by the Guangdong
Province higher vocational colleges and schools,
the Pearl River scholar funding scheme (2016), a
project of the Shenzhen Science and Technology
Innovation Committee (JCYJ20170817114522834,
JCYJ20160608151239996), the Key laboratory of Longgang
District (LGKCZSYS2018000028), the science and
technology development center of the Ministry of Education
of China (2017A15009) and Engineering Applications of the
Artificial Intelligence Technology Laboratory (PT201701).
R EFERENCES
[1] Na, Zhenyu; Wang, Yuyao; Li, Xiaotong; Xia, Junjuan; Liu, Xin; Xiong,
Mudi; Lu, Weidang. Subcarrier allocation based Simultaneous Wireless
1551-3203 (c) 2019 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Transactions on Industrial Informatics
8
Information and Power Transfer algorithm in 5G cooperative OFDM
communication systems. Physical Communication, v 29, p 164-170,
August 2018.
[2] Z. Na, J. Lv, M. Zhang, B. Peng, M. Xiong and M. Guan, ”GFDM Based
Wireless Powered Communication for Cooperative Relay System,” IEEE
Access, vol. 7, pp. 50971-50979, 2019.
99.5%
[3] Z. Cao,X. Zhao,F. M. Soares.38-GHz Millimeter Wave Beam Steered
99.3% Fiber Wireless Systems for 5G Indoor Coverage: Architectures, Devices,
98.3% and Links. IEEE Journal of Quantum Electronics, 2017, 53(1): 1-9
[4] Mingxiang Guan, Le Wang, Liming Chen. Channel Allocation for Hot
95.6%
Spot Areas in HAPS Communication Based on the Prediction of Mobile
User Characteristics,Intelligent Automation & Soft Computing, 2016,
22(4): 613-620
[5] YuanYifei, Zhao Xiaowu. 5G: Vision,Scenarios and Enabling Technolo-
giesZTE Communications, 201513(1): 69-79
[6] Edgar Lemos Cid, Monica Portela Taboas, Manuel Garcia
Sanchez.Microcellular Radio Channel Characterization at 60 GHz
for 5G communications,IEEE Antennas and Wireless Propagation
Letters, 2017, (99): 1-4
[7] Guan Mingxiang, Wang Le. Modelling the HAP swing impact on HAPS
communication performance of wireless link,International Journal of
Sensor Networks, 2015, 17(3): 203-209
[8] Guan Mingxiang, Wang Le. A Novel Recognition Method for Low
SNR DSSS Signals Based on Four-order Cumulant and Eigenvalue
Analysis,Chinese Journal of Electronics, 2015, 24(3): 648-653
[9] Mingxiang Guan, Le Wang. Antenna Design and Cell Division for HAPS
Communication. Journal of Internet Technology, 2016, 17(2): 393-399
[10] Yufeng Wang,M. C. Erturk, Jinxing Liu. Throughput and delay of
single-hop and two-hop aeronautical communication networks,Journal of
Communications and Networks, 2015, 17(1): 58-66
[11] Z. Na, J. Lv, F. Jiang, M. Xiong and N. Zhao, ”Joint Subcarrier
and Subsymbol Allocation based Simultaneous Wireless Information and
Power Transfer for Multiuser GFDM in IoT,” IEEE Internet of Things
Journal. doi: 10.1109/JIOT.2018.2865248
[12] Mingxiang Guan, Le Wang. Minimum-Power Constraint-BasedResource
Allocation Algorithm forWireless Communication Systems,Journal of
Internet Technology, 2017, 18(3): 245-252
[13] A. Ibrahim, A. S. Alfa. Using Lagrangian Relaxation for Radio Resource
Allocation in High Altitude Platforms,IEEE Transactions on Wireless
Communications, 2015, 14(10): 5823-5835
[14] Feihong Dong, Yuanzhi He,Xionglin Zhou. Optimization and design of
HAPs broadband communication networks,The 5th International Confer-
ence on Information Science and Technology, 2015: 154-159
[15] Mingxiang Guan, Le Wang, XinLiu.Joint Rate and BER Scheduling Re-
source Allocation for Wireless Communication Systems,IEEE ACCESS,
2018,6: 65697-65704
Mingxiang Guan received the B.S. degree in Electronic En-
gineering from Harbin University of Science and Technology,
China, in 2002, and the M.S. and Ph. D in Information and
Communication Engineering from Harbin Institute of Tech-
nology, China, in 2004, 2008, respectively. Now, he is a full-
time professor with the School of Electronic Communication
Technology, Shenzhen Institute of Information Technology.
His main interests include wireless communications, resource
allocation, HAPS based communications and networking,
HAPS based 5G communications.
Zhou Wu received the M.S. and Ph. D in Information and
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TII.2019.2962035, IEEE
Transactions on Industrial Informatics
JOURNAL OF LATEX CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 9

Communication Engineering from Harbin Engineering Uni-
versity, in 2004 and 2008, respectively. Now, he is a full-
time teacher with the School of Sino-Germany, Shenzhen
Institute of Information Technology. His main interests include
artificial intelligence, wireless communications and resource
management.
neering from Harbin Engineering University, China, in 2004,
2009, respectively. Now, he is a full-time associate professor
with the School of Electronic Communication Technology,
Shenzhen Institute of Information Technology. His main inter-
ests include wireless communications , Communication Signal
Processing , HAPS based 5G communications.

Yingjie Cui received the B.E. degree in Electronic and In-

formation Engineering from SZU, China, in 2007and M.E.
in Signal and Information Processing from SZU, China, in
2010. Now, she is a full-time lecturer with the School of
Electronic Communication Technology, Shenzhen Institute of
Information Technology. Her main interests are in the areas of
Signal Processing and network communication research.
Bao Peng received the Ph.D. degree in information and com-
munication engineering from the Institute of Electronic Infor-
mation Engineering, Harbin Institute of Technology, Harbin,
China, in 2009. His research interests are in the areas of
distributed systems, and information management.

Xuemei Cao received the B.S. and M.S degree in Electronic

Information Engineering from Chongqing University of Tech-
nology, China, in 2009, 2012, respectively, and the Ph. D in
Electronic Science and technology from Beijing University of
Posts and Telecommunications, China, in 2015, Now, she is a
lecturer with the School of Electronic Communication Tech-
nology, Shenzhen Institute of Information Technology. Her
main interests include wireless communications, Holographic
display, 3D display and the New optical device.

Le Wang received the B.S. degree in Electronic Engineering

from Harbin Institute of Technology, China, in 2001, and the
M.S. and Ph. D in Information and Communication Engineer-
ing from Harbin Institute of Technology, China, in 2004, 2010,
respectively. Now, she is a full-time teacher with the School of
Electronic Communication Technology, Shenzhen Institute of
Information Technology. Her main interests include wireless
communications and signal processing.

Jianfeng YE received the B.S. degree in Electronic Engineer-

ing from Harbin Engineering University, China, in 2001, and
the M.S. and Ph. D in Information and Communication Engi-

1551-3203 (c) 2019 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.