A modified algorithm for computation issues in UAV-enabled wireless communications

Abstract

Unmanned aerial vehicles (UAVs) in wireless communication have received significant interests recently due to its low cost and flexibility in providing wireless connectivity in areas without infrastructure coverage. In this paper, we optimize the location of UAVs to maximize their coverage areas. We propose a modified artificial bee colony (MABC) incorporating bee number reallocation and a new search equation. In the proposed algorithm, a greater number of bees in the population are assigned to execute local searches near food sources to enhance solution accuracy, and the bees are guided by elite vectors to enable the algorithm to rapidly converge to a potentially globally optimal position. The deployment of UAVs is thus obtained. The experimental results show that the proposed algorithm achieves great improvements over the traditional algorithm.

1 Introduction

Unmanned aerial vehicles (UAVs) have attracted widespread attention over the past decade [1–3], involving applications such as surveillance [4, 5], aerospace imaging [6, 7], and cargo transportation [8, 9]. Extensive research is also devoted to the use of drones as different types of wireless communication platforms, such as aeronautical mobile base stations (BS) [10–12], mobile relays [13], and flight cloud computing [14]. In particular, the use of UAVs as airborne BSs is envisioned as a promising solution to enhance the performance of existing cellular systems [15].

In a UAV-assisted network, UAVs are deployed to provide wireless connectivity to ground users. In practice, UAVs can move freely in three-dimensional space for better performance. Due to the high mobility of drones, the deployment of drone-assisted communication systems is faster and more flexible, making them particularly suitable for on-demand applications or accidents. Furthermore, the UAV-ground link is more likely to have a line-of-sight (LoS) channel than the ground-to-ground link in the terrestrial system [16–19], thus providing a higher link capacity. In addition, UAV-assisted communication provides additional design freedom for performance improvements by dynamically optimizing the UAV position to best meet communication requirements. In this paper, we have studied a general-purpose multi-UAV wireless communication system in which multiple drones are used to serve a group of users on the ground within a given group of users.

Research on wireless networks supporting static drones has focused on drone deployment/layout optimization, which acts as a quasi-static BS in the air to support terrestrial users in specific areas [20]. In such a scene, the deployment of UAVs is an important and fundamental issue. The artificial bee colony (ABC) evolutionary algorithm is known to be powerful, effective, and competitive in the above problem. However, its success is hindered by its slow convergence speed and poor local search capability [21–23]. In this paper, we reallocate the number of employed and onlooker bees to generate a better balance between global and local search. The proportion of employed bees is decreased while that of onlooker bees is increased in the colony. In addition, a new search equation to accelerate the algorithm’s convergence speed is also proposed. The one-dimensional search strategy, which typically guarantees a global search [24], is retained in this paper. Finally, a series of benchmark functions are employed to test the proposed algorithm’s effectiveness on both theoretical and applied problems.

The remainder of this paper is organized as follows: Section 2 describes traditional artificial bee colonies, and Section 3 presents a detailed description of the proposed modified ABC algorithm. In Section 4, benchmarks and parameter estimation problem are presented, and a suite of experiments is conducted. Section 5 concludes the paper.

2 Method

Firstly proposed by Karaboga in 2005, an artificial bee colony simulates the foraging behavior of bees in a colony. In the algorithm, three types of bees cooperatively work with each other: employed bees are distributed to enable the exploration of a food source’s position within the entire search space, onlooker bees are assigned to enable exploitation near the neighbor areas of food sources, and scouts are designed to help the algorithm avoid local optima.

In the traditional artificial bee colony algorithm, the entire population is divided into employed bees and onlooker bees. Thus, the number of employed bees and onlooker bees are equivalent to both each other and the number of food sources. To illustrate each part of ABC algorithm in greater detail, we describe them in succession.

2.1 Initialization

For a given optimization problem, let l and u denote the lower and upper border of the parameters. Let NP denote the population size, and let D denote the dimension of the problem. Each food source can be initialized as

$$ {F_{ij}} = {l_{ij}} + \text{rand}\left({{u_{ij}} - {l_{ij}}} \right)\ $$

(1)

where i represents the ith food source, and j denotes the jth dimension, i=1,2,...,NP/2, j=1,2,...,D.

2.2 Employed bees

At each iteration, the employed bees search the entire space. Thus, they are responsible for conducting a global search. Each food source corresponds to an employed bee. The search equation is

$$ \text{trial}{_{ij}} = {F_{ij}} + \text{rand}\left({ - 1,1} \right)\left({{F_{rj}} - {F_{ij}}} \right) $$

(2)

where F_r is a neighbor of food source F_i, and r is selected within the range of [1,NP/2],r≠i.

In the traditional ABC algorithm, each newly generated position is stored in a trial vector only if it improves upon the current food source’s position, and the corresponding food source is updated, resulting in a so-called greedy search.

The objective value, f_i, and fitness value, F_i, are calculated for each food source, i. For minimum optimization problems, the objective value is calculated by the problem’s mathematical expression, and the fitness value is calculated as

$$ {F_{i}} = \left\{ {\begin{array}{*{20}{c}} {1/(1 + {f_{i}})}&{\text{if}}&{{f_{i}} \ge 0}\\ {1 + \text{abs}({f_{i}})}&{\text{if}}&{{f_{i}} < 0} \end{array}} \right. $$

(3)

2.3 Onlooker bees

After the employed bees’ searches are completed, the onlooker bees initiate local searches around the food sources’ neighboring areas. In this phase, the onlookers select food sources by roulette wheel selection to enable exploitation. The search equation is identical to that of the employed bees presented in Eq. (2).

2.4 Scouts

When a food source cannot be improved upon for a certain number of iterations, the corresponding employed bee turns into a scout and reinitializes the corresponding food source in the search space.

3 Modified Artificial Bee Colony (MABC)

The artificial bee colony algorithm is known for its strong global search and poor local search capabilities; thus, we aim to compensate for this insufficiency on the basis of guaranteeing an advantage. With this purpose in mind, two modifications are proposed.

The first modification reallocates the percentages of employed bees and onlooker bees in the colony. As discussed in Section 2, employed bees are responsible for exploration, whereas onlooker bees are in charge of exploitation. Thus, this modification decreases the proportion of employed bees and increases that of onlooker bees. More specifically, in the modified artificial bee colony, the employed bees represent a quarter of the colony, and the onlooker bees represent the remainder of the colony. Under this circumstance, a greater number of bees are allocated for executing exploitation search; thus, the solution accuracy is expected to be enhanced and improved. Furthermore, the roulette wheel selection mechanism is abandoned. The number of food sources is equivalent to the number of employed bees, and each food source corresponds to one employed bee and three onlooker bees.

In the second modification, the search equation is changed. In a traditional artificial bee colony, an employed bee hunts for a food position depending on its memory of its previous position and a randomly selected neighboring food source; this hunting is blind and ineffective for local searches [24]. Considering this drawback, we propose a novel search equation to achieve a better balance between exploration and exploitation. Its mathematical expression is presented in Eq. (4).

$$ \text{trial}{_{ij}} = {F_{rj}} + \text{rand}\left({ - 1,1} \right)\left({{G_{j}} - {F_{ij}}} \right) $$

(4)

where F_r is a neighbor of food source F_i, which is selected in the same manner as that in Eq. (2). G is the current best food source’s position. By introducing a best vector, bees can fly to the potential global point more rapidly.

To demonstrate the effectiveness of Eq. (4), we conduct experiments on the sphere function (f₁) presented in Section 4. In this experiment, the population size is set to 100. Because we are demonstrating the search equation’s effectiveness, the comparison algorithms both adopt employed and onlooker bees as representing half of the colony. In this demonstration, we analyze the performance of the proposed Eq. (4) and traditional Eq. (2). Thus, the test dimension is selected to be 2 to allow for plotting the population distribution figures of different iterations. Figure 1 shows the results of the comparison.

Fig. 1

Comparison of the population distributions of Eqs. (2) and (4) at generation =300, 500, and 800. a Population distributions observed at generation = 300, 500, and 800 in Eq. (2). b Population distributions observed at generation = 300, 500, and 800 in Eq. (4)

As indicated in the figure, the population distribution with Eq. (2) in the traditional artificial bee colony algorithm reaches a stable precision at 10⁻⁸ after the 300th, 500th, and 800th generations, whereas the population distribution with MABC in Eq. (4) decreases rapidly with an increasing number of iterations, achieving a stable precision at 10⁻⁴¹,10⁻⁶⁹, and 10⁻¹¹¹ after the 300th, 500th, and 800th generations, respectively. These experiments demonstrate that the proposed search equation might help bees converge to potentially global optima much more rapidly.

To further demonstrate the two modifications’ effectiveness, Section 4 evaluates MABC’s optimization accuracy on a series of benchmark experiments.

To illustrate the proposed MABC algorithm much more specifically, Fig. 2 gives its pseudo-code.

Fig. 2

MABC pseudo code

4 Simulation results and discussions

In this subsection, integral and comprehensive experiments are conducted to test MABC’s effectiveness. Section 4.1 gives detailed information on the twelve benchmarks of performance estimation criteria, and Section 4.2 presents the results of the comparison experiments using the proposed MABC and other state-of-the-art algorithms. In Section 4.3, sub-experiments demonstrate each MABC modification’s effectiveness, and Section 4.4 describes a parameter estimation problem for frequency-modulated sound waves and discusses the MABC’s application performance.

4.1 Detailed benchmark information

In this subsection, twelve well-known benchmark functions [25–27] that are widely used in the literature function as the evaluation criteria for the evolutionary algorithms tested. They include five unimodal functions, signifying that there is only one global optimum in the search space, five multimodal functions with abundant global optima in the search space, and two two-dimensional test functions. Detailed information, including formulae, search ranges, and optimal values, are presented in Table 1.

Table 1 Detailed information on the 12 benchmarks

4.2 Comparison experiments

This subsection describes the comparison experiments conducted to demonstrate the proposed MABC’s effectiveness and competitiveness against other evolutionary algorithms. In this phase, the selected comparison algorithms include traditional particle swarm optimization (PSO), differential evolution (DE), and artificial bee colony (ABC), as well as four ABC variants, including STOC-ABC [21], dABC [22], distABC [23], and NSABC [24].

In the experiments, the population size is set to 40. For the first ten benchmarks presented in Table 1, all the algorithms are tested on 10, 30, and 50 dimensions. For the last two benchmarks, the comparison algorithms are tested on two dimensions. The corresponding maximum iteration and function evaluation numbers are presented in Table 2. For the sake of fairness, all the trials are repeated 50 times, and the corresponding mean fitness values (first row) and standard deviations (second row) are recorded, as presented in Tables 3, 4, 5, 6, 7, 8, 9, and 10.

Table 2 Corresponding experimental settings

Table 3 Comparison results (1), D = 10

Table 4 Comparison results (2), D = 10

Table 5 Comparison results (1), D = 30

Table 6 Comparison results (2), D = 30

Table 7 Comparison results (1), D = 50

Table 8 Comparison results (2), D = 50

Table 9 Comparison results (1), D = 2

Table 10 Comparison results (2), D = 2

From the results, it can be easily observed that the proposed MABC algorithm generally achieves strong performance. For the multimodal functions, ABC exhibits its strong global search ability, as demonstrated by the ABC variants’ experimental results compared with those achieved by PSO and DE. The proposed MABC algorithm achieves a similarly improved outcome on multimodal functions compared with the other ABC variants. For the unimodal functions, MABC represents an obvious improvement over the traditional ABC and achieves better performance than the other comparison algorithms. For the last two two-dimensional test functions, the proposed MABC algorithm also attains the best solution accuracy. Taken together, the experimental results demonstrate that the decreasing number of employed bees does not cripple their exploration ability, and increasing the number of onlooker bees improves their exploitation capability. In addition, the proposed MABC algorithm’s successful performance on low dimensional functions demonstrates that it is unlimited by a problem’s dimension. For the unimodal functions, with the exception of the solution accuracy presented in the results table, convergence speed is another important evaluation criterion. Thus, we plot the convergence curves of f1 and f4 in Fig. 3. f1 is the sphere function, which is also the most representative unimodal function, and f4 is the unimodal function for which most of the algorithms obtain global optima. Thus, convergence speed functions as the main evaluation criterion for the evolution algorithms’ performance.

Fig. 3

Convergence curves

4.3 Effectiveness of the two modifications

Whereas the previous subsection presented an integral demonstration of MABC’s performance, the present subsection covers the experiments to test the effectiveness of each MABC modification, which are conducted in two groups.

• Adjustment of the number of different bees

  For this group of experiments, we design another ABC variant named ABC₁, wherein employed bees occupy one-fourth of the colony, and onlooker bees constitute the remainder of the colony. The other parts of ABC₁ remain identical to the traditional ABC algorithm. Thus, a comparison between ABC and ABC₁ demonstrates the first modification of MABC’s effectiveness.

• New search equation

  The second group of experiments tests the proposed search equation’s competitiveness. Thus, we design ABC₂, whose search equation adopts Eq. (4). The remaining parts of the algorithm remain consistent with the traditional ABC algorithm.

  In this subsection, the test dimension is set to 10, and the other settings are identical to those in Section 4.4. Figures 4 and 5 show the comparison results for the two experimental groups on several representative benchmarks. The figures show that each modification greatly improves upon the traditional ABC. The detailed accuracy and standard deviation data for the first ten benchmarks are presented in Table 11, which also demonstrates each modification of MABC’s effectiveness.

  Fig. 4

  

  Demonstration of the first modification’s effectiveness

  Fig. 5

  

  Demonstration of the second modification’s effectiveness

  Table 11 Comparison results for ABC, ABC₁, ABC₂, and MABC

4.4 Parameter estimation problem for frequency-modulated sound waves

The synthesis of frequency-modulated sound waves [28] plays a significant role in modern music systems [29–32]. In this process, parameter estimation consists of a six-dimensional optimization problem. The goal is to generate a sound, A, that is very similar to a certain sound, B. Let X = {x₁,x₂,x₃,x₄,x₅,x₆} represent the six parameters to be optimized. The mathematical expressions of sound A wave can then be formulated as follows:

$$ {\text{waves}{_{A}}\left(t \right) = {x_{1}}\sin \left({\frac{{2\pi }}{{100}}{x_{2}}t + {x_{3}}\sin \left(\begin{aligned} &\frac{{2\pi }}{{100}}{x_{4}}t +\\ &{x_{5}}\sin \left({\frac{{2\pi }}{{100}}{x_{6}}t} \right)\\ \end{aligned} \right)} \right)} $$

(5)

$$ \begin{aligned} \!\!\!\!\!\!\!\!\!\!\!\text{waves}{_{B}}\left(t \right) \,=\, \sin \left({\frac{{2\pi }}{{100}}5t \,-\, 1.5\sin \left({\frac{{2\pi }}{{100}}4.8t \,+\, 2\sin \left({\frac{{2\pi }}{{100}}4.9t} \right)} \right)} \right) \end{aligned} $$

(6)

The objective function of this problem is the summation of the squared errors between sound waves A and B, as presented in Eq. (6):

$$ f = \sum\limits_{t = 0}^{100} {{{\left({\text{waves}{_{A}}\left(t \right) - \text{waves}{_{B}}\left(t \right)} \right)}^{2}}} $$

(7)

This is a minimization problem with complex local optima. For all six parameters, the lower bound is - 6.4, and the maximum bound is 6.35. In our experiment, the population size is set to 40, and the maximum function evaluation number is set to 30,000. When the maximum function evaluation number is satisfied, the corresponding trial terminates. The experimental results for the eight algorithms employed in Section 4.4 are presented in Table 12, which demonstrate the proposed MABC algorithm’s competitiveness on a real-world application problem.

Table 12 Experimental results on parameter estimation for frequency-modulated sound waves

5 Conclusion

In this paper, we studied the problem about the placement of UAVs in UAV-aided wireless communications. We first exploit the controllable channel variation induced by different locations of base stations, the coverage areas of UAVs are maximized via optimizing their locations. Then, we formulate the original problem and try to solve it by artificial bee colony algorithm. Instead of using traditional algorithms, we propose a modified artificial bee colony. By reallocating the number of employed and onlooker bees and improving the search equation, convergence speed and enhancing local search capability are both accelerated. Furthermore, it generates a better balance between global and local search. Experimental results show that the new approach of placement problem improves the performance of UAV communication systems.