AGDT: A Mathematical Model of Hybrid Algorithm for Efficient Routing in MANETs Using Dynamic Thresholds

Main Article Content

Archana Kumari, Raghavendra Patidar, Surendra Kumar Yadav

Abstract

Due to the high mobility of nodes in the dynamic topology of Mobile Ad Hoc Networks (MANETs), it is challenging to define the precise position of a node in the network for effective data delivery. The paperproposed a hybrid algorithm for routing in MANETs called Adaptive GPSR with Dynamic Thresholds (AGDT). AGDT is a novel approach that combines the GPSR routing protocol with a dynamic threshold-based approach to increase the enactment of the network. The algorithm employs distance and direction-based thresholds to determine when to switch between GPSR and a perimeter-based approach for routing. The paper discusses the implementation of the algorithm and provides a performance evaluation of its effectiveness in comparison to other present routing algorithms. The results show that AGDT outperforms other protocols in terms of packet delivery ratio, end-to-end delay, and throughput. The paper concludes by highlighting the potential applications and benefits of the AGDT algorithm in MANETs.

Article Details

Section
Articles