VANETsim: An open source simulator for security and privacy concepts in VANETs

Tomandl, Andreas; Herrmann, Dominik; Fuchs, Karl-Peter; Federrath, Hannes; Scheuer, Florian

doi:10.1109/hpcsim.2014.6903733

Cited by 26 publications

(11 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, we implement the Echo-Announcement protocol and incentive mechanism in CreditCoin in VANETs simulation. We improve the simulator on the basis of the project [51] that is a simulation project for VANETs security, and we develop our own network from the open source code in [51] to achieve all of the proposed contributions ourselves. The details are shown as follows:…”

Section: A Evaluation Of Announcements Protocolmentioning

confidence: 99%

CreditCoin: A Privacy-Preserving Blockchain-Based Incentive Announcement Network for Communications of Smart Vehicles

Liu

Cheng

et al. 2018

IEEE Trans. Intell. Transport. Syst.

491

225

View full text Add to dashboard Cite

Section: A Evaluation Of Announcements Protocolmentioning

confidence: 99%

CreditCoin: A Privacy-Preserving Blockchain-Based Incentive Announcement Network for Communications of Smart Vehicles

Liu

Cheng

et al. 2018

IEEE Trans. Intell. Transport. Syst.

491

225

View full text Add to dashboard Cite

“…Three initiatives have recently been emerged to propose a simulation framework to evaluate the privacy level in VANETs. Tomandl et al [88] proposed VANETsim an event-driven simulation framework that allows implementing a set of pseudonym changing strategies in an abstract way i.e. without considering the wireless medium characteristics and communication protocols used in VANETs.…”

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

150

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

“…The performance of our algorithm is evaluated during the remaining time. To simulate our proposed approach, we have used the VanetSim simulator 33 to evaluate in real-time the algorithms performances. VanetSim allows simulating different real scenarios of traffic in real-time, by using real maps.…”

Section: Simulation Scenariomentioning

confidence: 99%

Cluster‐based emergency message dissemination strategy for VANET using V2V communication

Benkerdagh

Duvallet

2019

Int J Communication

View full text Add to dashboard Cite

Data dissemination in vehicular ad hoc network (VANET) is emerging as a critical area of research. One of the challenges posed by this domain is the reliability of connection, which depends on many parameters, such as the bandwidth consumption, transmission delay, and data quality of service (QoS). Dissemination of emergency messages is very critical since the network topology is changing frequently and rapidly, which leads to data loss. So, it is necessary to develop new protocols and enhance dissemination schemes in VANET to avoid more emergencies and hazards cases. In this regard, we have proposed a new strategy, which consists of data handling before dissemination process as the first step of our scheme. In this phase, the original message is optimized in order to reduce the number of exchanged packets. The second part of this proposition consists of constructing fast and stable clusters to improve the message delivery time and to procure efficient bandwidth consumption. This approach is based on a Fitness function, which takes into account different parameters such as the transmission period, the connectivity degree, the relative velocity, and the link lifetime validity. Since exchanging data in VANET is an important process, routing phase is proposed to perform data exchange among clusters. It is based on a rapid and real-time heuristic (real-time adaptive A* [RTAA*]). To evaluate the reliability of the proposed approach, an urban scenario is used with different simulation parameters. The simulation results show that our proposed approach presents a better stability and efficiency performance compared with the discussed approaches. The proposed approach improves the performance of cluster duration (5% − 25%), delivery rate (2% − 8%), and the overhead (5% − 35%) on average compared with the discussed approaches. KEYWORDS clustering algorithm, data dissemination, Fitness function, quality of service, routing, transmission delay Int J Commun Syst. 2019;32:e3897.wileyonlinelibrary.com/journal/dac

show abstract

VANETsim: An open source simulator for security and privacy concepts in VANETs

Cited by 26 publications

References 26 publications

CreditCoin: A Privacy-Preserving Blockchain-Based Incentive Announcement Network for Communications of Smart Vehicles

CreditCoin: A Privacy-Preserving Blockchain-Based Incentive Announcement Network for Communications of Smart Vehicles

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

Cluster‐based emergency message dissemination strategy for VANET using V2V communication

Contact Info

Product

Resources

About