Message dissemination scheduling for multiple cooperative drivings

With the advances of control and vehicular communication technologies, a group of connected and autonomous (CA) vehicles can drive cooperatively to form a so-called cooperative driving pattern, which has been verified to significantly improve road safety, traffic efficiency and the environmental sustainability. A more general scenario that various types of cooperative driving, such as vehicle platooning and traffic monitoring, coexist on roads will appear soon. To support such multiple cooperative drivings, it is critical to design an efficient scheduling algorithm for periodical message dissemination, i.e. beacon, in a shared communication channel, which has not been fully addressed before. In this paper, we consider multiple cooperative drivings in a bidirectional road, and propose both the decentralized and the RSU-assisted centralized beacon scheduling algorithms which aim at guaranteeing reliable delivery of beacon messages for cooperative drivings as well as maximizing the channel utilization. Numerical results confirm the effectiveness of the proposed algorithms.