Performance Evaluation of the LAR-1P Route Discovery Algorithm

Abstract

The location-aided routing scheme 1 (LAR-1) and probabilistic algorithms were combined together into a new algorithm for route discovery in mobile ad hoc networks (MANETs) called (LAR-1P) [1]. Simulation results demonstrated that, on network scale, for a uniform random node distribution and for a specific simulation setup (time); the LAR-1P algorithm reduces the number of retransmissions as compared to LAR-1 at a cost of insignificant reduction in the average network reachability. However, on zone scale, the algorithm provides an excellent performance in high-density zones, while in low-density zones; it almost preserves the performance of LAR-1. This paper provides a detail analysis of the performance of the LAR-1P algorithm through various simulations, where the actual numerical values for the number of retransmissions and reachability in high- and low-density zones are estimated to demonstrate the effectiveness and significance of the algorithm and how it provides better performance than LAR-1 in high-density zones. Furthermore, the effect of the total number of nodes on the average network performance is also investigated.