IDEAS home Printed from https://ideas.repec.org/a/epw/ejece0/v6y2022i1id19387.html

An Effective Heuristics Approach for Performance Enhancement of MANET

Author

Listed:
  • Koshal Rahman Rahmani
  • Md Sohel Rana
  • Md Alamin Hossan
  • Wali Mohammad Wadeed

Abstract

Mobile Ad-hoc Networks (MANET) are widely adopted in almost all research fields due to their significant advantages like minimal energy consumption and compact size. In MANET major challenges are optimal coverage, a lifetime of nodes, and throughput. This paper proposed a hybrid ant colony-flower pollination (HAC - FP) algorithm for throughput maximization and minimal energy consumption in a sensor network. To enhance the performance of the MANET network this research adopts the meta-heuristic technique. The meta-heuristic approach utilized for the MANET network is the ant colony and flower pollination algorithm. The planned HAC-FP makes use of neighborhood distance to determine the best position for each node. With hypersphere localization, the Levy struggle in flower pollination is used for optimal energy location. The placement of sensor nodes is identified in the first step using a hypersphere. Sensor network node energy consumption is lowered based on neighborhood distance. The results showed that the suggested HAC-FP algorithm, rather than existing methodologies, enhances the MANET network's coverage area. Further proposed HAC-FP algorithm minimizes the energy consumption level of the MANET than the conventional genetic approach.

Suggested Citation

  • Koshal Rahman Rahmani & Md Sohel Rana & Md Alamin Hossan & Wali Mohammad Wadeed, 2022. "An Effective Heuristics Approach for Performance Enhancement of MANET," European Journal of Electrical Engineering and Computer Science, European Open Science, vol. 6(1), pages 16-23, January.
  • Handle: RePEc:epw:ejece0:v:6:y:2022:i:1:id:19387
    DOI: 10.24018/ejece.2022.6.1.387
    as

    Download full text from publisher

    File URL: https://eu-opensci.org/index.php/ejece/article/view/19387
    File Function: Abstract page
    Download Restriction: no

    File URL: https://eu-opensci.org/index.php/ejece/article/download/19387/11223
    File Function: Full text
    Download Restriction: no

    File URL: https://libkey.io/10.24018/ejece.2022.6.1.387?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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:epw:ejece0:v:6:y:2022:i:1:id:19387. 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: support (email available below). General contact details of provider: https://eu-opensci.org/index.php/ejece .

    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.