IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Privacy Protection in Vehicular Ad-Hoc Networks

Privacy Protection in Vehicular Ad-Hoc Networks
View Sample PDF
Author(s): Gongjun Yan (University of Southern Indiana, USA), Danda B. Rawat (Georgia Southern University, USA), Bhed Bahadur Bista (Iwate Prefectural University, Japan), Wu He (Old Dominion University, USA) and Awny Alnusair (Indiana University – Kokomo, USA)
Copyright: 2014
Pages: 38
Source title: Security, Privacy, Trust, and Resource Management in Mobile and Wireless Communications
Source Author(s)/Editor(s): Danda B. Rawat (Georgia Southern University, USA), Bhed B. Bista (Iwate Prefectural University, Japan) and Gongjun Yan (University of Southern Indiana, USA)
DOI: 10.4018/978-1-4666-4691-9.ch013

Purchase

View Privacy Protection in Vehicular Ad-Hoc Networks on the publisher's website for pricing and purchasing information.

Abstract

The first main contribution of this chapter is to take a non-trivial step towards providing a robust and scalable solution to privacy protection in vehicular networks. To promote scalability and robustness the authors employ two strategies. First, they view vehicular networks as consisting of non-overlapping subnetworks, each local to a geographic area referred to as a cell. Each cell has a server that maintains a list of pseudonyms that are valid for use in the cell. Each pseudonym has two components: the cell’s ID and a random number as host ID. Instead of issuing pseudonyms to vehicles proactively (as virtually all existing schemes do) the authors issue pseudonyms only to those vehicles that request them. This strategy is 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. The 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. Empirical results obtained by detailed simulation confirm the accuracy of the authors’ analytical predictions.

Related Content

. © 2021. 35 pages.
. © 2021. 24 pages.
. © 2021. 35 pages.
. © 2021. 30 pages.
. © 2021. 34 pages.
. © 2021. 21 pages.
. © 2021. 31 pages.
Body Bottom