Literature Database Entry


S.M. Hosseini, S. Yousefi and M.J.F. Ashrafi, "Modeling vehicle safety in vehicular networks using Markov chain model based on cooperative awareness," Proceedings of 21st Iranian Conference on Electrical Engineering (ICEE 2013), Mashhad, Iran, May 2013.


Main concern of many safety applications in emergency situations is determining the safety of a vehicle respect to the other ones. Consecutive packet losses reduce the overall performance of a safety application which using vehicular networks as its source of awareness. Thus, determining the impact of consecutive packet losses on safety and awareness seems critical. However, speed, acceleration and losses, the other dynamic properties of the vehicles play an important role in determining number of tolerable packet and safety assessment process. In this paper, we model the safety and novel, awareness values according to consecutive packet losses using Markov chain model. Our model serves a and network, promising framework for analyzing a vehicle safety based on the current situation of the and the vehicle dynamical properties. This model gives us the channel situation as well as the vehicle risk value. In the proposed model, the uncertainty of the driver perception about an upcoming event due to the lack of information is also taken into account. Using this model, one can investigate the impact of distance and efficiently., velocity on safety

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


S.M. Hosseini
S. Yousefi
M.J.F. Ashrafi

BibTeX reference

    author = {Hosseini, S.M. and Yousefi, S. and Ashrafi, M.J.F.},
    doi = {10.1109/IranianCEE.2013.6599819},
    title = {{Modeling vehicle safety in vehicular networks using Markov chain model based on cooperative awareness}},
    publisher = {IEEE},
    address = {Mashhad, Iran},
    booktitle = {21st Iranian Conference on Electrical Engineering (ICEE 2013)},
    month = {5},
    year = {2013},

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.