Finding viable metrics to assess the effectiveness of Intelligent Transportation Systems (ITS) in terms of 'safety' is one of the major challenges in vehicular networking research. We aim to provide a metric, an estimation of the vehicle collision probability at intersections, that can be used for evaluating Inter-Vehicle Communication (IVC) concepts. In the last years, the vehicular networking community reported in several studies that safety enhancing protocols and applications cannot be evaluated based only on networking metrics like delays and packet loss rates. We present an evaluation scheme that addresses this need by quantifying the probability of a future crash, depending on the situation in which a vehicle is receiving a beacon message (e.g., a CAM or a BSM). Thus, our criticality metric also allows for fully distributed situation assessment. We investigate the impact of safety messaging between cars approaching an intersection using a modified road traffic simulator that allows selected vehicles to disregard traffic rules. As direct result we show that simple beaconing is not as effective as anticipated in suburban environments. More profoundly, however, our simulation results reveal more details about the timeliness (regarding the criticality assessment) of beacon messages, and as such, can be used to develop more sophisticated beaconing solutions.
Original Version 
(at publishers web site)
Authors' Version 
(PDF on this web site)
BibTeX 
Stefan Joerer
Michele Segata
Bastian Bloessl
Renato Lo Cigno
Christoph Sommer
Falko Dressler
@article{joerer2014vehicular,
author = {Joerer, Stefan and Segata, Michele and Bloessl, Bastian and Lo Cigno, Renato and Sommer, Christoph and Dressler, Falko},
doi = {10.1109/TVT.2013.2287343},
journal = {IEEE Transactions on Vehicular Technology},
month = {May},
number = {4},
pages = {1802-1812},
publisher = {IEEE},
title = {{A Vehicular Networking Perspective on Estimating Vehicle Collision Probability at Intersections}},
volume = {63},
year = {2014},
}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.