FINDING OPTIMAL ROUTE FOR EMERGENCY

VEHICLES USING VANET

PROJECT PHASE II

Submitted by
Student Name Register no.
M.LEELA AKASH 19TD0440
SOMORJIT LAISHRAM 19TD0452
V.VIKRAM 19TD0465

Under the guidance of

Mrs. S.LAVANYA, M.Tech, IT,
Asst. Professor
In partial fulfillment for the award of the degree
of
BACHELOR OF TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CHRIST COLLEGE OF ENGINEERING AND TECHNOLOGY
PONDICHERRY UNIVERSITY PONDICHERRY, INDIA.
 APRIL 2023
CHRIST COLLEGE OF ENGINEERING AND TECHNOLOGY
PONDICHERRY UNIVERSITY

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

BONAFIDE CERTIFICATE

This is to certify that the project work entitled “FINDING OPTIMAL ROUTE PATH FOR
AMBULANCE” is a work done by M. LEELA AKASH [REGISTRATION NUMBER:
19TD0440], SOMORJIT LAISHRAM [REGISTRATION NUMBER:19TD0452], V.
VIKRAM [REGISTRATION NUMBER:19TD0465] in partial fulfillment of the requirements
for the award of B.Tech Degree in Computer Science and Engineering by Pondicherry University
during the academic year 2022-2023.

PROJECT GUIDE HEAD OF THE DEPARTMENT

Project Examination held on _________________

INTERNAL EXAMINER EXTERNAL EXAMINER

 ACKNOWLEDGEMENT

I find great pleasure in thanking our Chairman and Managing Director Dr. S. R. S. Paul,
M.E., Ph.D., for all his support and encouragement and for providing us with a better
environment for studying as well as to equip myself to the learning environment.

It gives me great ecstasy of pleasure to convey my deep and sincere thanks to our
Principal Dr. A. Sivakumar, M.E., Ph.D., M.I.S.T.E., for having given permission to take up
this project and for his kind patronage.

I wish to extend my sincere gratitude to the Head of the Department of Computer Science
and Engineering, Mrs. K. Sudha, M.Tech.,( Ph.D.), M.I.S.T.E., Senior Assistant Professor
who has always been a constant source of inspiration and encouragement during the course.

I would like to express my heartfelt thanks to our Project guide Mrs.S.LAVANYA,

M.Tech, IT, AP/CSE for her guidance and support from the starting of the project without
which I might not have been able to succeed in my work.

I thank all faculty members, supporting teaching and non-teaching staffs for the help they
extended in completing my project phase-II. I also express my sincere thanks to my family
members and all my friends for their continuous support.

Last but not least, as everything begins and ends in Almighty GOD, I conclude this
acknowledgement by thanking GOD for everything.

M.LEELA AKASH

SOMORJIT LAISHRAM

V. VIKRAM
 Abstract

This research proposal mainly reports the problem of deciding the traveling path with
minimalized Parking Delay co efficient for improvised security related applications in Vehicular
Adhoc networks. Most of the previous research works are target to reduce the overall Parking
Delay with adaptive blind based schemes. (For example, shortest path algorithm, based on
connectivity parameters, total number of intermediate relays),In this approach, our algorithm
implements the power and Parking Delay effective spine nodes on intersection of roadsides and
connects all the spine nodes with help of bridge nodes. These type of nodes helps to balance the
higher no of nodes with effective Parking Delay and connectivity co efficient. To transfer the
data Packets routes which having lesser no of weights are elected to transfer the packet. In
additional we are applying the Adaptive path rerouting scheme on urban vehicular adhoc network
to eliminate the traffic on road segments. End-to-end packet latency increases with the increasing
number of vehicles associated with that path in vehicle network systems. In the case of Parking
Delay-sensitive applications, the exchange of information must be carried out very quickly in
order to ensure the quality of infotainment services.The modified method of priority queuing is to
solve the constraints imposed by a Parking Delay in processing. By choosing a set of alternative
paths based on individual node buffer status, the proposed system dramatically minimizes
average latency.Finally, in order to the performance improvement of the proposed algorithm
relative to existing relaying schemes, both analytical and simulation results are given.
 TABLE OF CONTENTS

CHAPTER TITLE PAGE

NO. NO.
ABSTRACT i
LIST OF TABLES vi
LIST OF FIGURES vii

1. INTRODUCTION
1.1 INTRODUCTION 1
1.2 ABOUT THE PROJECT 2
1.2.2 FEATURES OF VANET 5
1.2.3 VANET SIMULATION PROBLEM 6
1.3 SCOPE OF THE PROJECT 7
1.4 ORGANIATION OF THE CHAPTER 7

2. LITERATURE SURVEY
2.1 GROOVESIM NETWORK SIMULATION 9
2.2 NHTSA (NATIONAL HIGHWAY TRAFFIC
SAFETY APPLICATION) 9
2.3 FLEETNET NETWORK DEMONSTRATOR 10
2.4 CARLINK THE CARLINK 10
2.5 CAR2CAR THE CAR2CAR 11
2.6 CLARION THE CLARION 11
2.7 IP PREVANET 12
2.8 COOPERATIVE VEHICULES AND
INFRASTUCTURE SYSTEM 12
2.9 DEMO 2000 14
2.10 CAR TALK 2000 14
3. EXISTING SYSTEM
3.1 INTRODUCTION 15
3.2 DEDICATED SHORT-RANGE COMMUNICATION 16
3.3 DISADVANTAGES 17
3.4 PROBLEM FORMATION 18

4. PROPOSED SYATEM
4.1 INTRODUCTION 19
4.2 PRIORITY BASED TRANSMISSION 20
4.3 ADVANTAGES 21
4.4 ARCHITECTURE 21

5. MODULE
5.1 MODULE SPECIFICATION 22
5.1.1 MODULE 22
5.2. MODULE DESCRIPTION 23
5.2.1 MODULE 1: IMPLEMENTATION OF
NETWORK 23
5.2.2 MODULE 2: TRUTH MODEL
MECHANISH 23
5.2.3 MODULE 3: CLUSTER INITIALIZATION
AND CLUSTER SELECTION 24
5.2.4 MODULE 4: WIRELESS ACCESS FOR
VEHICULAR ENVIRONMENTS (WAVE) 25
5.2.5 MODULE 5: ALGORITHM
IMPLEMENTATION 26

6. SOFTWARE AND HARDWARE REQUIREMENTS

6.1 INRODUCTION 27
 6.1.1 SOFTWARE REQUIREMENTS 28
6.1.2 HARDWARE REQUIREMENTS 28
.

7. SYSTEM DESIGN
7.1 INTRODUCTION 29
7.2 NS2 INSTALLATION 30
7.3 SIMULATION FRAMEWORK 31
7.3.1 AGENTS: NETWORK PROTOCOL AND
APPLICATION 32
7.3.2 SCHEDULES: PACKET IS EVENT 32
7.4 STARTING NS2 34

8. SAMPLE CODING
7.1 SAMPLE CODING 36
7.2 MAIN. TCL 60

9. TESTING
9.1 INTRODUCTION 65
9.2 TYPES OF TESTING 65
9.2.1 WHITE BOX TESTING 66
9.2.2 BLACK BOX TESTING 66
9.2.3 ALPHA TESTING 66
9.2.4 BETA TESTING 66
9.2.5 VALIDATION TESTING 67
9.2.6 OUTPUT TESTING 67
 9.2.7 USER ACCEPTANCE TESTING 68
9.3 UNIT TESTING 68
9.4 INTEGRATION TESTING 69

10. PERFORMANCE EVALUATION

10.1 INTRODUCTION 75
10.2 HYBRID APPROACH 76
10.3 EXPERIMENTAL SETUP 77
10.4 SIMULATION RESULTS 78
10.5 STATISTICAL ANALYSIS 88

11. CONCLUSION 93
REFERENCE 94
APPENDIX 1 96
SCREEN SHOT 97
 LIST OF TABLE

TABLE NO. DESCRIPTION PAGE NO.

1. LITERATURE SURVEY 5
2. COMPARISION OF TECHNOLOGY 12
 LIST OF FIGURES

TABLE NO. DESCRIPTION PAGE NO.

3.1 DEDICATED SHORT RANGE COMMUNICATION 17
4.1 PRIORITY BASED COMMUNICATION 21
4.4 ARCHITECTURE 21
10.1 PROPOSED HYBRID METHODOLOGY 76
10.2 PRR WITH RESPECT TO DIFFERENT
COMMUNICATION RANGE OF RSU 80
10.3 E2E PARKING DELAY WITH RESPECT TO
VARIED COMMUNICATION DENSITY 81
10.4 SIMULATION RESULT OF E2E PARKING DELAY
WITH RESPECT TO VARIED COMMUNICATION 83
10.5 PRR WITH RESPECT TO VARIED MESSAGE DENSITY 84
10.6 SIMULATION RESULT OF PRR WITH RESPECT TO 85
VARIED MESSAGE DENSITY AND CLUSTER SIZE
OF HYBRID APPROACH 87
10.7 PRR OVER PARKING DELAY RATIO WITH RESPECT TO
VARIED MESSAGE DENSITY 88