TY - GEN
T1 - An efficient cluster-based data sharing algorithm for bidirectional road scenario in vehicular ad-hoc networks
AU - Wang, Junhua
AU - Liu, Kai
AU - Sha, Edwin H.M.
AU - Lee, Victor C.S.
AU - Son, Sang H.
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
PY - 2015
Y1 - 2015
N2 - Efficient data sharing in vehicular ad hoc networks (VANETs) is one of the fundamental requirements to enable emerging intelligent transportation systems. Much research has focused on the routing algorithms and MAC protocols in VANETs. However, unique characteristics of data sharing for bidirectional road scenarios make it challenging to design an efficient scheduling algorithm. In this work, we present the data sharing model among vehicles driving in opposite directions, and investigate the potential interference caused by simultaneous vehicle-to-vehicle (V2V) communications. On this basis, we propose a cluster-based algorithm to implement efficient data sharing in bidirectional road scenarios. Specifically, we design a time slot division policy to assign the clusters with specific slots according to the driving directions and relative positions of vehicles. Then, based on certain required quality of services, we derive a theoretical model by analyzing the signalto- interference-and-noise ratio (SINR) in V2V communications, which determines how to divide vehicles into different clusters. Finally, we build the simulation model and give an extensive performance evaluation, which demonstrates that the proposed algorithm is efficient in terms of enhancing data throughput under different traffic workloads.
AB - Efficient data sharing in vehicular ad hoc networks (VANETs) is one of the fundamental requirements to enable emerging intelligent transportation systems. Much research has focused on the routing algorithms and MAC protocols in VANETs. However, unique characteristics of data sharing for bidirectional road scenarios make it challenging to design an efficient scheduling algorithm. In this work, we present the data sharing model among vehicles driving in opposite directions, and investigate the potential interference caused by simultaneous vehicle-to-vehicle (V2V) communications. On this basis, we propose a cluster-based algorithm to implement efficient data sharing in bidirectional road scenarios. Specifically, we design a time slot division policy to assign the clusters with specific slots according to the driving directions and relative positions of vehicles. Then, based on certain required quality of services, we derive a theoretical model by analyzing the signalto- interference-and-noise ratio (SINR) in V2V communications, which determines how to divide vehicles into different clusters. Finally, we build the simulation model and give an extensive performance evaluation, which demonstrates that the proposed algorithm is efficient in terms of enhancing data throughput under different traffic workloads.
KW - Bidirectional scenarios
KW - Data dissemination
KW - Scheduling algorithm
KW - Vehicle-to-vehicle communication
KW - Vehicular ad-hoc networks
UR - https://www.scopus.com/pages/publications/84959374427
U2 - 10.1007/978-3-319-27119-4_37
DO - 10.1007/978-3-319-27119-4_37
M3 - 会议稿件
AN - SCOPUS:84959374427
SN - 9783319271187
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 537
EP - 551
BT - Algorithms and Architectures for Parallel Processing - 15th International Conference, ICA3PP 2015, Proceedings
A2 - Perez, Gregorio Martinez
A2 - Zomaya, Albert
A2 - Wang, Guojun
A2 - Li, Kenli
PB - Springer Verlag
T2 - 15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015
Y2 - 18 November 2015 through 20 November 2015
ER -