Intersection Assistance Systems (IAS) aim to assist road users in avoiding collisions at intersections, either by warning the driver or by triggering automated actions. Such a system can be realized based on passive scanning only (e.g., using LiDAR) or supported by active Inter-Vehicle Communication (IVC). The main reason to use IVC is its ability to provide situation awareness even when a possible crash candidate is not yet in visual range. The IVC research community has identified beaconing, i.e., one-hop broadcast, as the primary communication primitive for vehicular safety applications. Recently, adaptive beaconing approaches have been studied and different congestion control mechanisms have been proposed to cope with the diverse demands of vehicular networks. In this paper, we show that current state-of-the-art congestion control mechanisms are not able to support IAS adequately. Specifically, current approaches fail due to their inherent fairness postulation, i.e., they lack fine grained prioritization. We propose a solution that extends congestion control mechanisms by allowing temporary exceptions for vehicles in dangerous situations, that is, situation-based rate adaptation. We show the applicability for two state-of-the-art congestion control mechanisms, namely Transmit Rate Control (TRC) and Dynamic Beaconing (DynB), in two different vehicular environments, rural and downtown.
Original Version 
(at publishers web site)
Authors' Version 
(PDF on this web site)
BibTeX 
Stefan Joerer
Bastian Bloessl
Michele Segata
Christoph Sommer
Renato Lo Cigno
Abbas Jamalipour
Falko Dressler
@article{joerer2016enabling,
author = {Joerer, Stefan and Bloessl, Bastian and Segata, Michele and Sommer, Christoph and Lo Cigno, Renato and Jamalipour, Abbas and Dressler, Falko},
doi = {10.1109/TMC.2015.2474370},
journal = {IEEE Transactions on Mobile Computing},
month = {June},
number = {7},
pages = {1674-1685},
publisher = {IEEE},
title = {{Enabling Situation Awareness at Intersections for IVC Congestion Control Mechanisms}},
volume = {15},
year = {2016},
}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.