A Survey on VANET Security through Position and Speed

A Survey on VANET Security through

Position and Speed Verification

Kavita Srivastava, Research Scholar, Department of Computer Application,

Shri Ramswaroop Memorial University, Lucknow

Abstract

Currently the vehicles or cars are equipped with the latest technologies and are being searched, that

future car systems will be fully controlled by the system software. With the development of digital

technology, it has been proposed of joint efforts by researchers and it has been built that the future car

will have the ability to reproduce itself (e.g. concept model introduced by Audi A9).In this continuity,

manufacturing by innovative ideas as well as researchers have modeled the vehicle adhoc network for

safe and secure driving.By strengthening the safety of the vehicle on the road. VANET is a wireless

network that is equipped with wireless devices, which is the communication between vehicles and

VANET. It provides communication between vehicles, and interfaces with communication points

established in road side infrastructure (RSI). In this intelligent transport system, information is shared

between vehicles and road side units. That is,on wireless communication, where there may be

inappropriate consequences of information done by malicious vehicles. We focus on such a security

issue. Where inappropriate information is generated by malicious nodes, due to which our security

arrangements fall into danger zone. In view of the authenticity of the vehicles, various parameters will

be included to verify information on the basis of security packet information.

Keywords: VANET, Security, Communication, Malicious Vehicles, RSI.

I. INTRODUCTION VANET is based on short-range wireless communication (100-300 meters) [1] between vehicle- to-

vehicle and some roadside infrastructure with the aim of improving road safety through the exchange of

alerts between neighborhood vehicles or to offer new comfort services to road users. Moreover, a large

number of Certification Authorities (CAs) will exist, where each CA is responsible for the identity

management of all vehicles registered in its region (e.g., national territory, district, and country).

Several types of messages are exchanged among vehicles such as traffic information, emergency

incident notifications, and road conditions. Due to shared wireless medium, it is important to forward

correctly messages in VANET, because attacker nodes may damage the messages [15, 16].

International Journal of Research

Volume VIII, Issue VI, JUNE/2019

ISSN NO:2236-6124

Page No:9

Figure 1: Vehicular Ad hoc Networks communicating units [2]

1.1 MOTIVATION

The increasing mobility of people has caused a high cost for societies as consequence of the increasing

number of traffic congestion, fatalities and injuries. If we take attention over the accidental death through

vehicles then we found that each and every state suffering from such hazard. We waste our time and

energy resources due to heavy traffic [30, 32]. Along with these facts traffic accidents are responsible for

a large portion of death causes. According to reports India road crashes kill 146,133 people in 2015

The incidence of accidental deaths has increasing trend since 2002. The following figure demonstrates

the percentage accidental death rate in various states [3, 21].

Figure 2: Accidental death percentage [3]

So we require an active participation of technology in the area of transportation that can facilitate safe

and secure driving. Thus, Vehicular Ad-Hoc Networks (VANETs) predict the traffic situation through

warning and alert so that drivers can get assistance to safe and secure driving [13, 17].

3



ISSN NO:2236-6124

Page No:10

1.3 PROBLEM STATEMENT

The next decade of transportation system is predicted as intelligent transportation system and it is

expected that vehicle will communicate with each other via radio interfaces [14, 34]. Thus the vehicular

network offering such functionality with the unique feature of high mobility of nodes, minuscule linkup

time etc. But with the prime functionality there are major security issues that are needed to overcome.

There are a various research has generated to detect and correct the security issues [10, 19]. Here we will

try to improve the security of VANET on the basis of alert message position shared among the vehicle.

II. SECURITY ISSUES AND REQUIREMENT

2.1 CLASSIFICATION OF MALICIOUS VEHICLES

The malicious vehicles instigate attack on the genuine vehicle in the VANET environment as per their

requirement and damage the communication or establish the unwanted communication. According to

their malicious activity we put the following classification [2]:

1.INSIDERS VS OUTSIDERS

The vehicle that is already participating the communication in VANET performs some non genuine

actions is known as the inside attackers. The outsider attackers are not directly part of the network but

the can perform limited capacity of attacks to harm the communicating system [9, 35].

2.MALICIOUS VS RATIONAL

If attackers harm/damage the participating nodes by using some methods without their personal benefits

are known as malicious vehicle. Converse to this, rational attackers expecting their personal benefits

that’s why they use prediction and patterns to execute the attacks [23].

3. ACTIVE VS PASSIVE

An attacker if produce a new packet/message to spoil the network is called active attackers while the

passive attackers only listen /observe the wireless channel and in nature passive attackers are less

harmful.

2.2 SECURITY ATTACKS

There are numerous attacks that can disturb the security of the VANET and the privacy of its nodes

(vehicles). Each type of attack affects some of the security services in the system. The following are the

most common devastating forms of attacks that a VANET can suffer [4], [5], [6]:

1. TIMING ATTACK: Time is a crucial aspect in any application so users need accurate information

on right time without any delay. In this attack attacker without manipulating the actual content add some

time slot to create a delay in the message due to this user will receive the message after the required time

[ 22, 33 ].

Here when a malicious vehicle receives an alert message then it holds the message and transmits it after

some time slot when a vehicle approaching nears the alert place. The following figure illustrates that



ISSN NO:2236-6124

Page No:11

malicious vehicle should forward the message when the vehicle was at position P but it transfer after few

time when vehicle reach upto position P1 where some unfavorable event was happened [7, 11].

Figure 11: Timing attack [2]

2.TUNNELING: The attacker connects two distant parts of the Ad hoc network using an extra

communication channel as a tunnel. As a result, two distant nodes assume they are neighbors and send

data using the tunnel [28].

3.SOCIAL ATTACK: The basic idea of the attack is to confuse and bedazzle the victim by sending

unethical and unmoral message so that driver gets disturb. The legitimate user reacts in annoyed manner,

which is the main objective of the attacker. It effects the driving of the vehicle which indirectly creates

the problem in the network [8, 12].

4.WORMHOLE ATTACK: In Wormhole attack, two or more malicious nodes form a tunnel to

broadcast packets from one end of the network to other ends malicious node and these packets are

broadcasted to the network. These node overcome the network and insecure the data packets or delete

them.

Figure 12: Wormhole Attack [5]



ISSN NO:2236-6124

Page No:12

III. PROPOSED APPROACH

3.1 POSITION & SPEED VERIFICATION

STEP 1: Y receives beacon from X

STEP 2: (Position verification based on RSU transmission range)

TLX =0;

If distance(X’s position (xi,yi), Y’s position(xj,yj)) ≤TRRSU

If X ∈ NTY

Update the position information of X in NTY

Else

Add X’s (ID, position) NTY

Else

TLX - -

Reject beacon from X

STEP 3: (Verification based on movement)

REPEAT STEP1

T = Time information from neighbour table

LT = Latest Time of beacon from X

TLX =0;

If X ∉ NTY

Add X’s (ID, position) NTY

Else

Pos_Pre = Position of X in NTY

Pos_New = Position information through beacon

SX = D (Pos_Pre, Pos_New)/ (T - LT)

If (SX ≤SMax)

Update position and time in NTY

Else

TLX - -

Reject beacon from X

Explanation of Pseudo Code

POSITION VERIFICATION

Lets we have numbers of Vehicles (nodes) that will participate in VANET environment by

exchanging the messages. The communication will be established on the basis of some parameters and

constraints.



ISSN NO:2236-6124

Page No:13

Let we have a vehicle with number of neighbours. Here we have also considered an additional

parameter, neighbour list for each vehicle to list the neighbour as well as update the position of its

neighbour .

Suppose vehicle X sends message (beacons) to vehicle Y and vehicle Y receives this message. It

means these vehicles are in the range of transmission and they can communicate [22].

Through beacons we can get the position coordinate of vehicles. In this case vehicle Y receives

beacons from vehicle X, so we have the coordinate of both the vehicles. Let vehicle’s X coordinate is

(x1, y1) and vehicle’s Y coordinate is (x2, y2).

Now we compute the distance between these points.

D =

Now we compare this distance D to the transmission range of vehicle (TR).

D ≤TR

Then it is quite well and if vehicle X is not the neighbour of Y currently then add this vehicle into

neighbour list of Y with the coordinate and if vehicle X is already in the neighbour list of Y then only

update the position (coordinate) only.

If D ≥TR then avoid the communication and reduce the trust level (TL) of vehicle X.

SPEED VERIFICATION

Let a vehicle X send beacons to Y i.e. Y receives beacons from vehicle X. Each and every vehicle

has the neighbour table (NT) in which it stores the neighbour details.

Because the vehicle Y receives the beacons from vehicle X so we have to verify about the availability

of details of vehicle X in the neighbour list of Y (NLY).

If available then it is all right otherwise we have to add this vehicles(X) information in the neighbour

list of vehicle Y.

Now for the calculation of speed on the basis of received beacons over different interval will be

calculated.

V = distance based on successive beacons received /time interval of received beacons

Now this speed will be compare with the specified maximum speed (Vmax).

If V ≤ Vmax it means vehicle will be considered for the communication and new position will be

set as:

Against to if vehicle speed V ≥ Vmax , so we reduce the trust level of vehicle X (TLX) and ignored

such vehicle after a certain time.

3.2 PARAMETERS & DESCRIPTION

The approach involves the following parameter that is listed in the in the table1 along with description.



ISSN NO:2236-6124

Page No:14

Notations Descriptions

A_MSG Alert Message

B_MSG Beacons Message

R_MSG Reply Message

D_A_MSG Deny A_MSG Message

TPA_MSG Time period during a alert message is alive

Δ Time interval

AE_LOC Location of alert event

LjT1 Node j sends alert message at time t1

TA Alert Type

NLjT1 Node location

TIE Table of invalid events table

E Event

Table 1: Parameters with their description

EXPLANATION

1. Initially the two variable Temp and C are set as 1 and 0 respectively.

2. Node ni receives an alert message A_MSG including the five tuples on time t2 that was send by the

node j at time t1.

3. Now we have checked the authenticity of this alert message on the basis of the sending time (t1) and

time taken to reach from location first to location second. i.e.



ISSN NO:2236-6124

Page No:15

t2 = t1 + time_dist (NLiT2, NLjT1)

4. Now we verify the alert message with few conditions.

a) t1 < t2 and t2 − t1 < TPA_MSG

b) (NLjT1 , NLiT2) < dist(NLiT2, AE_LOC)

5. In this first of all we check the receiving time(t2) of alert message must be larger than the sending

time(t1)and differences of these time(t2-t1)must not exceed the alive time of the alert message because it

is assumed that every alert message have a time of alive. Along with this it is also verified that the

distance between the alert receiving nodes must be larger than the distance between sending and

receiving node. It will verify that node receiving the alert is far from the alert position as well as the

position of the sending node. This verifies that the alert receiving vehicle can be in progress [18, 20].

6. After that we increase the time stamp and node ni receives beacon from nj.at time t4 that was send at

time t3 and we recalculate authenticity of time t3 and t4 as above (step 3).

7. Now we check the event (E) from the invalid event table that lists all the event type along position.

Here we verify the alert position and the position of the vehicle sending the alert on the basis of table

information and beacons. This verification will return either 0 or 1 to CHK_FUN. If the value of

CHK_FUN is 1 and temp is set to 0 then it justify the alert position is right and it will broadcast “valid

alert”. Contradictory against “valid alert”, if the value of CHK_FUN is 0 then it justify the alert position

is not up to date right and it will broadcast “invalid alert”. Whenever we receive the value of CHK_FUN

is 0 then we set the temp as 1.

8. To prevent the misbehavior we can repeat the procedure when we receive any alert message to

improve the security in VANET environment [24, 26, 29].

IV. REAL TIME VANET ANALYSIS THROUGH SUMO(SIMULATION OF URBAN

MOBILITY)

Sumo is a simulation Software that simulate the road traffic and said to handle the large road

networks.Sumo is implemented and designed using C++ libraries.By using Sumo we can evaluate the

performance of traffic lights on a weekly basis by advance algorithms.Using Sumo, we can choose the

route according to our requirement(considering population,pollution,traffic in that area).Sumo was

developed by Institute of Transportation Systems(ITS) which is an open source road traffic simulation

tool. The road network created through Sumo using following steps [ 25, 27, 31]:

1.Importing Map

For realistic simulation we create a network file and the real world road map downloaded from open

street map.org as shown in figure.



ISSN NO:2236-6124

Page No:16

Figure1: Open street map of Faizabad Chowk ,India

The map downloaded for Faizabad Chowk,India as OSM file.

2.Network File Creation

The network file is created using OSM file.The OSM file is converted to fzd.net.xml file using following

commands:

<type id="highway.bridleway" priority="1" numLanes="1" speed="2.78" allow="pedestrian"

oneway="1" width="2.00"/>

<type id="highway.bus_guideway" priority="1" numLanes="1" speed="8.33" allow="bus"

oneway="1"/><type id="highway.cycleway" priority="1" numLanes="1" speed="5.56" allow="bicycle"

oneway="0" width="1.00"/>

3.Network File:The converted network file has different attributes like edges and lanes.

4.Defining Route:The route of each vehicle will be defined by creating trip file having attributes like

route id and departure id.

<route edges="-210670014 210670154#1 210670104#0 210670104#1 210670001#0 210670001#1

210669987#2"/>

</vehicle><vehicle id="1" depart="1.00">

<route edges="-210669911 210670155#1 210669971 210670153#3 210670153#4 209643121#1

209643121#2 209643121#3 209442232#7 209442232#0 209442232#1 209442232#2 209442232#3

209442232#4 210669986#0 210669986#1 -210670001#0 210670104#2 -210669998"/>

</vehicle>

The phython script Randomtrips is provided by the SUMO to create link between two vehicles.

5.Route File:

Route file has the information about the route that vehicles would travel.



ISSN NO:2236-6124

Page No:17

6.Configuration file:

Simulation Scenario is shown in sumo.cfg file which show network and routing files as well as road

network will be configured with the start and end time as shown in figure

<configuration xsi:noNamespaceSchemaLocation="http://sumo.sf.net/xsd/sumoConfiguration.xsd">

<input>

<net-file value="map.net.xml"/><route-files value="map.rou.xml"/>

<additional-files value="map.poly.xml"/></input><time>

<begin value="0"/>

<end value="1000"/>

<step-length value="0.1"/>

</time>

</configuration>

Figure2: Simulation view of Faizabad Chowk area ,India through SUMO

Steps and commands

1.Firstly, Export a map from www.openstreetmap.org

The file will be named as map.osm

2.Now the commands to run the simulation are given stepwise below:

Step3:

netconvert --osm-files map.osm -o map.net.xml

Step4:

Go to the link http://sumo.dlr.de /wiki/Networks/Import/OpenStreetMap and copy the additional polygon

structures.

Step5:

Go to map folder and paste the structures in the folder named typemap.xml

Step6:

Open terminal and write the commands as follows:

polyconvert –net-file map.net.xml –osm-files map.osm –type-file typemap.xml –o map.poly.xml

python /home/shubhang/sumo-0.22.0/tools/trip/randomTrips.py –n map.net.xml –e 100 –l

python /home/shubhang/sumo-0.22.0/tools/trip/randomTrips.py –n map.net.xml –r map.rou.xml –e 100

–l



ISSN NO:2236-6124

Page No:18

Step7:

After this, the routes have been created in the xml file.

Next step is configuration for SUMO gui.

Steps:

Sumo.cfg file must be present in the sumo folder.

Copy it and paste in on your working folder and rename it as map.sumo.cfg

Make changes in the file according to the names of the folder that you have created.

Now,

Run sumo as:

sumo-gui map.sumo.cfg

(in terminal/command prompt)

V. CONCLUSION

The proposed methodology is formulate to secure the VANET environment on the basis of the

information gathered from alert and beacons messages. In proposed approach it is tried to verify the

position of the alert and then decide the appropriate action on the basis of received alert message. After

receiving an alert vehicle can verify the truthfulness of the event on the basis of location verification and

take the security majors. Our proposed approach is based on real time simulation that the clear view

vehicles are moving at traffic signal. The work can be further expanded to minimize accidents and to

detect optimal path from source to destination.

REFERENCES

1. Mohammed Saeed Al-kahtani, “Survey on Security Attacks in Vehicular Ad hoc Networks

(VANETs)”, 978-1-4673-2393,2012 IEEE

2. Accidental Deaths Report by India National Crime Records Bureau.

3. Bharati Mishra, Priyadarshini Nayak, Subhashree Behera, “Security in Vehicular Adhoc Networks:

A Survey”, ICCCS’11, February 12–14, 2011, Rourkela, Odisha, India. Copyright 2011 ACM 978-1-

4503-0464

4. Shrikant S. Tangade, Sunilkumar S. Manvi, “A Survey on Attacks, Security and Trust

Management Solutions in VANETs” IEEE – 31661, 4th ICCCNT – 2013 July 4 - 6, 2013,

Tiruchengode, India,

5. A. Dadhich, Dr. A. K. Sarje, Dr. (Mrs.) K. Garg, “A Distributed Cooperative Approach to Improve

Detection And Removal Of Misbehaving MANET Nodes”

6. Jyoti Grover, Manoj Singh Gaur, Vijay Laxmi, “Detection of Incorrect Position Information using

Speed and Time Span Verification in VANET”, SIN’12, October 25–27, 2012, Jaipur, Rajasthan, India,

Copyright 2012 ACM 978-1-4503-1668-2/12/10

7. Danda B. Rawatz, Bhed B. Bistax, Gongjun Yan_, and Michele C. Weigley, “Securing Vehicular

Ad-hoc Networks Against Malicious Drivers: A Probabilistic Approach”, 2011 International Conference

on Complex, Intelligent, and Software Intensive Systems, 978-0-7695-4373-4/11 © 2011 IEEE DOI

10.1109/CISIS.2011.30

8. Maxim Raya, Panagiotis Papadimitratos, Imad Aad, Daniel Jungels, and Jean-Pierre Hubaux,

“Eviction of misbehaving and faulty nodes in vehicular networks”, IEEE Journal on Selected Areas in

Communications 25(8):1557–1568, 2007.



ISSN NO:2236-6124

Page No:19

9. Subir Biswas, Jelena Miˇsi´c, Vojislav Miˇsi´c, “ID-based Safety Message Authentication for

Security and Trust in Vehicular Networks”, 31st International Conference on Distributed Computing

Systems Workshops, 2011 1545-0678/11 © 2011 IEEE

10. A. Hesham, A. Abdel-Hamid and M.A. El-Nasr, “ A dynamic key distribution approach for PKI

based VANETs”, Wireless Days(WD), 2011 IFIP, pp.1-3, 10-12 Oct. 2011

11. M. Manvi, M.S. Kakkasageri, and D.G. Adiga, “Message Authentication in Vehicular adhoc

Network: ECDSA based Approch”, Future Computer and Communication, ICFCC 2009. International

Conference on, 2009, pp. 16-20.

12. H. Al. Fasai, “Revocation in VANETs: A Survey” Innovations in Information Technology (IIT),

2011 International Conference on, pp.214-219, 25-27 April 201.1

13. Huang Lu, Jie Li and M Guizani, “ A Novel ID-Based Authentication Framework with Adaptive

privacy prevention for VANETs ” Computing, Communications and Applications Conference

(ComComAp), 2012, pp.345-350, 11-13 Jan. 2012

14. https://veniam.com/

15. http://www.adaptive-ip.eu/

16. www.compass4d.eu/

17. http://vra-net.eu/about-the-vra-network/

18. http://www.citymobil2.eu/en/

19. http://www.drive-c2x.eu/project

20. http://www.eict.de/en/simtd.html

21. http://www.wisafecar.com/

22. https://dsn.tm.kit.edu/english/projects_now-project.php

23. http://www.safespot-eu.org/

24. http://gizmodo.com/346983/cartorrent-yes-exactly-what-it-sounds-like

25. http://www-personal.engin.umd.umich.edu/~vnsrl/IVDBMS_Project.htm

26. G Remy,SM Senouci,F Jan,Y Gourhant. LTE4V2X-Collection,dissemination and multi-hop

forwarding. IEEE International Conference on Communications (ICC)2012.p.120-5.

27. J Zaldivar,CT Calafate,JC Cano,P Manzoni. Providing Accident Detection in Vehicular Networks

Through OBD-II Devices and Android based Smartphones 5th IEEE Workshop On User Mobility and

VEhicular Networks,

28. Bonn, Germany 2011.

29. Khan, Imran, and Amir Qayyum, ëPerformance evaluation of AODV and OLSR in highly fading

vehicular ad hoc network environmentsíINMIC IEEE 13th International Conference, 2009

30. Jun Peng, Liang Cheng, ìA distributed MAC scheme for emergency message dissemination in

Vehicular ad hoc networksî,IEEE Transaction on Vehicular Technology, Vol.56,No.6, pp.3300-3308,

2007.



ISSN NO:2236-6124

Page No:20

31. http://sumo.dlr.de/wiki/Tools/TraceExporter#ns2.2Fns3 accessed on

32. http://sumo.dlr.de/wiki/Tutorials/Trace_File_Generation

33. http://sumo.dlr.de/wiki/Tutorials/Import_from_OpenStreetMap

34. Asif Uddin Khan, Bikram Kesari Ratha, "Time Series Prediction QoS Routing In Software Defined

Vehicular Ad-hoc Network", MAMI, IEEE-2015, pp.

35. M. H. Eiza, Thomas Owens, and Qiang Ni, "Secure and Robust Multi-Constrained QoS aware

Routing Algorithm for VANETs", TDSCSI, IEEE-2014, pp.1-14



ISSN NO:2236-6124

Page No:21

Documents

A Survey on VANET Security through Position and Speed