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

Abstract

Dynamic Routing Protocols (DRPs) are widely-used for routing information among mobile nodes in Mobile Ad Hoc Network (MANET) and establish and maintain connectivity within the network. A DRP comprises two main phases: route discovery and route maintenance. The route discovery phase involves transmission of large number of redundant control packets consuming significant portion of the nodes power and increase communication overheads. Recently, a new efficient and effective route discovery algorithm has been developed, namely, the LAR-1P algorithm, which combines two well-known routing protocols; these are: The Location-Aided Routing scheme 1 (LAR-1) and probabilistic algorithms. This study evaluates and compared the performance of the LAR-1P algorithm against the performance of a number of route discovery algorithms through simulation. For each simulation, the number of retransmissions and reachability are estimated and compared. The simulations results demonstrated that LAR-1P provides better performance than all other algorithms it is compared with, as it significantly reduces communication overheads while maintaining almost the same network connectivity.