TY - GEN
T1 - Message dissemination scheduling for multiple cooperative drivings
AU - Jia, Dongyao
AU - Liu, Bingyi
AU - Chen, Haibo
AU - Fan, Jingyuan
AU - Qiao, Chunming
AU - Wang, Jianping
AU - Wu, Libing
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/11/20
Y1 - 2017/11/20
N2 - 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.
AB - 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.
KW - Message dissemination
KW - Multiple cooperative drivings
KW - Scheduling
KW - TDMA
UR - http://www.scopus.com/inward/record.url?scp=85041342884&partnerID=8YFLogxK
U2 - 10.1109/INFCOMW.2017.8116389
DO - 10.1109/INFCOMW.2017.8116389
M3 - Conference Proceeding
AN - SCOPUS:85041342884
T3 - 2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017
SP - 277
EP - 282
BT - 2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2017
Y2 - 1 May 2017 through 4 May 2017
ER -