Performance and fairness analysis of range control algorithms in cooperative vehicle safety networks at intersections

Cooperative vehicle safety (CVS) systems rely on broadcast of vehicle position to other neighboring vehicles. Scalability is one of the main challenges of CVS, and many congestion control algorithms have been proposed to resolve the issue. These algorithms need to be robust, stable and fair in especially both highways and urban areas. Many of the proposed algorithms have been examined in the past mostly for highway scenarios. In particular, a study of properties such as stability in time and fairness in space for intersection scenarios has not yet been presented in literature for some important scalability solutions. In this paper we study two congestion control algorithms in intersection scenarios and evaluate their fairness and stability properties. We show that the stability and fairness in different typical intersection scenarios can be achieved. The robustness of the algorithms to the high variability of density in intersection scenarios is also verified. While unfairness does not happen in most of the scenarios naturally, a previously proposed method for resolving possible unfairness is evaluated for completeness of the study.