A secured vehicle to vehicle communication system to reduce accidents and to improve traffic control

1. VEHICULAR AD-HOC NETWORKs(VANET)
Presented by :
Mayuresh Bhagat
Shubham Khati
Ankita Panchabhai
Priya Mude

2. CONSIDER THE SITUATIONS?
You are on the way in a car and….
 Wish to know about traffic jam condition at next turn or road
condition ahead.
 Wish to have prior alert, if vehicle in front of you applying breaks.
 Wish to have advance information, if any vehicle meet with an
accidents on the road ahead.
 Wish to know whether the nearby parking area has vacancy or not.
 Wish to avoid accidents in ever increasing traffic conditions

3. THE ANSWER IS?
VANET

4. WHAT IS VANET?
 A large self-organized communication network in automobiles referred to as a
Vehicular ad-hoc network (VANET).
 VANET is V2V communication in ad hoc manner that enables the intelligent
transportation system(ITS).
 In a VANET each vehicle periodically broadcasts its geographic information
through GPS.
 The VANET provides an omnipresent computing atmosphere.

5. System model of VANET

6. WHY VANET?
 Today’s car accident alert system is not efficient.
 The accident first needs to be physically reported and then announced via a
radio broadcast or a portable GPS unit before a driver is alerted.
 It leads to jams, car collisions and inconvenience in traffic flow as well as for
people.
 Poor traffic monitoring.

7. KEY MANAGEMENT TECHNIQUES
 Safety Message Broadcast in VANET
 Shared Key Management Framework
 Distributed Key Management Frame
 Efficient Cooperative Message Authentication in Vehicular Ad Hoc
Networks
 RFID authentication

8. ROUTING PROTOCOL ANALYSIS
A routing protocol specifies how routers communicate with each other and enables
them to select routes between any two nodes on a computer network.
 AODV(Ad hoc on-demand distance vector)
 DSR(Dynamic Source Routing)
 DSDV(Destination-Sequenced Distance-Vector Routing)

9. AODV(AD-HOC ON-DEMAND DISTANCE VECTOR)
 AODV is a routing protocol that creates routes between nodes only when
the routes are requested by the source nodes.
 This gives the network the flexibility to allow nodes to enter and leave
the network at will.
 AODV is a reactive protocol: the routes are created only when they are
needed.

10. DSR(DYNAMIC SOURCE ROUTING)
 DSR is a routing protocol for wireless mesh networks.
 It uses source routing supplied by packet’s originator to determine
packet’s path through the network.
 This protocol is truly based on source routing whereby all the routing
information is maintained (continually updated) at mobile nodes.

11. DSDV(DESTINATION SEQUENCED DISTANCE VECTOR
ROUTING)
 DSDV is one of the early algorithms available for data relay.
 The main contribution of the algorithm was to solve routing loop
problem.
 There is no commercial implementation of this algorithm, since no
formal specification of this algorithm is present.

12. COMPARISON OF ROUTING PROTOCOLS
parameters AODV DSR DSDV
Definition
Selection of routes
Bandwidth consumption
Packet delivery rate
Latency
This protocol establishes
routes to destinations on
demand and supports
both unicast and
multicast routing.
Destination sequence
numbers are used to find
the latest route .
Good
More
More
This protocol is
specifically designed for
multi-hop ad hoc
networks.
Source routing supplied
by packet’s originator to
determine packet’s path
.
Less than AODV.
Less than AODV
Less than AODV
It is quite suitable for
creating ad hoc
networks with small
number of nodes.
The route with the better
metrics is used if the
latest sequence number
matches the one already
present.
Wastage of bandwidth.
Less than both
Less

13. ISSUES IN VANET
 The complicated physical domain of VANET incurs many challenging
issues to the cyber domain.
 Frequent broadcast of safety messages from a vehicle along the road may leak the
travelling route of a vehicle, which could be a privacy issue.
 Vehicles communicate with each other through radio over the IEEE 802.11p on 5.9GHz.
 If a vehicle would like to cheat others, it will send false messages.
 For example, a vehicle may claim a traffic jam somewhere; however in fact no traffic jam
happens there.
 The other phrase we will use in the cooperative message authentication is invalid
message.

14. COOPERATIVE MESSAGE AUTHENTICATION
PROTOCOL(CMAP)
 A cooperative message authentication protocol (CMAP) is developed to
alleviate vehicles' computation burden.
 With CMAP, all the vehicles share their verification results with each other in a
cooperative way, so that the number of safety messages that each vehicle needs
to verify reduces significantly.
 A promising thread of techniques to reduce the computation overhead in
authentication is cooperative authentication.

15. HOW DOES CMAP WORKS?
 In the CMAP, each vehicle sends periodically broadcasted messages (PBM) which include its
current geographic information every 300 ms.
 When its neighboring vehicles receive the PBM, they will decide whether they are verifiers
of this message.
 If a vehicle is the verifier of the message, it will start to verify the message by itself.
 Once an invalid message is identified, verifiers will broadcast a one hop warning message
to others. Otherwise, verifiers will keep silent.
 Non-verifiers will wait for cooperative warning messages (CWM) from verifiers.

16. PROCESS IN CMAP TECHNIQUE

17. COMPUTATION AND COMMUNICATION
OVERHEAD
 Verifying the group signature attached to each broadcast message is the dominating
component that consumes computation capacity.
 In our simulation, we use the average number of verified messages per vehicle per second
as the metric for the computation overhead.
 It is worth noting that CMAP method achieves a much lower missed detection ratio than
the non cooperative authentication with the same computation overhead.

18.  We have the following observations:
1) Compared with the conventional non-cooperative authentication protocol, our CMAP method achieves
significantly lower computation overhead.
2) The computation overhead of CMAP is independent of vehicle density, while that of the non-cooperative
protocol increases with the density.

19. Characteristics of VANET
 High Mobility of nodes
 Dynamic Topology
 Unbounded network size
 Frequent exchange of information
 Wireless Communication
 Crucial effect of privacy and security
 Real time , time sensitive data exchange

20. Safety applications(to enhance driving safety) like :
 EEBL – Emergency Electronic Brake Light(sudden braking)
 PCN – Post Crash Notification
 RFN – Road Feature Notification(ex. Downhill curve)
 LCA – Lane Change Assistance
 CCW – Cooperative Collision Warning
 Blind Merge Assistant and many more…
APPLICATIONS

21. Convenience Applications (for better driving experience):
 Road Congestion Notification
 Dynamic Route/ Travel Time Planning
 Querying Parking Availability
 Finding Parking Spots
Other Commercial/Infotainment/Telematics Applications:
 Remote Vehicle Diagnostics
 Free Flow Tolling
 Social Networking
 Multimedia Content Exchange
 Advertising

22. KEY RESEARCH AREAS IN VANET
 Quality of Service (QoS)
 Network Security
 MAC layer protocol
 Scalability and Robustness
 Image processing
 Co-operative Communication
 Mobility model
 Efficient Routing Algorithms Design
 Fault tolerance

23. MAJOR PLAYERS IN VANET RESEARCH

24. CONCLUSION
 The CMAP significantly reduces the computation overhead of each
vehicle at the cost of a slightly increased communication
overhead.
 AODV is the most effective algorithm in terms of throughput and
data transmission delay time for mobile ad hoc networks in urban
areas.
 VANET security system achieves privacy, traceability, non frame
ability, and privacy preserving defense against misbehavior.

25. REFERENCES
[1] Y. Toor and P. Mühlethaler, “Vehicle Ad Hoc Networks: Applications and Related Technical
issues”, IEEE Communications surveys & Tutorials, 3rd quarter, vol. 10, no. 3, (2008), pp. 74-88.
[2] M. Raya and J. P. Hubaux, “Securing vehicular ad hoc networks,” J. Comput. Security, vol. 15, no.
1, pp.39–68, Jan. 2007. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS,
VOL.14, NO. 1, MARCH 2013.
[3] Xiaodong Lin, Xu Li “Achieving Efficient Cooperative Message Authentication in Vehicular Ad-
hoc Network”, IEEE Transactions on Vehicular Technology, volume 62, no. 7, September 2013.
[4] A. Boukerche, “Performance Evaluation of Routing Protocols for Ad Hoc Wireless Networks”,
Mobile Networks and Applications vol. 9, Netherlands, 2004.
[5] Y. Hao, Y. Cheng, C. Zhou, and W. Song, ``A distributed key management framework with
cooperative message authentication in VANETs,'' IEEE J.Sel. Areas Commun., vol. 29, no. 3, pp.
616_629, Mar. 2011.

26. THANK YOU