## 2 Literature Survey  
Traditional routing protocols in mobile ad hoc networks, such as bacteria for aging optimization algorithm (BFOA), ad hoc on-demand distance vector (AODV), ad hoc on-demand multipath distance vector (AOMDV), dynamic source routing (DSR) protocols, destination sequence distance vector (DSDV), zone routing protocol (ZRP), ad-hoc on-demand multipath distance vector (AODMV) and temporally ordered routing algorithm (TORA), have been widely simulated and analyzed by authors for disparate network parameters and simulation environments. In [3], a secure optimization routing algorithm was designed to address energy consumption and latency in MANETs. The study utilized the bacteria for aging optimization algorithm (BFOA) to develop an efficient routing approach. Initially, cluster heads (CHs) were determined through the employment of a fuzzy clustering method. The CHs were responsible for routing data packets, while detecting intruded nodes through a predefined threshold. The BFOA optimization algorithm was highlighted as a solution for secure routing in MANETs, offering faster convergence rates and improvements in storage, throughput and route connectivity. This technique demonstrated significant performance benefits by achieving minimal energy consumption, low latency and high throughput. In [4], the authors evaluated the performance of MANETs with variation in transmission power over 40, 80 and 120 nodes using the AOMDV routing protocol. AODMV performs better than AODV for several performance metrics such as throughput, average end-to-end delay and average energy consumption. The simulation was conducted using QualNet Simulator in a MANET scenario with nodes placed over 1500 \(\times\) 1500 m terrain. A comparison between the performance of AODV and AOMDV protocols was compared in terms of throughput, power consumption and average end-to-end delay. AOMDV outperformed AODV in throughput, especially with high node density, because of the AOMDV multipath routing capability. Moreover, average end-to-end-delay was lower with AOMDV, highlighting more efficient data packet delivery. AODMV can have lower energy consumption per node, as it uses multiple paths, which provides balance between the load and energy usage across the network more effectively than AODV. The study concluded that AOMDV has higher efficiency than AODV in dynamic and high-density MANET scenarios. In [5], on-demand routing protocols AODV and destination sequenced distance vector (DSDV) were proposed to investigate the behaviors of those protocols in ad hoc networks. An exhaustive comparison has been made in terms of loop route structure, freedom, number of tables required, the capability of multiple routes and maintenance of the routes. Furthermore, MANETs' routing attacks, such as blackhole attacks, wormhole attacks, Greyhole attacks and Byzantine attacks were insightfully illustrated in terms of the routing protocol of the attack, the used approach, simulation environment and comparison of results, as well as techniques to mitigate each attack separately, addressing the challenge of detecting and mitigating attack and its effect on end-to-end delay, through additional overhead caused by detecting threats. Detecting attacks is a complex process that consists mainly of creating new tables to store responses from multiple nodes and analyze these responses, based on target sequence number threshold to determine the validity of the source of the response. Other techniques such as hash trees, route redundancy and route aggregation were introduced. In [6], the routing protocols DSDV and AODV were simulated with the Gauss-Markov mobility model. The experiment assessed the performance of AODV and DSDV routing protocols in the form of routing overhead, node density, number of packets and number of hops count. In the experiment, it was observed that number of nodes in AODV is similar to that in DSDV, while the routing overhead increases in AODV simulation, in case of increasing the number of nodes, while the DSDV is not affected.