Literature Database Entry

zaidi2014datacentric

K. Zaidi, M. Milojevic, V. Rakocevic and M. Rajarajan, "Data-centric Rogue Node Detection in VANETs," Proceedings of 13th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2014), Beijing, China, September 2014, pp. 398–405.

Abstract

Vehicular ad hoc networks (VANETs) are the future of vehicular technology and Traffic Information Systems. In VANETs vehicles communicate by different types of beacon messages to inform each other of their position and speed to give them a sense of traffic around them. Vehicles can also send emergency messages in case of accidents or other hazards. The very fast moving nodes have to act quickly based on these emergency messages. However, a rogue node which sends false emergency messages can wreak havoc in the network that may even result in fatalities. This paper develops and simulates a technique to detect a rogue node that is sending false emergency messages in VANETs by cooperative exchange of data without the need of any infrastructure or revocation list. Also, the proposed mechanism will make VANETs fault tolerant and resilient against injection of false data.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

K. Zaidi
M. Milojevic
V. Rakocevic
M. Rajarajan

BibTeX reference

@inproceedings{zaidi2014datacentric,
    author = {Zaidi, K. and Milojevic, M. and Rakocevic, V. and Rajarajan, M.},
    doi = {10.1109/TrustCom.2014.51},
    title = {{Data-centric Rogue Node Detection in VANETs}},
    pages = {398--405},
    publisher = {IEEE},
    address = {Beijing, China},
    booktitle = {13th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2014)},
    month = {9},
    year = {2014},
   }
   
   

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 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.