Intelligent route planning on large road networks with efficiency and privacy

被引:94
作者
Liu, Qin [1 ,4 ]
Hou, Panlin [1 ]
Wang, Guojun [2 ]
Peng, Tao [2 ]
Zhang, Shaobo [3 ]
机构
[1] Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Hunan, Peoples R China
[2] Guangzhou Univ, Sch Comp Sci, Guangzhou 510006, Guangdong, Peoples R China
[3] Hunan Univ Sci & Technol, Sch Comp Sci & Engn, Xiangtan 411201, Hunan, Peoples R China
[4] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing 210093, Jiangsu, Peoples R China
关键词
Route planning; Road networks; Privacy; Intelligence; Usability; QUERIES;
D O I
10.1016/j.jpdc.2019.06.012
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
When using Location-Based Services (LBS), intelligent route planning becomes crucial to improve service quality and user experience. The state-of-the-art G-tree structure enables efficient route planning on large road networks, but lacks usability and intelligence. In this paper, we first propose a comprehensive service framework, called BCloud-IFog, which consists of blind cloud servers and intelligent fog servers. Then, we propose an Outsourced Real-time Route Planning (OR2P) scheme, where the search index is built as a G*-tree structure and each G*-tree leaf node is split into a set of non-confidential outsourced graphs. Compared with the G-tree structure, our work has the following advantages: (1) Higher usability. Unlike the G-tree structure requiring the user to perform all calculations in the search process, it delegates the most of computations to cloud servers. (2) Privacy Protection. Unlike the straightforward solution that directly outsource the G-tree structure, it outsources only the non-confidential graphs such that cloud servers cannot infer the original road network or user trajectory. (3) Better intelligence. Unlike the G-tree structure handles only static route planning, it allows fog servers to make route plans based on the dynamic real-time traffic status. Extensive experiments on real data sets demonstrate the effectiveness of our work. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:93 / 106
页数:14
相关论文
共 40 条
[1]  
Akiba Takuya, 2012, Proceedings of the 15th International Conference on Extending Database Technology, P144
[2]  
Akiba Takuya, 2013, P ACM SIGMOD INT C M, P349, DOI [DOI 10.1145/2463676.2465315, 10.1145/2463676, DOI 10.1145/2463676]
[3]   Search-space size in contraction hierarchies [J].
Bauer, Reinhard ;
Columbus, Tobias ;
Rutter, Ignaz ;
Wagner, Dorothea .
THEORETICAL COMPUTER SCIENCE, 2016, 645 :112-127
[4]  
Chvatal V., 1979, Mathematics of Operations Research, V4, P233, DOI 10.1287/moor.4.3.233
[5]   Customizable Point-of-Interest Queries in Road Networks [J].
Delling, Daniel ;
Werneck, Renato F. .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (03) :686-698
[6]  
Dijkstra E. W., 1959, Numer. Math, V1, P269, DOI [DOI 10.1007/BF01386390, 10.1007/BF01386390]
[7]  
Gao J., 2011, SIGMOD, P409
[8]   Resisting re-identification mining on social graph data [J].
Gao, Jianliang ;
Ping, Qing ;
Wang, Jianxin .
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2018, 21 (06) :1759-1771
[9]   Outsourcing shortest distance computing with privacy protection [J].
Gao, Jun ;
Yu, Jeffrey Xu ;
Jin, Ruoming ;
Zhou, Jiashuai ;
Wang, Tengjiao ;
Yang, Dongqing .
VLDB JOURNAL, 2013, 22 (04) :543-559
[10]  
Garey M. R., 1979, COMPUTERS INTRACTABI, V340