Analyzing the Effect of Node Density on the Performance of the LAR-1P Algorithm

Abstract

The location-aided routing scheme 1 (LAR-1) and probabilistic algorithms are combined together into a new algorithm for route discovery in mobile ad hoc networks (MANETs) called LAR-1P. Simulation results demonstrated that the LAR-1P algorithm reduces the number of retransmissions as compared to LAR-1 without sacrificing network reachability. Furthermore, on a sub-network (zone) scale, the algorithm provides an excellent performance in high-density zones, while in low-density zones; it preserves the performance of LAR-1. This paper provides a detailed 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 were computed to demonstrate the effectiveness and significance of the algorithm and how it provides better performance than LAR-1 in high-density zones. In addition, the effect of the total number of nodes on the average network performance is also investigated.

Evaluating the Performance of the Location-Aided Routing-1p Route Discovery Algorithm

“…Later on, Al-Bahadili (2013) developed a new version of LAR-1P with dynamic probability, which will be described later. The effect of node density on the performance of the LAR-1P algorithm was investigated by Al-Bahadili et al (2012).…”

“…1a). Additionally, RZ may also include other regions around RZ (Al-Bahadili et al, 2012). Note that the probabilities of finding a path (in the first attempt) can be increased by increasing the size of RZ.…”