Literature Database Entry


K. Sharshembiev, S. Yoo, Y. Kim and G. Jeong, "Optimal Threshold Analysis for Triggering Fail-Safe Mechanism in Vehicular Ad Hoc Networks," Proceedings of 2019 21st International Conference on Advanced Communication Technology (ICACT), Gangneung, South Korea, February 2019, pp. 344–350.


A novel approach is proposed to estimate the optimal threshold of broadcast messages in vehicular ad hoc networks in order to detect misbehaving nodes and prevent broadcast storms. This threshold value is estimated based on the number of incoming and outgoing data statistics and metrics to be used to judge if the node is behaving properly. To avoid misjudgement and false alarms, the accuracy of the estimate of the threshold value is very important. Our method and detection technique are based on the IEEE 802.11p MAC protocol and weighted p-persistence routing protocol. The main contribution of this paper is proposing an analytical model to accurately estimate the optimal threshold value to trigger the fail-safe mechanism for misbehaving cars. Computer simulation results using Veins simulator show that analytical models work properly.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


K. Sharshembiev
S. Yoo
Y. Kim
G. Jeong

BibTeX reference

    address = {Gangneung, South Korea},
    author = {Sharshembiev, K. and Yoo, S. and Kim, Y. and Jeong, G.},
    booktitle = {2019 21st International Conference on Advanced Communication Technology (ICACT)},
    doi = {10.23919/ICACT.2019.8701976},
    month = {2},
    pages = {344--350},
    publisher = {IEEE},
    title = {{Optimal Threshold Analysis for Triggering Fail-Safe Mechanism in Vehicular Ad Hoc Networks}},
    year = {2019},

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.