Affiliation:
1. School of Electrical and Electronic Engineering, North China Electric Power University, Beijing 102206, China
Abstract
In this paper, a swell neural network (SNN) algorithm was proposed for solving time-varying path query (TVPQ) problems with privacy protection with the following goals: (i) querying the K-nearest paths with time limitations in a time-varying scenario, and (ii) protecting private information from neighborhood attacks. The proposed SNN is a network in which the optimal paths can be calculated at the same time with no need for training. For TVPQ, a node is considered a neuron, and time-varying means that an edge has different costs in different time windows. For SNN, the query paths are swell sets from the start to the target within an upper limit. An encrypted index is designed for privacy protection. The evaluation of the efficiency and accuracy of the SNN was carried out based on New York road instances.
Reference33 articles.
1. SPPS: A search pattern privacy system for approximate shortest distance query of encrypted graphs in iiot;Yu;IEEE Trans. Syst. Man Cybern. Syst.,2022
2. Grid-based non-uniform probabilistic roadmap-based agv path planning in narrow passages and complex environments;Zhou;Electronics,2024
3. A time wave neural network framework for solving time-dependent project scheduling problems;Huang;IEEE Trans. Neural Netw. Learn. Syst.,2020
4. Cao, N., Yang, Z., Wang, C., Ren, K., and Lou, W. (2011, January 20–24). Privacy-preserving query over encrypted graph-structured data in cloud computing. Proceedings of the 2011 31st International Conference on Distributed Computing Systems, Minneapolis, MN, USA.
5. Dynamic path privacy protection framework for continuous query service over road networks;Memon;World Wide Web,2017