Improved safety IRP using VANET

Improved Safety Information Routing Protocol using Vehicular Ad hoc

Network

ByRama M. Maliya

Guided By: Mr. Trupesh Patel

Asst. Prof.CE, SOCET

Abstract

Vehicular Ad hoc Networks (VANETs) is one of the most

important technique to provide road safety. Some challenging

issues in the VANET like mobility, routing, connectivity. safety

information routing protocol for sending data from source to

destination.

In this system Spray & wait Router & Direct Delivery Router

using for data transmission between different nodes.

VANETA VANET is effectively a subset of MANETs.

Vehicular Ad Hoc Networks (VANETs) are created by applying the principles of mobile ad-hoc networks  (MANETs) - the spontaneous creation of a wireless network for data exchange - to the domain of vehicles.

Applications

1. Traffic Coordination in Intersections2. Collaborative Route Computation3. Safety oriented 4. Commercial Applications (internet & map)5. Productive Applications (time & fuel)

Literature Review

Title Author, Publication & Year

Summery Simulator/Software

Safety Information Routing Protocol in Vehicular Ad hoc Networks

1. Spoorti Doddamani2. Prof Aswani KumarIEEE, 2015

Establishes the routing between the nodes.

C in WINDOWS platform on Pentium-i3 machine

Technique to Improve the File Transfer Outcomes Between Road Side Unit and Vehicles in Vehicular Ad-Hoc Networks

1. Shashank kumar Gupta

2. Sibaram KharaIEEE, 2015

Continues connection we will use the connectivity aware routing protocol (CAR) and multipath TCP.

Simulator (NS-2)

Recovering VANET Safety Messages in Transmission Holes

1. Faisal Khan,2. Kamran Sani, 3. Farhan Elahi, 4. John CopelandIEEE, 2013

Nack With Smart Neighborhood – Hole Recovery (Nsn-h) Technique

ns-3 simulator

Intelligent Traffic Signal Control for Urban Central Using Vehicular Ad-hoc Network

1. Erfan Shaghaghi, 2. Ali Jalooli, 3. Rozita Aboki, 4. Alireza Marefat, 5. Rafidah Md NoorIEEE, 2014

create various adaptive traffic signal cycles to control the traffic congestion.

SUMO traffic simulation

Title Author, Publication & Year

Summery Simulator/Software

Vehicular Ad Hoc Networks: How to Show the Impact on Traffic Safety?

1. Moritz Killat, 2. Hannes HartensteinIEEE, 2007

increase transport efficiency and traffic safety.

microscopic traffic simulator (VISSIM )

Research of Security for Vehicular Ad Hoc Networks

1. Han Guo2. Gang LiuIEEE, 2010

The main function of the module is making the real-timereaction to the road condition information.

The Security of Vehicular Adhoc Networks

1. Farzad SabahiIEEE, 2011

Attacks in the network world also exist in VANET. They are of widespread and different categories which can be classified in three major groups :Authentication, confidentiality

Performance Analysis Of Vehicular Ad-hoc Networks Handovers With Meta-heuristic Algorithms” :A Review

1. Dr. S.S.Dorle2. Mr. Pravin

WararkarIEEE, 2013

analysis the relationship between the throughput and the reliability with Inter VANET handovers.

Analysis of Existing System

Delay v/s Number of vehicles

Route lifetime v/s Number of vehicles

Analysis of Existing System

Proposed Work

Improved Safety Information Routing Protocol :1. Calculation of traffic density : Using length of vehicle

and safety distance between vehicles we calculate traffic density. Area=(length*breadth) of the road, Traffic density=area/(number of the vehicles + safety distance between vehicles).

2. Forward message from source node to destination node & Route Establishment for the same

3. Spray And Wait Router uses for the data transmission.

Algorithm

Step 1: Let S be the source node and D be the destination node.

Step 2: Let (Xs , Ys) and (Xd , Yd) be the co-ordinates of source node and destination node respectively.

Step 3: The distance d between the source node and destination node is calculated using the Euclid’s relation

Step 4: With S as centre and d as radius an arc is considered from source to destination and is referred as forwarding zone.

Step 5: With D as centre and 2d as radius another arc is considered along the length of the road and is referred as expected zone.

Algorithm

Step 6: The forwarding and expected zones are divided into five and four hops respectively.

Step 7: The neighboring node to the source S in first hop with maximum speed is determined and referred as ni.

Step 8: Data is transmitted to the node ni which is having maximum speed; if the speeds of two or more vehicles is same then the data is transmitted randomly.

Step 9: For the Data Transmission spray And Wait & Direct Delivery Router Protocol

S Source & D Destination

Distance between the co-ordinates

Determination of Forwarding & expected

Is Forwarding

Zone

Spray And Wait Router Protocol

Direct Deliver Router Protocol Use in expected Zone

 Expected Zone

Packet transfer One node to another

System Flow

Yes No

Software & Tools

• Front End One Simulator • JAVA programming

Spay And Wait Router, Direct Delivery Router

create

d

relay

ed

dropp

ed

deliv

ered

respo

nse_

prob

laten

cy_a

vg

hopc

ount_

avg

buffe

rtime_

avg

0

500

1000

1500

2000

2500

3000

Spray & Wait RouterDirect Delivery Router

Spray And Wait Router

create

d

starte

d:

dropp

ed

deliv

ered

deliv

ery_p

rob

overh

ead_

ratio

laten

cy_a

vg

hopc

ount_

avg

0

500

1000

1500

2000

2500

Spray & Wait Router with different Message Interval

create

d

starte

d:

relay

ed

dropp

ed

remov

ed

deliv

ered

deliv

ery_p

rob

overh

ead_

ratio

laten

cy_a

vg

hopc

ount_

avg

0

1000

2000

3000

4000

5000

6000

0 to 80 to 160 to 248 to 3525 to 35

Spray & Wait Router with No of Host=40

delivered overhead_ratio0

5

10

15

20

25

30

35

40

45

50

No of Host= 40

Spray And Wait Router with No of Host=50.

delivered overhead_ratio0

5

10

15

20

25

30

35

40

45

50

No of Host= 50

Spray And Wait Router with No of Host=60

delivered overhead_ratio0

5

10

15

20

25

30

35

40

45

50

No of Host= 60

Spray And Wait Router with No of Host=70

delivered overhead_ratio0

10

20

30

40

50

60

No of Host= 70

Spray And Wait Router with No of Host=80

delivered overhead_ratio0

5

10

15

20

25

30

35

40

45

50

No of Host= 80

Delivered v/s Overhead ratio in Spray And Wait Router

delivered OverHead Ratio0

5

10

15

20

25

30

35

40

45

50

Delivered v/s Overhead ratio in Direct Delivered Router

delivered Overhead Ratio0

2

4

6

8

10

12

Direct Delivered Router

create

d

deliv

ered

overh

ead_

ratio

hopc

ount_

avg

0

20

40

60

80

100

120

140

160

180

Direct Delivery

No of Host v/s Buffer Size in Direct Delivery Router

10M 15M 20M 25M 30M0

5

10

15

20

25

30

35

40

45

Buffer Size

No o

f Hos

t

No of Host v/s Delivered packets in Direct Delivery Router

1 2 3 4 50

10

20

30

40

50

60

70

80

90

No. of HostDelivered

No of Host v/s Delivered packets in Spray And Wait router

1 2 3 4 50

10

20

30

40

50

60

70

80

90

deliveredNo of host

Spay And Wait Router, Direct Delivery Router

Parameters Spray & Wait Router Direct Delivery Router

Delivered message 46 11

delivery_prob 0.2738 0.0655

overhead_ratio 14.9783 0

latency_avg 1855.5652 2072.1909

Analysis by using Spray And Wait Router

No of Host overhead_ratio latency_avg

40 14.9783 1855.5652

50 15.3191 1700.8702

60 16.4091 1631.8864

70 14.5192 1495.7

80 16.413 1657.8304

Different Message Interval in S&W Router

Parameters 0 to 8 0 to 16 0 to 24 8 to 35 25 to 35

Delivered 77 75 75 53 46

overhead_ratio 31.1169 23.6933 20.8667 16.6981 14.9783

latency_avg 878.3584 1159.12 1302.96 1617.87 1855.57

Conclusion

Vehicular Ad hoc Network is most promising technique for communication between vehicle to vehicle & vehicle to road. By using VANET we can send message from one vehicle to another vehicle. In this scenario message is forwarding from source to destination. Spray And Wait Router & Direct Delivery Router protocol uses. Delay problems can be solved.Spray And Wait is better for this.

References[1] Sahu, Pratap Kumar, et al. "BAHG: Back-Bone-Assisted Hop Greedy Routing for VANET's City Environments." Intelligent Transportation Systems, IEEE Transactions on 14.1 (2013): 99-213.

[2] Multipath TCP in Vehicular to Infrastructure Communications Nigel Williams, Prashan Abeysekera , Nathan Dyer*, Hai Vu,Grenville Armitage Centre forAdvanced Internet ∗Architectures, Technical Report 140828A Swinburne University of Technology

Melbourne.

[3] R. L. Gordon, W. Tighe, and I. Siemens, Traffic control systems handbook: US Department ofTransportation, Federal Highway Administration, Office of Operations, 2005.

[4] J. Otto, F. Bustamante, and R. Berry, “Down the block and around the corner the impact of radio propagation on inter-vehicle wireless communication,” in Distributed Computing Systems, 2009. ICDCS ’09. 29th IEEE International Conference on, pp. 605 –614, june 2009.

[5] Jeremy Blum and Azim Eskandarian. The threat of intelligent collisions. IT Professional, 6(1):24-29, Jan.-Feb. 2004.1. Clerk Maxwell, A Treatise on Electricity and Magnetism, 3rd ed., vo!' 2. Oxford: Clarendon, 1892, pp.68-73.

References

[6] SuKyoung Lee, Kotikalapudi Sriram, Kyungsoo Kim,Yoon Hyuk Kim, and Nada Golmie, Vertical Handoff Decision Algorithms for Providing Optimized Performance in Heterogeneous Wireless Networks,” IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 58, NO. 2, FEBRUARY 2009.

[7] The FCC DSRC (Dedicated Short Range Communications) web site. http://wireless.fcc.gov/services/its/dsrc/.

[8] Vehicle Safety Communications Project, Final Report, DOT HS 810 591, April 2006.

Thank you