EVALUATING THE PERFORMANCE OF THE LOCATION-AIDED ROUTING-1P ROUTE DISCOVERY ALGORITHM
Ali Maqousi and Hussein Al-Bahadili
DOI : 10.3844/jcssp.2014.423.433
Journal of Computer Science
Volume 10, Issue 3
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.
© 2014 Ali Maqousi and Hussein Al-Bahadili. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.