Performance Enhancement for Adaptive Beam-Forming Application Based Hybrid PSOGSA Algorithm ()

Ahmed Magdy^{1}, Osama M. EL-Ghandour^{2}, Hesham F. A. Hamed^{1*}

^{1}Department of Electrical Engineering, Minia University, Minia, Egypt.

^{2}Department of Electronics, Communications and Computer Engineering, Helwan University, Cairo, Egypt.

**DOI: **10.4236/jemaa.2015.74014
PDF
HTML XML
3,743
Downloads
4,814
Views
Citations

Recently researchers were interested in hybrid algorithms for optimization problems for several communication systems. In this paper, a novel algorithm based on hybrid PSOGSA technique (combination of Gravitational Search Algorithm and Particle Swarm Optimization) is presented to enhance the performance analysis of beam-forming for smart antennas systems using N elements for Uniform Circular Array (UCA) geometry. Complex excitations (phases) of the array radiation pattern are optimized using hybrid PSOGSA technique for a set of simultaneously incident signals. Our results have shown tremendous improvement over the previous work was done using Uniform Linear Array (ULA) geometry and standard GSA in terms of normalized array factor and computational speed for normalized fitness values.

Keywords

Share and Cite:

Magdy, A. , EL-Ghandour, O. and Hamed, H. (2015) Performance Enhancement for Adaptive Beam-Forming Application Based Hybrid PSOGSA Algorithm. *Journal of Electromagnetic Analysis and Applications*, **7**, 126-133. doi: 10.4236/jemaa.2015.74014.

1. Introduction

Adaptive beam-forming capabilities for smart antenna arrays are nowadays used in different applications such as suppression and reduction of interference in wireless mobile communication, besides its effects on the overall quality of service [1] [2] . There are different optimization techniques dealing with adaptive beam-forming for smart antennas. Particle Swarm Optimization (PSO), Central Force Optimization (CFO), and Bacterial Swarm Optimization (BSO) are well known global optimization techniques that are based on a nature-inspired heuristic [3] -[5] . It is proven that CFO requires higher computational complexity but on the other hand it has better performance than PSO in [6] .

Recently, Gravitational Search Algorithm (GSA) is considered as a new optimization technique based on the law of gravity and mass interaction [7] . Where a set of various standard benchmark functions, synthesis of thinned scanned concentric ring array antenna and a fully digital controlled reconfigurable concentric ring array antenna problems were examined in [8] [9] . In most cases the GSA provided superior or at least comparable results with PSO and CFO. The GSA was proposed in [10] [11] for calculating the dimensions of a rectangular patch antenna, and for Direction of Arrival (DOA) estimation using a Uniform Circular Array (UCA) of 12 elements based on maximum likelihood (ML) criteria and showed better performance results over PSO and multiple signal classification (MUSIC) in terms of computational time for fitness function and RMSE. In [12] , planar ultra-wide band (UWB) antennas with irregular radiator shapes were designed using GSA and compared with those obtained using CFO algorithm, it was found that the GSA gave better performance than CFO. In [13] , GSA was implemented using Open-MP and its results outperformed the PSO by 65.09% in terms of normalized array factor. In [14] , an algorithm based on collective animal behaviour (CAB) was used for finding the best optimal non-uniform excitation weights and optimal uniform inter-element spacing for hyper beam-forming of linear antenna arrays. In [15] , a new algorithm based on Hybrid Particle Swarm Optimization with Gravitational Search Algorithm (Hybrid PSOGSA) technique was proposed and showed better performance than standard PSO and GSA in terms of computational speed.

In this paper, a novel algorithm that is based on the hybrid PSOGSA technique is developed for optimal beam-forming using ULA and UCA. The goal is to maximize the beam of the radiation pattern towards the intended user or Signal of Interest (SOI) and minimize the beam of the radiation pattern towards Signal Not of Interest (SNOI) based on controlling the complex weights (phase) of ULA or UCA. The paper is organized as follows. In Section 2, the system model and problem formulation for adaptive beam-forming are explained. In Section 3, two models for smart antenna array models are described. However, hybrid PSOGSA algorithm is proposed in Section 4. Simulation results and discussions for beam-forming are discussed in Section 5. Finally, the conclusion is presented in Section 6.

2. Problem Formulation

Smart antenna based on UCA topology by using N elements is showed in Figure 1. In this section, 12 elements in array structure are distributed uniformly along the circle of radius, where is the azimuth angle, is the wavelength, the angle between adjacent elements is, and is the space between two adjacent elements.

In the synthesis of beam-forming, the complex excitation for each element must be optimized to minimize radiation power intensity at certain directions and maximize the main-lobes to other directions. The following fitness function must be minimized to maximize the total output power toward the desired signal at and minimize the total output power in the direction of the interfering signals at.

Figure 1. Geometry of the UCA with N elements.

(1)

where the number of SOI users is represented in constant, and represents the number of SNOI hackers. is the array factor that will be maximized or minimized in specific directions for ULA and UCA using evolutionary algorithms.

(2)

(3)

where represents the complex excitation phase of the n-th element, is the angular position of the n-th element, and is the phase shift constant.

3. Smart Antennas Array Beam-Forming Models

As two models are proposed as shown in Figure 2, the first model assumes user #2 as transmitter, desired user #1 as receiver at desired angle from user #2, and hacker at angle from user #2. In our work, smart antennas array using linear and circular topology are obtained. The second model assumes number of desired users M as SOI angles at.

4. Hybrid PSOGSA Algorithm Optimization Technique

Several different hybridization methods for heuristic algorithms was presented in [16] , when two different algorithms can be hybridized in high-level or low-level with relay or co-evolutionary method as homogeneous or heterogeneous. In 1995, Kennedy and Eberhart surprised the world by PSO as shown in [3] . PSO was improved by several researchers when many interest variants were developed as shown in [4] . PSO depended on two main equations for updating the velocity and position as follow:

(4)

(5)

where and are position and variation in position (velocity) of the i-th particle for an D-dimensional problem, respectively. and represent for personal best position of the i-th particle and global best position vector, respectively. and are the acceleration constants, which represent the weighting of stochastic acceleration terms that pull each particle towards pbest and gbest positions. Rand 1 and Rand 2 are two random numbers in the range [0, 1], w is the inertia weight introduced to balance between the global and local search abilities

(a) (b)

Figure 2. Two models for smart antennas array.

in terms of k iterations.

Recently, Gravitational Search Algorithm (GSA) was provided as an optimization problem based on the law of gravity and mass interaction [7] . The algorithm considered agents as objects consisting of different masses. Each agent in GSA was specified by four parameters: position of the mass in d-th dimension, inertia mass, active gravitational mass and passive gravitational mass. At each iteration, perform of the fitness evolution for all agents and also compute the best and worst fitness defined as below (for minimization problems):

(6)

(7)

where represents the fitness of the j-th agent at iteration, and represents the best and worst fitness at generation. Then the mass of the agents (gravitational and inertia masses) can be calculated as:;

(8)

(9)

where is the active gravitational mass of the i-th agent, and is the passive gravitational mass of the i-th agent.

In this paper, PSO with GSA was hybridized using low-level co-evolutionary heterogeneous hybrid. The hybrid is low-level because the functionality of both algorithms is combined. It is co-evolutionary because both algorithms aren’t used one after another but run in parallel. It is heterogeneous because there are two different algorithms that are involved to produce final results. The basic idea of hybrid PSOGSA is to combine the ability of social thinking (gbest) in PSO with the local search capability of GSA. In order to combine these algorithms, updating velocity is proposed as follow:

(10)

where is the velocity of agent at iteration, , , , and are taken from PSO algorithm. On the other hand, from GSA in [7] , is the acceleration of agent at iteration and can be calculated by

(11)

where is the total force acting on -th agent calculated as:

(12)

where is the force acting on agent from agent at d-th dimension and t-th iteration and is computed as below:

(13)

where is the Euclidian distance between two agents and at iteration, is the computed gravitational constant at the same iteration, and is a small constant.

(14)

In this problem is set to 100, is set to 20 and is the total number of iterations. In each iteration, the positions of particles are updated as follow:

(15)

In hybrid PSOGSA [15] , firstly, all agents are randomly initialized. Each agent is considered as a candidate solution. As can be seen in Figure 3, after initialization, evaluate the fitness function based on Equation (1). Gravitational force, gravitational constant, and resultant forces among agents are calculated using Equations (12), (14) and (13) respectively. After that, the accelerations of particles are defined as Equation (11). In each iteration,

Figure 3. Flow chart for steps in hybrid PSOGSA algorithm.

the best solution so far (gbest) must be updated. After calculating the accelerations and with updating the best solution so far, the velocities and the positions of all agents can be updated using Equations (10) and (15) respectively. Finally, after agents are updated, the process of updating velocities and positions will be stopped by meeting an end criterion.

5. Simulation and Discussion Results

To validate the above analysis, we have developed a custom event driven simulator using Matlab package. In this section, the capability of hybrid PSOGSA technique for adaptive beam-forming with a UCA is studied.

In this section two models are discussed, the first model is shown in Section 3. Figures 4-6 show beam patterns in comparison with smart antenna for different geometries (UCA and ULA) from user #2 to user #1 (SOI = 30˚) and from user #2 to hacker #1 (SNOI = −30˚ (330˚) or −20˚ (340˚) or −40˚ (320˚)). Figure 4(a) and Figure 4(b) is obtained for normalized array factor comparison using ULA and UCA by hybrid PSOGSA at SOI 30˚ and SNOI −30˚ (330˚) in polar and rectangular representation respectively. It is found that only UCA topology has capability to direct the main beam toward user #1 (SOI) and null at hacker #1 (SNOI). It is clear that the directed power toward the intended direction (30˚) using UCA is better than that obtained by ULA by approximately 55% as shown in Figure 4(a) (more than 6 dB as shown in Figure 4(b)). On the other hand, the directed null (zero power) toward the intended direction (−30˚) using UCA is better than that obtained by ULA by approximately 35 dB as shown in Figure 4(b).

Figure 5(a) and Figure 5(b) shows SOI at 30˚ and a changed value −40˚ (320˚) for SNOI. Accordingly the results showed an improvement of 17% (more than 1.5 dB) and approximately 14 dB for SOI and SNOI respectively.

Figure 6(a) and Figure 6(b) shows SOI at 30˚ and a changed value −20˚ (340˚) for SNOI. Accordingly the results showed an improvement of 35% (more than 3.5 dB) and approximately 5 dB for SOI and SNOI respectively.

Also, it can be noticed that an extra undesired main beam in the broadside direction is obtained in the ULA geometry. Therefore, the first case is the worst case in ULA because (broadside direction). In general, the results obtained by UCA are better than those obtained from ULA which used in [14] for all directions in all scenarios.

The second model is shown in Section 3. Figure 7 shows two scenarios normalized array factor comparison and normalized fitness functions versus iteration number using hybrid PSOGSA and GSA. The hybrid PSOGSA is used to adjust the weights of phase shift of the excitation of each element of the UCA array for beam synthesis to maximize the output power toward the desired signals at (scenario #1 two users at:, scenario #2 five users at:). To validate the algorithm, the results are compared to those obtained using GSA which used in [13] . Both algorithms are employed with a population size of 30 and 150 iterations. First part in Figure 7(a) and Figure 7(b) shows the radiation pattern for the case of feeding each element of the UCA with the original precise values of phases optimized by hybrid PSOGSA and GSA for scenarios #1 and #2. Part two in Figure 7(a) and Figure 7(b) shows the normalized global best fitness of the hybrid PSOGSA and GSA algorithms for adaptive beam-forming of the array feeding. Comparing the global best

(a) (b)

Figure 4. Normalized array factor comparison using ULA and UCA by hybrid PSOGSA at SOI 30˚ and SNOI −30˚ (330˚). (a) Polar representation; (b) Rectangular representation.

(a) (b)

Figure 5. Normalized array factor comparison using ULA and UCA by hybrid PSOGSA at SOI 30˚ and SNOI −40˚ (320˚). (a) Polar representation; (b) Rectangular representation.

(a) (b)

Figure 6. Normalized array factor comparison using ULA and UCA by hybrid PSOGSA at SOI 30˚ and SNOI −20˚ (340˚). (a) Polar representation; (b) Rectangular representation.

fitness of the two algorithms, it is found that the hybrid PSOGSA converges faster than GSA with a better performance in terms of computed final fitness values.

The pervious Figure 7 indicates that the hybrid PSOGSA in general outperforms the GSA in precise feedings. Table 1 shows the corresponding normalized |AF| values at the SOI directions for different scenarios. As shown,

(a) (b)

Figure 7. Two scenarios normalized array factor comparison and normalized fitness functions versus iteration number using Hybrid PSOGSA and GSA. (a) Scenario #1; (b) Scenario #2.

Table 1. The corresponding normalized |AF| values at the SOI directions for different scenarios.

the hybrid PSOGSA is better than GSA by −3.05 dB and −3.182 dB on the average for scenario #1 and scenario #2 respectively.

6. Conclusion

In this paper, a new novel (hybrid PSOGSA) technique is proposed with ULA and UCA antenna system for enhancing the performance of adaptive beam-forming in wireless communications applications. The technique is simple and appropriate for real time applications. It is clear that the directed power toward the intended direction (SOI) using UCA is better than that obtained by ULA by approximately 55% (more than 6 dB), 35% (more than 3.5 dB) and 17% (more than1.5 dB); on the other hand, directed null to SNOI better than ULA by approximately 35 dB, 5 dB and 14 dB in all cases in the first model in terms of normalized array factor. Simulations of beam- forming show accurate results even for a big set of simultaneously incident signals. Strategically pairing GSA with PSO has the desired advantages over GSA. It is found that hybrid PSOGSA is more attractive for beam- forming applications and better than GSA with approximately −3 dB in average. Via extensive simulation studies, it is demonstrated that hybrid PSOGSA achieves fast and robust global convergence over GSA.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] | Lehne, P.H. and Pettersen, M. (1999) An Overview of Smart Antenna Technology for Mobile Communications Systems. IEEE Communications Surveys and Tutorials, 2, 2-13. |

[2] |
Chryssomallis, M. (2000) Smart Antennas. IEEE Antennas and Propagation Magazine, 42, 129-136. http://dx.doi.org/10.1109/74.848965 |

[3] |
Kennedy, J. and Eberhart, R. (1995) Particle Swarm Optimization. Proceedings of IEEE International Conference on Neural Networks, Perth, 27 November-01 December 1995, 4, 1942-1948. http://dx.doi.org/10.1109/ICNN.1995.488968 |

[4] |
Mahmoud, K.R., Eladawy, M., Bansal, R., Zainud-Deen, S.H. and Ibrahem, S.M.M. (2008) Analysis of Uniform Circular Arrays for Adaptive Beamforming Applications Using Particle Swarm Optimization Algorithm. International Journal of RF and Microwave Computer-Aided Engineering, 18, 42-52. http://dx.doi.org/10.1002/mmce.20265 |

[5] |
Formato, R.A. (2007) Central Force Optimization: A New Metaheuristic with Applications in Applied Electromagnetics. Progress in Electromagnetics Research, 77, 425-491. http://dx.doi.org/10.2528/PIER07082403 |

[6] |
Mahmoud, K.R. (2011) Central Force Optimization: Nelder-Mead Hybrid Algorithm for Rectangular Microstrip Antenna Design. Electromagnetics, 31, 578-592. http://dx.doi.org/10.1080/02726343.2011.621110 |

[7] |
Rashedi, E., Nezamabadi-Pour, H. and Saryazdi, S. (2009) GSA: A Gravitational Search Algorithm. Information Sciences, 179, 2232-2248. http://dx.doi.org/10.1016/j.ins.2009.03.004 |

[8] |
Chatterjee, A., Mahanti, G.K. and Pathak, N.N. (2010) Comparative Performance of Gravitational Search Algorithm and Modified Particle Swarm Optimization Algorithm for Synthesis of Thinned Scanned Concentric Ring Array Antenna. Progress in Electromagnetics Research B, 25, 331-348. http://dx.doi.org/10.2528/PIERB10080405 |

[9] |
Chatterjee, A., Mahanti, G.K. and Mahapatra, P.R.S. (2011) Design of Fully Digital Controlled Reconfigurable Dual-Beam Concentric Ring Array Antenna Using Gravitational Search Algorithm. Progress in Electromagnetics Research C, 18, 59-72. http://dx.doi.org/10.2528/PIERC10101806 |

[10] |
Altinoz, O.T. and Yilmaz, A.E. (2011) Calculation of Optimized Parameters Of Rectangular Patch Antenna Using Gravitational Search Algorithm. 2011 International Symposium on Innovations in Intelligent Systems and Applications (INISTA), Istanbul, 15-18 June 2011, 349-353. http://dx.doi.org/10.1109/INISTA.2011.5946090 |

[11] | Magdy, A., Mahmoud, K.R., Abdel-Gawad, S.G. and Ibrahim, I.I. (2013) Direction of Arrival Estimation Based on Maximum Likelihood Criteria Using Gravitational Search Algorithm. Progress in Electromagnetics Research Symposium Proceedings, Taipei, 25-28 March 2013, 1162-1167. |

[12] | Mahmoud, K.R. (2013) UWB Antenna Using Gravitational Search Algorithm. Journal of Engineering Sciences, 41, 1890-1903. |

[13] |
Mahmoud, K.R. and Hamad, S. (2014) Parallel Implementation of Hybrid GSA-NM Algorithm for Adaptive Beam-Forming Applications. Progress in Electromagnetics Research B, 58, 47-57. http://dx.doi.org/10.2528/PIERB13102106 |

[14] | Ram, G., Mandal, D., Kar, R. and Ghoshal, S.P. (2013) Optimized Hyper Beamforming of Linear Antenna Arrays Using Collective Animal Behaviour. The Scientific World Journal, 2013, Article ID: 982017. |

[15] | Mirjalili, S. and Hashim, S.Z.M. (2010) A New Hybrid PSOGSA Algorithm for Function Optimization. International Conference on Computer and Information Application (ICCIA), Tianjin, 3-5 December 2010, 374-377. |

[16] |
Talbi, E.G (2002) A Taxonomy of Hybrid Metaheuristic. Journal of Heuristics, 8, 541-546. http://dx.doi.org/10.1023/A:1016540724870 |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.