Thinning of antenna array via adaptive memetic particle swarm optimization
- Xiu Zhang^{1} and
- Xin Zhang^{1}Email authorView ORCID ID profile
https://doi.org/10.1186/s13638-017-0968-2
© The Author(s) 2017
Received: 5 August 2017
Accepted: 20 October 2017
Published: 6 November 2017
Abstract
Massive multiple input multiple output antenna array is crucial for the fifth generation wireless communication. Proper antenna array design can reduce interference among different signals and generate desirable beamforming. Sparse antenna array is able to form narrower beam with lower sidelobe than equally spaced antenna array given the same number of array elements. However, determining the position of elements is non-deterministic polynomial-time hard. To effectively solve such problem, this paper proposes adaptive memetic particle swarm optimization (AMPSO) algorithm. The algorithm adaptively tunes algorithmic parameters of particle swarm optimization (PSO). Moreover, crossover operator is added to enhance local exploiting search information of PSO. Sparse antenna array design is modeled as a minimization by thinning method. It is then tackled by the proposed algorithm. In terms of peak sidelobe level, the AMPSO algorithm shows good performance compared with PSO and genetic algorithm.
Keywords
1 Introduction
Massive multiple input multiple output antenna array is crucial for the fifth generation wireless communication [1]. No matter in cognitive radio networks, ad hoc networks, or radar networks [2–5], antenna play an important role to ensure data transmission and high Quality of Services (QoS) under certain communication requirements [6–9]. The design of antenna arrays is well known to be a hard nonlinear programming problem [10]. Recently, many researchers attempt to create efficient and effective optimization algorithms to solve the design of antenna arrays. Stochastic algorithms are popularly used because traditional optimization methods are not suitable due to the unavailable of gradient information [11–13]. Stochastic algorithms also show good performance for such design problems [14, 15].
Stochastic algorithms consist of two classes: evolutionary algorithms (EAs) and swarm intelligence (SI) algorithms. Informally, EAs contain genetic algorithm (GA) [16], evolutionary strategies [17], and differential evolution [18]. These algorithms simulate the evolution of genetic process of livings. They usually contain both mutation and crossover operators. SI algorithms contain particle swarm optimization (PSO) [19], artificial bee colony (ABC) [20], neighborhood search optimization [21], etc. SI algorithms emulate the social behaviors of swarms or particles. They usually do not contain crossover operator. Although EAs and SI are created based on different nature, their positive combinations are able to result effective algorithms [22]. In the past, GA, PSO, and ABC have been used in antenna designs [15, 23, 24]. Recently, covariance matrix adaptation evolutionary strategy [25] and differential evolution [26] are applied to synthesize antenna array patterns.
A large number of iterations is needed for standard PSO algorithm to obtain a satisfactory solution [27]. This is not acceptable for users as antenna simulation often takes a long time. In this paper, standard PSO is modified by adding a crossover operator and a parameter adaptation method. The idea is reasonable as memetic with crossover operator can enlarge and promote algorithm’s search; also parameter control is an effective way to make the algorithm adapt to different design problems and saves the fine-tuning efforts of users. The new algorithm is named as adaptive memetic particle swarm optimization (AMPSO), which is applied to tackle antenna design. Numerical experiment is conducted studying the effect of adding crossover and parameter adaptation. The results are discussed based on different metrics and compared with other algorithms.
In the following, Section 2 introduces the antenna array design considered in this paper. Section 3 gives standard PSO and the proposed AMPSO algorithm. Section 4 presents numerical simulation with discussions. Section 5 concludes the paper.
2 Sparse antenna array and related works
Sparse antenna array design can be classified to two categories. One refers to that array elements can be placed anywhere between the aperture of antenna array. The other is that thinning the distance to grids and positions in grids are equally spaced. In the first case, elements can be arbitrarily placed, hence the positions of elements are continuous variables. In the second case, elements could be placed on grids, hence its search space is discrete and finite. However, when the number of array elements increases up to tens or hundreds, search space of such combinatorial optimization problem exponentially increases, which brings huge trouble for conventional optimization algorithms.
where MP is mainlobe peak level, C _{0} is a correction parameter as the first zero point may shift in nonuniform array. The constraint in (4) is to constrain the value of u so that mainlobe field is removed in computing E(u).
Previously, many researches have reported in literature. Wang et al. considered nonuniform antenna array design for millimeter wave situations [28]. Zhao et al. studied resource allocation problem in MIMO systems such as time allocation [29] and power allocation [30].
3 Optimization algorithms
This section depicts standard PSO and the proposed AMPSO algorithm.
3.1 Standard particle swarm optimization algorithm
where subscript j∈[1,D] refers to the jth dimension; t refers to the tth generation; r _{1} and r _{2} are random numbers between 0 and 1. p _{ i } and p _{ g } are respectively personal best and global best positions that particle i walked through. In this equation, w, c _{1}, and c _{2} are three algorithmic parameters of PSO. Their setting for good performance of algorithm depends on the properties of practical problem. In other words, they are sensitive to problem types.
Recently, many researches have been published about parameter control of PSO. Inertia weight was adapted in a stability-based manner, which could improve the performance of PSO [31]. Khan et al. improved PSO by a random mutation mechanism and a dynamic inertia weight adaptive method, which could facilitate algorithm convergence [32]. Jin et al. improved PSO through enlarging explorative ability of PSO to design a permanent magnet synchronous machine [33].
3.2 Adaptive memetic PSO algorithm
As designated by no free lunch theory [34], the performance of an optimization algorithm could be improved by incorporating prior knowledge or properly hybrid with other search operators or optimization algorithms. This section will present a hybrid algorithm, as mentioned in introduction, the modification contains two parts. The first one is parameter control of PSO algorithm. The second is hybrid with crossover operator.
where w ^{min} and w ^{max} are the maximum and minimum value of parameter w; similarly, the minimum and maximum value of c1 and c2 are c1^{min}, c1^{max} and c2^{min}, c2^{max}.
The PSO algorithm combined with crossover operator and parameter adaptation is abbreviated as AMPSO. Compared with standard PSO, the AMPSO algorithm needs more operations to perform two additional steps. For arithmetic crossover, the computing of velocity requires 2D addition and 2D multiplication operations; the computing of position also requires 2D addition and 2D multiplication operations. Thus, in each generation, AMPSO needs 8D computer operations than standard PSO.
4 Numerical experiment
The AMPSO algorithm deals with nonuniform antenna array design problem in this section. The numerical results are also reported and discussed.
4.1 Experimental setting
Electromagnetic phenomena of antenna array systems can be described using Maxwell’s electromagnetic field equations, thus numerical methods of electromagnetic field computation, such as finite element method (FEM), method of moments, Monte Carlo method, and finite volume method, are in a better position for engineers to appreciate and analyze the performance antenna array systems. FEM is used in this paper to simulate antenna array system.
Simulation configuration is described as follows. Nonuniform antenna array design are thinned and then used to study how AMPSO performs in handling binary optimization design problems. The number of elements is 25 (N=25), and the number of grids is 101 (D=M=101). The interval between elements is 0.5λ and the aperture is 50λ.
Configuration of the PSO, MPSO, and AMPSO algorithms
Algorithm | Parameters |
---|---|
PSO | Np=100, w=0.8, c1=c2=2 |
MPSO | Np=100, w=0.8, c1=c2=2, Cr=0.8 |
AMPSO | Np=100, Cr=0.8 |
As to termination condition, the maximum number of function evaluations (MFE) is set to 5e4 for all algorithms, i.e., MFE=50,000. Each algorithm is independently run 25 times to gain an average performance. The simulation is implemented in Matlab, and executed on a personal computer with 4-core 3.4 GHz CPU and 4 GB of memory. This could provide a fair comparison environment for the test algorithms.
4.2 Simulation results
Optimal f values found by the test algorithms for antenna design
Algorithm | min | med | max | mean | std |
---|---|---|---|---|---|
PSO | −10.2747 | −9.7138 | −9.3686 | −9.7785 | 0.2624 |
MPSO | −11.0568 | −10.5446 | −10.1880 | −10.5823 | 0.2897 |
AMPSO | −11.3935 | −10.7617 | −10.4727 | −10.8028 | 0.2619 |
5 Conclusions
This paper proposes to add crossover operator and parameter adaptation to standard PSO algorithm for tackling the design of nonuniform antenna array. The design of antenna array is thinned to a finite candidate slots. The increase of slot numbers brings enormous difficulties to optimization algorithms. Hence, it is necessary to study more efficient algorithms for such design problems. This paper takes arithmetic crossover and uses rounding method to discretized real values to binary values. Moreover, a novel parameter adaptation method is proposed. Different from traditional linear decrease of parameter values, parameters are adapted alike to sigmoid function. In this way, sensitive parameters are adapted and could be applied to a good many of problem types. Simulated on an example with D=101, the proposed AMPSO algorithm presents good performance in both convergence process and solution quality. Moreover, both the use of crossover and parameter adaptation are shown to be able to positively affect the algorithm.
In antenna array model (4), far field pattern is considered, which is the main metric in evaluating the performance of antenna. The larger the difference between main lobe beam and sidelobe beam, the higher the transmission efficiency is. However, the bandwidth of main lobe beam is not included in this model. Large bandwidth antenna is more reliable in receiving signals in complex terrain and severe weather. This issue will be studied in the future.
Declarations
Acknowledgements
This research was supported in part by the National Science Foundation of China (Project Nos. 61601329, 61603275) and the Applied Basic Research Program of Tianjin (Project Nos. 15JCYBJC52300, 15JCYBJC51500).
Authors’ contributions
XZ proposes the modified PSO method and writes most of this paper. XZ is in charge of numerical simulation and proofreading of the paper. Both authors read and approved the final manuscript.
Competing interests
The authors declare that they have no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
References
- F Zhao, W Wang, H Chen, Q Zhang, Interference alignment and game-theoretic power allocation in MIMO heterogeneous sensor networks communications. Signal Proc.126:, 173–179 (2016).View ArticleGoogle Scholar
- J Gao, C Yin, Analysis of the local delay with slotted-aloha based cognitive radio ad hoc networks. EURASIP J. Wirel. Commun. Netw.2015(1), 1–6 (2015).View ArticleGoogle Scholar
- Q Liang, Radar sensor wireless channel modeling in foliage environment: UWB versus narrowband. IEEE Sensors J.11(6), 1448–1457 (2011).View ArticleGoogle Scholar
- F Zhao, H Nie, H Chen, Group buying spectrum auction algorithm for fractional frequency reuses cognitive cellular systems. Ad Hoc Netw.58:, 239–246 (2017).View ArticleGoogle Scholar
- T Jiang, W Zang, C Zhao, J Shi, An energy consumption optimized clustering algorithm for radar sensor networks based on an ant colony algorithm. EURASIP J. Wirel. Commun. Netw.2010:, 627253 (2010).View ArticleGoogle Scholar
- HK Min, MS Song, I Song, JH Lim, A frequency-sharing weather radar network system using pulse compression and sidelobe suppression. EURASIP J. Wirel. Commun. Netw.2016:, 100 (2016).View ArticleGoogle Scholar
- Q Liang, Situation understanding based on heterogeneous sensor networks and human-inspired favor weak fuzzy logic system. IEEE Systems J.5(2), 156–163 (2011).View ArticleGoogle Scholar
- F Zhao, X Sun, H Chen, R Bie, Outage performance of relay-assisted primary and secondary transmissions in cognitive relay networks. EURASIP J. Wirel. Commun. Netw.2014:, 60 (2014).View ArticleGoogle Scholar
- Q Liang, X Cheng, S Huang, D Chen, Opportunistic sensing in wireless sensor networks: theory and applications. IEEE Trans. Comput.63(8), 2002–2010 (2014).View ArticleMATHMathSciNetGoogle Scholar
- W Li, X Shi, Y Hei, An improved particle swarm optimization algorithm for pattern synthesis of phased arrays. Progress Electromagn Res.82:, 319–332 (2008).View ArticleGoogle Scholar
- C Han, T Feng, G He, T Guo, Parallel variable distribution algorithm for constrained optimization with nonmonotone technique. J. Appl. Math.2013(1), 401–420 (2013).MATHMathSciNetGoogle Scholar
- CY Han, FY Zheng, TD Guo, GP He, Parallel algorithms for large-scale linearly constrained minimization problem. Acta Mathematicae Applicatae Sinica, English Series.30(3), 707–720 (2014).View ArticleMATHMathSciNetGoogle Scholar
- J Yu, M Li, Y Wang, G He, A decomposition method for large-scale box constrained optimization. Appl. Math. Comput.231(12), 9–15 (2014).View ArticleMathSciNetGoogle Scholar
- L Jin, Y Li, C Zhao, Z Wei, B Li, J Shi, Cascading polar coding and LT coding for radar and sonar networks. EURASIP J. Wirel. Commun. Netw.2016:, 254 (2016).View ArticleGoogle Scholar
- X Zhang, X Zhang, A non-revisiting artificial bee colony algorithm for phased array synthesis. EURASIP J. Wirel. Commun. Netw.2017(1), 7 (2017).View ArticleGoogle Scholar
- C Ergun, K Hacioglu, Multiuser detection using a genetic algorithm in CDMA communications systems. IEEE Trans. Commun.48(8), 1374–1383 (2000).View ArticleGoogle Scholar
- HG Beyer, HP Schwefel, Evolution strategies-a comprehensive introduction. Natural Comput.1(1), 3–52 (2002).View ArticleMATHMathSciNetGoogle Scholar
- R Storn, K Price, Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J. Global. Optim.11(4), 341–359 (1997).View ArticleMATHMathSciNetGoogle Scholar
- J Kennedy, RC Eberhart, in Proc. IEEE Int. Conf. Neural Networks, vol. 4. Particle swarm optimization (IEEE, Perth, 1995), pp. 1942–1948.View ArticleGoogle Scholar
- D Karaboga, B Basturk, A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithms. J. Glob. Optim.39(3), 459–471 (2007).View ArticleMATHMathSciNetGoogle Scholar
- Z Wu, TWS Chow, Neighborhood field for cooperative optimization. Soft Comput.17(17), 819–834 (2013).View ArticleGoogle Scholar
- F Neri, C Cotta, Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol. Comput.2:, 1–14 (2012).View ArticleGoogle Scholar
- DW Boeringer, DH Werner, Particle swarm optimization versus genetic algorithms for phased array synthesis. IEEE Trans. Antennas Propag.52(3), 771–779 (2004).View ArticleGoogle Scholar
- P Rocca, RJ Mailloux, G Toso, GA-based optimization of irregular subarray layouts for wideband phased arrays design. IEEE Trans. Antennas Propag.14:, 131–134 (2015).View ArticleGoogle Scholar
- MD Gregory, Z Bayraktar, DH Werner, Fast optimization of electromagnetic design problems using the covariance matrix adaptation evolutionary strategy. IEEE Trans. Antennas Propag.59(4), 1275–1285 (2011).View ArticleGoogle Scholar
- X Li, WT Li, XW Shi, J Yang, JF Yu, Modified differential evolution algorithm for pattern synthesis of antenna arrays. Prog. Electromagn. Res.137(137), 371–388 (2013).View ArticleGoogle Scholar
- S Pang, T Li, F Dai, M Yu, Particle swarm optimization algorithm for multisalesman problem with time and capacity constraints. Appl. Math. Inf. Sci. 7(6), 2439–2444 (2013).View ArticleMathSciNetGoogle Scholar
- P Wang, Y Li, Y Peng, SC Liew, B Vucetic, Non-uniform linear antenna array design and optimization for millimeter-wave communications. IEEE Trans. Wirel. Commun.15(11), 7343–7356 (2016).View ArticleGoogle Scholar
- F Zhao, L Wei, H Chen, Optimal time allocation for wireless information and power transfer in wireless powered communication systems. IEEE Trans. Wirel. Commun.65(3), 1830–1835 (2016).Google Scholar
- F Zhao, B Li, H Chen, X Lv, Joint beamforming and power allocation for cognitive MIMO systems under imperfect CSI based on game theory. Wirel. Pers. Commun.73(3), 679–694 (2013).View ArticleGoogle Scholar
- M Taherkhani, R Safabakhsh, A novel stability-based adaptive inertia weight for particle swarm optimization. Appl. Soft Comput.38:, 281–295 (2016).View ArticleGoogle Scholar
- SU Khan, S Yang, L Wang, L Liu, A modified particle swarm optimization algorithm for global optimizations of inverse problems. IEEE Trans. Magn.52(3), 7000804 (2016).View ArticleGoogle Scholar
- HL Jin, JW Kim, JY Song, YJ Kim, SY Jung, A novel memetic algorithm using modified particle swarm optimization and mesh adaptive direct search for PMSM design. IEEE Trans. Magn.52(3), 7001604 (2016).Google Scholar
- DH Wolpert, WG Macready, No free lunch theorems for optimization. IEEE Trans. Evol. Comput.1(1), 67–82 (1997).View ArticleGoogle Scholar