An Energy-Aware Cluster Head Selection and Optimal Route Selection Algorithm for Maximizing Network Lifetime in MANETs
Venkatesh Devarayasamudram, Rakesh Chandrashekar, Chandra Mohan Chetla, D. R. Kumar Raja, Purushotham Nimmala, Singaravelan Arumugam · Mathematical Modelling and Engineering Problems · 2024
Quality of Service (QoS) is a crucial aspect of Mobile Ad Hoc Networks (MANET) that needs examination to demonstrate optimal performance.The scientific community is increasingly concerned with the challenge of developing an energy-aware clustering method for MANETs.This is owing to the fact that the battery-operated sensor devices that form the backbone of these wireless networks cannot be recharged.The selection of a cluster's leader is a difficult problem in MANET.Additionally, the research focuses on Optimal Route Selection (ORS) within the MANET context, acknowledging the significance of establishing efficient communication paths between cluster heads and member nodes.Through the integration of a reliability pair factor and node energy considerations, the proposed ORS algorithm generates optimal paths based on maximizing energy efficiency while minimizing the sum of hops between nodes.The study suggests a new algorithm based on the way waterwheel plants move and change their places as they explore and exploit new territory in the quest for food.The suggested method is named Binary Waterwheel Plant Algorithm (BWPA).In this method, a novel model is used to represent both the binary search space and the mapping from continuous to discrete spaces.Particularly, mathematical models of the fitness and cost functions used by the algorithm are constructed.Through the use of a reliability pair factor and node energy, the proposed research paper on Optimal Route Selection (ORS) generates the optimal path between the cluster head and member node and establishes the path based on the maximum energy and sum of hops among the nodes.By fusing the reactive power of differential evolution with the exhaustive search efficiency of the BWPA, the proposed method extends the life of networks.The recommended method increases node lifetime by compounding the dynamic capabilities of discrepancy evolution with the high effectiveness of search.