JASC: JOURNAL OF APPLIED SCIENCE AND COMPUTATIONS ISSN NO: 0076-5131

Implementation and Comparison of Location Aware Routing Protocol with

Existing AODV Routing Protocol Using Network Simulator

Pushpa1, Mr. Sudesh Jakhar2

PG Scholar, BRCM College of Engineering & Technology, Haryana, India
1

2 Head of Dept. Computer Science & Engineering, BRCM College of Engineering & Technology, Haryana, India

Abstract - Vehicular Ad Hoc Network (VANET) is a recently developed technology to achieve traffic safety and
efficiency purposes through inter-vehicle communications, where the routing protocols in VANETs play a very important role.
In this paper, we propose an adaptive strategy based on the combination of these two situation using greedy perimeter and
right hand rule in adaptive algorithm and then apply this strategy to Location-Aided Routing (LAR) protocol to keep the
routing performance from degradation. In the adaptive strategy we use the Multiple Attribute Decision Making like sorting
based on hop count and store neighbor history to establish the path to transmit information which can accommodate message
transmission to the circumstances dynamically. Location services help vehicles to get aware of the traffic information and thus
location-aided routing protocol can improve the packet delivery ratio. Theoretical analysis and simulation performance prove
that this strategy can improve the packet delivery ratio (PDR) of LAR protocol effectively. We seek to improve the stability of
path between sources and destinations by removing from the paths the nodes that move in opposite direction of the source
movement. The performance metrics such as average delay of stability path between source and destination, packet delivery
ratio (PDR), throughput, and normalized routing load (NRL) are measured using ns2.

Key Words: VANET, LAR, PDR, NRL, AODV, V2V, GPS

1. INTRODUCTION
Vehicular Ad-hoc network provide many improvements in terms of accident avoidance, better utilization of roads, traffic
management and resources such as time and fuel, and new opportunities for entertainment applications. In the VANET
vehicles are taken as nodes that are connected to each other in the form of a wireless network called “vehicular ad hoc
network”. For transferring between vehicles the CBR (Constant bit rate) and TCP (Transmission control protocol) are the
traffic agent is used. Vehicular ad hoc network is the major part of the intelligent transport system. VANET have two types of
communication 1) Vehicle to Vehicle (V2V) 2) Vehicle to Infrastructure (V2I) that is road side unit. Vehicle to Vehicle
communication uses multi-hop or multi cast technique and it use two type of broadcasting first is naive broadcasting in which
vehicle send broadcast message periodically and at regular interval upon receipt of the message, the vehicle ignores the message
if it has come from a vehicle behind. If the message comes from a vehicle in front, the receiving vehicles send it own broadcast
message to vehicle behind it. Limitation of this broadcasting is that large numbers of broadcast message are generated. So
message collision risk. Second, Intelligent broadcasting remove this message collision risk. By taking an example we can easily
understand, if a car spot a dangerous road situation such as black ice, it transmit the information to car behind it, that might be
heading in the direction of danger. Routing protocols are used to provide the communication by routing the data among
vehicles. Second is the Vehicles to Roadside unit communication. In which vehicles send and receive the data from Road Side
Unit (RSU) that is fixed along the side of road. In the VANET vehicles (nodes) itself taken as router. Firstly systems that will
integrate this technology are police and fire vehicles to communicate with each other. The roadway system effect the life of
every person so for saving the accident and for traffic management the vanet is important in the Intelligent Transportation
System (ITS).

VOLUME 5 ISSUE 5 MAY-2018 PAGE NO:115

JASC: JOURNAL OF APPLIED SCIENCE AND COMPUTATIONS ISSN NO: 0076-5131

2. REVIEW OF ROUTING PROTOCOLS

A routing protocol is used for transmitting the data packet from source to destination networks. These protocols find a route
for packet delivery and deliver the packet to the correct destination. Ad-Hoc network routing protocols are commonly divided
into three main classes: Proactive, reactive and hybrid protocols.

2.1 Proactive Protocols

Proactive routing protocols maintain routing information about all possible destinations by periodically sharing information
among the nodes of the network. Network routing information depends on the topology of a mobile ad hoc network which
may change for several reasons, including node mobility, the discovery of new nodes, node failure and node departures. Any
change in the topology of the network is followed by an update of the routing information in the routing tables of all the nodes
in the entire network. The nodes in the network maintain all routes even if a route is not currently being used by any
communication channel. Proactive protocols are better suited for static or slow changing topology networks but they do not
scale well for constantly changing topologies such as those in mobile ad hoc networks [1]. Examples of proactive routing
protocols include Destination Sequenced Distance Vector (DSDV) [2] and Optimized Link State Routing Protocol (OLSR) [3].

2.2 REACTIVE PROTOCOLS

Reactive protocols do not constantly maintain the routing information for the entire network. The routing information in a
reactive protocol is updated according to the current needs of the communicating nodes. This method reduces bandwidth
usage compared to proactive protocols but may result in an initial delay in packet delivery due to the route discovery process
required in order to establish communication. Reactive protocols maintain only the routes that are currently in use of the
network. The routes currently in use may be only a small subset of all the possible routes and thus save a considerable amount
of overhead from the network. On the other hand, in the case of mobile nodes, the established routes may quickly become
outdated and require frequent updates, which generates extra network traffic overhead [4].

2.3 HYBRID PROTOCOLS

Some protocols use the concepts of both proactive and reactive protocols in an attempt to minimize network overhead and
improve scalability. In hybrid protocols, a subset of nodes maintain routing information proactively whereas others respond
reactively to network requirements. One possible combination is the use of local routing on a proactive basis and global routing
on a reactive basis. However, hybrid combinations still must maintain the routes that are currently in use, which limits the
changes in topology that can be tolerated by the protocol. Examples of hybrid protocols are Zone Routing Protocol (ZRP) [5]
and Adaptive Distance Vector Routing ADV [6].

3. LOCATION BASED ROUTING PROTOCOL

To make routing decision this type of approach uses the geographic position of nodes. We can use GPS or some other
mechanism to obtained Location information. One of geographical-based routing protocols is location-aided routing (LAR) [7].
Here route request packets are limitedly flooded in a small group of nodes which belong to a request zone. To obtain this
request zone, we have to obtain first the expected zone of the destination node. In route discovery phase, route-request packets
contain the location information of source and destination and then this packet is broadcasted to all the nodes within the
request zone. Or we can say that the nodes which are in the request zone forward the message, and the nodes which are not in
the request zone discard the message. When a route request packet reach to the destination, the destination replies with a route
reply packet which contains the current location of the destination node. These neighboring nodes forward the route request to
their neighbors, and this goes on until route request reach the destination node. The procedure of route discovery in LAR is:
The source puts the location information of itself and the destination in the routing request packet. Then routing request
packet is broadcast within the request zone. In other words, the nodes within the request zone forward the message, others
discard the message. When a route request packet reach to the destination, the destination replies with a route reply packet
which contains the

VOLUME 5 ISSUE 5 MAY-2018 PAGE NO:116

JASC: JOURNAL OF APPLIED SCIENCE AND COMPUTATIONS ISSN NO: 0076-5131

Destination
source

Request Zone Expected Zone

Fig -1: Location aided routing protocol

current location of the destination node. If LAR is unable to find the route to the destination due to some error, then the
routing protocol will flood a routing message throughout the network.

4. THE ADAPTIVE STRATEGY FOR LAR PROTOCOL

The main objective of this work is to apply an effective routing protocol to the VANETs that can provide high packet delivery
ratio, high throughput, low end to end delay and reduce overhead. To eliminate the influence of the dynamically changing
topology, a detailed description to the adaptive strategy will be given in this section.

4.1. Decision Function

The function is built by multiple attribute of decision making using right hand rule, which is associated with the density of the
network, the velocity of vehicles and the transmission load, etc. It is proposed to directly reflect the dense degree of the
network and control the data transmission reactively. This function has two main effects involving cutting down the number of
forwarding nodes in dense networks and prolong the timeout of the message in sparsely connected networks.

4.2. Routing Protocol with Adaptive Strategy

The routing protocol proposed is based on the location aided routing with application of the adaptive strategy. Firstly, location
service process is carried out. In LAR, the source node requests the destination node’s location information, such as position,
speed and moving direction, etc. After that the intermediate nodes will reply to this request if they already have the needed
information, otherwise they will deliver this request and their own location information to other intermediate nodes of next
hop.

Fig-2: Adaptive Location-Aided Routing protocol

This procedure will continue until the request is replied. And then, besides the source node, each relevant intermediate vehicle
will acquire the location information of other vehicles including the destination node. And finally, the source node is allowed to
disseminate messages by LAR to the destination node with parameters that have already been set up. The visual representation
of this routing protocol can be viewed as shown in Fig-2.

VOLUME 5 ISSUE 5 MAY-2018 PAGE NO:117

JASC: JOURNAL OF APPLIED SCIENCE AND COMPUTATIONS ISSN NO: 0076-5131

LAR is an idea which is used by utilizing the node hosts location information. Such information about location may be known
by using Global Positioning System. Two flooded sections are used by LAR, the expected section and forwarded section. LAR
protocol reduce the search space by using location information for an expected route. By limiting the search space we decreases
the number of route finding messages [8]. When an origin vertex needs to transfer data packets to a location, the origin vertex
first find the position of the destination mobile vertex by communicating with a location service responsible for the mobile
vertices position. This creates a tracking problem and connection problems [9, 10]. The two LAR algorithms had developed
LAR scheme 1 and scheme 2. Scheme 1 use predicted location of the destination also known as predicted zone which is require
to decide the request zone at the time of discovering the route. On the other hand, LAR scheme 2 uses distance from the
previous location of the destination as a parameter for defining the request zone. Thus, any intermediate node receiving the
route request forwards it if it is closer to or not much farther from the destination's previous location than node transfers the
request packet. Therefore, the implicit request zone of LAR scheme 2 becomes adapted as the route request packet is
broadcasted to various nodes. Following are the forwarding strategies:

Forwarding in Greedy manner Agreeing to the scenario represented in Fig-3, if forwarding strategy is used in greedy manner
then, source node forwards the packets to a node closest to the destination „D‟. In this case „S‟ sends packet to „A‟.

Improved forwarding in greedy manner In this scenario, source node first refers to its neighbour table and then computes
new expected position of all its neighbours based on direction and velocity and then selects a node which is closest to the
destination. „S‟ computes new expected position of its neighbours and suppose at time t2, vehicle „B‟ over takes the vehicle
„A‟, then „S‟ selects „B‟ as its next hop instead of „A‟.

Directional forwarding in Greedy manner Greedy approach can be used directionally by considering only those nodes
which are moving towards destination. It picks a node which is moving towards destination and is nearest to the destination.
Thus, it selects vehicle „B‟ as its next hop.

Greedy forwarding Predictive directional In this strategy, forwarding node keeps the information of its 2-hop neighbours.
Before forwarding the packet, forwarding node refers to its neighbour table and calculates expected position of all its
neighbours (1-hop and 2-hop neighbours) and then chooses a node whose one-hop neighbour is moving towards the
destination and is nearest to the destination. In this case, „S‟ selects vehicle „B‟ because its one-hop neighbour „S‟ is moving
towards destination „D‟.

Fig-3: Forwarding Strategy of Adaptive Lar Protocol

5. RESULTS
Here Fig-4 present the 20 nodes and each node communicate through each other and transfer data from one node to
another using Adaptive Location aided Routing protocol.

VOLUME 5 ISSUE 5 MAY-2018 PAGE NO:118

JASC: JOURNAL OF APPLIED SCIENCE AND COMPUTATIONS ISSN NO: 0076-5131

Fig -4: Simulation Scenario

5.1 End to End Delay
Simulation environment consists of five different numbers 10, 20, 30, 40, 50 nodes. chart-1 shows that the End to End Delay
of AODV and LAR and Adaptive-LAR routing protocols . End to End Delay of Adaptive-LAR is less as the LAR and AODV
routing protocol. So the performance of End-to-end delay is better of Adaptive-LAR protocol as compare to the LAR and
AODV routing protocol.

Chart -1: End to End Delay

5.2 Packet Delivery Ratio
Simulation environment consists of five different numbers 10, 20, 30, 40, 50 nodes. Chart-2 shows that the Packet delivery
ratio of Adaptive-LAR is better than the LAR and AODV routing protocol at every number of Nodes. So performance of
Adaptive-LAR is better than the LAR and AODV routing Protocol.

Chart-2: Packet Delivery Ratio

5.3 Throughput
Simulation environment consists of five different numbers 10, 20, 30, 40, 50 nodes. Chart-3 shows that the Throughput of
Adaptive LAR is better at 30, 40 and 50 nodes and AODV and LAR routing protocol perform better at nodes 10 and 20 as
compare to LAR-Adaptive. So the overall performance of Adaptive-LAR is better as compare to the LAR and AODV routing
Protocol.

VOLUME 5 ISSUE 5 MAY-2018 PAGE NO:119

JASC: JOURNAL OF APPLIED SCIENCE AND COMPUTATIONS ISSN NO: 0076-5131

Chart-3: Throughput
5.4 Overhead
Simulation environment consists of five different numbers 10, 20, 30, 40, 50 nodes. Chart-4 shows that the Overhead of
Adaptive-LAR is less as compare to the LAR and AODV routing protocol at every number of Nodes. So the performance of
Adaptive-LAR is better as compare to the LAR and AODV routing Protocol.

Chart-4: Overhead

6. CONCLUSIONS
We propose an adaptive strategy for Location-Aided Routing protocol in VANETs that could effectively keep the routing
performance from the degradation brought by the dynamically changing topology. Location services help vehicles to get aware
of the traffic information and thus location-aided routing protocol can improve the packet delivery ratio, throughput and all the
performance metrics. Right hand rule is used to adapt the transmission to the network circumstances reactively. In dense
networks, Right hand rule adds constraints for selecting forwarding nodes to achieve congestion control by reducing the total
number of forwarding vehicles. On the other hand, Greedy perimeter and right hand rule prolongs the timeout of messages in
sparse networks, which leads the routing to act like “store-carry-forward” opportunistic scheme and get higher packet delivery
ratio. Our theoretical analysis and simulation results show that this strategy can improve the packet delivery ratio of LAR
protocol effectively. However, this strategy is far from perfect for the improvement of throughput that is not satisfied especially
using Adaptive-LAR and LAR protocol. Some more effective measures of congestion control should be applied. And the
assumptions that distance and velocities independently obey uniform distribution restrict the application of this strategy to the
real traffic scenarios, because the velocities of a pair of vehicles are usually correlative, as well as the distance.

REFERENCES
[1] A. B. McDonald and T. F. Znati. "A mobility based framework for adaptive clustering in wireless ad-hoc networks", IEEE Journal on
Selected Areas in Communications, 17(8):1466–1487, 1999.
[2] C. E. Perkins and P. Bhagwat. "Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers", ACM
SIGCOMM Computer Communication Review, pages 234–244, 1994.

VOLUME 5 ISSUE 5 MAY-2018 PAGE NO:120

JASC: JOURNAL OF APPLIED SCIENCE AND COMPUTATIONS ISSN NO: 0076-5131

[3] P. Jacquet, P. Muhlethaler, and A. Qayyum et al. "Optimized link state routing protocol", Internet draft, draft-ietf-manet-olsr-04.txt, 2001.
[4] R. A. Santos, R. M. Edwards, L. N. Seed, and A. Edwards. "A location based routing algorithm for vehicle to vehicle communication"
Proceedings.13th International Conference on Computer Communications and Networks, pages 221 – 226, 2004.
[5] Z. J. HAAS. "A new routing protocol for the reconfigurable wireless network", In Proceedings of the 1997 IEEE 6th International Conference
on Universal Personal Communications, pages 562–566, 1997.
[6] R. V. Boppana and S. Konduru. "An adaptive distance vector routing for mobile ad hoc networks", Proceedings. 20th Annual Joint Conference
of the IEEE Computer and Communications Societies, 3:1753 – 1762, 2001.
[7] Ashwani Kush, Sunil Taneja and Divya Sharma , "Energy Efficient Routing for MANET", International Conference on Methods and
Models in Computer Science (ICM2CS),2010 , page 112-116, 2010.
[8] Rakesh Kumar, Mayank Dave department of IT, M.M. University, Mullana, Haryana, India ,"A Comparative Study of Various Routing
Protocols in VANET" (2011) p643-648.
[9] Josiane Nzouonta, Neeraj Rajgure, Guiling Wang, Member, IEEE, and Cristian Borcea, Member IEEE, "VANET Routing on City
Roads using Real-Time Vehicular Traffic Information", (2008) p1-18.
[10] Salim M.Zaki, M.A.ngadi, Maznah Kamat, "A location based routing predicton service protocol for vanet city environment", (2012).

VOLUME 5 ISSUE 5 MAY-2018 PAGE NO:121