A framework for evaluating pseudonym strategies in vehicular ad-hoc networks

Förster, David; Kargl, Frank; Löhr, Hans

doi:10.1145/2766498.2766520

Cited by 12 publications

(2 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[35][82] [83][84] [85]) and techniques (e.g. [86][87] [88][89] [90]) have been proposed to evaluate the achieved level of location privacy protection in VANETs. However, finding an unified framework and a comprehensible metric to evaluate and compare pseudonym changing strategies is not yet achieved.…”

Section: Evaluation Metrics and Techniquesmentioning

confidence: 99%

A Survey on Pseudonym Changing Strategies for Vehicular Ad-Hoc Networks

Boualouache

Senouci

Moussaoui

2018

IEEE Commun. Surv. Tutorials

148

View full text Add to dashboard Cite

The initial phase of the deployment of Vehicular Ad-Hoc Networks (VANETs) has begun and many research challenges still need to be addressed. Location privacy continues to be in the top of these challenges. Indeed, both of academia and industry agreed to apply the pseudonym changing approach as a solution to protect the location privacy of VANETs' users. However, due to the pseudonyms linking attack, a simple changing of pseudonym shown to be inefficient to provide the required protection. For this reason, many pseudonym changing strategies have been suggested to provide an effective pseudonym changing. Unfortunately, the development of an effective pseudonym changing strategy for VANETs is still an open issue. In this paper, we present a comprehensive survey and classification of pseudonym changing strategies. We then discuss and compare them with respect to some relevant criteria. Finally, we highlight some current researches, and open issues and give some future directions.

show abstract

Section: Evaluation Metrics and Techniquesmentioning

confidence: 99%

A Survey on Pseudonym Changing Strategies for Vehicular Ad-Hoc Networks

Boualouache

Senouci

Moussaoui

2018

IEEE Commun. Surv. Tutorials

148

View full text Add to dashboard Cite

show abstract

“…Our this work, we propose VPL x to denote the level of vehicle node x,(x = 1,2,….,n) to the number of the vehicle nodes to CH. [46][47][48][49][50][51][52][53] The pseudonyms changing vehicle node obviously consider distance and traffic from other vehicle nodes to CH by way of it or not. Pseudonyms changing of node x is P x , PC is for the number of the pseudonyms changing vehicle to transfer their traffic information by way of distance to the CH, then the pseudonyms changing of node x is calculated by…”

Section: Clustering Protocolsmentioning

confidence: 99%

Distance and clustering‐based energy‐efficient pseudonyms changing strategy over road network

Memon

2018

Int J Communication

View full text Add to dashboard Cite

Summary To improve the fairness, the energy consumption changing pseudonyms needs to be taken into account. Existing works focus on changing velocity‐based pseudonyms changing strategy and short changes interval with limited coverage, but due to similar velocity and short changes, internal attacker guesses easily known communication and location information due to location information of vehicle on tracking, which may expose adversary private information, and frequently, pseudonyms changing occurs due to movement of vehicles' similar velocity and short coverage, which may cause serious attack of vehicle. To overcome this problem, distance and cluster can be performed. In this work, we proposed distance and cluster‐based energy pseudonyms changing method for road network. We proposed distance and energy‐based clustering routing service over road network, the cluster head elected to depend on random number of distance and energy to change pseudonyms of vehicles. An each interval to be establish cluster head vehicle deployed while selects the operation mode and informs the cluster members of the selected mode through beacon signal. The cluster head vehicle node performs the pseudonyms changing based on the predicted distance and energy of the cluster member to use clustering optimization. The data of whole network send to report server through these nodes while near the RSU, and the vehicles in this area will use less energy to change the pseudonyms. The simulation results show that the proposed method enhances pseudonyms changing strategy less consumption and delays sufficient privacy level each vehicle also our method has outperform compare with existing methods than we use Sumo simulation and Matlab tools to verify our proposed method. Our proposed method outperformed in terms of pseudonym changing energy efficiency to careful attention during the cluster formation process, stable and balanced clusters that prolong the network lifetime, increases distances to more CH vehicles connectivity to makes clustering group and changing their pseudonyms in terms of high level privacy and finally, CH nodes use Dijkstra's algorithm use MST among the vehicles nodes depend on existing road networks to follow shortest path selection roads in terms of high connectivity probability of CH and stable structure of the network decreases the topology changes and thus,the clustering overhead is reduced.

show abstract