TY - JOUR
T1 - Real-Time Cache-Aided Route Planning Based on Mobile Edge Computing
AU - Yao, Yuan
AU - Xiao, Bin
AU - Wang, Wen
AU - Yang, Gang
AU - Zhou, Xingshe
AU - Peng, Zhe
N1 - Funding Information:
Acknowledgment This work was supported in part by the National Natural Science Foundation of China (No. 61876151, 61751208, 61772446, 61502394), and the Fundamental Research Funds for the Central Universities (No. 3102017OQD097).
Publisher Copyright:
© 2002-2012 IEEE.
PY - 2020/10
Y1 - 2020/10
N2 - Route planning is considered as one of the fundamental technologies in the navigation system, which finds an optimal route between a pair of source and target locations. Navigation services are required to provide real-time responses to route planning queries to promote user experiences on the road under different situations, such as sudden detour, unpredictable traffic congestion and loss of GPS signals. However, most commercial navigation products search the optimal path at the remote central server which suffer from several inherent limitations. First, the communication between the access network and the remote central server has a large uncertain Internet-induced time delay. Second, the computational cost of retrieving an optimal path is increasing exponentially with the distance from the source location to the destination in a large-scale road network. To address the above issues, we propose a real-time Cache-Aided Route Planning System based on Mobile Edge Computing (CARPS-MEC), aiming to greatly shorten the communication and computation time of route planning queries by caching those frequently requested paths. Different from traditional cache based route planning algorithms which require an exact path matching from point to point, CARPSMEC makes a rough path matching from region to region. Thus, it only needs to process unmatched road segments on a MEC server which is closer to the end users. This will significantly reduce the transmission latency due to the uncertainty of the Internet. Experiment results demonstrate that CARPS-MEC can increase the cache hit ratio and reduce the response time greatly.
AB - Route planning is considered as one of the fundamental technologies in the navigation system, which finds an optimal route between a pair of source and target locations. Navigation services are required to provide real-time responses to route planning queries to promote user experiences on the road under different situations, such as sudden detour, unpredictable traffic congestion and loss of GPS signals. However, most commercial navigation products search the optimal path at the remote central server which suffer from several inherent limitations. First, the communication between the access network and the remote central server has a large uncertain Internet-induced time delay. Second, the computational cost of retrieving an optimal path is increasing exponentially with the distance from the source location to the destination in a large-scale road network. To address the above issues, we propose a real-time Cache-Aided Route Planning System based on Mobile Edge Computing (CARPS-MEC), aiming to greatly shorten the communication and computation time of route planning queries by caching those frequently requested paths. Different from traditional cache based route planning algorithms which require an exact path matching from point to point, CARPSMEC makes a rough path matching from region to region. Thus, it only needs to process unmatched road segments on a MEC server which is closer to the end users. This will significantly reduce the transmission latency due to the uncertainty of the Internet. Experiment results demonstrate that CARPS-MEC can increase the cache hit ratio and reduce the response time greatly.
UR - http://www.scopus.com/inward/record.url?scp=85090450575&partnerID=8YFLogxK
U2 - 10.1109/MWC.001.1900559
DO - 10.1109/MWC.001.1900559
M3 - Journal article
AN - SCOPUS:85090450575
SN - 1536-1284
VL - 27
SP - 155
EP - 161
JO - IEEE Wireless Communications
JF - IEEE Wireless Communications
IS - 5
M1 - 9183790
ER -