Efficient MANETs Routing Algorithm to Mitigate Latency Based on AODV

Mobile Ad hoc Network (MANET) is a self-organizing and self-configuring network that enables mobile devices to communicate in locations without a pre-existing communication infrastructure. To satisfy applications requiring QoS, like multimedia communication and online games, the quality of service (QoS) parameters delay, overhead, throughput, and packet loss must be predefined in this network. Therefore, a routing protocol with QoS support that determines the best routing path between two or more mobile devices is required. Therefore, in this paper, we present an effective routing protocol for Mobile Ad hoc Networks (MANETs) that reduces latency by altering the header fields of the original MANET routing protocol to take path delay into account during path selection using node buffer information in addition to hop count. Using Network Simulator-2.35, the proposed Q-learning Ad Hoc On-Demand Distance Vector (QL-AODV) routing protocol is simulated, and comparisons are made between its performance and that of the current AODV and HT-AODV based on the packet delivery ratio, normalized routing overhead, and average end-to-end delay for various network densities. The simulation results demonstrate that in terms of end-to-end delay, packet delivery ratio, and normalized routing overhead, the proposed QL-AODV performs better than the current AODV and HT-AODV. For instance, the QL-AODV simulation results demonstrated an average improvement of 4 point 43 and 2 point 65 percent in end-to-end delay and packet delivery ratio, respectively, when compared to the AODV.