Refining Location-Aided Routing (LAR) through Proactive Algorithm

Abstract

One of the weaknesses in Location-Aided Routing (LAR) is the delay due to partial flooding of data packets throughout the ad hoc network during route discovery. Systematic literature review indicates that very little or no studies conducted to seek a solution to this routing weakness in LAR. This study proposes introduction of periodic updates of location information among the nodes as a solution to minimizing latency. Proactive-LAR (P-LAR) eliminates partial flooding, thus reducing latency while advancing routing performance of traditional LAR. As a research scope, this study uses Angle of Arrival (AoA), Time of Arrival (ToA), Time Difference of Arrival (TDoA) and the expected distance of nodes and the direction of movement as the only location information details. Moreover, the simulation on OMNET ++ is limited to the initial expected zone of LAR Scheme 1. Simulation of the modified LAR Scheme 1 algorithm indicates that inclusion of proactivity as an algorithmic aspect of LAR augments general data packets throughput, latency, packets delivery ratio while minimizing the number of packets dropped. Nodes mobility in simulation was considered stationary. The simulation results—as analyzed through RapidMiner, suggest that proactive algorithmic element in LAR routing algorithm can potentially minimize partial flooding thus improving routing performance while minimizing routing overheads such as jitter and delay.