RAP:空间众包中具有个性化隐私保护的路网感知多位置任务分配框架

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
Liang Liu , Ning Cao , Yu Fan
{"title":"RAP:空间众包中具有个性化隐私保护的路网感知多位置任务分配框架","authors":"Liang Liu ,&nbsp;Ning Cao ,&nbsp;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 ,&nbsp;Ning Cao ,&nbsp;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}
引用次数: 0

摘要

空间众包(Spatial Crowdsourcing, SC)以其可扩展性、低成本和广泛的覆盖范围而备受关注。然而,它对准确员工位置信息的依赖引发了对隐私的担忧。大多数现有的研究假设了统一的隐私保护,并侧重于单地点任务,忽视了多地点任务和个性化隐私的需求。此外,这些工作假设了一个二维欧几里得工作空间,这无法考虑到现实世界道路网络的拓扑约束和复杂性。为了解决这些挑战,我们提出了一个空间众包(RAP)中具有个性化隐私保护的道路网络感知多位置任务分配框架。具体来说,RAP通过在路网的局部子图中应用图指数机制(GEM)来实现个性化的地理图不可分辨性(Geo-GI)。这种新颖的设计既减少了计算开销,又支持可调的隐私级别,使GEM适用于大规模部署。随后,利用基于r树的索引对搜索空间进行有效的修剪,检索候选工作者。最后,提出了一种分配算法,通过评估在位置不确定情况下的期望移动距离,将任务分配给最合适的工人。实验结果表明,RAP为SC环境下保护隐私的多位置任务分配提供了一种有效的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
19.90
自引率
2.70%
发文量
376
审稿时长
10.6 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信