An Optimized and Energy-Efficient Ad-Hoc On-Demand Distance Vector Routing Protocol Based on Dynamic Forwarding Probability (AODVI)

Abstract

MANET (mobile ad-hoc network) is a wireless ad-hoc network made up of mobile devices that use peer-to-peer routing to provide network access instead of using a preexisting network infrastructure. Despite the network infrastructure’s simplicity, it faces issues such as changeable connection capacity, dynamic topology, node battery power exhaustion, and inadequate physical security. Broadcasting is a standard MANET approach for sending messages from a source node to all other nodes in the network. Flooding is a frequent method for broadcasting route request (RREQ) packets, which is susceptible to broadcast storms. The high retransmission rate is caused by the standard flooding technique, which causes media congestion and packet collisions, which can drastically reduce throughput and network performance. In a mobile ad-hoc network, efficient broadcasting focuses on selecting a compact forward node set while assuring broadcast coverage. The goal is to find a limited number of forward nodes that will provide complete coverage. In this paper, we propose an optimized and energy-efficient routing protocol for MANET (mobile ad-hoc network) based on dynamic forwarding probability in general and AODV (ad hoc on-demand distance vector) in particular, in which the route request packets are randomly controlled to increase the network lifetime and reduce packet loss in the flooding algorithm. We tested and assessed the results of our proposed solution using various network performance factors after implementing and integrating it into NS-2. According to simulation findings, our proposed technique effectively reduced route request propagation messages (RREQ). The suggested technique is more efficient, has a longer network lifetime, and uniformly utilizes node residual energy, enhancing network throughput and minimizing routing overhead when compared to regular and modified AODV protocols.