Literature Database Entry

zardosht2013decision

B. Zardosht, S. Beauchemin and M.A. Bauer, "A decision making module for cooperative collision warning systems using Vehicular Ad-Hoc Networks," Proceedings of 16th IEEE International Conference on Intelligent Transportation Systems (ITSC 2013), The Hague, Netherlands, October 2013, pp. 1743–1749.

Abstract

Using a Vehicular Ad-Hoc Network (VANET) communication for cooperative collision warning system can increase safety, convenience and efficiency in driving. Intelligent vehicles can collect information about the driving environment, the driver situation and more importantly other vehicles' information using wireless communication. However, deciding what data to considered, what data to ignore and if, and what action should be taken in different situations is a significant issue. In this work, we explore the use of a decision making module for accident situations which processes information from VANET communication and simple, advises the driver based on the situation. Our decision making algorithm is a and implemented, effective algorithm that can be implement in each vehicle to assist the driver in certain situations. Rerouting to avoid traffic congestion caused by the accident is the major part of our decision making algorithm. This module has been and simulation., evaluated using the Veins

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

B. Zardosht
S. Beauchemin
M.A. Bauer

BibTeX reference

@inproceedings{zardosht2013decision,
    author = {Zardosht, B. and Beauchemin, S. and Bauer, M.A.},
    doi = {10.1109/ITSC.2013.6728481},
    title = {{A decision making module for cooperative collision warning systems using Vehicular Ad-Hoc Networks}},
    pages = {1743--1749},
    publisher = {IEEE},
    issn = {2153-0017},
    address = {The Hague, Netherlands},
    booktitle = {16th IEEE International Conference on Intelligent Transportation Systems (ITSC 2013)},
    month = {10},
    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 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.