z-logo
open-access-imgOpen Access
An Effective Heuristics Approach for Performance Enhancement of MANET
Author(s) -
Koshal Rahman Rahmani,
Md. Sohel Rana,
Md Alamin Hossan,
Wali Mohammad Wadeed
Publication year - 2022
Publication title -
european journal of electrical engineering and computer science
Language(s) - English
Resource type - Journals
ISSN - 2736-5751
DOI - 10.24018/ejece.2022.6.1.387
Subject(s) - mobile ad hoc network , computer science , hypersphere , energy consumption , node (physics) , heuristic , wireless sensor network , throughput , computer network , engineering , artificial intelligence , network packet , wireless , telecommunications , structural engineering , electrical engineering
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here