International Journal of Antennas and Propagation

Volume 2014 (2014), Article ID 987140, 10 pages

http://dx.doi.org/10.1155/2014/987140

Research Article

Comparative Analysis of Linear and Nonlinear Pattern Synthesis of Hemispherical Antenna Array Using Adaptive Evolutionary Techniques

K. R. Subhashini and A. T. Praveen Kumar

Department of Electrical Engineering, National Institute of Technology, Rourkela 769008, India

Received 12 September 2013; Revised 8 November 2013; Accepted 8 November 2013; Published 22 January 2014

Academic Editor: Hon Tat Hui

Copyright © 2014 K. R. Subhashini and A. T. Praveen Kumar. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

Hemispherical antenna arrays are subjected to linear and nonlinear synthesis and are optimized using adaptive based differential evolution (ADE) and fire fly (AFA) algorithm. The hemispherical shaped array with isotropic elements is considered. Antenna element parameters that are used for synthesis are excitation amplitude and angular position. Linear synthesis is termed as the variation in the element excitation amplitude and nonlinear synthesis is process of variation in element angular position. Both ADE and AFA are a high-performance stochastic evolutionary algorithm used to solve -dimensional problems. These methods are used to determine a set of parameters of antenna elements that provide the desired radiation pattern. The effectiveness of the algorithms for the design of conformal antenna array is shown by means of numerical results. Comparison with other methods is made whenever possible. The results reveal that nonlinear synthesis, aided by the discussed techniques, provides considerable enhancements compared to linear synthesis.

1. Introduction

Design of antenna arrays that conforms an arbitrary shape has triggered the electromagnetic researchers since they have a potential of coverage, either with an omnidirectional beam, multiple beams, or a narrow beam that can be steered over . One of the geometrical solutions that can be provided through a hemispherical shape. The linear arrays have good directivity and they can form the narrowest main lobe in a given direction but cannot be steered in all azimuth directions. The circular array is a high side lobe geometry. The lacuna of the regular arrays leads to the aid of arrays that can perform/radiate in azimuth range also [1]. These arrays have to be mathematically formulated for their array factor. Since the array elements are conformal to the surface of the sphere, the phase at each element becomes critical for synthesizing low side lobe patterns [2, 3]. Primitive methods such as Schelkunoff, Fourier, and Woodwardlawson cannot be applied for this hemispherical array because of its curvature effects; the phase adjustments of each array element become complex. The stochastic pattern synthesis [4–7] can be adopted for these conformal shapes. The literature instructs the advantages of stochastic process over deterministic methods that can be stretched out for large size arrays [8–11]. One of the greatest advantages of using these evolutionary techniques such as Genetic Algorithm and Particle Swarm optimization [12–14] is their ability to deal with a huge parameter set up with out getting trapped in the local minima and with the advent of high computing facility these can be easily simulated [7, 15–18]. Recently invented high performance algorithm is Fire fly algorithm. DE involves mutation and crossover strategies that influence the results. Usage of the DE in the design of antenna array is available. Chen et al. [19] proposed antenna array optimization for various pattern synthesis objectives. Mandal et al. [20–24] have proposed many modified versions to the standard DE algorithm. On the other hand the literature on FA method in the design of antenna arrays is not extensive, a sample of which can be found in [25–28]. In this paper, the method of FA is used to provide a comprehensive study of the design of a mathematically modelled hemispherical antenna array. The parameters of antenna elements that provide the goal radiation pattern are optimized using both DE and FA. The effectiveness of these methods for the design of antenna arrays is shown by means of numerical results. The results reveal that design of hemispherical antenna array antenna and using these techniques to optimize element excitation and angular positioning of the elements provide considerable improvement in the directivity and a sharper beam widths.

2. Formulation of Array Factor for a Hemispherical Shaped Antenna Array

In this geometry the antenna elements are placed in the combination of linear and circular arrays. Hence the array factor equations of linear and circular array are utilized to deduce the array factor equation of the hemispherical arrangement see Figure 1. The array factor equation for -element linear array with spacing “” is

Figure 1: Geometry of the hemisphere.

And each circular arrangement with uniform spacing containing “” elements is given as

The stack of elements is not considered at the apex of the sphere. Consider the following:

The angular spacing between two elements in the circular arrangement is given by

In (2) is the radius of circle. And the assumption is made such that radius of , where is the radius of the initial circle in plane. The linear distance between two circular stacks is same as the distance between two linear elements, that is, “”. In order to steer beam towards direction the progressive phase shift has to be maintained as

Hence the array factor of the hemispherical arrangement of elements is framed as

where .

3. Overview of DE and FA Algorithms

3.1. Differential Evolution

Evolutionary algorithms (EAs) are population-based stochastic algorithms that can effectively handle real-world optimization problems which are noncontinuous and/or nondifferentiable and characterized by chaotic disturbances, randomness, and complex nonlinear dynamics. DE is a Stochastic Direct Search and Global Optimization algorithm. It uses rather greedy selection and less stochastic approach to solve optimization problems when compared to other classical EAs. DE is an evolutionary computation method that was originally introduced by Storn and Price in 1995. Furthermore, it has been modified by researchers [29] to be a reliable and versatile function optimizer that is also readily applicable to a wide range of optimization problems. Mutation and crossover strategies along with their associated parameters show the effectiveness of the conventional DE in solving numerical optimization problems. DE has the ability to find the global minimum regardless of the initial parameter values and can give reasonably fast convergence see Figure 2.

Figure 2: Flow Chart for differential evolution algorithm.

DE uses a population of size , composed of floating point encoded individuals that evolve over generations to reach an optimal solution. Each is a vector that contains as many parameters as the problem decision variables . The population size is an algorithm control parameter selected by the user which remains constant throughout the optimization process. With the present weight current fitness is found and compared with the new fitness value, the weights will be updated by employing mutation and crossover . Pseudo code of the algorithm presented in Pseudocode 1.

Input Parameters =

Output parameter

Evaluate fitness = , =

For Gen Genmax

Mutation Tuned With Adaptive

, are random vectors

; search limits of the

; current value is tuned

Cross  Over Tuned With Adaptive CR

; search limits of CR

; current CR value is tuned

Evaluate fitness , =

end

Pseudocode 1: Pseudocode of Adaptive DE Algorithm.

3.2. Firefly Algorithm

Firefly algorithm was developed by Xin-She Yang at Cambridge university in 2007. It uses the following two idealized rules: all fireflies are unisex so that a firefly will be attracted to other fireflies regardless of their sex; attractiveness is proportional to their brightness and they both vary with the distance between them. FA initially produces a swarm of fireflies located randomly in the search space. The initial distribution is usually produced from a uniform random distribution. The position of each firefly in the search space represents a potential solution of the optimization problem. The dimension of the search space is equal to the number of optimizing parameters in the given problem. The fitness function takes the position of a firefly as input and produces a single numerical output value denoting how good the potential solution is. A fitness value is assigned to each firefly. The FA uses a phenomenon known is bioluminescent communication to model the movement of the fireflies through the search space. The brightness of each firefly depends on the fitness value of that firefly. Each firefly is attracted by the brightness of other fireflies and tries to move towards them. The velocity or the pull of a firefly towards another firefly depends on the attractiveness. The attractiveness depends on the relative distance between the fireflies. It can be a function of the brightness of the fireflies as well. A brighter firefly that is far away may not be as attractive as a less bright firefly that is closer. In each iterative step, FA computes the brightness and the relative attractiveness of each firefly. Depending on these values, the positions of the fireflies are updated [25–28]. After a sufficient amount of iterations, all fireflies converge to the best possible position on the search space. The antenna problems are addressed by this FA algorithm in the literature in recent times and have not been properly explored with the updated equations. An attempt is made in this paper to explore, modify, and apply this FA to antenna pattern synthesis see Figure 7 and Pseudocode 2.

(i) Initialize algorithm's parameters

number of fireflies (n),

maximum number of generations (iterations, Max-Gen)

Define the objective function ,

Generate initial population of fire flies ()

//generate initial solutions

Light intensity for firefly at is determined by

value of objective function

(ii) While k MaxGen//(: MaxGen)

        For  : // all n fireflies

             For: 

                    If () move firefly i towards firefly j in

                  d-dimension; End if

                  Obtain attractiveness, which varies with distance r

Adaptive Tuning Of Controlling Parameters (, , )

            End for j

       End for i

Rank the fireflies and find the current best

End while

(iii) Find the firefly with the highest light intensity, visualisation

Pseudocode 2: Pseudocode of Adaptive Fire Fly Algorithm.

4. Minimize the Maximum Side Lobe Ratio, Null Detection, and Beam Width

The DE and FA algorithms are used to obtain the optimal synthesis of a hemispherical array in order to minimize the SLL ratio range in a specified region and to detect null points and beam width within the decided angle. Consider the following:

where is the obtained array factor and is the desired array factor. The fitness is framed, taking into account the above discussed three constraints, and summarized as the objective function given in (8) is the weighted sum of the individual objectives. . Consider the following:

4.1. Optimize Elements Amplitudes and Element Positions

Analytical synthesis approach is framed for the synthesis of multidimensional array geometry,

The mathematical form of the above explained equation is where . represents the sample points of the elevation range. represents the sample points of the azimuthal range. represents the excitation current vector and and its associated excitation angle vector and angular position of each current element over each circular stack which forms a conformal shape. The conformal linear synthesis points out to the variation of the matrix . The conformal non linear synthesis points out to the variation of the matrix . The amplitudes of the elements are varied and angle of the main beam direction is kept constant; the angular distance between the elements is also kept constant. The initial values of the current amplitudes provided to the linear array are set to be uniformly distributed from . Nonuniform synthesis can be achieved by adapting the angular positions of the elements for the objective function given by (8). Mathematically this non linear synthesis is adjusting the parameter by altering the depending values and by maintaining the excitation amplitudes uniform.

The case study is performed on various array sizes starting with eight elements arranged in two circles with four elements each. The radiation pattern is shown in Figure 3. With this array size the assumed desired pattern is not attained, particularly the side lobe level region is at −10 dB. Both the optimization techniques in the uniform and nonuniform synthesis do not meet the objective. The array size is increased to sixteen elements which could show a small effect on the side lobe level but not considerate. This is shown in Figure 3(b). The cost function curve also settled at a high value is shown in Figures 4(a) and 4(b). The corresponding radiation pattern in the azimuth plane for amplitude and position optimization using DE and FA for various array sizes is shown in Figures 4 and 6.   Figure 5 shows the simulated result of twenty-five elements. The radiation pattern of the nonuniform synthesis using DE reflects a lower side lobe level, with a minimum cost function shown in Figure 6.

(a)

(b)

Figure 3: Radiation pattern for (a) , (b) .

(a)

(b)

Figure 4: Fitness curves for (a) , (b) .

(a)

(b)

Figure 5: Radiation pattern for (a) , (b) .

(a)

(b)

Figure 6: Fitness curves for (a) , (b) .

Figure 7: Flowchart of firefly algorithm.

The array size is varied from eight elements (i.e., two concentric circles of four elements) to forty-nine elements. The amplitude optimization by DE and FA are labelled as UDE and UFA. On the other hand position optimization by DE and FA are labelled as NDE and NFA. The corresponding radiation patterns are given in Figure 5. Pattern graphs reveal that for small array size position optimization is not desirable as the SLL has not settled at −20 dB. With the increase in the array size the optimized pattern of non linear synthesis adapted fast to the desired. Considering the algorithm point of view and the cost of evaluation for both uniform and nonuniform pattern syntheses adaptive DE comes out as a low cost value to produce the nearly optimum pattern. However the iterations were fixed to and evaluated for best 15 runs. If the iterations are increased the performance of the evolutionary fire fly can be further improved.

A statistical comparison of the antenna array performance values is tabulated in Table 1. The numerical statistics show an enhanced directivity value of 29.1 dB for a nonuniform pattern synthesis using DE algorithm. The numericals listed out in the directivity column stand as an fetching property in choosing this geometry. Another achievement of this geometry is the sharper beam for large array sizes.

Table 1: Statistical antenna array performance data of hemispherical nonuniform synthesis.

Number of
Directivity
Side lobe level
HPBW

El
(DB)
(DB)
(degrees)

NDE
NFA
UDE
UFA
NDE
NFA
UDE
UFA
NDE
NFA
UDE
UFA

14.4
14.5
13.1
12.9
−1.38
−20.84
−9
−0.5
16
16
18
16

20.1
21.3
16.5
16.2
−13.72
−18.89
−20
−20
10
10
10
10

23.9
24.1
22.3
22.7
−13.48
−10.21
−7
−8
6
6
7
7

26.8
26.6
25.1
25
−18.73
13.44
−15
−19
4
4
3
3

29.1
28.7
25.5
26.1
−21.11
−14.67
−14
−11
4
4
3
3

5. Conclusion

The paper concludes with the mathematical assumption and formulation of a hemispherical antenna array. A multiobjective function is chosen with different constraints. The radiation pattern of this array is synthesized using two evolutionary based adaptive algorithms, where the excitations and angular positions are optimized and comparatively analysed. Nonuniform synthesis of hemispherical arrangement beats out the other conformal shapes in tracking applications because of the regularity and uniformity in the shape. The sharper beam width of has a good application in medical fields. Numerical results show that firefly and differential evolution compete with each other in satisfying the objectives. FA maintains desired SLL, whereas DE maintains good directivity. On the whole this conformal shape proves much advantages because of its uniformity in tracking entire space. Hemispherical array arrangement gives narrow beam pattern for the same number of elements For very large number of elements the antenna array becomes ideal. Future work can focus on the enhancement of this arbitrary shape for medical application such as tumour treatment with the tissue exposed to controlled electromagnetic field.

Appendix

In this section, we provide the results of testing the performance of DE and FA over six representative benchmark functions from the test suite of the Congress on Evolutionary Computation (CEC) 2005 Special Session and Competition on Real Parameter Optimization [30]. All the benchmarks have been tested for dimensions , independent runs of each of the algorithms were carried out, and the average and the computing time for each algorithm and the number of iterations to obtain the least fitness are noted down. Absolute run time and number of iterations of standard functions are tabulated. Table 2 is a statistical comparison on the performance of the two algorithms in terms of computing time and number of iterations required to reach a least fitness (zero). To have a fair comparison, both initial population sizes are set for the same value.

Table 2: Run time and fitness comparison of standard functions.

Test function
Equation

DE
FA

Rosenbrock's

N
2
2

equation

Fitness
0
0

Iterations
1592
6451

CPU time (sec)
0.1872
465.1170

Griewank's

N
30
30

equation

Fitness
0
0

Iterations
2501
2664

CPU time (sec)
0.1825
166.0471

Ackley's

N
30
30

equation

Fitness
0
0

Iterations
5960
6451

CPU time (sec)
4.3368
96.1170

Rastrigin's

N
30
30

equation

Fitness
0
0

Iterations
9548
9751

CPU time (sec)
6.9108
461.5791

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

C. A. Balanis, Antenna Theory: Analysis and Design, John Wiley & Sons, Hoboken, NJ, USA, 3rd edition, 2012.

K.-K. Yan and Y. Lu, “Sidelobe reduction in array-pattern synthesis using genetic algorithm,” IEEE Transactions on Antennas and Propagation, vol. 45, no. 7, pp. 1117–1122, 1997.

A. Tennant, M. Dawoud, and A. Anderson, “Array pattern nulling by element position perturbations using a genetic algorithm,” Electronics Letters, vol. 30, no. 3, pp. 174–176, 1994.

B. Kumar and G. Branner, “Generalized analytical technique for the synthesis of unequally spaced arrays with linear, planar, cylindrical or spherical geometry,” IEEE Transactions on Antennas and Propagation, vol. 53, no. 2, pp. 621–634, 2005.

J. Jin, H. Wang, W. Zhu, and Y. Liu, “Array patterns synthesizing using genetic algorithm,” PIERS Online, vol. 2, no. 1, pp. 64–68, 2006.

Z. Xu, H. Li, Q.-Z. Liu, and J.-Y. Li, “Pattern synthesis of conformal antenna array by the hybrid genetic algorithm,” Progress in Electromagnetics Research, vol. 79, pp. 75–90, 2008.

Y. Cengiz and H. Tokat, “Linear antenna array design with use of genetic, memetic and tabu search optimization algorithms,” Progress in Electromagnetics Research C, vol. 1, pp. 63–72, 2008.

C. Dolph, “A current distribution for broadside arrays which optimizes the relationship between beam width and side-lobe level,” Proceedings of the IRE, vol. 34, no. 6, pp. 335–348, 1946.

M. Skolnik, G. Nemhauser, and J. Sherman III, “Dynamic programming applied to unequally spaced arrays,” IEEE Transactions on Antennas and Propagation, vol. 12, no. 1, pp. 35–43, 1964.

R. Harrington, “Sidelobe reduction by nonuniform element spacing,” IRE Transactions on Antennas and Propagation, vol. 9, no. 2, pp. 187–192, 1961.

D. King, R. Packard, and R. Thomas, “Unequally-spaced, broad-band antenna arrays,” IRE Transactions on Antennas and Propagation, vol. 8, no. 4, pp. 380–384, 1960.

M. A. Panduro, D. H. Covarrubias, C. A. Brizuela, and F. R. Marante, “A multi-objective approach in the linear antenna array design,” International Journal of Electronics and Communications, vol. 59, no. 4, pp. 205–212, 2005.

W.-C. Weng, F. Yang, and A. Z. Elsherbeni, “Linear antenna array synthesis using Taguchi's method: a novel optimization technique in electromagnetics,” IEEE Transactions on Antennas and Propagation, vol. 55, no. 3, pp. 723–730, 2007.

Y.-J. Zhang, S.-X. Gong, and Y.-X. Xu, “Radiation pattern synthesis for arrays of conformal antennas mounted on an irregular curved surface using modified genetic algorithms,” Journal of Electromagnetic Waves and Applications, vol. 23, no. 10, pp. 1255–1264, 2009.

S. Pal, B. Qu, S. Das, and P. Suganthan, “Optimal synthesis of linear antenna arrays with multi-objective differential evolution,” Progress in Electromagnetics Research B, vol. 21, pp. 87–111, 2010.

Y. Rahmat-Samii and E. Michielssen, Electromagnetic Optimization by Genetic Algorithms, John Wiley & Sons, Hoboken NJ, USA, 1999.

Y.-B. Tian and J. Qian, “Improve the performance of a linear array by changing the spaces among array elements in terms of genetic algorithm,” IEEE Transactions on Antennas and Propagation, vol. 53, no. 7, pp. 2226–2230, 2005.

N. Jin and Y. Rahmat-Samii, “Advances in particle swarm optimization for antenna designs: real-number, binary, single-objective and multiobjective implementations,” IEEE Transactions on Antennas and Propagation, vol. 55, no. 3 I, pp. 556–567, 2007.

Y. Chen, S. Yang, and Z. Nie, “The application of a modified differential evolution strategy to some array pattern synthesis problems,” IEEE Transactions on Antennas and Propagation, vol. 56, no. 7, pp. 1919–1927, 2008.

A. Mandal, H. Zafar, S. Das, and A. Vasilakos, “A modified differential evolution algorithm for shaped beam linear array antenna design,” Progress in Electromagnetics Research, vol. 125, pp. 439–457, 2012.

X. Li, W.-T. Li, X.-W. Shi, J. Yang, and J.-F. Yu, “Modified differential evolution algorithm for pattern synthesis of antenna arrays,” Progress in Electromagnetics Research, vol. 137, pp. 371–388, 2013.

U. K. Chakraborty, Advances in Differential Evolution, vol. 143 of Studies in Computational Intelligence, Springer, Berlin, Germany, 2008.

J.-L. Guo and J.-Y. Li, “Pattern synthesis of conformal array antenna in the presence of platform using differential evolution algorithm,” IEEE Transactions on Antennas and Propagation, vol. 57, no. 9, pp. 2615–2621, 2009.

A. Chowdhury, A. Ghosh, R. Giri, and S. Das, “Optimization of antenna configuration with a fitness-adaptive differential evolution algorithm,” Progress in Electromagnetics Research B, vol. 26, pp. 291–319, 2010.

B. Basu and G. Mahanti, “Thinning of concentric two-ring circular array antenna using fire fly algorithm,” Scientia Iranica, vol. 19, no. 6, pp. 1802–1809, 2012.

S. Yang, Y. B. Gan, and A. Qing, “Antenna-array pattern nulling using a differential evolution algorithm,” International Journal of RF and Microwave, vol. 14, no. 1, pp. 57–63, 2004.

E. Aksoy and E. Afacan, “Planar antenna pattern nulling using differential evolution algorithm,” International Journal of Electronics and Communications, vol. 63, no. 2, pp. 116–122, 2009.

M. A. Zaman and A. Matin, “Nonuniformly spaced linear antenna array design sing firefly algorithm,” International Journal of Microwave Science and Technology, vol. 2012, Article ID 256759, 8 pages, 2012.

R. Li, L. Xu, X.-W. Shi, N. Zhang, and Z.-Q. Lv, “Improved differential evolution strategy for antenna array pattern synthesis problems,” Progress in Electromagnetics Research, vol. 113, pp. 429–441, 2011.

P. N. Suganthan, N. Hansen, J. J. Liang et al., “Problem definitions and evaluation criteria for the cec 2005 special session on real-parameter optimization,” KanGAL Report 2005005, 2005.