To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org

1. GLOBALSOFT TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
Towards Providing Scalable and Robust Privacy
In Vehicular Networks
ABSTRACT:
In vehicular networks, there is a strong correlation between a vehicle’s identity and that
of the driver. It follows that any effort to protect driver privacy must attempt to make
the link between the two harder to detect. One of the most appealing solutions to hiding
the identity of a vehicle is the use of pseudonyms, whereby each vehicle is issued one or
several temporary identities (i.e., pseudonyms) that it uses to communicate with other
vehicles and/or the roadside infrastructure. Due to the large number of vehicles on our
roadways and city streets and of the sophistication of possible attacks, privacy
protection must be both scalable and robust. The first main contribution of this work is
to take a nontrivial step towards providing a scalable and robus t solution to privacy
protection in vehicular networks. To promote scalability and robustness we employ two
strategies. First, we view vehicular networks as consisting of non-overlapping
subnetworks, each local to a geographic area referred to as a cell. Depending on the
topology and the nature of the area, these cells may be as large as few city blocks or,
indeed, may comprise the entire downtown area of a small town. Each cell has a server
that maintains a list of pseudonyms valid for use in the cell. Ins tead of issuing
pseudonyms to vehicles proactively, as virtually all existing schemes do, we issue
pseudonyms only to those vehicles that request them. Our second main contribution is
to model analytically the time-varying request for pseudonyms in a given cell. This is
important for capacity planning purposes since it allows system managers to predict, by
taking into account the time-varying attributes of the traffic,the probability that a given
number of pseudonyms will be required at a certain time as we ll as the expected

2. number of pseudonyms in use in a cell at a certain time. Empirical results obtained by
detailed simulation confirmed the accuracy of our analytical predictions.
EXISTING SYSTEM:
The first main contribution of this work is to take a nontrivial step towards providing a
scalable and robust solution to privacy protection in vehicular networks. To promote
scalability and robustness we employ two strategies. First, we view vehicular networks
as consisting of non-overlapping subnetworks, each local to a geographic area referred
to as a cell. Depending on the topology and the nature of the area, these cells may be as
large as few city blocks or, indeed, may comprise the entire downtown area of a small
town. Each cell has a server that maintains a list of pseudonyms valid for use in the cell.
Our second main contribution is to model analytically the time-varying request for
pseudonyms in a given cell. This is important for capacity planning purposes since it
allows system managers to predict, by taking into account the time-varying attributes of
the traffic, the probability that a given number of pseudonyms will be required at a
certain time as well as the expected number of pseudonyms
in use in a cell at a certain time
PROPOSED SYSTEM:
We first applied SUMO to generate a mobility trace file and then fed the trace file to
NS-2 where the corresponding wireless network was simulated. We chose SUMO and
NS-2.30 not only because they are publicly available, but also because they are both well
maintained and well accepted in the research community.In our proposed scheme,
ourassumption that the communication can directly reach to the cell shows both
theoretical value and empirical meaning in this simulation.
CONCLUSION:
Virtually all published papers in the recent literature ignore the issues of scalability and
robustness in the context of privacy protection. In this work we took a nontrivial step
towards providing a robust and scalable solution to privacy protection in vehicular

3. networks. To promote scalability and robustness we employed two strategies. First, we
viewed vehicular networks as consisting of non-overlapping sub networks each local to
a geographic area referred to as a cell. Second, instead of issuing pseudonyms to
vehicles proactively (as virtually all existing schemes do) we issue pseudonyms only to
those vehicles that request them. This strategy was suggested by the fact that, in a
typical scenario, only a fraction of the vehicles in an area will engage in communication
with other vehicles and/or with the infrastructure and, therefore, do not need
pseudonyms. Our second main contribution was to model analytically the time -varying
request for pseudonyms in a given cell. Empirical results obtained by simulation
confirmed the accuracy of our analytical predictions.
System Configuration:-
H/W System Configuration:-
Processor - Pentium –III
Speed - 1.1 Ghz
RAM - 256 MB(min)
Hard Disk - 20 GB
Floppy Drive - 1.44 MB
Key Board - Standard Windows Keyboard
Mouse - Two or Three Button Mouse
Monitor - SVGA
S/W System Configuration:-
Operating System :Windows XP
Application Server : Tomcat5.0/6.X
Front End : HTML, Java, Jsp

4. Scripts : JavaScript.
Server side Script : Java Server Pages.
Database : Mysql
Database Connectivity : JDBC.