ISSN : 0976-8491 (Online) | ISSN : 2229-4333 (Print) IJCST Vol.

6, Issue 2, April - June 2015

Performance Analysis of Ad-Hoc Routing Protocols for

VANET Using NS2 Simulation
1
Ameer Ali, 2Dr. Latha C.A
1,2
Dept. of CSE, Don Bosco Institute of Technology, Bangalore, Karnataka INDIA

Abstract
Vehicle Ad hoc Networks (VANET) emerged as a subset of the
Mobile Ad hoc Network (MANET) application; it is considered
to be a significant approach to the ITS (Intelligent Transportation
System). VANETs are introduced to assist drivers and improve
safety issues and driving comfort, as a step towards constructing a
safer, smoother, cleaner and more intelligent environment. At the
present time vehicles are equipped with On Board Units (OBU)
this enables vehicles to sense situations affecting other vehicles
and manage communications. VANET is a new communication
paradigm that enables the communication between vehicles
moving at high speeds on the roads. This inspired to develop several
new applications like, traffic engineering, traffic management,
dissemination of emergency information to avoid hazardous
situations and other user applications.802.11p, also known as
WAVE, is a standard protocol intended for future traffic systems in
order to support safety and commercial non-safety applications for Fig. 1: Vehicular Ad-Hoc Network Overview
vehicular communication. 802.11p is amended from 802.11a, and
both are based on OFDM. The main difference between 802.11a VANETs and MANETs present some similar characteristics such
and 802.11p is that 802.11p uses 10 MHz frequency bandwidth as low bandwidth, short range of transmission and omnidirectional
(half of bandwidth of 802.11a) in order to make the signal more broadcast. However, VANETs have some unique characteristics
robust against fading and increase the tolerance. This paper such as:
investigate the performance of 802.11p for Vehicle-to-Vehicle
communication through real-world experiments using different A. Highly Dynamic Topology
adhoc routing protocols. We measure throughput and packet losses Vehicles move at different directions and/or speed and, as a result
of 802.11pin urban environments. In addition, the performance of the topology changes constantly;
routing protocol with different modulations by varying the number
of vehicles to evaluate the feasibility of using rate adaptation for B. Frequently Disconnected Network
safety V-to-V applications. The highly dynamic topology results in frequent changes in its
connectivity, thus the link between two vehicles can quickly
Keywords disappear while they are transmitting information;
Performance, Analysis, Ad Hoc Network, AODV, DSR, DSDV,
NS2 C. Geographical Type of Communication
Vehicles to be reached typically depend on their geographical
I. Introduction location. This differs from other networks where the target node
The increasing in demand of wireless communication and the needs or a group of target nodes are defined by an ID or a group ID;
of new wireless devices have tend to research on self-organizing,
self-healing networks without the interference of centralized or D. Constrained Mobility and Prediction
pre-established infrastructure/authority. The networks with the VANETs present highly dynamic topology but vehicles usually
absence of any centralized or pre-established infrastructure are follow a certain mobility pattern constrained by roads, streets and
called Ad hoc networks. Ad hoc Networks are collection of self- highways, traffic lights, speed limit, traffic conditions, and drivers’
governing mobile nodes [1]. driving behaviors. Thus, given the mobility pattern, the future
Vehicular Ad hoc Networks (VANET) is the subclass of Mobile Ad position of the vehicle is more feasible to be predicted;
Hoc Networks (MANETs). VANET is one of the influencing areas
for the improvement of Intelligent Transportation System (ITS) E. Propagation Model
in order to provide safety and comfort to the road users. VANET Typically, VANETs operate in tree environments: highway,
assists vehicle drivers to communicate and to coordinate among rural and city. In a highway, the propagation model is usually
themselves in order to avoid any critical situation through Vehicle assumed to be free-space, but the signal can suffers interference
to Vehicle communication e.g. road side accidents, traffic jams, by the reflection with the walls around the roads. In a city, its
speed control, free passage of emergency vehicles and unseen surroundings can be complex and more difficult to communication
obstacles etc. Besides safety applications VANET also provide due to variable node density and the presence of buildings, trees
comfort applications to the road users. For example, weather and other objects that act as obstacles to the communication signal
information, mobile e-commerce, internet access and other and cause shadowing, multipath and fading effects. Usually, the
multimedia applications [2]. Fig. 1 shows the overall working propagation model is assumed to be not free-space due to those
structure of VANET. characteristics of the communication environment. In the rural

w w w. i j c s t. c o m International Journal of Computer Science And Technology 127

IJCST Vol. 6, Issue 2, April - June 2015 ISSN : 0976-8491 (Online) | ISSN : 2229-4333 (Print)

environments, due to the complex topographic forms (fields, hills, B. Multichannel Operation
climbs, dense forests, etc.), it is important to consider the signal IEEE 1609.4 is one of the standards of the IEEE 1609 protocol
reflection and the attenuation on the signal propagation. Thus, in family, which manages channel coordination and supports MAC
this scenario the free-space model is not appropriate. As in any service data unit delivery. This standard describes seven different
other network, the propagation model in a VANET must consider channels with different features and usage (six service channels
the effects of potential interference of wireless communication (SCH) and one control channel (CCH)). In addition, these
from other vehicles and the existence of largely deployed access channels use different frequencies and transmit powers. Eichler
points. [3] mentions that each station continuously alternates between
Several publications ([3-5]) have studied the performance of the control channel and one of the service channels; however the
802.11p, however they do not support realistic vehicular mobility different channels cannot be used at the same time. According
simulation. In [6], the authors present a comprehensive evaluation to [9], the control channel is used for system control and safety
and simulative review of the performance of 802.11p and WAVE data transmission. On the other hand, non-safety messages are
standards. They use Qualnet network simulator for the simulation exchanged by the six service channels. The IEEE 802.11p MAC
portion. In terms of modelling accuracy, A new model of IEEE layer is based on multichannel operation of WAVE architecture
802.11 MAC and PHY, which support IEEE 802.11P, is designed and 802.11e EDCA. This mechanism defines four different access
and implemented in ns-2 network simulator version 2.34 [7]. This categorizes (AC) for each channel. The access categories are
version of ns-2 network simulator is used for this paper [8]. indicated by AC0-AC3, and each of them has an independent
queue [3]. The EDCA mechanism provides prioritization by
The remainder of this paper is organized as follows. In section II assigning different contention parameters to each access category.
we clarify the WAVE and IEEE802.11p structure.Different adhoc AC3 has the highest priority to access medium, and AC0 has the
protocols are described in section III. The simulation scenario lowest priority. So there are six service channels and one control
is conducted in section IV. Results from the simulation and the channel and each of them has four different access categories.
analyses of the performance metrics of the IEEE 802.11p are Consequently, during data transmission, there are two contention
presented in section V. Finally, this paper is concluded in Section procedures to access the medium:
VI. • Internal contention procedure which occurs inside each
channel between their access categories by using the
II. Overview of 802.11p Protocol contention parameters (Arbitrary InterFrame space (AIFS)
In this section we briefly present an outline of WAVE architecture and Contention Window (CW)),
system and IEEE 802.11p protocol for VANET. • The contention procedure between channels to access the
medium is supported by different timer settings based on the
internal contention procedure.

Throughout data transmission, each frame is categorized into

different access categories, depending on the importance of the
message. Then the selected frames contend to access the medium
using their contention parameters [10].

Logical link control (LLC) is another element of WAVE structure

which is similar to upper sub-layer of OSI layer two. LLC provides
the communication between upper layers and the lower layer.

C. Network and transport layers

The IEEE 1609.3 defines the operation of services at network
and transport layers. Moreover, it provides wireless connectivity
between vehicles, and vehicles to roadside devices. The functions
of the WAVE network services can be separated to two sets:
Fig. 2: DSRC Standards and Communication Stack • Data-plane services: they transmit network traffics and
support IPV6 and WSMP protocols. WAVE short-message-
A. Physical and MAC Layers Protocol (WSMP) provides this capability that applications
The physical and MAC layers of WAVE are based on IEEE 802.11p can send short message to increase theprobability of receiving
standard. The physical layer of IEEE 802.11P consists of seven the messages in time.
channels in 5.9GHz band which is similar to IEEE 802.11a design, • Management-plane services: Their functions are to configure
but the main difference is that the IEEE 802.11p use 10MHZ and maintain system, for instance: IPV6 configuration, channel
bandwidth for each channel instead of 20MHZ bandwidth in IEEE usage monitoring, and application registration. This service
802.11a. The physical layer of 802.11p uses OFDM technology is known as WAVE management entity (WME).
which is used for increasing data transmission rate and overcoming
signal fading in wireless communication. One of the specifications The devices which use WAVE architecture should implement UDP
of IEEE 802.11p is that the management functions are connected as specified in RFC 768, and TCP as defined in RFC 793 [10].
with the physical and MAC layers which are called physical layer
management entity (PLME) and MAC layer management entity D. Resource Manager
(MLME), respectively [3]. The IEEE 802.11p uses CSMA/CA to There are two kinds of wireless access in VANETs:
reduce collisions and provide fair access to the channel. • Roadside unit (RSU) which are the static stations located

128 International Journal of Computer Science And Technology w w w. i j c s t. c o m

ISSN : 0976-8491 (Online) | ISSN : 2229-4333 (Print) IJCST Vol. 6, Issue 2, April - June 2015

along the roadside, formation of loops. The stations periodically transmit their routing
• On-board unit (OBU) mounted on a vehicle and can operate tables to their immediate neighbors. A station also transmits its
while moving. routing table if a significant change has occurred in its table from
the last update sent. So, the update is both time-driven and event-
IEEE 1609.1 standard defines a WAVE application known as driven.
resource manager (RM) which should allow communication The routing table updates can be sent in two ways: a “full dump”
between applications runs on RSUs and OBUs. The RM resides or an incremental update. A full dump sends the full routing table
on either OBUs or RSUs [10]. to the neighbors and could span many packets whereas in an
incremental update only those entries from the routing table are
E. Security Services sent that has a metric change since the last update and it must fit in a
The IEEE 1609.2 standard defines security services for the packet. If there is space in the incremental update packet then those
WAVE architecture and the applications which run through this entries may be included whose sequence number has changed.
architecture. This standard defines the format and the processing When the network is relatively stable, incremental updates are
of secure messages; furthermore, it describes the core security sent to avoid extra traffic and full dump are relatively infrequent.
functions [11]. In a fast-changing network, incremental packets can grow big so
full dumps will be more frequent.
III. Vanet Routing Protocol
Wireless networks can be classified in two types: 2. Ad Hoc on -Demand Distance Vector Routing (AODV)
AODV [11] discovers routes on an as needed basis via a similar
A. Infrastructure Networks route discovery process. However, AODV adopts a very different
Infrastructure network consists of a network with fixed and wired mechanism to maintain routing information. It uses traditional
gateways. A mobile host communicates with a bridge in the network routing tables, one entry per destination. This is in contrast to
(called base station) within its communication radius. The mobile DSR, which can maintain multiple route cache entries for each
unit can move geographically while it is communicating. When it destination. Without source routing, AODV relies on routing table
goes out of range of one base station, it connects with new base entries to propagate an RREP back to the source and, subsequently,
station and starts communicating through it. This is called handoff. to route data packets to the destination. AODV uses sequence
In this approach the base stations are fixed. numbers maintained at each destination to determine freshness
of routing information and to prevent routing loops. All routing
B. Infrastructure Less (Ad-hoc) Networks packets carry these sequence numbers.
In ad hoc networks [14] all nodes are mobile and can be connected
dynamically in an arbitrary manner. As the range of each host’s An important feature of AODV is the maintenance of timer -based
wireless transmission is limited, so to communicate with hosts states in each node, regarding utilization of individual routing table
outside its transmission range, a host needs to enlist the aid of its entries. A routing table entry is expired if not used recently. A set
nearby hosts in forwarding packets to the destination. So all nodes of predecessor nodes is maintained for each routing table entry,
of these networks behave as routers and take part in discovery indicating the set of neighboring nodes which use that entry to
and maintenance of routes to other nodes in the network. Ad route data packets. These nodes are notified with RERR packets
hoc Networks are very useful in emergency search-and-rescue when the next -hop link breaks. Each predecessor node, in turn,
operations, meetings or conventions in which persons wish to forwards the RERR to its own set of predecessors, thus effectively
quickly share information, and dataacquisition operations in erasing all routes using the broken link. In contrast to DSR, RERR
inhospitable terrain. This ad-hoc routing protocols can be divided packets in AODV are intended to inform all sources using a link
into two categories: when a failure occurs. Route error propagation in AODV can be
visualized conceptually as a tree whose root is the node at the point
1. Table-Driven Routing Protocols of failure and all sources using the failed link as the leaves.
In table driven routingprotocols, consistent and up-t o-date routing
information to all nodes is maintained at each n ode. 3. Dynamic Source Routing (DSR)
The key distinguishing feature of DSR [13] is the use of source
2. On-Demand Routing Protocols routing. That is, the sender knows the complete hop - by-hop route
In On-Demand routingprotocols, the routes are created as and to the destination. These routes are stored in a route cache. The
when required. When a source wants to send to a destination, it data packets carry the source route in the packet header. When
invokes the route discovery mechanisms to find the path to the a node in the ad hoc network attempts to send a data packet to a
destination destination for which it does not already know the route, it uses
a route discovery process to dynamically determine such a route.
B. Ad-Hoc Routing Protocols Description Route discovery works by flooding the network with route request
(RREQ) packets. Each node receiving an RREQ rebroadcasts it,
1. Destination -Sequenced Distance -Vector unless it is the destination or it has a route to the destination in its
The Destination-Sequenced Distance-Vector (DSDV) [12] route cache. Such a node replies to the RREQ with a route reply
Routing Algorithm is based on the idea of the classical Bellman- (RREP) packet that is routed back to the original source. RREQ
Ford Routing Algorithm with certain improvements. Every mobile and RREP packets are also source routed. The RREQ builds up
station maintains a routing table that lists all available destinations, the path traversed across the network. The RREP routes itself back
the number of hops to reach the destination and the sequence to the source by traversing this path backward. The route carried
number assigned by the destination node. The sequence number is back by the RREP packet is cached at the source for future use.
used to distinguish stale routes from new ones and thus avoid the If any link on a source route is broken, the source node is notified

w w w. i j c s t. c o m International Journal of Computer Science And Technology 129

IJCST Vol. 6, Issue 2, April - June 2015 ISSN : 0976-8491 (Online) | ISSN : 2229-4333 (Print)

using a route error (RERR) packet. The source removes any route for Urban VANET model for different routing protocols. For
using this link from its cache. A new route discovery process must reliability, seed values are given for 5 different simulation which
be initiated by the source if this route is still needed. DSR makes are used to find the values and the average is considered. The
very aggressive use of source routing and route caching. performance of different routing protocol using 802.11p standard
are studied based on the performance metrics.
IV. Simulations
The simulation model is based on NS 2 simulation version 2.34. V. Simulated results
The simulation scenario is designed according to the normal For all the simulations, the same movement models were used,
state of car running on a road. The position and the movement of the number of traffic sources wasvaried from 4, 8, 16, 24, 32 and
the nodes are given in the screen scenario generator file shown maximum speed of the nodes was set to 40kmph and the number
in Table 1. The routing parameters are obtained from the trace of nodes was varied as 8, 16, 32, 48 and 64.
file. To evaluate the performance of the routing protocols, some
parameters have been used in the TCL file for measuring the A. Packet Delivery Ratio(PDR)Vs Number of Nodes
efficiency of vehicle-to-vehicle communication. The studies of The performance of various routing protocols such as AODV,
these parameters are analyzed by the NS 2 Trace file. Therefore DSDV and DSR in terms of packet delivery ratio to the number
the Agent Trace ON and Route Trace ON in the TCL file are of nodes is shown below in figure 3 and values obtained are given
activated. The speed of the vehicles is assumed to be constant at in Table 3.
40kmph. An IEEE working group has invented a new PHY/MAC
layer amendment of the 802.11p standard, which is designed for Table 3:
car-to-car and car-to-infrastructure communication only. NODES AODV DSDV DSR
The critical parameters used in the NS 2.34 version simulation is
given in below table: 8 80.218 67.94 71.7638
16 75.1415 63.5137 59.9913
Table 1: Parameters for NS 2.34 32 76.0607 54.456 52.4402
Network Area 600m x 300m 48 76.0572 53.34 50.8423
Radio Range 200m
64 77.6726 52.2667 51.015
Traffic Type CBR
Visualization Tool Nam, Trace
Duration 200 seconds
MAC Layer 802.11p,802.11
Protocol AODV,DSDV,DSR
Number of nodes 8,16,32,48,64
Speed 40Kmph

We have used the above mentioned parameters and estimated the

performance of the Routing protocols such as DSDV, AODV and
DSR for vehicular communication.

IEEE 802.11p Parameters in TCL file are given in the below

Table 2
Fig. 3: Packet Delivery Ratio (PDR) Vs Number of Nodes
Table 2: Parameters of IEEE 802.11p
Fig. 3 shows the average PDR of all 3 protocols. The behavior of
PDR of every routing protocol with respect to number of nodes
is shown. We observe that AODV routing protocol in all the
conditions provides better PDR consistently at the initial stage
the PDR is 80.2% and it is better compared to other protocols.
AODV out performed both DSDV and DSR protocols by 9.73%
and 10.3% respectively, As the number of nodes increases DSR
routing protocol’s PDR gradually decreases. The proactive routing
protocols have decreasing PDR all times. It is observed that
proactive routing protocols with short interval values provide
better PDR, as their routing table is updated quickly and reactive
protocol such as AODV performs better in all scenarios.

B. Throughput Vs Number of Nodes:

The performance of various routing protocols such as AODV,
DSDV and DSR in terms of throughput to the number of nodes
We compare the Packet delivery ratio, Packet drop, Average is shown below fig. 4 and values obtained are in Table 4.
Throughput and Network routing load with 802.11p standards

130 International Journal of Computer Science And Technology w w w. i j c s t. c o m

ISSN : 0976-8491 (Online) | ISSN : 2229-4333 (Print) IJCST Vol. 6, Issue 2, April - June 2015

Table 4: Throughput in 802.11p Fig. 5 shows the Normalized Routing Load (NRL). It is observed
NODES AODV DSDV DSR that DSDV consistently has more NRL (19.67%) compared to
reactive protocols. This is because the proactive routing protocols
8 634.27 775.44 508.07
generate sustained control traffic, in order to have updated
16 553.4 613.29 310.34 information about the topology and routing paths. This process
32 474.88 354.22 111.26 is done irrespective of user communication. On one hand this
48 511.83 331.01 97.01 helps in avoiding initial latency of finding routes, but in return
64 484.15 327.71 63.27 it generates more routing overhead compared to reactive routing
protocols. It is observed that AODV has less routing overhead
(23.15%) compared to DSDV with NLR% as 19.67.

D. Packet Drop Vs Number of Nodes

The Packet Drop of various routing protocols such as AODV,
DSDV and DSR in terms of packet drop to the number of nodes
is shown below in fig. 6 and Table 6.

Table 6: Packet Drop in 802.11p

NODES AODV DSDV DSR
8 140898 133762 159700
16 221857 224381 251052
Fig. 4: Throughput Vs Number of Nodes 32 471256 516670 503319
48 666248 693142 701305
Fig. 4 shows the average Throughput of all 3 protocols. The 64 843936 904270 877456
behavior of Throughput of every routing protocol with respect
to number of nodes is shown. We observe that AODV routing
protocol with increased number of vehicles is able to give the
better Throughput as compared to other protocols. As the number
of nodes increases AODV routing protocol with throughput
43.23% outperforms DSR with throughput 39.05%. Throughout
the simulations it is observed that DSDV has lesser throughput
(17.72%). The reactive routing protocols have better Throughput
at all the time.

C. Normalized Routing Load Vs Number of Nodes

The performance of various routing protocols such as AODV,
DSDV and DSR in terms of network routing load to the number
of nodes is shown below in fig. 5 and values are updated in Table
5.
Fig. 6: Packet Drop Vs Number of Nodes
Table 5: NRL in 802.11P
NODES AODV DSDV DSR Fig. 6 shows the average Packet Drop of all 3 protocols. The
behavior of Packet Drops of every routing protocol with respect
8 0.1233 0.0461 0.1807
to number of nodes is shown. We observe that DSR routing
16 0.1157 0.0884 0.2805 protocol in dense condition have lesser Packet Drop, as compared
32 0.0905 0.1026 0.2921 to other protocols. As the number of nodes increases DSR routing
48 0.0806 0.0932 0.2408 protocol’s Packet Drop is increased and AODV routing protocol
64 0.0734 0.0806 0.2003 with Packet drop, 32.07% outperforms DSR and DSDV with
34.11% and 33.82% respectively. The proactive routing protocols
have increasing Packet Drops at all times. It is observed that
reactive routing protocol i.e., AODV provides lesser Packet Drop
and outperforms other routing protocols.

VI. Conclusion
In this paper, we compared the performance of DSDV, AODV and
DSR routing protocols for ad hoc networks using ns-2 presents the
study of an efficient routing protocol for vehicular communication
in city environment. The earlier VANET models discussed only
the communication between vehicles through the RSU. Most of
the researchers used standard 802.11 for VANET model with the
movements of mobile nodes within the city area.
Fig. 5: Normalized Routing Load Vs Number of Nodes

w w w. i j c s t. c o m International Journal of Computer Science And Technology 131

IJCST Vol. 6, Issue 2, April - June 2015 ISSN : 0976-8491 (Online) | ISSN : 2229-4333 (Print)

For efficient data communication the protocol used in the given

model is important. Thus the familiar routing protocols are Mr. AMEER ALI received his
compared with each other and it is concluded that the reactive Bachelor’s Degree in Computer
routing protocols i.e. AODV with IEEE 802.11p yields better Science and Engineering from Ghousia
performance. College of engineering affiliated
to Visvesvaraya Technological
References University, Belgaum in the year 2013.
[1] M. Mauve, A. Widmer, H. Hartenstein,“A survey on position- He is currently pursuing Master’s
based routing in mobile Ad-Hoc networks”, Network, IEEE, Degree in Computer Science and
Vol. 15, No. 6, pp. 30 - 39, Nov/Dec 2001. Engineering from Don Bosco Institute
[2] Bernsen, J. Manivannan, D.,“Routing Protocols for Vehicular of Technology,Bangalore affiliated
Ad-Hoc Networks That Ensure Quality of Service”, In the to Visvesvaraya Technological
fourth international conference on Wireless and Mobile University, Belgaum. Project is
Communications., pp. 1-6, Aug. 2008. carried out in Indian Institute of Science (IISc) Bangalore under
[3] S. Eichler,“Performance evaluation of the IEEE 802.11p the guidance of Dr. R. Bhakthavathsalam, Principal Research
WAVE communication standard”, In Proc. IEEE Vehicular Scientist, SERC Dept., IIsc.
Technology Conf., Baltimore, MD, US, Oct. 2007, pp. 2199-
2203. Dr. LATHA C A is a doctorate from
[4] T. Murray, M. Cojocari, H. Fu,"Measuring the performance of Anna University Chennai, India, in
IEEE 802.11p using ns-2 simulator for vehicular networks", the domain of distributed systems. She
In: Proc. IEEE EIT, 2008, pp. 98–503. has graduated in the year 1991 from
[5] K. Bilstrup, E. Uhlemann, E. G. Ström, U. Bilstrup, Mysore University, post graduated
"Evaluation of the IEEE 802.11p MAC method for vehicle- from National Institute of Technology
to-vehicle communication”, Proc. IEEE Int. Symposium on Karnataka in 2003. She has a teaching
Wireless Vehicular Communications, Calgary, Canada, Sept. experience of more than 20 years and
2008. research experience of more than 7
[6] S. Grafling, P. Mahonen, J. Riihijarvi,“Performance evaluation years. As a result, she has in her credit
of IEEE 1609 WAVE and IEEE 802.11p for vehicular several national and international
communications”, In Proceedings of the 2nd International papers. She has also filed for a patent at USPTO for one of her
Conference on Ubiquitous and Future Networks (ICUFN research works. Her area of interest includes, Distributed Systems
’10), June 2010, pp. 344 –348. and Cloud Computing. At present she is serving as Professor and
[7] Q. Chen, F. Schmidt-Eisenlohr, D. Jiang, M. Torrent- Head in the department of Computer Science and Engineering
Moreno, L. Delgrossi, H. Hartenstein,“Overhaul of IEEE at Don Bosco Institute of Technology, Bangalore affiliated to
802.11 modeling and simulation in NS-2”, In Proc. of the Visweswaraya Technological University, India.
10th ACM/IEEE International Symposium on Modeling,
Analysis and Simulation of Wireless and Mobile Systems
(MSWiM), 2007.
[8] “Network Simulator ns-2”, [Online] Available: http://www.
isi.edu/nsnam/ns/IEEE Wireless Communications, Vol. 13,
No. 5, pp. 36–43, Oct. 2006.
[9] M. Amadeo, et al.,“Enhancing IEEE 802.11p/WAVE to
provide infotainment applications in VANETs”, Ad-Hoc
Networks. S.1.: Elsevier, 2010.
[10] WILLIAMS, B.,"Intelligent Transport Systems Standards",
Artech House Publishers, 2008.
[11] R. A. Uzcátegui, G. Acosta-Marum,“WAVE: A Tutorial”,
IEEE Commun. Mag., May 2009.
[12] Ian D. Chakeres, Elizabeth M. Belding-Royer,"AODV
Routing Protocol Implementation Design".
[13] Charle E. Perkins, Pravin Bhagwat,"Highly Dynamic
Destination - Sequenced Distance- Vector Routing (DSDV)
for Mobile Computers.
[14] David B. Johnson, David A. Maltz, Josh Broch,"DSR: The
Dynamic Source Routing protocol for Multi-Hop Wireless
Ad-Hoc networks".

132 International Journal of Computer Science And Technology w w w. i j c s t. c o m