TY - GEN
T1 - Towards scalable, fair and robust data dissemination via cooperative vehicular communications
AU - Liu, Kai
AU - NG, Joseph K Y
AU - Lee, Victor C.S.
AU - Wu, Weiwei
AU - Son, Sang H.
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/9/25
Y1 - 2014/9/25
N2 - Recent advances in infrastructure-to-vehicle (I2V) and vehicle-to-vehicle (V2V) communications are envisioned to enable a variety of emerging applications in vehicular networks, where it is imperative to provide efficient data services via cooperative vehicular communications. In this work, we present the data dissemination system via cooperative I2V and V2V communications. We formulate the problem by investigating both the communication constraint and the application requirement on data dissemination. The goal is to maximize the system performance by exploiting the joint effects of I2V and V2V communications. On this basis, we propose an on-line scheduling algorithm to enable scalable, fair and robust data dissemination. The algorithm makes scheduling decisions by transforming the data dissemination problem to the maximum weighted independent set (MWIS) problem and approximately solving MWIS using a greedy method. We build the simulation model based on realistic traffic and communication characteristics. A comprehensive simulation study demonstrates that the proposed solution is able to effectively strike a balance between I2V and V2V data services and maximize system performance in terms of scalability, fairness and robustness.
AB - Recent advances in infrastructure-to-vehicle (I2V) and vehicle-to-vehicle (V2V) communications are envisioned to enable a variety of emerging applications in vehicular networks, where it is imperative to provide efficient data services via cooperative vehicular communications. In this work, we present the data dissemination system via cooperative I2V and V2V communications. We formulate the problem by investigating both the communication constraint and the application requirement on data dissemination. The goal is to maximize the system performance by exploiting the joint effects of I2V and V2V communications. On this basis, we propose an on-line scheduling algorithm to enable scalable, fair and robust data dissemination. The algorithm makes scheduling decisions by transforming the data dissemination problem to the maximum weighted independent set (MWIS) problem and approximately solving MWIS using a greedy method. We build the simulation model based on realistic traffic and communication characteristics. A comprehensive simulation study demonstrates that the proposed solution is able to effectively strike a balance between I2V and V2V data services and maximize system performance in terms of scalability, fairness and robustness.
UR - http://www.scopus.com/inward/record.url?scp=84908636736&partnerID=8YFLogxK
U2 - 10.1109/RTCSA.2014.6910531
DO - 10.1109/RTCSA.2014.6910531
M3 - Conference proceeding
AN - SCOPUS:84908636736
T3 - RTCSA 2014 - 20th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
BT - RTCSA 2014 - 20th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
PB - IEEE
T2 - 20th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2014
Y2 - 20 August 2014 through 22 August 2014
ER -