TY - GEN
T1 - Vehicle Assisted Data Update for Temporal Information Service in Vehicular Networks
AU - Dai, Penglin
AU - Liu, Kai
AU - Sha, Edwin
AU - Zhuge, Qingfeng
AU - Lee, Victor
AU - Son, Sang Hyuk
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/10/30
Y1 - 2015/10/30
N2 - Vehicular networks blueprint the bright future of transportation systems in safety, efficiency and sustainability. Highly dynamic traffic information is one of the most important features in vehicular networks, which makes data services very challenging, as the data quality drops over time dramatically and timely data update is expected to maintain the service quality. In this paper, we consider the system architecture, in which vehicles coming from different directions are able to sense and carry upto-date location-based information along their trajectories and upload fresh information to the roadside unit (RSU) when passing through. Meanwhile, vehicles may request information from the RSU for other routes. To enable efficient data services in such a scenario, firstly, we characterize the freshness of temporal data. Then, based on the general form of data quality function, we propose a heuristic algorithm called priority-based scheduling (PBS), which synthesizes the data quality, the broadcast effect and the real-time service requirement in making scheduling decisions. A comprehensive performance evaluation demonstrates the superiorty of PBS under a variety of scenarios.
AB - Vehicular networks blueprint the bright future of transportation systems in safety, efficiency and sustainability. Highly dynamic traffic information is one of the most important features in vehicular networks, which makes data services very challenging, as the data quality drops over time dramatically and timely data update is expected to maintain the service quality. In this paper, we consider the system architecture, in which vehicles coming from different directions are able to sense and carry upto-date location-based information along their trajectories and upload fresh information to the roadside unit (RSU) when passing through. Meanwhile, vehicles may request information from the RSU for other routes. To enable efficient data services in such a scenario, firstly, we characterize the freshness of temporal data. Then, based on the general form of data quality function, we propose a heuristic algorithm called priority-based scheduling (PBS), which synthesizes the data quality, the broadcast effect and the real-time service requirement in making scheduling decisions. A comprehensive performance evaluation demonstrates the superiorty of PBS under a variety of scenarios.
UR - https://www.scopus.com/pages/publications/84950261576
U2 - 10.1109/ITSC.2015.409
DO - 10.1109/ITSC.2015.409
M3 - 会议稿件
AN - SCOPUS:84950261576
T3 - IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC
SP - 2545
EP - 2550
BT - Proceedings - 2015 IEEE 18th International Conference on Intelligent Transportation Systems
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 18th IEEE International Conference on Intelligent Transportation Systems, ITSC 2015
Y2 - 15 September 2015 through 18 September 2015
ER -