<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    jcc
   </journal-id>
   <journal-title-group>
    <journal-title>
     Journal of Computer and Communications
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2327-5219
   </issn>
   <issn publication-format="print">
    2327-5227
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/jcc.2024.127009
   </article-id>
   <article-id pub-id-type="publisher-id">
    jcc-134850
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Computer Science 
     </subject>
     <subject>
       Communications
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Optimization Algorithms for Sidelobes SSL Reduction: A Comparative Study
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Mohsen
      </surname>
      <given-names>
       Denden
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Aymen
      </surname>
      <given-names>
       Alhamdan
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff2"> 
      <sup>2</sup>
     </xref>
    </contrib>
   </contrib-group> 
   <aff id="aff1">
    <addr-line>
     aDepartment of Computer Science, Higher Institute of Applied Sciences of Sousse, Sousse University, Sousse, Tunisia
    </addr-line> 
   </aff> 
   <aff id="aff2">
    <addr-line>
     aDepartment of Electrical Computer Engineering, Faculty of Engineering, King Abdulaziz University, Jeddah, Saudi Arabia
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     17
    </day> 
    <month>
     07
    </month>
    <year>
     2024
    </year>
   </pub-date> 
   <volume>
    12
   </volume> 
   <issue>
    07
   </issue>
   <fpage>
    120
   </fpage>
   <lpage>
    132
   </lpage>
   <history>
    <date date-type="received">
     <day>
      21,
     </day>
     <month>
      June
     </month>
     <year>
      2024
     </year>
    </date>
    <date date-type="published">
     <day>
      26,
     </day>
     <month>
      June
     </month>
     <year>
      2024
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      26,
     </day>
     <month>
      July
     </month>
     <year>
      2024
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    The development of new technologies in smart cities is often hailed as it becomes a necessity to solve many problems like energy consumption and transportation. Wireless networks are part of these technologies but implementation of several antennas, using different frequency bandwidths for many applications might introduce a negative effect on human health security. In wireless networks, most antennas generate sidelobes SSL. SSL causes interference and can be an additional resource for RF power that can affect human being health. This paper aims to study algorithms that can reduce SSL. The study concerns typical uniform linear antenna arrays. Different optimum side lobe level reduction algorithms are presented. Genetic algorithm GA, Chebyshev, and Particle Swarm Optimization algorithm are used in the optimization process. A comparative study between the indicated algorithms in terms of stability, precision, and running time is shown. Results show that using these algorithms in optimizing antenna parameters can reduce SSL. A comparison of these algorithms is carried out and results show the difference between them in terms of running time and SSL reduction Level.
   </abstract>
   <kwd-group> 
    <kwd>
     SSL
    </kwd> 
    <kwd>
      Radio Wave Interference
    </kwd> 
    <kwd>
      SAR
    </kwd> 
    <kwd>
      Linear Antenna Arrays
    </kwd> 
    <kwd>
      Genetic Algorithm
    </kwd> 
    <kwd>
      Chebyshev
    </kwd> 
    <kwd>
      Particle Swarm Optimization
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>In the world, many countries follow the World Health Organization recommendations relating to public exposure to electromagnetic fields. The safety measures chosen by a majority of states consist of taking the necessary precautions against possible health risks linked to exposure to electromagnetic fields <xref ref-type="bibr" rid="scirp.134850-1">
     [1]
    </xref>. Furthermore, the Council of the European Union announced Decree No. 1999/519/EC of July 12, 1999, <xref ref-type="bibr" rid="scirp.134850-2">
     [2]
    </xref> concerning general exposure to electromagnetic fields. When researchers <xref ref-type="bibr" rid="scirp.134850-3">
     [3]
    </xref>-<xref ref-type="bibr" rid="scirp.134850-6">
     [6]
    </xref>, introduced new smart city technologies, they rarely discussed if they could affect the traditional urban process or the negative effect on human health <xref ref-type="bibr" rid="scirp.134850-7">
     [7]
    </xref> <xref ref-type="bibr" rid="scirp.134850-8">
     [8]
    </xref>. Some antenna propagation is characterized by main radiation named also the main lobe and another radiation named SSL or sidelobes. SSL is sometimes used to cover particular regions, but in most cases, they cause problems of interference and unused radiation that contribute to negative radio-frequency effects. In Wireless networks, linear antennas can provide excellent radiation direction-changing capability and provide high gain by adjusting the characteristics of each element of the antenna array. Compared to a single antenna element <xref ref-type="bibr" rid="scirp.134850-9">
     [9]
    </xref> <xref ref-type="bibr" rid="scirp.134850-10">
     [10]
    </xref>, the antenna array provides more performance and flexibility for new array applications because it is desirable to monitor the main beam, increase directivity, and minimize side lobe level in some cases. In literature, many developed algorithms are used to reduce the level of side lobes, such as genetic algorithm, Chebyshev, and particle swarm. The factors mentioned previously determine the array factor, which is used in the calculation of the directivity (and consequently the gain). The total field of an array can be formed by multiplying the field of a single element at a selected reference point (usually the origin) and the array factor. Note that this multiplication property is only valid when all the elements of the array have the same element pattern; hence, in this paper, all elements are assumed to be identical and installed in the same orientation. The gain is equal to the directivity multiplied by a loss coefficient depending on the antenna type. When losses are negligible, the gain is equal to the directivity. The most common antenna arrays are the linear array and the most common types of linear and uniformly spaced antenna arrays are Uniform and Chebyshev arrays. Many algorithms are used to reduce the side Lobe Level, most of them are enhanced versions of Genetic and Particle Swarm algorithms. In the literature, results regarding which algorithm is suitable to reduce the SSL radiation level are diversified. This work compares the effectiveness of the most treated algorithms and contributes to improving the final decision regarding the best algorithm.</p>
  </sec><sec id="s2">
   <title>2. Related Work</title>
   <p>Due to their high performance, antenna arrays have been the subject of many research topics <xref ref-type="bibr" rid="scirp.134850-11">
     [11]
    </xref>-<xref ref-type="bibr" rid="scirp.134850-13">
     [13]
    </xref>. The research focused on developing optimization algorithms, designing new reduced shapes, and concept Ulta Wideband frequency cases. Developing this type of antenna responds to an urgent need for new technologies such as the Internet of Things, mobile networks, etc. Recently the authors in <xref ref-type="bibr" rid="scirp.134850-14">
     [14]
    </xref> developed an improved genetic algorithm to suppress the peak side lobe level (PSSL). The authors considered that N array element selection is a non-deterministic polynomial hard problem. For this, they proposed a genetic algorithm to reduce sub-optimal reconfigurable element patterns. In the paper <xref ref-type="bibr" rid="scirp.134850-15">
     [15]
    </xref> the authors used the TLBO algorithm to synthesize the radiation pattern of a non-uniform array antenna. The concept of non-uniform elements permits a space gain of 78% compared to the traditional uniform array antenna. In the work of <xref ref-type="bibr" rid="scirp.134850-16">
     [16]
    </xref>, the authors proposed two combined techniques to reduce the side lobe in an array antenna. Both techniques are based on a genetic algorithm. The first developed technique determines which element excitation should operate and the second determines the space between elements. The authors in <xref ref-type="bibr" rid="scirp.134850-17">
     [17]
    </xref> used the fruit fly algorithm for the synthesis of array antennas. To improve the performance of their algorithms, the authors introduced generation mechanisms, orthogonal crossing operations, and quantum selection. The proposed algorithm is tested on cases of circular antenna arrays and compared to other algorithms and showed a superiority. A similar idea has been presented in the work of <xref ref-type="bibr" rid="scirp.134850-18">
     [18]
    </xref>. The authors summarized the use of antenna arrays in the wireless environment. A description of new antenna arrays used in radio links was introduced. They therefore analyzed the techniques used to improve the operation of this antenna type. A comparative analysis of different antenna array simulation and design techniques was conducted. This study did not take into account the antenna arrays used in 6G networks. The propagation loss research will need to be conducted. The work of <xref ref-type="bibr" rid="scirp.134850-19">
     [19]
    </xref> consisted of the synthesis of new algorithms for the analysis of adaptive and reconfigurable antenna arrays. The effect of artificial intelligence on the design of these antennas is studied. The paper showed AI’s importance in configuring and controlling the antenna arrays, especially for fixing the desired digital beams. The authors in <xref ref-type="bibr" rid="scirp.134850-20">
     [20]
    </xref> studied several antenna array architectures in the mmw case. A description of multiple forms of antenna was presented to meet the requirements imposed by the development of mobile technologies. The circular antenna array is studied as a particular case that showed a flat gain, unlike other regular shapes. According to the same study, this characteristic makes the antennas more stable and resists angle variations due to external phenomena linked to the deployment of these antennas. The work in <xref ref-type="bibr" rid="scirp.134850-21">
     [21]
    </xref> considered a comparison of several BFN-type circuits to control the beamforming of an antenna array. Different BFN circuits are discussed and compared. This work proposed also innovative ideas and developments for future research in this area. In the article <xref ref-type="bibr" rid="scirp.134850-22">
     [22]
    </xref>, the authors applied an evolutionary algorithm to optimize two antenna arrays. The presented algorithm showed an improvement and proved its effectiveness. Nevertheless, the presented algorithms need to be generalized by applying them to various examples to generalize their usefulness. In the article <xref ref-type="bibr" rid="scirp.134850-23">
     [23]
    </xref>, the authors applied PSO, ABC, JS, and MA algorithms on a linear array antenna. A comparison study between these algorithms is presented. The results showed the superiority of the MA and JS algorithms. This work must take into account the design of the antenna diversity. The authors in <xref ref-type="bibr" rid="scirp.134850-24">
     [24]
    </xref> developed approaches for tracking a moving object in the near field environment (Fresnel zone). The objective was to determine the position and speed of the considered object using an ad-hoc observation model that takes into account the phase profile of a large receiving array. For this, the authors derived the posterior Cramer-Rao Lower Bound (P-CRLB) and proved that the loss of positioning information outside Fresnel comes from an increase in the ranging error rather than from inaccuracies of angular estimation. New technologies and applications require urgently the development of wireless communications <xref ref-type="bibr" rid="scirp.134850-25">
     [25]
    </xref> <xref ref-type="bibr" rid="scirp.134850-26">
     [26]
    </xref>. Technologies such as AI, collaborative robotics, digital twins, and additive manufacturing enable better planning, improved safety, and better human-machine interaction <xref ref-type="bibr" rid="scirp.134850-27">
     [27]
    </xref>-<xref ref-type="bibr" rid="scirp.134850-29">
     [29]
    </xref>. Compared to other domains, AI antenna application is not widely exploited, so many additional efforts should be considered.</p>
  </sec><sec id="s3">
   <title>3. Problem Description</title>
   <p>A broadside linear antenna array of 2M isotropic patch radiators has been considered as shown in <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref>, in which each element is excited with non-uniform current excitation. All elements are assumed to be identical. The array elements are assumed uncoupled and equally spaced along the z-axis with its center at the origin (<xref ref-type="fig" rid="fig1">
     Figure 1
    </xref>). The array is symmetric in both geometry and excitation. Array factor, in general, is a function of several elements, their geometrical arrangements, relative magnitudes, relative phases, and their relative spacing.</p>
   <p>Since the array factor does not depend on the directional characteristics of the radiating elements, it can be formulated by replacing the actual elements with isotropic (point) sources. Referring to <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref>, the array factor 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        A 
      </mi> 
      <mi>
        F 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          θ 
        </mi> 
        <mn>
          , 
        </mn> 
        <mi>
          I 
        </mi> 
        <mn>
          , 
        </mn> 
        <mi>
          ϕ 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> in azimuth plane (x-y plane) with symmetric amplitude distributions may be written as <xref ref-type="bibr" rid="scirp.134850-30">
     [30]
    </xref>.</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        A 
      </mi> 
      <mi>
        F 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          θ 
        </mi> 
        <mn>
          , 
        </mn> 
        <mi>
          I 
        </mi> 
        <mn>
          , 
        </mn> 
        <mi>
          ϕ 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mn> 
       <mo>
         = 
       </mo>2 
      </mn> 
      <mstyle displaystyle="true"> 
       <msubsup> 
        <mo>
          ∑ 
        </mo> 
        <mi>
          m 
        </mi> 
        <mi>
          M 
        </mi> 
       </msubsup> 
      </mstyle> 
      <mtext>
          
      </mtext> 
      <mi>
        I 
      </mi> 
      <mi>
        m 
      </mi> 
      <mi>
        cos 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mfrac> 
         <mrow> 
          <mn>
            2 
          </mn> 
          <mi>
            m 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mn>
           2 
         </mn> 
        </mfrac> 
        <mi>
          k 
        </mi> 
        <mi>
          d 
        </mi> 
        <mi>
          cos 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            θ 
          </mi> 
          <mo>
            + 
          </mo> 
          <mi>
            ϕ 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math></p>
   <p>where 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       θ 
     </mi> 
    </math> denotes the zenith angle measured from the broadside direction of the array. Im and 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       ϕ 
     </mi> 
    </math> are respectively, the current excitation amplitude, the excitation phase of m<sup>th</sup> array element, and d is the inter-elements spacing between</p>
   <p>two consecutive elements. In this paper 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       ϕ 
     </mi> 
    </math> is kept as zero, 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        k 
      </mi> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <mn>
          2 
        </mn> 
        <mi>
          π 
        </mi> 
       </mrow> 
       <mi>
         λ 
       </mi> 
      </mfrac> 
     </mrow> 
    </math> is the wave</p>
   <p>numbers and 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       λ 
     </mi> 
    </math> is the signal wavelength. The array elements are numbered 1 to M from the origin in a symmetric array where the total number of elements is 2M.</p>
  </sec><sec id="s4">
   <title>4. Optimization Algorithms</title>
   <p>The main purpose of this work is to study the low-side lobe radiation pattern for linear antenna arrays with the constraint of a fixed beam width. For this purpose, we propose, to use Genetic Algorithm, PSO, and Chebyshev. A comparative study of the efficiency of each other will be considered.</p>
   <sec id="s4_1">
    <title>4.1. Genetic Algorithm</title>
    <p>John Holland developed a Genetic Algorithm (GA) at the University of Michigan. It is a meta-heuristic that searches the feasible region of an optimization problem. GA has been applied to many problems in various domains such as engineering, finance, and economics <xref ref-type="bibr" rid="scirp.134850-31">
      [31]
     </xref>. GA consists of a data structure of individuals called Population. Individuals are also called chromosomes. Each chromosome is evaluated by an equation known as the fitness function or cost function, which is usually the objective function of the corresponding optimization problem.</p>
    <p>The important parameters of GA are:</p>
    <p>The basic steps involved in implementing GA are simple. These are listed as follows:</p>
    <p>1) genes, chromosomes, and coding a parameter set;</p>
    <p>2) create an initial population;</p>
    <p>3) evaluate the fitness of each population member;</p>
    <p>4) invoke natural selection;</p>
    <p>5) select population members for mating;</p>
    <p>6) generate off-springs; Mutate selected members of the population;</p>
    <p>7) terminate or go to step b.</p>
    <p>A simple flow graph for the Genetic Algorithm is shown in <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref>.</p>
   </sec>
   <sec id="s4_2">
    <title>4.2. Particle Swarm Optimization PSO</title>
    <p>Particle Swarm Optimization (PSO) was invented by Russell Eberhart and James Kennedy in 1995. PSO is a computational method that optimizes a problem by iteratively trying to improve a candidate solution concerning a given measure of quality. PSO optimizes a problem by having a population of candidate solutions, here dubbed particles, and moving these particles around in the search space according to simple mathematical formulae over the particle’s position and velocity <xref ref-type="bibr" rid="scirp.134850-32">
      [32]
     </xref>. From some of the information available, a particle must decide his next move, it is necessary to decide its new speed.</p>
    <p>To do this, it linearly combines three informations:</p>
    <p>Using three parameters sometimes called confidence factors that weigh three trends:</p>
    <fig id="fig1" position="float">
     <label>Figure 1</label>
     <caption>
      <title>Figure 1. Linear array antenna.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732786-rId25.jpeg?20240806100652" />
    </fig>
    <fig id="fig2" position="float">
     <label>Figure 2</label>
     <caption>
      <title>Figure 2. Genetic algorithm description.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732786-rId26.jpeg?20240806100652" />
    </fig>
    <p>The basic steps are the following:</p>
    <p>1) 1<sup>st</sup> step, we initialize the particle swarm in the search space.</p>
    <p>2) 2<sup>nd</sup> step, the speed is also initialized at random.</p>
    <p>3) 3<sup>rd</sup> step Assess fitness for each particle.</p>
    <p>4) 4<sup>th</sup> step Update velocity based on its best performance in the best performance of its neighbors.</p>
    <p>5) 5<sup>th</sup> step Finish if the stop condition is satisfied.</p>
    <p>6) 6<sup>th</sup> step Back to Step 2, this formula is used for updating velocity and the particle.</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          v 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           d 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <msub> 
        <mi>
          v 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           d 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          c 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            p 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             d 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             d 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          c 
        </mi> 
        <mn>
          3 
        </mn> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            p 
          </mi> 
          <mrow> 
           <mi>
             g 
           </mi> 
           <mi>
             d 
           </mi> 
          </mrow> 
         </msub> 
         <mo>
           − 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mi>
             d 
           </mi> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           d 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           d 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         − 
       </mo> 
       <msub> 
        <mi>
          v 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           d 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math></p>
    <p>With:</p>
   </sec>
   <sec id="s4_3">
    <title>4.3. Chebyshev</title>
    <p>In mathematics, the Chebyshev polynomials, named after Pafnuty Chebyshev, are a sequence of orthogonal polynomials <xref ref-type="bibr" rid="scirp.134850-33">
      [33]
     </xref>. The Chebyshev polynomials of the first kind are defined by the recurrence relation:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          T 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          T 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         x 
       </mi> 
      </mrow> 
     </math></p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          T 
        </mi> 
        <mrow> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mi>
             n 
           </mi> 
           <mo>
             + 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mn>
         2 
       </mn> 
       <mi>
         x 
       </mi> 
       <msub> 
        <mi>
          T 
        </mi> 
        <mrow> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mi>
             n 
           </mi> 
           <mo>
             + 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         − 
       </mo> 
       <msub> 
        <mi>
          T 
        </mi> 
        <mrow> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mi>
             n 
           </mi> 
           <mo>
             − 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math></p>
    <p>Our bibliographic research shows that the previous three algorithms have largely proven their performance. Most newly developed algorithms are improvements and derivations of these algorithms <xref ref-type="table" rid="table1">
      Table 1
     </xref> illustrates all variables used in this article.</p>
   </sec>
  </sec><sec id="s5">
   <title>5. Result and Discussion</title>
   <p>A 4, 8, 12, 16, 20, and 24-element linear antenna array of isotropic radiating</p>
   <table-wrap id="table1">
    <label>
     <xref ref-type="table" rid="table1">
      Table 1
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.134850-"></xref>Table 1. Variable nomenclatures.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="22.67%"><p style="text-align:center">Variable</p></td> 
      <td class="custom-bottom-td acenter" width="34.82%"><p style="text-align:center">Description</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="22.67%"><p style="text-align:center">SAR</p></td> 
      <td class="custom-top-td aleft" width="34.82%"><p style="text-align:left">Specific Absorption Rate</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="22.67%"><p style="text-align:center">BFN</p></td> 
      <td class="aleft" width="34.82%"><p style="text-align:left">Beamforming Network</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="22.67%"><p style="text-align:center">SSL</p></td> 
      <td class="aleft" width="34.82%"><p style="text-align:left">Side Lobe Level</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="22.67%"><p style="text-align:center">PSO</p></td> 
      <td class="aleft" width="34.82%"><p style="text-align:left">Particle Swarm Optimization</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="22.67%"><p style="text-align:center">ABC</p></td> 
      <td class="aleft" width="34.82%"><p style="text-align:left">Number of servers</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="22.67%"><p style="text-align:center">JS</p></td> 
      <td class="aleft" width="34.82%"><p style="text-align:left">File index</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="22.67%"><p style="text-align:center">MA</p></td> 
      <td class="aleft" width="34.82%"><p style="text-align:left">server index</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="22.67%"><p style="text-align:center">TLBO</p></td> 
      <td class="aleft" width="34.82%"><p style="text-align:left">Teaching-Learning-Based Optimization</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="22.67%"><p style="text-align:center">HPBw</p></td> 
      <td class="aleft" width="34.82%"><p style="text-align:left">Half Power BeamWidth</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="22.67%"><p style="text-align:center">FNBw</p></td> 
      <td class="aleft" width="34.82%"><p style="text-align:left">First Null BeamWidth</p></td> 
     </tr> 
    </table>
   </table-wrap>
   <p>elements, with inter-element spacing is considered for reference. Genetic Algorithm, PSO, and Chebyshev are applied to get deeper nulls and to reduce Side Lobe Levels (SSLs). Every time, these algorithms ran with 400 iterations. The population size was fixed to 100. GA algorithm is initialized using random values of excitation (0 &lt; In &lt; 1) and spacing The programming has been written in Matlab language.</p>
   <sec id="s5_1">
    <title>5.1. Radiation Pattern</title>
    <fig id="fig3" position="float">
     <label>Figure 3</label>
     <caption>
      <title>Figure 3. Radiation pattern using GA, PSO and Chebyshev.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732786-rId59.jpeg?20240806100652" />
    </fig>
    <p>In the next step, the variation of the SSL with the number of elements will be presented in <xref ref-type="fig" rid="fig4">
      Figure 4
     </xref>.</p>
    <fig id="fig4" position="float">
     <label>Figure 4</label>
     <caption>
      <title>Figure 4. SSL variation with the array dimension.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732786-rId60.jpeg?20240806100653" />
    </fig>
    <p>For this scenario, the best values are obtained with the number of elements equal to 12. <xref ref-type="fig" rid="fig5">
      Figure 5
     </xref> shows the running time with the variation of the array size. For N elements equal to 4, 6, 8, 12, 16, and 18-element arrays, the Chebyshev algorithm showed less running time than others.</p>
    <fig id="fig5" position="float">
     <label>Figure 5</label>
     <caption>
      <title>Figure 5. Running time variation.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1732786-rId61.jpeg?20240806100653" />
    </fig>
   </sec>
   <sec id="s5_2">
    <title>5.2. Comparison of the Effects of Excitation and Number of Elements N</title>
    <p>
     <xref ref-type="table" rid="table2">
      Table 2
     </xref> shows the numerical results and a comparative study between the three algorithms.</p>
    <table-wrap id="table2">
     <label>
      <xref ref-type="table" rid="table2">
       Table 2
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.134850-"></xref>Table 2. Numerical results.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="19.47%"><p style="text-align:center">Number of element</p></td> 
       <td class="custom-bottom-td acenter" width="21.73%"><p style="text-align:center">Parameters</p></td> 
       <td class="custom-bottom-td acenter" width="19.22%"><p style="text-align:center">GA</p></td> 
       <td class="custom-bottom-td acenter" width="19.22%"><p style="text-align:center">PSO</p></td> 
       <td class="custom-bottom-td acenter" width="20.36%"><p style="text-align:center">Chebyshev</p></td> 
      </tr> 
      <tr> 
       <td rowspan="4" class="custom-top-td acenter" width="19.47%"><p style="text-align:center">4</p></td> 
       <td class="custom-top-td acenter" width="21.73%"><p style="text-align:center">Excitation</p></td> 
       <td class="custom-top-td acenter" width="19.22%"><p style="text-align:center">0.5555 0.70712</p></td> 
       <td class="custom-top-td acenter" width="19.22%"><p style="text-align:center">0.67792 0.74205</p></td> 
       <td class="custom-top-td acenter" width="20.36%"><p style="text-align:center">0.9611 0.8472</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="21.73%"><p style="text-align:center">SSL (dB)</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">−5.91</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">−19</p></td> 
       <td class="acenter" width="20.36%"><p style="text-align:center">−6.4</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="21.73%"><p style="text-align:center">FNBw (degree)</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">59.58</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">47.01</p></td> 
       <td class="acenter" width="20.36%"><p style="text-align:center">62.84</p></td> 
      </tr> 
      <tr> 
       <td class="custom-bottom-td acenter" width="21.73%"><p style="text-align:center">HPBw (degree)</p></td> 
       <td class="custom-bottom-td acenter" width="19.22%"><p style="text-align:center">35.87</p></td> 
       <td class="custom-bottom-td acenter" width="19.22%"><p style="text-align:center">36.79</p></td> 
       <td class="custom-bottom-td acenter" width="20.36%"><p style="text-align:center">37.03</p></td> 
      </tr> 
      <tr> 
       <td rowspan="5" class="custom-top-td acenter" width="19.47%"><p style="text-align:center">8</p></td> 
       <td class="custom-top-td acenter" width="21.73%"><p style="text-align:center">Excitation</p></td> 
       <td class="custom-top-td acenter" width="19.22%"><p style="text-align:center">0.30137 0.70993</p></td> 
       <td class="custom-top-td acenter" width="19.22%"><p style="text-align:center">0.90579 0.63236</p></td> 
       <td class="custom-top-td acenter" width="20.36%"><p style="text-align:center">0.9611 0.8472 0.6600 0.4364</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="21.73%"><p style="text-align:center"></p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">0.45978 0.24117</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">0.54688 0.15761</p></td> 
       <td class="acenter" width="20.36%"><p style="text-align:center"></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="21.73%"><p style="text-align:center">SSL (dB)</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">−6.37</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">−7.73</p></td> 
       <td class="acenter" width="20.36%"><p style="text-align:center">−10.17</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="21.73%"><p style="text-align:center">FNBw (degree)</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">29</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">30.02</p></td> 
       <td class="acenter" width="20.36%"><p style="text-align:center">36.42</p></td> 
      </tr> 
      <tr> 
       <td class="custom-bottom-td acenter" width="21.73%"><p style="text-align:center">HPBw (degree)</p></td> 
       <td class="custom-bottom-td acenter" width="19.22%"><p style="text-align:center">17.49</p></td> 
       <td class="custom-bottom-td acenter" width="19.22%"><p style="text-align:center">15.2</p></td> 
       <td class="custom-bottom-td acenter" width="20.36%"><p style="text-align:center">20.41</p></td> 
      </tr> 
      <tr> 
       <td rowspan="6" class="custom-top-td acenter" width="19.47%"><p style="text-align:center">12</p></td> 
       <td class="custom-top-td acenter" width="21.73%"><p style="text-align:center">Excitation</p></td> 
       <td class="custom-top-td acenter" width="19.22%"><p style="text-align:center">0.20064 0.19728</p></td> 
       <td class="custom-top-td acenter" width="19.22%"><p style="text-align:center">0.93401 0.46939</p></td> 
       <td class="custom-top-td acenter" width="20.36%"><p style="text-align:center">0.9611 0.8472 0.6600 0.4364</p><p style="text-align:center">0.2466 0.0976</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="21.73%"><p style="text-align:center"></p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">0.35707 0.27514</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">0.16218 0.462</p></td> 
       <td class="acenter" width="20.36%"><p style="text-align:center"></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="21.73%"><p style="text-align:center"></p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">0.31669 0.69138</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">0.26297 0.74815</p></td> 
       <td class="acenter" width="20.36%"><p style="text-align:center"></p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="21.73%"><p style="text-align:center">SSL (dB)</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">−6.82</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">−9.49</p></td> 
       <td class="acenter" width="20.36%"><p style="text-align:center">−19.52</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="21.73%"><p style="text-align:center">FNBw (degree)</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">19.21</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">22.81</p></td> 
       <td class="acenter" width="20.36%"><p style="text-align:center">36.01</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="21.73%"><p style="text-align:center">HPBw (degree)</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">11.04</p></td> 
       <td class="acenter" width="19.22%"><p style="text-align:center">13.04</p></td> 
       <td class="acenter" width="20.36%"><p style="text-align:center">16.06</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>The comparative parameters include the excitation, the SSL, the FNBW, and the HPBW as well as the number of elements (4 elements, 8 elements, and 12 elements non-uniformly excited). Because of the symmetry of the linear antenna array design, the excitation value numbers are divided by 2, for example, N = 4 corresponds to two excitation values, etc. For N = 4, PSO shows the best SSL (−19 dB) but for N = 8 and N = 12, it’s the Chebyshev algorithm that dominates. The variation of FNPw and HPBw parameters can be discussed but our interest is focalised on minimizing SSL.</p>
    <p>This work is a comparative study between three optimization algorithms, the results may depend on several parameters including the capacity of the resources allocated in the simulation tests.</p>
   </sec>
  </sec><sec id="s6">
   <title>6. Conclusion</title>
   <p>In this paper, Three optimization algorithms are applied to reduce the second side lobe SSL generated from a typical linear antenna. SSL is a result of antenna radiation. The reduction of these electromagnetic fields especially in local zones can contribute to minimizing interference and keep the human body safe. A comparison study of the three algorithms is also carried out, the goal is to identify the best algorithms in the optimization process. Results showed a dominance for the Chebyshev algorithm in reducing SSL values. This work can be enhanced by considering newly developed heuristics and algorithms, and proposed practice solutions to convict mobile operators’ services to use such algorithms and reduce SSL values.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.134850-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     World Health Organization (2024) Specific Absorption Rate. &gt;https://www.who.int/data/gho/data/indicators/indicator-details/GHO/specific-absorption-rate-(sar)-(w-kg) 
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     European Regulations (1999) 1999/519/EC: Council Recommendation of 12 July 1999 on the Limitation of Exposure of the General Public to Electromagnetic Fields (0 Hz to 300 GHz). 
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Denden, M., Jemmali, M., Boulila, W., Soni, M., Khan, F. and Ahmad, J. (2024) Clustering-Based Resource Management for Consumer Cost Optimization in IoT Edge Computing Environments. IEEE Transactions on Consumer Electronics. &gt;https://doi.org/10.1109/tce.2024.3414929
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Laufs, J., Borrion, H. and Bradford, B. (2020) Security and the Smart City: A Systematic Review. Sustainable Cities and Society, 55, Article 102023. &gt;https://doi.org/10.1016/j.scs.2020.102023
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Eljack, S., Jemmali, M., Denden, M., Turki, S., Khedr, W.M., Algashami, A.M., et al. (2023) A Secure Solution Based on Load-Balancing Algorithms between Regions in the Cloud Environment. PeerJ Computer Science, 9, e1513. &gt;https://doi.org/10.7717/peerj-cs.1513
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Jemmali, M., Denden, M., Boulila, W., Srivastava, G., Jhaveri, R.H. and Gadekallu, T.R. (2022) A Novel Model Based on Window-Pass Preferences for Data Emergency Aware Scheduling in Computer Networks. IEEE Transactions on Industrial Informatics, 18, 7880-7888. &gt;https://doi.org/10.1109/tii.2022.3149896
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kurdi, M.H., Denden, M. and Paul, D. (2024) A Study on the Challenges of Human-Centric Cyber-Security and the Guarantee of Information Quality. Journal of Information Security, 15, 218-231. &gt;https://doi.org/10.4236/jis.2024.152013
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Jayarama, K. and Chen, C.H. (2024) Enhanced Wideband Frequency Estimation via FFT: Leveraging Polynomial Interpolation and Array Indexing. Journal of Computer and Communications, 12, 35-48. &gt;https://doi.org/10.4236/jcc.2024.121003
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mohsen, D., Ghannay, N. and Samet, A. (2009) A Half Hollow Cylindrical Antenna (HHCA) Analysis Using the CFDTD Algorithm. Progress in Electromagnetics Research C, 11, 51-60. &gt;https://doi.org/10.2528/pierc09090804
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Romdhani, F., Denden, M. and Samet, A. (2009) A Printed Reconfigurable Antenna for Communication System. 2009 Mediterrannean Microwave Symposium (MMS), Tangiers, 15-17 November 2009, 1-3. &gt;https://doi.org/10.1109/mms.2009.5409789
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mailloux, R.J. (2017) Phased Array Antenna Handbook. Artech House.
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Al-Zoubi, A.S., Amaireh, A.A. and Dib, N.I. (2022) Comparative and Comprehensive Study of Linear Antenna Arrays’ Synthesis. International Journal of Electrical and Computer Engineering (IJECE), 12, 2645-2654. &gt;https://doi.org/10.11591/ijece.v12i3.pp2645-2654
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Liang, Q., Chen, B., Wu, H., Ma, C. and Li, S. (2021) A Novel Modified Sparrow Search Algorithm with Application in Side Lobe Level Reduction of Linear Antenna Array. Wireless Communications and Mobile Computing, 2021, Article 9915420. &gt;https://doi.org/10.1155/2021/9915420
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Song, Q., Lei, S., Chen, M., Tian, J., Yang, W. and Sun, K. (2024) Peak Sidelobe Level Suppression via Reconfigurable Element Pattern Selection for Beam Scanning Linear Array Antenna. Digital Signal Processing, 145, Article 104333. &gt;https://doi.org/10.1016/j.dsp.2023.104333
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Khalili, H., Mohammadpour-Aghdam, K. and Alamdar, S. (2024) Sidelobe Level Reduction in Pattern Synthesis of a Non-Uniform Series-Fed Microstrip Antenna Array Using the TLBO Algorithm. AEU-International Journal of Electronics and Communications, 176, Article 155143. &gt;https://doi.org/10.1016/j.aeue.2024.155143
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Amer, S.M., Khalaf, A.A.M., Hussein, A.H., Alqahtani, S.A., Dahshan, M.H. and Kassem, H.M. (2024) New Antenna Array Beamforming Techniques Based on Hybrid Convolution/Genetic Algorithm for 5G and Beyond Communications. Computer Modeling in Engineering&amp;Sciences, 138, 2749-2767. &gt;https://doi.org/10.32604/cmes.2023.029138
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Li, W., Zhang, Y. and Shi, X. (2019) Advanced Fruit Fly Optimization Algorithm and Its Application to Irregular Subarray Phased Array Antenna Synthesis. IEEE Access, 7, 165583-165596. &gt;https://doi.org/10.1109/access.2019.2953544
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Federico, G., Caratelli, D., Theis, G. and Smolders, A.B. (2021) A Review of Antenna Array Technologies for Point-to-Point and Point-to-Multipoint Wireless Communications at Millimeter-Wave Frequencies. International Journal of Antennas and Propagation, 2021, Article 5559765. &gt;https://doi.org/10.1155/2021/5559765
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zardi, F., Nayeri, P., Rocca, P. and Haupt, R. (2021) Artificial Intelligence for Adaptive and Reconfigurable Antenna Arrays: A Review. IEEE Antennas and Propagation Magazine, 63, 28-38. &gt;https://doi.org/10.1109/map.2020.3036097
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zhang, J., Ge, X., Li, Q., Guizani, M. and Zhang, Y. (2017) 5G Millimeter-Wave Antenna Array: Design and Challenges. IEEE Wireless Communications, 24, 106-112. &gt;https://doi.org/10.1109/mwc.2016.1400374rp
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref21">
    <label>21</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Guo, Y.J., Ansari, M. and Fonseca, N.J.G. (2021) Circuit Type Multiple Beamforming Networks for Antenna Arrays in 5G and 6G Terrestrial and Non-Terrestrial Networks. IEEE Journal of Microwaves, 1, 704-722. &gt;https://doi.org/10.1109/jmw.2021.3072873
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref22">
    <label>22</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Xu, Q., Zeng, S., Zhao, F., Jiao, R. and Li, C. (2021) On Formulating and Designing Antenna Arrays by Evolutionary Algorithms. IEEE Transactions on Antennas and Propagation, 69, 1118-1129. &gt;https://doi.org/10.1109/tap.2020.3016181
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref23">
    <label>23</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Durmus, A., Kurban, R. and Karakose, E. (2021) A Comparison of Swarm-Based Optimization Algorithms in Linear Antenna Array Synthesis. Journal of Computational Electronics, 20, 1520-1531. &gt;https://doi.org/10.1007/s10825-021-01711-w
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref24">
    <label>24</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Guerra, A., Guidi, F., Dardari, D. and Djuric, P. (2021) Near-Field Tracking with Large Antenna Arrays: Fundamental Limits and Practical Algorithms. IEEE Transactions on Signal Processing, 69, 5723-5738. &gt;https://doi.org/10.1109/tsp.2021.3101696
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref25">
    <label>25</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Nabil, G., Mohsen, D., Faouzi, R. and Abdelaziz, S. (2008) A Novel Technique for Calculating Moment Method Impedance Matrix. IEEE Mediterranean Microwave Symposium 2008, Damascus, 14-16 October 2008, 77-80.
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref26">
    <label>26</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mohamed, H., Fethi, C., Mohsen, D., Tan Hoa, V. and Jacques, D. (2011) A Novel Compact Ultra-Wideband Rectangular Shaped Antenna. Progress in Electromagnetics Research Symposium Proceedings, Marrakesh, 20-23 March 2011, 381-385.
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref27">
    <label>27</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Alnasser, N., Alabssi, R., Faran, B., Alessa, L. and Nagy, N. (2024) The Implementation of Ray Tracing Algorithm with Openmp Parallelization. Journal of Computer and Communications, 12, 120-130. &gt;https://doi.org/10.4236/jcc.2024.121008
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref28">
    <label>28</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Alkhalifah, A. and Denden, M. (2023) Investigating the Impact of COVID-19 on the Morale of Deaf and Hearing-Impaired Students in Saudi Arabia Technical Colleges: Lessons Learned and Future Implications. Journal for Educators, Teachers and Trainers, 14, 420-428.
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref29">
    <label>29</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Denden, M. and Alkhalifah, A. (2023) Assessing the Impact of COVID-19 on the Psychology of Saudi Technical College Students: Lessons and Tips. Creative Education, 14, 518-529. &gt;https://doi.org/10.4236/ce.2023.143036
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref30">
    <label>30</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Balanis, C.A. (2016) Antenna Theory: Analysis and Design. John Wiley&amp;Sons.
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref31">
    <label>31</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mitchell, J. (1998) Introduction to Melanie Klein. In: Phillips, J. and Stonebridge, L., Eds., Reading Melanie Klein, Routledge, 11-31. &gt;https://doi.org/10.4324/9780203360538-1
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref32">
    <label>32</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Freitas, D., Lopes, L.G. and Morgado-Dias, F. (2020) Particle Swarm Optimisation: A Historical Review up to the Current Developments. Entropy, 22, Article 362. &gt;https://doi.org/10.3390/e22030362
    </mixed-citation>
   </ref>
   <ref id="scirp.134850-ref33">
    <label>33</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Rivlin, T.J. (2020) Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory. Dover Publications.
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>