Literature Database Entry

tahani2012distributed

Gazdar Tahani, Abderrezak Rachedi, Abderrahim Benslimane and Belghith Abdelfettah, "A Distributed Advanced Analytical Trust Model for VANETs," Proceedings of IEEE Global Communications Conference (GLOBECOM 2012), Anaheim, CA, December 2012, pp. 219–224.

Abstract

variation, In this paper we propose a trust model based on a Markov chain in order to formalize the trust metric and its stability in the context of Vehicular Ad hoc Networks (VANETs). The proposed model takes into account not only the dynamic trust metric variation according to the vehicles behaviors, but also the constraints related to the monitoring process. In our model each vehicle can act as monitor and update the trust metric of its neighbors according to their behavior in the network. In addition, our model can be customized through different parameters like the trust interval and parameters, the number of transitions needed to reach the highest trust level. This flexibility enables to adapt the model according to the application context. The performance evaluation of the proposed model is presented with different and malicious, two types of disruptive vehicles are taken into account: and selfish. The obtained results show the resistance, the robustness and behaviors., the incentive of the proposed model against the fluctuations of the vehicles

Quick access

BibTeX BibTeX

Contact

Gazdar Tahani
Abderrezak Rachedi
Abderrahim Benslimane
Belghith Abdelfettah

BibTeX reference

@inproceedings{tahani2012distributed,
    author = {Tahani, Gazdar and Rachedi, Abderrezak and Benslimane, Abderrahim and Abdelfettah, Belghith},
    title = {{A Distributed Advanced Analytical Trust Model for VANETs}},
    pages = {219--224},
    publisher = {IEEE},
    address = {Anaheim, CA},
    booktitle = {IEEE Global Communications Conference (GLOBECOM 2012)},
    month = {12},
    year = {2012},
   }
   
   

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.