TY - JOUR
T1 - A collective filtering based content transmission scheme in edge of vehicles
AU - Wang, Xiaojie
AU - Feng, Y.
AU - Ning, Zhaolong
AU - Hu, Xiping
AU - Kong, Xiangjie
AU - Hu, Bin
AU - Guo, Yi
N1 - Publisher Copyright:
© 2019 Elsevier Inc.
PY - 2020/1
Y1 - 2020/1
N2 - With the emergence of the ever-increasing vehicular applications and booming Internet services, the requirements of low-latency and high efficient transmission among vehicles become urgent to meet, and their corresponding solutions need to be well investigated. To resolve the above challenges, we propose a fog computing-based content transmission scheme with collective filtering in edge of vehicles. We first provide a system model based on fog-based rode side units by considering location-awareness, content-caching and decentralized computing. Then, a content-caching strategy in RSUs is designed to minimize the downloading latency. Specifically, we model the moving vehicles with the two-dimensional Markov chains, and calculate the probabilities of file caching in RSUs to minimize the latency in file downloading. Each vehicle can also maintain a neighbor list to record the encounters with high similarities, and update it based on the historic and real-time contacts. Finally, we carry on the experiments based on the real-world taxi trajectories in Beijing and Shanghai, China. Simulation results demonstrate the effectiveness of our proposed method.
AB - With the emergence of the ever-increasing vehicular applications and booming Internet services, the requirements of low-latency and high efficient transmission among vehicles become urgent to meet, and their corresponding solutions need to be well investigated. To resolve the above challenges, we propose a fog computing-based content transmission scheme with collective filtering in edge of vehicles. We first provide a system model based on fog-based rode side units by considering location-awareness, content-caching and decentralized computing. Then, a content-caching strategy in RSUs is designed to minimize the downloading latency. Specifically, we model the moving vehicles with the two-dimensional Markov chains, and calculate the probabilities of file caching in RSUs to minimize the latency in file downloading. Each vehicle can also maintain a neighbor list to record the encounters with high similarities, and update it based on the historic and real-time contacts. Finally, we carry on the experiments based on the real-world taxi trajectories in Beijing and Shanghai, China. Simulation results demonstrate the effectiveness of our proposed method.
KW - Collaborative filtering
KW - Edge of vehicles
KW - Fog computing
KW - Markov chains
UR - http://www.scopus.com/inward/record.url?scp=85070188723&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2019.07.083
DO - 10.1016/j.ins.2019.07.083
M3 - Article
AN - SCOPUS:85070188723
SN - 0020-0255
VL - 506
SP - 161
EP - 173
JO - Information Sciences
JF - Information Sciences
ER -