Literature Database Entry

nikolovski2017efficient


T. Nikolovski, R. W. Pazzi, A. T. Akabane and L. A. Villas, "Efficient Encounter-based Event Dissemination Protocol (E-BED) for urban and highway Vehicular Ad Hoc Networks," Proceedings of IEEE Symposium on Computers and Communications (ISCC 2017), Heraklion, Greece, July 2017, pp. 1085-1090.

Abstract

Efficient and reliable data dissemination is crucial to most of the vehicular network applications. However, the inherent vehicular network characteristics make data dissemination a challenging task. Typically, the existing algorithms generate too many redundant packets that saturate the network, thus causing frequent channel contention and packet collisions. To tackle these problems we propose an Efficient Encounter-based Event Dissemination Protocol. By exploiting the distance and the encountering probability of the vehicles to the event, the proposed protocol is capable of performing an efficient data dissemination in both urban and highway scenarios. An extensive set of simulation experiments was conducted to evaluate the performance of the proposed algorithms. Results showed that the proposed protocol outperforms the selected approaches in terms of retransmission packets and delivery ratio.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

T. Nikolovski
R. W. Pazzi
A. T. Akabane
L. A. Villas

BibTeX reference

@inproceedings{nikolovski2017efficient,
    author = {Nikolovski, T. and Pazzi, R. W. and Akabane, A. T. and Villas, L. A.},
    title = {{Efficient Encounter-based Event Dissemination Protocol (E-BED) for urban and highway Vehicular Ad Hoc Networks}},
    booktitle = {IEEE Symposium on Computers and Communications (ISCC 2017)},
    pages = {1085-1090},
    year = {2017},
    month = {July},
    address = {Heraklion, Greece},
    publisher = {IEEE},
    doi = {10.1109/ISCC.2017.8024670},
   }
   
   

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 proceeedings 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 permissions@acm.org.

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

This page was automatically generated using BibDB and bib2web.