Location-Aided Routing Scheme Research Articles

Refining Location-Aided Routing (LAR) through Proactive Algorithm

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.

Minimizing Routing Overheads in Zone Routing Protocol (ZRP); Replacing Zone Radius with Node Location Information

There are many routing protocols suggested for use in Mobile Ad Hoc Networks (MANETs). Among them (the routing protocols) is the Zone Routing Protocol (ZRP). ZRP uses the concept of zones to ensure that proactive activities are limited to a defined area around a node. The zone is determined by the radius (hops). By limiting a proactive zone on the radius, the transmission of data packets is made effective. However, any node that resides beyond the zone, is reachable reactively. The literature review indicates that one of the shortcomings in ZRP is the overlapping of zones. Furthermore, the exercise of determining zone radius is complicated. The overlapping of zones occurs because individual nodes and their zones are determined by a hop-count radius. Consequently, this overlapping of zones leads to increased routing overhead in ZRP. In an effort to resolve zone overlapping and thus reduce routing overheads, this study suggests the application of the Location-Aided Routing (LAR) Scheme I in the Interzone Routing Protocol (IARP) scheme of ZRP. By applying LAR Scheme 1 algorithm, the need for a hop-count-based radius is eliminated. Location information of nodes in IARP ensures that zones do not overlap, resulting in reduced routing overheads. This study simulates elementary parameters of delay, drop rates, deliver ratio, and the general throughput of ZRP based on the number of nodes, the area, and the size of the data packets. The conventional algorithm of ZRP was rendered on NS-2 and while the nodal-location enhanced ZRP algorithm on OMNET++. Simulation results suggest that the positionally enhanced ZRP algorithm minimizes zonal overlapping hence better data packets throughput, minimized delay and drop rates, and augmented data packets delivery ratio.

Minimize the routing overhead through 3D cone shaped location-aided routing protocol for FANETs

Recently, designing an effective routing protocol is challenging for flying ad-hoc networks (FANETs) due to the versatile nature of unmanned aerial vehicles (UAVs). Position-based routing schemes are seen to be a remarkable preference for routing in FANETs due to the fact that the geographical information of UAVs is readily available. In this paper, we are interested in the modification of the location-aided routing (LAR) that we call 3D cone shaped location-aided routing (3DC-LAR) a position-based routing (PBR) protocol. In the existing LAR scheme, a route discovery process done through the concept of request zone, in which only nodes presents in the request zone will forward the route request for transmitting the data. The proposed 3DC-LAR scheme modified the definition of request zone using 3D cone shape by intermediate UAVs in FANETs environment. The simulation results reveal that the proposed 3DC-LAR scheme has contributed to lead to an improvement in the terms of routing overhead.

EVALUATING THE PERFORMANCE OF THE LOCATION-AIDED ROUTING-1P ROUTE DISCOVERY ALGORITHM

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.

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

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.

Performance Evaluation of the LAR-1P Route Discovery Algorithm

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.

An Effective Location-Based Power Conservation Scheme for Mobile Ad Hoc Networks

Problem statement: One of the major issues in current reactive routing protocols for Mobile Ad Hoc Networks (MANETs) is the high bandwidth and power consumptions during the routing process. In this study, we proposed and evaluated the performance of an efficient Location-Based Power Conservation (LBPC) scheme for MANETs. Approach: In this scheme, the transmitting node utilized the location-information of the first-hop neighbors to adjust its radio transmission range according to one of the following criteria: Farthest first-hop neighbor, average distance of the first-hop neighbors and a random distance between the nearest and the farthest first-hop neighbors. Results: A number of simulation were carried-out to evaluate the power conservation ratio that can be achieved for two route discovery algorithms, namely, pure flooding and Location-Aided Routing Scheme 1 (LAR-1) algorithms. Conclusion: The simulation results demonstrated that the scheme can provide power conservation ratios between 10-50% without adding any extra overheads or complexity to the routing algorithm.