25.01.2014 Views

Performance Evaluation of AODV and ADV Protocols in VANET ...

Performance Evaluation of AODV and ADV Protocols in VANET ...

Performance Evaluation of AODV and ADV Protocols in VANET ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Kusum Dalal et al,Int.J.Comp.Tech.Appl,Vol 3 (1), 50-55<br />

ISSN:2229-6093<br />

<strong>Performance</strong> <strong>Evaluation</strong> <strong>of</strong> <strong>AODV</strong> <strong>and</strong> <strong>ADV</strong> <strong>Protocols</strong> <strong>in</strong> <strong>VANET</strong> Scenarios<br />

Ms. Kusum Dalal<br />

Assistant Pr<strong>of</strong>essor<br />

ECE Deptt., B.M.I.E.T.,<br />

Sonepat, Haryana-131001.<br />

kusumdalal@gmail.com<br />

Ms. Prachi Chaudhary<br />

Assistant Pr<strong>of</strong>essor<br />

ECE Deptt., D.C.R.U.S.T,<br />

Murthal, Haryana-131039.<br />

prachi.chaudhary@gmail.com<br />

Dr. Pawan Dahiya<br />

Assistant Pr<strong>of</strong>essor<br />

ECE Deptt., D.C.R.U.S.T,<br />

Murthal, Haryana-131039.<br />

pawan.dahiya@gmail.com<br />

Abstract<br />

This paper presents a comparative test <strong>of</strong> two protocols<br />

namely-<strong>AODV</strong> <strong>and</strong> <strong>ADV</strong> <strong>in</strong> various mobility scenarios<br />

<strong>of</strong> Vehicular Ad-hoc NETworks (<strong>VANET</strong>s). In order to<br />

make comparison three performance criterions are<br />

selected which <strong>in</strong>clude number <strong>of</strong> packet drop,<br />

throughput <strong>and</strong> total time taken by NCTUns-6.0 to<br />

simulate the given network. To carry out the simulation<br />

process an open source simulator tool is used for this<br />

study namely-NCTUns-6.0. Based on the simulation<br />

results <strong>of</strong> both aforementioned protocols, the<br />

performance comparison is made <strong>and</strong> appropriate<br />

protocol is selected for <strong>in</strong>dividual scenarios. The<br />

mobility scenarios selected are broadly categorized as<br />

highway <strong>and</strong> city scenarios with different mobility<br />

patterns.<br />

1. Introduction<br />

The world is progress<strong>in</strong>g at a very fast pace <strong>in</strong><br />

almost all spheres <strong>of</strong> life <strong>and</strong> so is the case with<br />

automobile <strong>in</strong>dustry. New techniques are be<strong>in</strong>g<br />

exploited to provide more <strong>and</strong> more facilities to<br />

customers, <strong>in</strong>clud<strong>in</strong>g safety applications. A lot <strong>of</strong><br />

research work has been done <strong>in</strong> the field <strong>of</strong> road-safety<br />

<strong>and</strong> some works have already been <strong>in</strong>corporated <strong>in</strong><br />

automobiles to enhance the safety <strong>of</strong> users. But along<br />

side the safety applications a lot <strong>of</strong> time is be<strong>in</strong>g<br />

devoted to develop techniques which can <strong>in</strong>tegrate the<br />

safety <strong>and</strong> comfort applications to provide more<br />

satisfaction to consumers. After a lot <strong>of</strong> hard-work one<br />

such technique was found that provides amalgamation<br />

<strong>of</strong> both safety <strong>and</strong> non-safety applications for vehicle<br />

users. This technique was an extension <strong>of</strong> Mobile Adhoc<br />

NETworks (MANETs) which can provide ad-hoc<br />

network<strong>in</strong>g capabilities between vehicles. The<br />

technique was named on the l<strong>in</strong>es <strong>of</strong> MANETs as<br />

Vehicular Ad-hoc Networks (<strong>VANET</strong>s).<br />

Besides provid<strong>in</strong>g <strong>in</strong>ter-vehicle communication;<br />

<strong>VANET</strong>s also provides communication between<br />

vehicles <strong>and</strong> Road Side Units (RSU). Such networks<br />

comprise <strong>of</strong> sensors <strong>and</strong> On Board Units (OBU)<br />

<strong>in</strong>stalled <strong>in</strong> the car as well as Road Side Units (RSU).<br />

The data collected from the sensors on the vehicles can<br />

be displayed to the driver, sent to the RSU or even<br />

broadcasted to other vehicles depend<strong>in</strong>g on its nature<br />

<strong>and</strong> importance. The RSU distributes this data, along<br />

with data from road sensors, weather centres, traffic<br />

control centres, etc to the vehicles <strong>and</strong> also provides<br />

commercial services such as park<strong>in</strong>g space book<strong>in</strong>g,<br />

Internet access <strong>and</strong> gas payment [1]. Thus, RSUs play a<br />

very important role <strong>in</strong> <strong>VANET</strong>s for message<br />

transmission between vehicles which <strong>in</strong> turn enables<br />

them to take <strong>in</strong>telligent decisions <strong>and</strong> avoid mishap. A<br />

<strong>VANET</strong> overview can be seen <strong>in</strong> figure 1.<br />

Figure 1: <strong>VANET</strong> Scenario [2]<br />

In order to accomplish all these said tasks <strong>VANET</strong><br />

make use <strong>of</strong> number <strong>of</strong> technologies like GPS (Global<br />

Position<strong>in</strong>g System) which is used by drivers to get<br />

their own, as well as, their neighbours location; GPRS<br />

(General Packet Radio Service) which a user can use to<br />

connect to the Internet for brows<strong>in</strong>g web pages,<br />

check<strong>in</strong>g email, download<strong>in</strong>g files etc.<br />

<strong>VANET</strong>s are characterized by highly mobile nodes<br />

that are abided by traffic rules <strong>and</strong> thus had to follow<br />

some set patterns <strong>of</strong> movement unlike MANETs <strong>in</strong><br />

which nodes move r<strong>and</strong>omly without any movement<br />

restrictions. Secondly, <strong>VANET</strong>s have very dynamic<br />

IJCTA | JAN-FEB 2012<br />

Available onl<strong>in</strong>e@www.ijcta.com<br />

50


Kusum Dalal et al,Int.J.Comp.Tech.Appl,Vol 3 (1), 50-55<br />

ISSN:2229-6093<br />

<strong>and</strong> complex topology due to different routes followed<br />

by drivers at different speeds <strong>and</strong> their behaviour <strong>of</strong><br />

driv<strong>in</strong>g, whereas <strong>in</strong> MANETs topology changes are<br />

much less frequent. Due to these notable differences<br />

between MANETs <strong>and</strong> <strong>VANET</strong>s, the rout<strong>in</strong>g protocols<br />

used <strong>in</strong> MANETs have to be studied first <strong>and</strong> checked<br />

for their compatibility <strong>in</strong> <strong>VANET</strong> environments. The<br />

rout<strong>in</strong>g protocols that are selected for this study<br />

belongs to a special branch <strong>of</strong> MANET rout<strong>in</strong>g<br />

protocols namely-Topology Based Rout<strong>in</strong>g <strong>Protocols</strong>.<br />

The ma<strong>in</strong> reason for such selection is the dynamic<br />

topology aspect <strong>of</strong> <strong>VANET</strong>s which has a direct<br />

implication on rout<strong>in</strong>g protocol analysis. The<br />

performance <strong>of</strong> selected protocols is carried out us<strong>in</strong>g<br />

NCTUns-6.0 simulator tool which provides various<br />

advantages over other simulators like MOVE, TraNs,<br />

QualNet etc.<br />

2. Related Work<br />

Several researchers have done the qualitative <strong>and</strong><br />

quantitative analysis <strong>of</strong> <strong>VANET</strong> rout<strong>in</strong>g protocols by<br />

means <strong>of</strong> different performance metrics <strong>and</strong> us<strong>in</strong>g<br />

different simulators for this purpose. Some <strong>of</strong> them are<br />

mentioned below as reference:-<br />

• Khaleel Ur Rahman Khan et al. [3], <strong>in</strong> this<br />

paper <strong>AODV</strong>, DSR <strong>and</strong> DSDV protocols are compared<br />

on basis <strong>of</strong> packet delivery ratio, number <strong>of</strong> packets<br />

dropped, end-to-end delay <strong>and</strong> average rout<strong>in</strong>g<br />

overhead metrics us<strong>in</strong>g NCTUns-4.0 version.<br />

• Pranav Kumar S<strong>in</strong>gh et al. [4], <strong>in</strong> this paper<br />

<strong>AODV</strong>, OLSR <strong>and</strong> DSR are compared us<strong>in</strong>g MOVE<br />

<strong>and</strong> NS-2 simulators on basis <strong>of</strong> packet delivery ratio<br />

<strong>and</strong> end to end delay.<br />

• S. S. Manvi et al. [5], <strong>in</strong> this paper comparison<br />

<strong>of</strong> <strong>AODV</strong>, DSR, <strong>and</strong> Swarm Intelligence based rout<strong>in</strong>g<br />

protocols is done us<strong>in</strong>g ns-2, 2.31 simulators <strong>in</strong>terms <strong>of</strong><br />

throughput, latency, data delivery ratio <strong>and</strong> data<br />

delivery cost.<br />

• Rajendra V. Boppana et al. [6], <strong>in</strong> this paper<br />

<strong>AODV</strong>, <strong>ADV</strong> <strong>and</strong> DSR are compared us<strong>in</strong>g CBR<br />

(Constant Bit Rate) traffic on basis <strong>of</strong> average data<br />

packet latency, network throughput <strong>and</strong> the percentage<br />

<strong>of</strong> data packets delivered.<br />

• Samir R. Das et al. [7] evaluated the<br />

performance <strong>of</strong> SPF, DSDV, TORA, DSR, <strong>and</strong> <strong>AODV</strong><br />

protocols with respect to fraction <strong>of</strong> packets delivered,<br />

end-to-end delay, <strong>and</strong> rout<strong>in</strong>g load by vary<strong>in</strong>g the<br />

number <strong>of</strong> conversation per node us<strong>in</strong>g Maryl<strong>and</strong><br />

Rout<strong>in</strong>g Simulator.<br />

3. Rout<strong>in</strong>g <strong>Protocols</strong><br />

A rout<strong>in</strong>g protocol governs the way that two<br />

communication entities exchange <strong>in</strong>formation with<br />

each other, by establish<strong>in</strong>g a route, mak<strong>in</strong>g decision for<br />

forward<strong>in</strong>g the data packets <strong>and</strong> ma<strong>in</strong>ta<strong>in</strong><strong>in</strong>g the route<br />

or recover<strong>in</strong>g from rout<strong>in</strong>g failure [8].<br />

DSDV<br />

Proactive<br />

Rout<strong>in</strong>g<br />

Topology Based<br />

Rout<strong>in</strong>g<br />

Reactive<br />

Rout<strong>in</strong>g<br />

OLSR STAR<br />

<strong>AODV</strong> TORA DSR<br />

Hybrid<br />

Rout<strong>in</strong>g<br />

<strong>ADV</strong><br />

Figure 2: Topology-based Rout<strong>in</strong>g <strong>Protocols</strong> [8]<br />

In this paper topology-based rout<strong>in</strong>g protocols are<br />

studied. Some <strong>of</strong> these protocols are shown <strong>in</strong> figure 2.<br />

These rout<strong>in</strong>g protocols use l<strong>in</strong>ks’ <strong>in</strong>formation, which<br />

exists <strong>in</strong> the network, to perform packet forward<strong>in</strong>g.<br />

They can be divided <strong>in</strong>to:-<br />

1. Proactive (table-driven) rout<strong>in</strong>g protocols<br />

2. Reactive (on-dem<strong>and</strong>) rout<strong>in</strong>g protocols<br />

3. Hybrid rout<strong>in</strong>g protocols<br />

3.1. Proactive Rout<strong>in</strong>g<br />

Proactive rout<strong>in</strong>g protocols are mostly based on<br />

shortest path algorithms <strong>and</strong> keep <strong>in</strong>formation <strong>of</strong> all<br />

connected nodes <strong>in</strong> form <strong>of</strong> tables which are also shared<br />

with their neighbors [9]. They ma<strong>in</strong>ta<strong>in</strong> <strong>and</strong> update<br />

<strong>in</strong>formation on rout<strong>in</strong>g among all nodes <strong>of</strong> a given<br />

network at all times even if the paths are not currently<br />

be<strong>in</strong>g used. Thus, even if some paths are never used but<br />

updates regard<strong>in</strong>g such paths are constantly<br />

broadcasted among nodes [8]. Route updates are<br />

periodically performed regardless <strong>of</strong> network load,<br />

b<strong>and</strong>width constra<strong>in</strong>ts, <strong>and</strong> network size which is one<br />

<strong>of</strong> the ma<strong>in</strong> drawbacks <strong>of</strong> us<strong>in</strong>g this approach <strong>in</strong><br />

<strong>VANET</strong>s.<br />

3.2. Reactive Rout<strong>in</strong>g<br />

On dem<strong>and</strong> or reactive rout<strong>in</strong>g protocols were<br />

designed to overcome the overhead problem, that was<br />

created by proactive rout<strong>in</strong>g protocols, by ma<strong>in</strong>ta<strong>in</strong><strong>in</strong>g<br />

only those routes that are currently active [9]. These<br />

protocols implement route determ<strong>in</strong>ation on a dem<strong>and</strong><br />

or need basis <strong>and</strong> ma<strong>in</strong>ta<strong>in</strong> only the routes that are<br />

currently <strong>in</strong> use, thereby reduc<strong>in</strong>g the burden on the<br />

network when only a subset <strong>of</strong> available routes is <strong>in</strong> use<br />

at any time [8].<br />

<strong>AODV</strong> ma<strong>in</strong>ta<strong>in</strong>s <strong>and</strong> uses an efficient method <strong>of</strong><br />

rout<strong>in</strong>g that reduces network load by broadcast<strong>in</strong>g route<br />

discovery mechanism <strong>and</strong> by dynamically updat<strong>in</strong>g<br />

rout<strong>in</strong>g <strong>in</strong>formation at each <strong>in</strong>termediate node. Route<br />

discovery <strong>in</strong> <strong>AODV</strong> can be done by send<strong>in</strong>g RREQ<br />

(Route Request) from a node when it requires a route to<br />

send the data to a particular dest<strong>in</strong>ation. After send<strong>in</strong>g<br />

RREQ, node then waits for the RREP (Route Reply)<br />

<strong>and</strong> if it does not receive any RREP with<strong>in</strong> a given time<br />

period, source node assumes that either route is not<br />

IJCTA | JAN-FEB 2012<br />

Available onl<strong>in</strong>e@www.ijcta.com<br />

51


Kusum Dalal et al,Int.J.Comp.Tech.Appl,Vol 3 (1), 50-55<br />

ISSN:2229-6093<br />

available or route expired [10].When RREQ reaches<br />

the particular dest<strong>in</strong>ation <strong>and</strong> if source node receives<br />

RREP then by us<strong>in</strong>g unicast<strong>in</strong>g, <strong>in</strong>formation is<br />

forwarded to the source node <strong>in</strong> order to ensure that<br />

route is available for communication.<br />

DSR protocol [11] uses source rout<strong>in</strong>g, that is, the<br />

source <strong>in</strong>dicates <strong>in</strong> a data packet’s the sequence <strong>of</strong><br />

<strong>in</strong>termediate nodes on the rout<strong>in</strong>g path. In DSR, the<br />

query packet copies <strong>in</strong> its header the IDs <strong>of</strong> the<br />

<strong>in</strong>termediate nodes that it has traversed. The dest<strong>in</strong>ation<br />

then retrieves the entire path from the query, <strong>and</strong> uses it<br />

to respond to the source. As a result, the source can<br />

establish a path to the dest<strong>in</strong>ation.<br />

TORA rout<strong>in</strong>g [12] belongs to a family <strong>of</strong> l<strong>in</strong>k<br />

reversal rout<strong>in</strong>g algorithms where a directed acyclic<br />

graph (DAG) toward the dest<strong>in</strong>ation is built based on<br />

the height <strong>of</strong> the tree rooted at the source. When a node<br />

has a packet to send, it broadcasts the packet. Its<br />

neighbor only broadcasts the packet if it is the send<strong>in</strong>g<br />

node’s downward l<strong>in</strong>k based on the DAG.<br />

Thus, among these three reactive protocol strategies<br />

<strong>AODV</strong> is preferred <strong>in</strong> <strong>VANET</strong>s because <strong>in</strong> <strong>AODV</strong> data<br />

packets carry the dest<strong>in</strong>ation address, whereas <strong>in</strong> DSR,<br />

data packets carry the full rout<strong>in</strong>g <strong>in</strong>formation. This<br />

means that DSR has potentially more rout<strong>in</strong>g overheads<br />

than <strong>AODV</strong>. Furthermore, as the network diameter<br />

<strong>in</strong>creases, the amount <strong>of</strong> overhead <strong>in</strong> the data packet<br />

will cont<strong>in</strong>ue to <strong>in</strong>crease. Also, TORA provides a route<br />

to all the nodes <strong>in</strong> the network, ma<strong>in</strong>tenance <strong>of</strong> these<br />

routes can be overwhelm<strong>in</strong>gly heavy, especially <strong>in</strong><br />

highly dynamic <strong>VANET</strong>s.<br />

The load carry<strong>in</strong>g capacity <strong>of</strong> <strong>AODV</strong> is much better<br />

than proactive rout<strong>in</strong>g protocols like DSDV, OLSR etc.<br />

thus <strong>AODV</strong> is preferred for this study.<br />

3.3. Hybrid Rout<strong>in</strong>g<br />

Hybrid rout<strong>in</strong>g comb<strong>in</strong>es characteristics <strong>of</strong> both<br />

reactive <strong>and</strong> proactive rout<strong>in</strong>g protocols to make<br />

rout<strong>in</strong>g more scalable <strong>and</strong> efficient [9]. Mostly hybrid<br />

rout<strong>in</strong>g protocols are zone based; it means the number<br />

<strong>of</strong> nodes is divided <strong>in</strong>to different zones to make route<br />

discovery <strong>and</strong> ma<strong>in</strong>tenance more reliable for MANETs<br />

or <strong>VANET</strong>s.<br />

The most recently developed <strong>ADV</strong> hybrid rout<strong>in</strong>g<br />

protocol starts with DSDV proactive rout<strong>in</strong>g approach<br />

by attach<strong>in</strong>g sequence numbers to rout<strong>in</strong>g entries <strong>and</strong><br />

then gradually shifts to on-dem<strong>and</strong> approach <strong>in</strong> order to<br />

reduce the overhead related with proactive approach.<br />

This feature is achieved us<strong>in</strong>g the follow<strong>in</strong>g dual<br />

strategy:-<br />

1. Vary<strong>in</strong>g the number <strong>of</strong> active routes ma<strong>in</strong>ta<strong>in</strong>ed:-<br />

This is achieved by advertis<strong>in</strong>g <strong>and</strong> ma<strong>in</strong>ta<strong>in</strong><strong>in</strong>g<br />

routes for active receivers only, which are receivers<br />

<strong>of</strong> any currently active connection.<br />

2. Vary<strong>in</strong>g the frequency <strong>of</strong> rout<strong>in</strong>g updates: -<br />

Accord<strong>in</strong>g to this approach a node should trigger an<br />

update under three conditions only:-<br />

1. if it has some buffered data packets due to lack <strong>of</strong><br />

route.<br />

2. if one or more <strong>of</strong> its neighbors make a request for<br />

fresh routes it is a forward<strong>in</strong>g node that <strong>in</strong>tends<br />

to advertise any fresh valid/<strong>in</strong>valid route to the<br />

dest<strong>in</strong>ation so as to keep the route fresh.<br />

4. Research Methodology Used<br />

To carry out the experiment discussed <strong>in</strong> this paper<br />

NCTUns-6.0 simulation tool is used. The scenarios<br />

used for analysis, simulation setup, performance<br />

metrics used for mak<strong>in</strong>g various comparisons are<br />

discussed <strong>in</strong> this section.<br />

4.1 Simulation Tool Used<br />

In order to carry out a simulation work for vehicular<br />

networks two basic simulator types are required<br />

namely-network simulators <strong>and</strong> traffic simulator. But <strong>in</strong><br />

this study a hybrid simulator is used which provides an<br />

<strong>in</strong>tegration <strong>of</strong> both network <strong>and</strong> traffic simulator.<br />

The hybrid simulator used is NCTUns-6.0(National<br />

Chiao Tung University Network Simulator) which is<br />

the latest version <strong>and</strong> whose core technology is based<br />

on the novel kernel re-enter<strong>in</strong>g methodology <strong>in</strong>vented<br />

by Pr<strong>of</strong>. S.Y. Wang [13]. The various features <strong>of</strong><br />

<strong>VANET</strong> supported by NCTUns-6.0 makes it an<br />

obvious choice for this study.<br />

Figure 3: Strength <strong>of</strong> Traffic, <strong>VANET</strong>, <strong>and</strong> Ns-2 [3]<br />

4.2. <strong>Performance</strong> Metrics<br />

For this study three performance metrics are<br />

selected namely:-<br />

1. Throughput: - Throughput describes as the total<br />

number <strong>of</strong> received packets at the dest<strong>in</strong>ation out <strong>of</strong><br />

total transmitted packets [14].Throughput is calculated<br />

<strong>in</strong> bytes/sec or data packets per second.<br />

Total number <strong>of</strong> received packets at dest<strong>in</strong>ation* packet size<br />

T = ------------------------------------------------------------<br />

Total simulation time<br />

2. Packet Drop:-It shows total number <strong>of</strong> data packets<br />

that could not reach dest<strong>in</strong>ation successfully. The<br />

IJCTA | JAN-FEB 2012<br />

Available onl<strong>in</strong>e@www.ijcta.com<br />

52


Kusum Dalal et al,Int.J.Comp.Tech.Appl,Vol 3 (1), 50-55<br />

ISSN:2229-6093<br />

reason for packet drop may arise due to congestion,<br />

faulty hardware <strong>and</strong> queue overflow etc.<br />

3. Time taken for simulation:-This criterion specifies<br />

the total time taken by NCTUns-6.0 simulator to<br />

simulate <strong>in</strong>dividual scenario cases with separate rout<strong>in</strong>g<br />

protocols.<br />

4.3. Simulation Scenario<br />

Four cases are considered for highway <strong>and</strong> city<br />

scenarios with variable number <strong>of</strong> nodes (vehicles) <strong>and</strong><br />

variable speeds. These scenarios are drawn us<strong>in</strong>g<br />

NCTUns-6.0 “draw topology” feature.<br />

Case #1:<br />

Figure 7: City Scenario Case with 50 nodes <strong>and</strong> 8 m/s<br />

speed drawn us<strong>in</strong>g NCTUns-6.0<br />

4.4. Simulation Setup<br />

In this simulation study follow<strong>in</strong>g network<br />

parameters <strong>and</strong> tools are selected:<br />

1. IEEE 802.11b (ad-hoc mode) st<strong>and</strong>ard is used for<br />

each vehicular node.<br />

2. 1400 bytes <strong>of</strong> UDP packets used for<br />

communication.<br />

3. 15dbm Transmission power used for node<br />

operation.<br />

Table 1 <strong>and</strong> 2 specifies the parameter sett<strong>in</strong>gs for<br />

both highway <strong>and</strong> city scenarios respectively.<br />

Table 1: Input parameters for highway scenario<br />

Figure 4: Highway Scenario Case with 8 nodes <strong>and</strong> 36<br />

m/s speed drawn us<strong>in</strong>g NCTUns-6.0<br />

Case #2:<br />

Figure 5: Highway Scenario Case with 16 nodes <strong>and</strong> 20<br />

m/s speed drawn us<strong>in</strong>g NCTUns-6.0<br />

Case #3:<br />

Parameter Sett<strong>in</strong>g<br />

Total number <strong>of</strong> nodes 8,16<br />

Max. Node Speed 36 m/s , 20m/s<br />

Packet Type<br />

UDP<br />

Simulation Time 80 seconds<br />

Table 2: Input parameters for city scenario<br />

Parameter<br />

Sett<strong>in</strong>g<br />

Total number <strong>of</strong> nodes 20,50<br />

Number <strong>of</strong> Radio Obstacles 4<br />

Attenuation Provided 20 dBm<br />

Max. Node Speed 18 m/s,8 m/s<br />

Packet Type<br />

UDP<br />

Simulation Time 80 seconds<br />

Figure 6: City Scenario Case with 20 nodes <strong>and</strong> 18 m/s<br />

speed drawn us<strong>in</strong>g NCTUns-6.0<br />

Case #4:<br />

4.5. Simulation Result<br />

The graphs below show the performance <strong>of</strong> both<br />

<strong>AODV</strong> <strong>and</strong> <strong>ADV</strong> protocols <strong>in</strong> respect <strong>of</strong> chosen<br />

performance metrics.<br />

Figure 8: Throughput performance <strong>in</strong> Highway<br />

Scenario with 20 m/s speed <strong>and</strong> 16 nodes.<br />

IJCTA | JAN-FEB 2012<br />

Available onl<strong>in</strong>e@www.ijcta.com<br />

53


Kusum Dalal et al,Int.J.Comp.Tech.Appl,Vol 3 (1), 50-55<br />

ISSN:2229-6093<br />

Figure 9: Throughput performance <strong>in</strong> Highway<br />

Scenario with 36 m/s speed <strong>and</strong> 8 nodes.<br />

From above graphs it can be seen that <strong>in</strong> highway<br />

scenarios throughput with <strong>ADV</strong> protocol is much better<br />

than with <strong>AODV</strong> with throughput peak reach<strong>in</strong>g upto<br />

338 kB/s. Also, as speed is <strong>in</strong>creased the <strong>ADV</strong><br />

performance slightly degrades while <strong>AODV</strong><br />

performance rema<strong>in</strong>s comparatively same.<br />

Figure 12: Throughput performance <strong>in</strong> City Scenario<br />

with 8 m/s speed <strong>and</strong> 50 nodes.<br />

Figure 13: Throughput performance <strong>in</strong> City Scenario<br />

with 18 m/s speed <strong>and</strong> 20 nodes.<br />

Figure 10: Packet Drop performance <strong>in</strong> Highway<br />

Scenario with 20 m/s speed <strong>and</strong> 16 nodes.<br />

In city scenarios also, the throughput performance<br />

<strong>of</strong> <strong>ADV</strong> protocol is better than <strong>AODV</strong>. As the speed is<br />

<strong>in</strong>creased throughput with <strong>ADV</strong> protocol deteriorates<br />

<strong>and</strong> for some part even reaches comparative to <strong>AODV</strong><br />

performance. <strong>AODV</strong> performance rema<strong>in</strong>s almost<br />

unaffected by <strong>in</strong>creased speed.<br />

Figure 11: Packet Drop performance <strong>in</strong> Highway<br />

Scenario with 36 m/s speed <strong>and</strong> 8 nodes.<br />

The packet drop performance <strong>of</strong> <strong>ADV</strong> protocol is<br />

much better than <strong>AODV</strong> <strong>in</strong> highway scenarios as is<br />

seen from above graphs. As the speed is <strong>in</strong>creased from<br />

20 to 36 m/s the packet drop rate for <strong>AODV</strong> protocol<br />

<strong>in</strong>creases upto 440 drop packets while <strong>ADV</strong> packet<br />

drop performance rema<strong>in</strong>s comparatively same.<br />

Figure 14: Packet Drop performance <strong>in</strong> City Scenario<br />

with 8 m/s speed <strong>and</strong> 50 nodes.<br />

IJCTA | JAN-FEB 2012<br />

Available onl<strong>in</strong>e@www.ijcta.com<br />

54


Kusum Dalal et al,Int.J.Comp.Tech.Appl,Vol 3 (1), 50-55<br />

ISSN:2229-6093<br />

Figure 15: Packet Drop performance <strong>in</strong> City Scenario<br />

with 18 m/s speed <strong>and</strong> 20 nodes.<br />

The packet drop performance <strong>in</strong> city scenarios with<br />

<strong>ADV</strong> protocol completely outperformed <strong>AODV</strong><br />

performance. With <strong>in</strong>creased speed the packet drop rate<br />

<strong>of</strong> <strong>AODV</strong> protocol <strong>in</strong>creased upto almost 475 packets<br />

dropped, while <strong>ADV</strong> performance improves.<br />

Table 3 provides protocol performance data for<br />

simulation time criterion <strong>in</strong> different scenarios.<br />

Table 3: Total time taken by NCTUns-6.0 to complete<br />

the simulation for various cases<br />

Protocol<br />

<strong>AODV</strong> Name<br />

Case #1<br />

(m<strong>in</strong>.) 02:34<br />

Case #2<br />

(m<strong>in</strong>.) 03:59<br />

Case #3<br />

(m<strong>in</strong>.) 05:45<br />

Case #4<br />

(m<strong>in</strong>.) 10:57<br />

<strong>ADV</strong> 02:19 02:30 03:11 06:52<br />

The total time taken by NCTUns-6.0 simulator to<br />

complete the simulation is less for <strong>ADV</strong> protocol <strong>in</strong><br />

each <strong>in</strong>dividual scenario cases, yield<strong>in</strong>g high<br />

throughput performances <strong>and</strong> as the number <strong>of</strong> vehicles<br />

<strong>in</strong>creases the simulation time also <strong>in</strong>creases due to<br />

<strong>in</strong>creased complexity <strong>of</strong> network.<br />

5. Conclusion<br />

It can be concluded that <strong>ADV</strong> outperformed <strong>AODV</strong><br />

at most <strong>of</strong> the <strong>in</strong>stances <strong>in</strong> conformance with the work<br />

done by other researchers as mentioned earlier. It is<br />

noticed that for <strong>ADV</strong>, throughput peaks are almost 60-<br />

70% more <strong>in</strong> number as compared to <strong>AODV</strong>. Also,<br />

number <strong>of</strong> packet drop rema<strong>in</strong>s almost 80-90% below<br />

to that observed <strong>in</strong> <strong>AODV</strong> protocol. Also the time<br />

taken by NCTUns-6.0 simulator for simulat<strong>in</strong>g each<br />

aforementioned scenarios give a clear <strong>in</strong>dication that<br />

network with <strong>ADV</strong> protocol is simulated much faster as<br />

compared to <strong>AODV</strong> protocol.<br />

S<strong>in</strong>ce <strong>ADV</strong> is an <strong>in</strong>tegration <strong>of</strong> both proactive <strong>and</strong><br />

on-dem<strong>and</strong> techniques, it exhibits the best<br />

characteristics <strong>of</strong> proactive algorithms <strong>and</strong> is<br />

simultaneously responsive to the network needs <strong>and</strong><br />

conditions. Thus <strong>in</strong>ference can be drawn from the<br />

simulation results that <strong>ADV</strong> protocol is a preferable<br />

choice for multi-hop, vehicular environment <strong>and</strong> is a<br />

preferable choice while mak<strong>in</strong>g real-time tests <strong>of</strong><br />

vehicular environments.<br />

Driven Ad Hoc Rout<strong>in</strong>g <strong>Protocols</strong> us<strong>in</strong>g NCTUns”, Tenth<br />

International Conference on Computer Model<strong>in</strong>g <strong>and</strong><br />

Simulation.<br />

[4] Pranav Kumar S<strong>in</strong>gh, Kapang Lego, Dr. Themrichon<br />

Tuithung, “Simulation based Analysis <strong>of</strong> Ahoy Rout<strong>in</strong>g<br />

Protocol <strong>in</strong> Urban <strong>and</strong> Highway Scenario <strong>of</strong> <strong>VANET</strong>”,<br />

International Journal <strong>of</strong> Computer Applications, January<br />

2011, (0975 – 8887) Volume 12– No.10.<br />

[5] S. S. Manvi, M. S. Kakkasageri, C. V.<br />

Mahapurush,“<strong>Performance</strong> Analysis <strong>of</strong> <strong>AODV</strong>, DSR, <strong>and</strong><br />

Swarm Intelligence Rout<strong>in</strong>g <strong>Protocols</strong> In Vehicular Ad hoc<br />

Network Environment”, International Conference on Future<br />

Computer <strong>and</strong> Communication, 2009.<br />

[6] Rajendra V. Boppana, Satyadeva P Konduru,“An<br />

Adaptive Distance Vector Rout<strong>in</strong>g Algorithm for Mobile, Ad<br />

Hoc Networks”, IEEE INFOCOM, , 2001, pp. 1753-1762.<br />

[7] S.R. Das, R. Castaneda, J. Yan, <strong>and</strong> R.<br />

Sengupta,“Comparative performance evaluation <strong>of</strong> rout<strong>in</strong>g<br />

protocols for mobile ad hoc networks”, 7th Int. Conf. on<br />

Computer Communications <strong>and</strong> Networks (IC3N ), October<br />

1998 pp., 153–161.<br />

[8] Kev<strong>in</strong> C. Lee, Uich<strong>in</strong> Lee, Mario Gerla,“Survey <strong>of</strong><br />

Rout<strong>in</strong>g <strong>Protocols</strong> <strong>in</strong> Vehicular Ad Hoc Networks”,<br />

Rout<strong>in</strong>gBookChapterKLULMario.pdf.<br />

[9] M. Abolhasan, T. Wysocki <strong>and</strong> E. Dutkiewicz, “A review<br />

<strong>of</strong> rout<strong>in</strong>g protocols for mobile ad hoc networks”, Ad Hoc<br />

Networks 2, 2004, pp. 1–22.<br />

[10] N. H; Tony Larsson, “ Rout<strong>in</strong>g <strong>Protocols</strong> <strong>in</strong> Wireless Ad<br />

Hoc Networks- A Simulation Study” , Department Of<br />

Computer Science <strong>and</strong> Electrical Eng<strong>in</strong>eer<strong>in</strong>g, Luleå<br />

University <strong>of</strong> Technology, Stockholm, 1998.<br />

[11] Johnson, D. B. <strong>and</strong> Maltz, D. A. (1996), “Dynamic<br />

Source Rout<strong>in</strong>g <strong>in</strong> Ad Hoc Wireless Networks”, Mobile<br />

Comput<strong>in</strong>g, T. Imiel<strong>in</strong>ski <strong>and</strong> H. Korth, Eds., Ch. 5, Kluwer,<br />

1996, pp. 153–81.<br />

[12] Park, V.D., Corson, M.S. (1997), “A highly adaptive<br />

distributed rout<strong>in</strong>g algorithm for mobile wireless networks”,<br />

INFOCOM '97. Sixteenth Annual Jo<strong>in</strong>t Conference <strong>of</strong> the<br />

IEEE Computer <strong>and</strong> Communications Societies. Proceed<strong>in</strong>gs<br />

IEEE, Apr 1997, vol.3, pp.1405-1413, vol.3, 7-12.<br />

[13] S.Y. Wang <strong>and</strong> H.T. Kung, “A Simple Methodology for<br />

Construct<strong>in</strong>g Extensible <strong>and</strong> High-Fidelity TCP/IP Network<br />

Simulator”, IEEE INFOCOM’99, New York, USA, March<br />

21-25, 1999.<br />

[14] Manvi, S.S., Kakkasageri, M.S., Mahapurush, C.V.,<br />

“<strong>Performance</strong> Analysis <strong>of</strong> <strong>AODV</strong>, DSR, <strong>and</strong> Swarm<br />

Intelligence Rout<strong>in</strong>g <strong>Protocols</strong> In Vehicular Ad hoc Network<br />

Environment”, International conference on future Computer<br />

<strong>and</strong> Communication , April. 2009, pp. 21-25.<br />

6. References<br />

[1] Ghassan M. T. Abdalla, Mosa Ali AbuRgheff <strong>and</strong> Sidi<br />

Mohammed Senouci, “Current Trends <strong>in</strong> Vehicular Ad Hoc<br />

Networks”, Ubiquitous Comput<strong>in</strong>g <strong>and</strong> Communication,<br />

Publisher, Location, Date, pp. 1-10.<br />

[2] Vanet Simulator, Report for the Computer Security exam<br />

at the Politecnico di Tor<strong>in</strong>o Walter Dal Mut, Arm<strong>and</strong> S<strong>of</strong>ack<br />

[3] Khaleel Ur Rahman Khan, Rafi U Zaman, A.Venugopal<br />

Reddy,“<strong>Performance</strong> Comparison <strong>of</strong> On-Dem<strong>and</strong> <strong>and</strong> Table<br />

IJCTA | JAN-FEB 2012<br />

Available onl<strong>in</strong>e@www.ijcta.com<br />

55

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!