Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Transactions on...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Transactions on Mobile Computing
Article . 2021 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
DBLP
Article . 2021
Data sources: DBLP
versions View all 2 versions
addClaim

Messages Classification and Dynamic Batch Verification Scheme for VANETs

Authors: Huei-Wen Ferng; Jia-Ying Chen; MohammadAmin Lotfolahi; Ying-Tsu Tseng; Si-Yuan Zhang;

Messages Classification and Dynamic Batch Verification Scheme for VANETs

Abstract

Under a high-density traffic environment in a vehicular ad hoc network (VANET), many safety messages will not be verified in time and then get dropped. To touch such an issue appropriately, we aim at improving the efficiency of message verification and the number of verified safety messages. In our proposed scheme, messages are properly classified and prioritized first so that more important basic safety messages can be verified earlier. To improve batch verification, a dynamic batch verification scheme with an adjustable batch size is designed accordingly. The batch size is halved when failures of batch verification occur consecutively over a certain threshold to improve the efficiency of batch verification. On the contrary, the batch size is doubled when successes of batch verification occur consecutively over a certain threshold to increase the messages in a batch to be verified. For a failure of batch verification, a divide-and-conquer approach is utilized to find the illegitimate message(s). Via analysis, the superiority of our design over some closely related schemes in terms of verification delay and number of verified basic safety messages etc. is successfully demonstrated. By simulation, performance of our design and some closely related schemes is further investigated in realistic scenarios.

  • BIP!
    Impact byBIP!
    citations
    The total number of citations received by all articles of the researcher of interest.
    17
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
citations
The total number of citations received by all articles of the researcher of interest.
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
17
Top 10%
Top 10%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!