TY - GEN
T1 - Auto-adaptive multi-hop clustering for hybrid cellular-vehicular networks
AU - Garbiso, Julian
AU - DIaconescu, Ada
AU - Coupechoux, Marceau
AU - Leroy, Bertrand
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - In this paper, we consider a hybrid vehicular network, in which vehicles transmit data via the cellular network and dispose of a Vehicle-to-Vehicle (V2V) interface. In this context, we propose an auto-adaptive multi-hop clustering algorithm, which optimizes the usage of the cellular radio resource under the constraint of a maximum packet loss rate (PLR) in the V2V network. The larger the V2V-based clusters are, the higher the data compression ratio at the cluster head is, and the smaller the amount of required resource on the cellular link becomes. However, PLR becomes higher due to the collisions on the V2V channel when increasing the number of hops for cluster enlargement. The proposed algorithm thus dynamically adapts the maximum number of hops in clusters according to the vehicular traffic density. Through simulations, we show that it performs better in terms of aggregated cellular data and packet loss rate than any fixed-hop clustering algorithm in a dynamic scenario.
AB - In this paper, we consider a hybrid vehicular network, in which vehicles transmit data via the cellular network and dispose of a Vehicle-to-Vehicle (V2V) interface. In this context, we propose an auto-adaptive multi-hop clustering algorithm, which optimizes the usage of the cellular radio resource under the constraint of a maximum packet loss rate (PLR) in the V2V network. The larger the V2V-based clusters are, the higher the data compression ratio at the cluster head is, and the smaller the amount of required resource on the cellular link becomes. However, PLR becomes higher due to the collisions on the V2V channel when increasing the number of hops for cluster enlargement. The proposed algorithm thus dynamically adapts the maximum number of hops in clusters according to the vehicular traffic density. Through simulations, we show that it performs better in terms of aggregated cellular data and packet loss rate than any fixed-hop clustering algorithm in a dynamic scenario.
UR - https://www.scopus.com/pages/publications/85046245450
U2 - 10.1109/ITSC.2017.8317746
DO - 10.1109/ITSC.2017.8317746
M3 - Conference contribution
AN - SCOPUS:85046245450
T3 - IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC
BT - 2017 IEEE 20th International Conference on Intelligent Transportation Systems, ITSC 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 20th IEEE International Conference on Intelligent Transportation Systems, ITSC 2017
Y2 - 16 October 2017 through 19 October 2017
ER -