{"title":"RAP:空间众包中具有个性化隐私保护的路网感知多位置任务分配框架","authors":"Liang Liu , Ning Cao , Yu Fan","doi":"10.1016/j.future.2025.108129","DOIUrl":null,"url":null,"abstract":"<div><div>Spatial Crowdsourcing (SC) has gained significant attention due to its scalability, low cost, and wide coverage. However, its reliance on accurate worker location information raises privacy concerns. Most existing research assumes uniform privacy protection and focuses on single-location tasks, overlooking multi-location assignments and the need for personalized privacy. In addition, these works assume a two-dimensional Euclidean workspace, which fails to account for the topological constraints and complexities of real-world road networks. To address these challenges, we propose a Road network-aware multi-location task Assignment framework with Personalized privacy-preserving in spatial crowdsourcing (RAP). Specifically, RAP achieves personalized Geo-Graph Indistinguishability (Geo-GI) by applying the Graph Exponential Mechanism (GEM) within localized subgraphs of the road network. This novel design both reduces computational overhead and supports tunable privacy levels, making GEM practical for large-scale deployment. Subsequently, an R-tree-based index is employed to efficiently prune the search space and retrieve candidate workers. Finally, an assignment algorithm matches tasks to the most suitable workers by evaluating the expected travel distance under location uncertainty. Experimental results demonstrate that RAP provides an effective and efficient solution for privacy-preserving multi-location task assignment in SC environments.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"176 ","pages":"Article 108129"},"PeriodicalIF":6.2000,"publicationDate":"2025-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"RAP: A road network-aware multi-location task assignment framework with personalized privacy-preserving in spatial crowdsourcing\",\"authors\":\"Liang Liu , Ning Cao , Yu Fan\",\"doi\":\"10.1016/j.future.2025.108129\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Spatial Crowdsourcing (SC) has gained significant attention due to its scalability, low cost, and wide coverage. However, its reliance on accurate worker location information raises privacy concerns. Most existing research assumes uniform privacy protection and focuses on single-location tasks, overlooking multi-location assignments and the need for personalized privacy. In addition, these works assume a two-dimensional Euclidean workspace, which fails to account for the topological constraints and complexities of real-world road networks. To address these challenges, we propose a Road network-aware multi-location task Assignment framework with Personalized privacy-preserving in spatial crowdsourcing (RAP). Specifically, RAP achieves personalized Geo-Graph Indistinguishability (Geo-GI) by applying the Graph Exponential Mechanism (GEM) within localized subgraphs of the road network. This novel design both reduces computational overhead and supports tunable privacy levels, making GEM practical for large-scale deployment. Subsequently, an R-tree-based index is employed to efficiently prune the search space and retrieve candidate workers. Finally, an assignment algorithm matches tasks to the most suitable workers by evaluating the expected travel distance under location uncertainty. Experimental results demonstrate that RAP provides an effective and efficient solution for privacy-preserving multi-location task assignment in SC environments.</div></div>\",\"PeriodicalId\":55132,\"journal\":{\"name\":\"Future Generation Computer Systems-The International Journal of Escience\",\"volume\":\"176 \",\"pages\":\"Article 108129\"},\"PeriodicalIF\":6.2000,\"publicationDate\":\"2025-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Future Generation Computer Systems-The International Journal of Escience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167739X25004236\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Computer Systems-The International Journal of Escience","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167739X25004236","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
RAP: A road network-aware multi-location task assignment framework with personalized privacy-preserving in spatial crowdsourcing
Spatial Crowdsourcing (SC) has gained significant attention due to its scalability, low cost, and wide coverage. However, its reliance on accurate worker location information raises privacy concerns. Most existing research assumes uniform privacy protection and focuses on single-location tasks, overlooking multi-location assignments and the need for personalized privacy. In addition, these works assume a two-dimensional Euclidean workspace, which fails to account for the topological constraints and complexities of real-world road networks. To address these challenges, we propose a Road network-aware multi-location task Assignment framework with Personalized privacy-preserving in spatial crowdsourcing (RAP). Specifically, RAP achieves personalized Geo-Graph Indistinguishability (Geo-GI) by applying the Graph Exponential Mechanism (GEM) within localized subgraphs of the road network. This novel design both reduces computational overhead and supports tunable privacy levels, making GEM practical for large-scale deployment. Subsequently, an R-tree-based index is employed to efficiently prune the search space and retrieve candidate workers. Finally, an assignment algorithm matches tasks to the most suitable workers by evaluating the expected travel distance under location uncertainty. Experimental results demonstrate that RAP provides an effective and efficient solution for privacy-preserving multi-location task assignment in SC environments.
期刊介绍:
Computing infrastructures and systems are constantly evolving, resulting in increasingly complex and collaborative scientific applications. To cope with these advancements, there is a growing need for collaborative tools that can effectively map, control, and execute these applications.
Furthermore, with the explosion of Big Data, there is a requirement for innovative methods and infrastructures to collect, analyze, and derive meaningful insights from the vast amount of data generated. This necessitates the integration of computational and storage capabilities, databases, sensors, and human collaboration.
Future Generation Computer Systems aims to pioneer advancements in distributed systems, collaborative environments, high-performance computing, and Big Data analytics. It strives to stay at the forefront of developments in grids, clouds, and the Internet of Things (IoT) to effectively address the challenges posed by these wide-area, fully distributed sensing and computing systems.