IDEAS home Printed from https://ideas.repec.org/a/taf/tewaxx/v38y2024i17p1954-1978.html
   My bibliography  Save this article

Marine predator’s algorithm-based linear and elliptical antenna array design for 5G communication

Author

Listed:
  • Rajrup Saha
  • Avishek Das
  • Durbadal Mandal
  • Rajib Kar

Abstract

The highly efficient linear and elliptical antenna array design presented in this article is intended to synthesize far-field radiation patterns for 5G communication. The objective is to achieve the best possible radiation pattern, which includes a lower side lobe level (SLL) and a narrower half-power beam width (HPBW). A low SLL is crucial to minimize intervention in the entire side lobe region, whereas long-distance communication requires a low HPBW. The marine predator’s algorithm (MPA) is used here to determine the optimal feeding currents to each array element to reduce the SLL and HPBW values. Two linear antenna array (LAA) design examples and the three elliptical antenna array (EAA) design examples are discussed in this article which are achieved using the optimal current excitations to each array element. Two well-established evolutionary optimization techniques, namely the genetic algorithm (GA) and the differential evolution (DE) technique, are also employed for comparison to demonstrate the superiority of the MPA optimization-based technique. The results achieved utilizing the MPA show the improvement of SLL contraction compared to the uniform antenna array and the methods affirmed in the recently published article.

Suggested Citation

  • Rajrup Saha & Avishek Das & Durbadal Mandal & Rajib Kar, 2024. "Marine predator’s algorithm-based linear and elliptical antenna array design for 5G communication," Journal of Electromagnetic Waves and Applications, Taylor & Francis Journals, vol. 38(17), pages 1954-1978, November.
  • Handle: RePEc:taf:tewaxx:v:38:y:2024:i:17:p:1954-1978
    DOI: 10.1080/09205071.2024.2412565
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/09205071.2024.2412565
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/09205071.2024.2412565?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tewaxx:v:38:y:2024:i:17:p:1954-1978. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tewa .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.