Literature Database Entry


Truc D. T. Nguyen, Thanh-Van Le and Hoang-Anh Pham, "Novel store-carry-forward scheme for message dissemination in vehicular ad-hoc networks," Elsevier ICT Express, vol. 3 (4), pp. 193–198, December 2017.


To improve traffic safety in intelligent transportation systems, vehicles formed by vehicular ad-hoc networks (VANETs) conventionally disseminate warning messages to their nearby vehicles as soon as a dangerous situation occurs. In this paper, we propose a novel scheme employing a novel story–carry–forward (SCF) mechanism to tackle the network partition and broadcast storm problems, which are two major challenges in VANETs. The experimental result in the Veins simulation framework shows that the proposed SCF scheme significantly mitigates broadcast storms relative to other schemes, and maintains good coverage across various traffic densities.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


Truc D. T. Nguyen
Thanh-Van Le
Hoang-Anh Pham

BibTeX reference

    author = {Nguyen, Truc D. T. and Le, Thanh-Van and Pham, Hoang-Anh},
    doi = {10.1016/j.icte.2017.11.009},
    journal = {Elsevier ICT Express},
    month = {12},
    number = {4},
    pages = {193--198},
    publisher = {Elsevier},
    title = {{Novel store-carry-forward scheme for message dissemination in vehicular ad-hoc networks}},
    volume = {3},
    year = {2017},

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.