TY - GEN
T1 - On efficient admission control utilizing cloud compression in drive-thru vehicular networks
AU - Su, Xiaonan
AU - Li, Changle
AU - Luan, Tom H.
AU - Miao, Zhifang
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - Providing vehicles with various services is an challenging issue for roadside units to support applications in future Intelligent Transportation System (ITS). Since each vehicle has only a limited period of time passing through a roadside unit, how to guarantee service data to be downloaded in time has been brought to the front. In this paper, we focus on the admission control problem, which is especially significant in overloaded conditions where tens of vehicles may share the resource of one roadside unit. To enhance downloading efficiency, we employ vehicular cloud which is extremely promising in future ITS to compute downloading time and compress contents. We propose an admission control scheme that calculates and increases the probability of successful downloads in a drive-thru system, which also promotes users' quality of experience. In addition, we formulate the admission control issue as a linear programming problem, and utilize a branch-and-bound algorithm to solve it. Simulations demonstrate that our proposed scheme reduces tasks failure notably and outperforms two regular downloading schemes in terms of throughput.
AB - Providing vehicles with various services is an challenging issue for roadside units to support applications in future Intelligent Transportation System (ITS). Since each vehicle has only a limited period of time passing through a roadside unit, how to guarantee service data to be downloaded in time has been brought to the front. In this paper, we focus on the admission control problem, which is especially significant in overloaded conditions where tens of vehicles may share the resource of one roadside unit. To enhance downloading efficiency, we employ vehicular cloud which is extremely promising in future ITS to compute downloading time and compress contents. We propose an admission control scheme that calculates and increases the probability of successful downloads in a drive-thru system, which also promotes users' quality of experience. In addition, we formulate the admission control issue as a linear programming problem, and utilize a branch-and-bound algorithm to solve it. Simulations demonstrate that our proposed scheme reduces tasks failure notably and outperforms two regular downloading schemes in terms of throughput.
UR - https://www.scopus.com/pages/publications/85049647659
U2 - 10.1109/ICCChina.2017.8330527
DO - 10.1109/ICCChina.2017.8330527
M3 - 会议稿件
AN - SCOPUS:85049647659
T3 - 2017 IEEE/CIC International Conference on Communications in China, ICCC 2017
SP - 1
EP - 6
BT - 2017 IEEE/CIC International Conference on Communications in China, ICCC 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE/CIC International Conference on Communications in China, ICCC 2017
Y2 - 22 October 2017 through 24 October 2017
ER -