Literature Database Entry


Rens W. Van der Heijden, Frank Kargl, Osama M. F. Abu-Sharkh and Ala'a Al-Momani, "Enhanced Position Verification for VANETs Using Subjective Logic," Proceedings of 84th IEEE Vehicular Technology Conference (VTC2016-Fall), Montréal, Canada, September 2016.


The integrity of messages in vehicular ad-hoc networks has been extensively studied by the research community, resulting in the IEEE 1609.2 standard, which provides typical integrity guarantees. However, the correctness of message contents is still one of the main challenges of applying dependable and secure vehicular ad-hoc networks. One important use case is the validity of position information contained in messages: position verification mechanisms have been proposed in the literature to provide this functionality. A more general approach to validate such information is by applying misbehavior detection mechanisms. In this paper, we consider misbehavior detection by enhancing two position verification mechanisms and fusing their results in a generalized framework using subjective logic. We conduct extensive simulations using VEINS to study the impact of traffic density, as well as several types of attackers and fractions of attackers on our mechanisms. The obtained results show the proposed framework can validate position information as effectively as existing approaches in the literature, without tailoring the framework specifically for this use case.

Quick access

BibTeX BibTeX


Rens W. Van der Heijden
Frank Kargl
Osama M. F. Abu-Sharkh
Ala'a Al-Momani

BibTeX reference

    address = {Montr{\'{e}}al, Canada},
    author = {Van der Heijden, Rens W. and Kargl, Frank and Abu-Sharkh, Osama M. F. and Al-Momani, Ala'a},
    booktitle = {84th IEEE Vehicular Technology Conference (VTC2016-Fall)},
    month = {9},
    publisher = {Institute of Electrical and Electronics Engineers},
    title = {{Enhanced Position Verification for VANETs Using Subjective Logic}},
    year = {2016},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.