Abstract: delay, Throughput and SUMO Introduction: The main idea

Abstract:

      The
Vehicular Ad-Hoc Network, or VANET, is a technology that customs moves cars as
nodes in a network to create a mobile network. VANET turns every joining car
into a wireless router or node, allowing cars approximately 100 to 300 meters
of each other to connect and, in turn, create a network with a wide range. As
cars fall out of the signal range and drop out of the network, other cars can
join in, involving vehicles to one another so that a mobile Internet is
created. Ad-hoc On-demand Multipath Distance Vector (AOMDV) protocol is used
for analysis the traffic prediction in VANET environment based of different
parameters. The parameters like packet delivery radio (PDR), End to End delay
Throughput and so on. VANET environment is created by using SUMO tools and
performance analyses using NS2.35

We Will Write a Custom Essay Specifically
For You For Only $13.90/page!


order now

 

Key
Words: VANET, AOMDV, PDR, End to End delay, Throughput and SUMO

Introduction:

            The main idea in AOMDV
is to compute multiple paths during route discovery. It is designed primarily
for highly dynamic ad hoc networks where link failures and route breaks occur
frequently. When single path on-demand rout-ing protocol such as AODV is used
in such networks, a new route discovery is needed in response to every route
break. Each route discovery is associated with high- overhead and latency. This
inefficiency can be avoided by having multi-ple redundant paths available. Now,
a new route discovery is needed only when all paths to the destination break. A
noteworthy feature of the AOMDV protocol is the use of routing information
already available in the underlying AODV protocol as much as possible. Thus
little additional overhead is required for the computation of multiple paths.
The AOMDV protocol has two main components: I. a route update rule to establish
and maintain multiple • loop-free paths at each node. 2. a distributed protocol
to find link-disjoint paths. In the following, we describe each of these two
components in detail.