Mobile Ad Hoc Network Routing Protocols Research Articles

COMPUTATIONAL INTELLIGENCE BASED ROUTING SOLUTIONS FOR MOBILE AD HOC NETWORKS

Mobile Ad Hoc Networks (MANETs) refers to a wireless network where nodes dynamically establish and maintain connections with each other, directly without the need for a centralized infrastructure. MANETs are characterized by their decentralized nature, presenting challenges for routing protocols concerning rapid data transmission, minimized delay and Quality of Service (QoS) provisioning. Traditional routing protocols may struggle to perform optimally in MANETs due to frequent changes in network topology and resource constraints. The development of intelligent routing protocols tailored to the specific characteristics of MANETs is vital for dynamic and resource-constrained environments. Computational intelligence (CI) techniques have gained attention for designing intelligent routing protocols for MANETs. This paper provides a comprehensive overview of majorly used CI methodologies in MANETs. The paper reviews existing research on intelligent routing protocols based on CI techniques in MANETs and identifies future research directions in this field to address the unique challenges of MANETs and improve network performance and reliability.

Performance Analysis of Non-Realistic Routing Protocol using Random Waypoint Model in MANET

A mobile ad hoc network (MANET) is a collection of wireless nodes connected via wireless networks and has no set structure. MANETs feature a self-organized routing topology in which mobile nodes are free to move, making it difficult and crucial to construct a stable and reliable network. Thus, failure of the route is also regarded as a prime factor affecting the efficiency of any MANET routing protocol. The breaking of the connection between two routes or more nodes will cause the failure of the route specifically in the non-realistic routing protocol. In a network of mobile nodes, the link break is mainly based on the mobility of individual nodes. Therefore, the objective of this research is to investigate the performance of proactive DSDV and reactive AODV routing protocol using the Random Waypoint(RWP) mobility model in MANET. NS-2 network simulator is used to simulate the MANET environment and BonnMotion is to create a movement of mobile nodes that integrate with the routing protocol. The network performance metrics used are throughput, packet delivery ratio, and average end-to-end delay. In addition, three simulation scenarios have been conducted to compare AODV and DSDV routing protocols with varying numbers of nodes, a comparison of AODV and DSDV routing protocols with varying pause time, and a comparison of AODV and DSDV routing protocols with varying mobility speed. The result from the three scenarios analysed and concluded that the RWP mobility model with AODV gives a better performance of throughput with 869.69 kbps and Packet Delivery Ratio (PDR) with 83.00% meanwhile, RWP with DSDV is better for the average end-to-end delay(EED) with 212.970 bps.

Improved Routing Protocols: A First Step Towards Quality of Service in Mobile Ad-hoc Networks

The recent developments in wireless technology have piqued academics' curiosity. Mobile Adhoc Networks (MANET) is a fast-growing networking architecture used in emergency, disaster, and tactical operations applications. It covers a wide range of applications with some degradation due to its flexible and expandable nature. Because routing is the primary function of wireless networks, routing protocol design is critical in Adhoc networks. Various methods have been used to improve the performance of current routing protocols in different categories. Technical advances in routing protocols have recently been achieved, combined with optimization approaches to improve the overall performance of MANETs routing protocols. This research initially looked at several sorts of routing protocols before going through their variations for energy economy and latency reduction. The previous protocols, which were created utilizing optimization methods, will then illustrate the current requirement. Finally, the review analysis delves into many aspects such as commonly used protocols, optimization techniques, QoS parameters, performance metrics, and future paths. Keywords: MANETs, Energy, Delay, Optimized Protocols, QoS.

Analyze the Impact of Mobility and Pause Time on ACO based Manet Routing Protocols - Review

Abstract: Recently, many researchers have studied its performance within Mobile Ad-hoc Networks (MANETs). Every ad hoc network protocol focuses on a different set of measurements and traits. The majority of the currently utilized mobility models are employed to provide realistic movement patterns for MANET scenarios. A crucial element in the creation of MANET protocols is simulation. The future topology of a network can be predicted, which enables Quality of service- aware routing to choose a dependable link for data transmission. Ant algorithms, also known as swarm intelligence, are a wider field of study that deals with algorithmic approaches that are motivated by the behaviour of ant colonies and other insects. Ant Colony Optimization (ACO) is a subset of this larger topic. Based on the pheromone value deposited over the link, we identified two categories for the link quality in the proposed approach. We have demonstrated how the network's performance is enhanced by the suggested technique. The nodes are moving in the specified terrain dimensions through the Enhanced Manhattan Mobility Model (EMMM). The five QoS performance metrics are analyzed over three MANET routing protocols. The comparison is made over two important factors-mobility and pause time with the proposed ACO technique of reliable links. In the first experiment of different speeds, DSR is 25.5% better than AODV and 5.3% better than DSDVin metric packet dropping, 1.15% better than AODV and 1.01% better than DSDV in Packet Delivery Ratio, 1.5% better than AODV and 1.04% better than DSDV in packet overhead, and 62.7% better than AODV and 73.1% better than DSDV in average end-to-end delay. In the second experiment of pause times, DSR is 25.05% better than AODV and 4.5% better than DSDV in packet dropping, 1.18% better than AODV and 1.01% better than DSDV in packet delivery ratio, 1.01% better than DSDV in throughput, 0 to 0.002% in packet overhead, and 0.02% to 0.005% shorter delay.

IoT energy efficiency routing protocol using FHO‐based clustering and improved CSO model‐based routing in MANET

SummaryMany protocols, services, and electrical devices with built‐in sensors have been developed in response to the rapid expansion of the Internet of Things. Mobile ad hoc networks (MANETs) consist of a collection of autonomous mobile nodes that can form an ad hoc network in the absence of any pre‐existing infrastructure. System performance may suffer due to the changeable topology of MANETs. Since most mobile hosts operate on limited battery power, energy consumption poses the biggest challenge for MANETs. Both network lifetime and throughput improve when energy usage is reduced. However, existing approaches perform poorly in terms of energy efficiency. Scalability becomes a significant issue in large‐scale networks as they grow, leading to overhead associated with routing updates and maintenance that can become unmanageable. This article employs a MANET routing protocol combined with an energy conservation strategy. The clustering hierarchy is used in MANETs to maximize the network's lifespan, considering its limited energy resources. In the MANET communication process, the cluster head (CH) is selected using Fire Hawk Optimization (FHO). When choosing nodes to act as a cluster for an extended period, CH election factors in connectivity, mobility, and remaining energy. This process is achieved using an optimized version of the Ad hoc On‐Demand Distance Vector (AODV) routing protocol, utilizing Improved Chicken Swarm Optimization (ICSO). In comparison to existing protocols and optimization techniques, the proposed method offers an extended network lifespan ranging from 90 to 160 h and reduced energy consumption of 80 to 110 J, as indicated by the implementation results.

Data aggregation and routing in Mobile Ad hoc network: Introduction to Self-Adaptive Tasmanian Devil Optimization

Mobile Ad-Hoc Network (MANETs) is referred to as the mobile wireless nodes that make up ad hoc networks. The network topology may fluctuate on a regular basis due to node mobility. Each node serves as a router, passing traffic throughout the network, and they construct the network’s infrastructure on their own. MANET routing protocols need to be able to store routing information and adjust to changes in the network topology in order to forward packets to their destinations. While mobile networks are the main application for MANET routing techniques, networks with stationary nodes and no network infrastructure can also benefit from using them. In this paper, we proposed a Self Adaptive Tasmanian Devil Optimization (SATDO) based Routing and Data Aggregation in MANET. The first step in the process is clustering, where the best cluster heads are chosen according to a number of limitations, such as energy, distance, delay, and enhanced risk factor assessment on security conditions. In this study, the SATDO algorithm is proposed for this optimal selection. Subsequent to the clustering process, routing will optimally take place via the same SATDO algorithm introduced in this work. Finally, an improved kernel least mean square-based data aggregation method is carried out to avoid data redundancy. The efficiency of the suggested routing model is contrasted with the conventional algorithms via different performance measures.

Auto-metric Graph Neural Network based Blockchain Technology for Secured Dynamic Optimal Routing in MANET

Mobile ad hoc network (MANET) routing is a generous tactic used for allocating packets to the base station (BS). During the operations of routing, occurrence of malicious node embellishes the mobile ad hoc network operations. For that reason, a trusted distributed routing protocol is obliged that maintains the routing buttressing and the proficiency of mobile ad hoc network. To overcome these challenging issues, Auto-Metric Graph Neural Network based Blockchain technology is proposed in this manuscript for Secured Dynamic Optimal Routing in MANET (BC-SDOR-MANET-AGNN). The proposed approach is simulated in NS-2 tool. The proposed BC-SDOR-MANET-AGNN approach attains 76.26%, 65.57%, 42.9% minimal delay during 25% malicious routing environment, 73.06%, 63.82%, 38.84% less delay during 50% malicious routing environment when analyzed to the existing models, like enhanced hybrid secure multipath routing protocol for MANET (BC-SDOR-MANET-GAHC), an improved ad hoc on-demand distance vector routing security approach based on BC technology in MANET (BC-SDOR-MANET-AODV-MQS) and block chain-based better approach for the mobile ad-hoc networking protocol using ensemble algorithm (BC-SDOR-MANET-E-BATMAN) methods.

Multipath Load Balancing in MANET via Hybrid Intelligent Algorithm

The Mobile Adhoc Network (MANET) is a vital network that is vulnerable to energy and security restrictions. Because of node mobility, building a routing protocol to offers an effective and acceptable means of routing data with minimum packet loss, less energy consumption, and extending network lifetime has become a difficult challenge in MANETs. Most of the current MANET routing protocols lack the strategy of precise load-balancing. A recent survey on load distribution in MANET shows shortest-path MANET routing protocols using centrally located nodes in many routes. Since few nodes have to carry excessive loads, congestion increases, leading to undesirable effects such as long delays, lower packet delivery, and higher routing overhead, which shows the need for proper balancing models. In this work, multipath load balancing with the proposed NUSOA is used in MANETs to reduce energy usage and packet loss. Here, the data packets are distributed through gateway nodes, which are selected by the various features such as path cost, link cost, residual energy, and distance. Proposed hybrid optimisation termed as Namib Updated Shepherd Optimisation Algorithm (NUSOA) which is the mixture of both Namib Beetle Optimisation (NBO) and Shuffled Shepherd Optimisation Algorithm (SSOA) to choose optimal gateway nodes. Moreover, the optimal path is chosen based on load balancing with the constraints of congestion detection and node availability of the path using the proposed hybrid optimisation.

An adaptive intelligent routing algorithm based on deep reinforcement learning

A mobile ad hoc network (MANET) is a self-organizing network composed of multiple mobile nodes. These nodes achieve distributed communication and wireless resource sharing through autonomous collaboration. However, typical routing protocols for MANETs suffer from uneven network load, low network throughput, poor anti-destruction performance, and low transmission reliability. In order to meet the routing protocol characteristics of distributed adaptability, reliability and anti-destruction, balance of load and energy consumption and guarantee of high QoS in MANETs, this paper proposes an adaptive intelligent routing algorithm based on the PER-D3QN model of deep reinforcement learning. To achieve better routing strategy selection, the routing problem is first modeled, a distributed multi-agent reinforcement learning routing framework is designed, and a deep reinforcement learning reward function considering multiple factors is used. Next, the implementation process of the adaptive intelligent routing algorithm using the PER-D3QN model is described in detail. Finally, a mobile self-organizing network environment was constructed based on Networkx, and corresponding data was collected to simulate the algorithm. The simulation results show that the adaptive intelligent routing algorithm proposed in this paper can balance the energy consumption of the network and the load of nodes, its average remaining energy has increased by more than 10% and PL is reduced by at least 10% compared to other algorithms, while guaranteeing high QoS performance of routing, that is, reducing the average end-to-end delay of data packet transmission by over 22% compared to other algorithms and maintaining a high packet delivery ratio.

Simulative Analysis of Column Mobility Model for Proactive and Reactive Routing Protocols in Highly Dense MANET

Abstract: One of the most promising fields of research in recent years is Mobile Ad Hoc Networks (MANET). The well-known advantages of the internet for specific types of applications lead to the fact that it is a wireless ad-hoc network. As a result, such networks can be utilized in circumstances where no other wireless communication infrastructure is present. A MANET is a network of wireless devices without any centralized control. A device can directly communicate with other devices using a wireless connection. For nodes that are located far from other nodes, multi-hop routing is employed. The functionality of route-finding is performed by routing protocols. The mobility model creates the movement pattern for nodes. This article discusses early research to address concerns about performance indicators for MANET routing protocols under the Column Mobility Model (CMM). Moreover, we discuss concerns regarding the designs of the related work, followed by the designed CMM model on the behavior of routing protocols.

Performance Evaluation of MANETs routing protocols for transmitting video

Transmitting video over Mobile Ad hoc Networks (MANETs) is the most challenge because of the dynamic of its topology and the mobility of its nodes. These networks operate without a fixed physical infrastructure, allows wireless nodes to seamlessly connect or disconnect at any time. Additionally, the nodes in these networks are capable of self-organization. That makes routing process more difficult than traditional networks in addition to needing high bandwidth requirements to complete video transmitting process. This research investigates and assesses the performance of several commonly utilized standard routing protocols in MANETs, including AODV, DSDV, OLSR, and DSR. The evaluation is conducted across a range of wireless node quantities, spanning from 10 to 100, and tested on many performance metrics such as PDR, ETE delay, Packets Delay Variation (jitter), Data Dropped (DD), Throughput, and routing Overhead, the simulation results are analyzed to determine the most suitable routing protocols among them and overcome the video transmitting. Results shows that OLSR routing protocol is better from others tested protocols in almost performance metrics for video transmitting. Standard routing protocols have many resources constraints that may cause a link failure, when using it in multimedia applications it needs more power consumption and more bandwidth. The performance study simulated with ns3 simulator.

Irregularity Behaviour Detection - Ad-hoc On-Demand Distance Vector Routing Protocol (IBD - AODV): A Novel Method for Determining Unusual Behaviour in Mobile Ad-hoc Networks (MANET)

All the communication in the mobile ad-hoc network (MANET) will depend on the intermediate neighbour nodes or router nodes. Routing protocol is very important in MANET, because all the communication will be done in the MANET depending on the neighbour or intermediate node. If the intermediate node is a malicious node, all the data will be lost or changed by the intermediate or malicious node. Ad-hoc On-demand Distance Vector routing protocol is one of the moderate routing protocol in MANET. The Ad-hoc On-demand Distance Vector Routing protocol does not have any security mechanism. This work is going to find the Irregularity Behaviour Detection (IBD) over the Ad-hoc On-Demand Distance Vector Routing (AODV) protocol. IBD is finding a trusted node by using the trust value (TV) of the node. This TV includes network performance, node energy level, and node position value. IBD-AODV is implemented and tested in the OmNetpp 6.0 simulator.

ADAPTIVE SECURE AND EFFICIENT ROUTING PROTOCOL FOR ENHANCE THE PERFORMANCE OF MOBILE AD HOC NETWORK

Nowadays Mobile Ad Hoc Network (MANET) is an emerging area of research to provide various communication services to end users. Mobile Ad Hoc Networks (MANETs) are self-organizing wireless networks where nodes communicate with each other without a fixed infrastructure. Due to their unique characteristics, such as mobility, autonomy, and ad hoc connectivity, MANETs have become increasingly popular in various applications, including military, emergency response, and disaster management. However, the lack of infrastructure and dynamic topology of MANETs pose significant challenges to designing a secure and efficient routing protocol. This paper proposes an adaptive, secure, and efficient routing protocol that can enhance the performance of MANET. The proposed protocol incorporates various security mechanisms, including authentication, encryption, key management, and intrusion detection, to ensure secure routing. Additionally, the protocol considers energy consumption, network load, packet delivery fraction, route acquisition latency, packets dropped and Quality of Service (QoS) requirements of the applications to optimize network performance. Overall, the secure routing protocol for MANET should provide a reliable and secure communication environment that can adapt to the dynamic nature of the network. The protocol should ensure that messages are delivered securely and efficiently to the intended destination, while minimizing the risk of attacks and preserving the network resources Simulation results demonstrate that the proposed protocol outperforms existing routing protocols in terms of network performance and security. The proposed protocol can facilitate the deployment of various applications in MANET while maintaining security and efficiency.

Mobile wireless ad-hoc network routing protocols comparison for real-time military application

Mobile wireless Ad-hoc has become more popular because it forms quickly, has an easy setup, and has easy extensibility. The mobile ad-hoc wireless networks can be further classified according to their applications as follows: Regular user ad-hoc networks are commercial communication that applies to vehicles to help avoid collisions and accidents and live connections to transfer data from car to car. Another application is disaster rescue ad-hoc networking, usually used when a normal infrastructure network is destroyed by storms, earthquakes, tsunamis, etc. Nowadays, a lot of applications, particularly those related to the military and emergency situations, rely on mobile ad hoc wireless networks, where security needs are more challenging to provide than in regular networks. We present the tactical network needs for the military. This platform attempts to assess the possible advantages of mobile ad hoc networks in tactical military applications. This work proposes route discovery using reactive (on-demand) routing protocols where nodes need to just transfer data. This eliminates the requirement for each node to store and maintain any routing tables. This study presents and contrasts the benefits and drawbacks of two fundamental mobile ad hoc routing systems (AODV and DSR). Both protocols are On-Demand routing techniques, and when data needs to be sent, the discovery phase begins. The results of the simulation, the AODV routing approach outperforms the DSV routing method under identical simulated conditions.

The Effectiveness of Dynamic Probabilistic Flooding in On-Demand Routing Protocols for MANETs was Assessed Through a Performance Analysis

In mobile ad hoc networks (MANET), broadcasting is widely used in route discovery and many other network services. The efficiency of broadcasting protocol can affect the performance of the entire network. As such, the simple flooding algorithm aggravates a high number of unnecessary packet rebroadcasts, causing contention and packet collisions. Proper use of probabilistic method can reduce the number of rebroadcasting, therefore reduce the chance of contention and collision among neighboring nodes. A good probabilistic broadcast protocol can achieve high save rebroadcast and low collision. In this paper, we propose a dynamic probabilistic approach when nodes move according to way point mobility and compare it with simple flooding AODV and fixed probabilistic scheme. Our approach dynamically set the rebroadcasting probability according to the number of nieghbors nodes distributed in the ad hoc network. Simulation results show our approach performs better than both simple flooding and fixed probabilistic flooding.

Performance Improvement of AODV in Wireless Networks using Reinforcement Learning Algorithms

This paper investigates the application of reinforcement learning (RL) techniques to enhance the performance of the Ad hoc On-Demand Distance Vector (AODV) routing protocol in mobile ad hoc networks (MANETs). MANETs are self-configuring networks consisting of mobile nodes that communicate without the need for a centralized infrastructure. AODV is a widely used routing protocol in MANETs due to its reactive nature, which reduces overhead and conserves energy. This research explores three popular Reinforcement Learning algorithms: SARSA, Q-Learning and Deep Q-Network (DQN) to optimize the AODV protocol's routing decisions. The RL agents are trained to learn the optimal routing paths by interacting with the network environment, considering factors such as link quality, node mobility, and traffic load. The experiments are conducted using network simulators to evaluate the performance improvements achieved by the proposed RL-based enhancements. The results demonstrate significant enhancements in various performance metrics, including reduced end-to-end delay, increased packet delivery ratio, and improved throughput. Furthermore, the RL-based approaches exhibit adaptability to dynamic network conditions, ensuring efficient routing even in highly mobile and unpredictable MANET scenarios. This study offers valuable insights into harnessing RL techniques for improving the efficiency and reliability of routing protocols in mobile ad hoc networks.

Impact of Jellyfish attack on routing protocols in TCP-based MANETs

Mobile ad-hoc networks (MANETs) are self-organized infrastructure-less network of mobile wireless devices that could be deployed for communication. Due to the insecure wireless communication medium, multi-hop routing communication process, and dynamic behavior of the nodes in MANETs, routing protocols are vulnerable to various security attacks, such as Jellyfish attacks. A Jellyfish node targets TCP-based MANET and exploits its working mechanism to degrade the communication performance. This attack is hard to detect since it is a TCP protocol compliant methodology.In this paper, we evaluate the performance of the Ad hoc on-demand vector (AODV), Dynamic source routing (DSR), Temporally ordered routing algorithm (TORA), Geographic routing protocol (GRP), and optimized link state routing (OLSR) routing protocols under the Jellyfish delay variance attacks for TCP-based MANETs. Further, the TAHOE, RENO, and SACK variants of TCP protocol are considered for comparison. These routing protocols are simulated using the OPNET simulator to compare their performance, using specific performance metrics on the network. The experimental results show that the AODV protocol performs better than the DSR, TORA, OLSR, and GRP protocols under the jellyfish delay variance attack. Further, the SACK TCP variant performs better than the other TCP variants under the Jellyfish delay variance attack.

Performance evaluation of dynamic source routing protocol with variation in transmission power and speed

<span lang="EN-US">Mobile ad-hoc network (MANET) is a set of mobile wireless nodes (devices) which is not rely on a fixed infrastructure. In MANETs, each device is responsible for routing its data according to a specific routing protocol. The three most common MANET routing protocols are: dynamic source routing protocol (DSR), optimized link state routing protocol (OLSR), and ad-hoc on-demand distance vector (AODV). This paper proposes an efficient evaluation of DSR protocol by testing the MANETs routing protocol with variation in transmission power at different speeds. The performance analysis has been given using optimized network engineering tools (OPNET) modeler simulations and evaluated using metrics of average end to end delay and throughput. The results show that the throughput increases as the transmission power increases up to a certain value after which the throughput decreases, also the network work optimally at a certain transmission power which varied at different speed.</span>

Improved Hybrid Routing Protocol (IHRP) in MANETs Based on Situation Based Adaptive Routing

Without the need of a fixed foundation or base station, the Mobile Ad hoc Network creates its own wireless network. One of the most troublesome aspects of Mobile Ad hoc Network (MANET) is the occurrence of unexpected loss of network connectivity. As a result of this problem, packets continue to drop, and we must restore the connection by sending Route Request (RREQ) and Route Reply (RREP). As a result, network performance will suffer yet another setback. We used the scenario routing technique to combine the Dream Multipath Routing (DMR), Ad hoc on-demand multipath distance vector (AOMDV), Optimized link-state routing (OLSR), and Ad-hoc on Demand Vector (AODV) routing protocols to build the IHRP routing protocol in this work. According to previous studies, (AODV) is more suited when node motion is high. The purpose of DREAM Multipath Routing (DMR) is to maintain node mobility and location information coordinated. Route packet flooding is prevented by computing the expected chance of node relocation. The number of mobile nodes in the wireless network fluctuates, and the DMR operates on each one individually. In the network, each node maintains a list of nearby nodes and their current locations. Using the AOMDV routing protocol is effective for load balancing and preventing congestion on the network. OLSR is a good fit for networks that priorities link reliability above other considerations when routing traffic. When using the aforementioned (DMR, AODV, AOMDV, and OLSR) protocols to create the IHRP routing protocol, we are capable of better regulation of network behavior and perform. In the case of 100 nodes, data is sent for analysis for The Improved Hybrid Routing Protocol (IHRP), Zone Routing Protocol (ZRP), AOMDV, AODV, and OLSR routing protocols. For data send, the performance of IHRP, ZRP, AOMDV, AODV, and OLSR is 11513, 10240, 10225, 10558, and 9184, respectively, and for 50 nodes, the performance of IHRP, ZRP, AOMDV, AODV, and OLSR is 11151, 9807, 9636, 9586, and 7470, respectively. Thus, with 100 and 50 nodes, the Improved Hybrid Routing Protocol (IHRP) outperforms the AOMDV, ZRP, AODV, and OLSR routing protocols. In the case of 100 nodes and 50 nodes, the data receive analysis for IHRP, ZRP, AOMDV, AODV, and OLSR routing protocols is 11513, 10240, 10225, 10558, and 9184, respectively, and 9367, 8714, 8370, 6730, and 7298, respectively, So IHRP also receives data faster than ZRP, AOMDV, AODV, and OLSR routing protocols. The IHRP outperforms AOMDV, AODV, ZRP, and OLSR routing protocols in terms of data transmit, receive, data drop, PDR, throughput, E-E latency, and NRL.

Comparative Study and Performance Analysis of MANET Routing Protocol

MANET (Mobile ad hoc networks) are famous in research due to their ad hoc nature and effectiveness during calamities across continents when no framework support is free. Wireless network interfaces have a limited transmission range; nodes may require multiple network hops to trade information across the organization. Each versatile node functions like a switch in such an organization, sending details to the other portable connected nodes. The nodes should not interrupt communication and associate themselves with the correct information transfer. Another significant issue was the development of expandable route discoveries capable of assessing rapid topography variations and numerous network detachments caused by high vehicle quality. This research article describes extensive technological changes, including the components and flaws of current progressive routing algorithms. Routing protocols designed for wired networks, such as the distance vector or connection state conventions, are inadequate for this application because they assume fixed geography and high overheads. This research article includes the MANET-supported routing protocols and their performance analysis across various performance parameters such as packet delivery ratio, average throughput, residual energy, and delay.