移动人群感知的隐私保护混合多任务分配

IF 6.7 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Xian Zhang;Xiaolin Qin;Haiwen Xu;Lin Li
{"title":"移动人群感知的隐私保护混合多任务分配","authors":"Xian Zhang;Xiaolin Qin;Haiwen Xu;Lin Li","doi":"10.1109/TNSE.2025.3559563","DOIUrl":null,"url":null,"abstract":"With the widespread adoption of mobile smart devices, mobile crowd sensing(MCS) has provided better services for people. To meet the growing sensing demands within a limited budget, platforms have integrated two modes—opportunistic sensing and participatory sensing—to utilize their complementary strengths. However, location privacy issues may reduce workers' willingness to participate, thereby affecting task completion rates. Although existing methods have addressed privacy protection in a single sensing mode, there remains little focus on location privacy in hybrid sensing modes. There are two main limitations in privacy issues related to task allocation: (i) how to effectively preserve workers' location privacy in hybrid sensing modes, and (ii) the usual reliance on trusted third-party institution. To address these issues, we propose a privacy-preserving hybrid multi-task allocation for MCS (PPHMA). This approach preserves workers' location privacy without relying on a fully trusted third-party institution, while maximizing the number of tasks completed. Specifically, for opportunistic task allocation, we employ zero-knowledge range proofs to protect workers' location, thereby avoiding location privacy leaks. Subsequently, based on the performance capability indicator of opportunistic workers, we select appropriate workers for task allocation. For participatory task allocation, we employ a worker location obfuscation generation algorithm to locally generate and upload obfuscated locations, ensuring that both the worker's real and obfuscated locations satisfy <inline-formula><tex-math>$\\varepsilon$</tex-math></inline-formula>-Geo-Indistinguishability within the protected range. Then, based on the execution capability indicator of the participatory workers, we screen for candidate workers and use a greedy immune clone algorithm to optimize the workers' travel distances. Finally, we verify the effectiveness of the scheme through experiments using two real-world datasets.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3360-3373"},"PeriodicalIF":6.7000,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PPHMA: Privacy-Preserving Hybrid Multi-Task Allocation for Mobile Crowd Sensing\",\"authors\":\"Xian Zhang;Xiaolin Qin;Haiwen Xu;Lin Li\",\"doi\":\"10.1109/TNSE.2025.3559563\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the widespread adoption of mobile smart devices, mobile crowd sensing(MCS) has provided better services for people. To meet the growing sensing demands within a limited budget, platforms have integrated two modes—opportunistic sensing and participatory sensing—to utilize their complementary strengths. However, location privacy issues may reduce workers' willingness to participate, thereby affecting task completion rates. Although existing methods have addressed privacy protection in a single sensing mode, there remains little focus on location privacy in hybrid sensing modes. There are two main limitations in privacy issues related to task allocation: (i) how to effectively preserve workers' location privacy in hybrid sensing modes, and (ii) the usual reliance on trusted third-party institution. To address these issues, we propose a privacy-preserving hybrid multi-task allocation for MCS (PPHMA). This approach preserves workers' location privacy without relying on a fully trusted third-party institution, while maximizing the number of tasks completed. Specifically, for opportunistic task allocation, we employ zero-knowledge range proofs to protect workers' location, thereby avoiding location privacy leaks. Subsequently, based on the performance capability indicator of opportunistic workers, we select appropriate workers for task allocation. For participatory task allocation, we employ a worker location obfuscation generation algorithm to locally generate and upload obfuscated locations, ensuring that both the worker's real and obfuscated locations satisfy <inline-formula><tex-math>$\\\\varepsilon$</tex-math></inline-formula>-Geo-Indistinguishability within the protected range. Then, based on the execution capability indicator of the participatory workers, we screen for candidate workers and use a greedy immune clone algorithm to optimize the workers' travel distances. Finally, we verify the effectiveness of the scheme through experiments using two real-world datasets.\",\"PeriodicalId\":54229,\"journal\":{\"name\":\"IEEE Transactions on Network Science and Engineering\",\"volume\":\"12 4\",\"pages\":\"3360-3373\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2025-04-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10960559/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10960559/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

随着移动智能设备的广泛应用,移动人群感知(MCS)为人们提供了更好的服务。为了在有限的预算下满足日益增长的传感需求,平台整合了两种模式——机会式传感和参与式传感——以利用它们的互补优势。然而,位置隐私问题可能会降低员工的参与意愿,从而影响任务完成率。虽然现有的方法已经解决了单一感知模式下的隐私保护问题,但对混合感知模式下的位置隐私保护关注较少。与任务分配相关的隐私问题有两个主要限制:(i)如何在混合传感模式下有效地保护工人的位置隐私;(ii)通常依赖于可信的第三方机构。为了解决这些问题,我们提出了一种保护隐私的MCS混合多任务分配(PPHMA)。这种方法在不依赖完全可信的第三方机构的情况下保护了员工的位置隐私,同时最大限度地完成了任务数量。具体而言,对于机会主义任务分配,我们采用零知识范围证明来保护工人的位置,从而避免位置隐私泄露。然后,根据机会主义员工的绩效能力指标,选择合适的员工进行任务分配。对于参与式任务分配,我们采用了一个工人位置混淆生成算法来本地生成和上传混淆位置,确保工人的真实位置和混淆位置在保护范围内都满足$\varepsilon$- geo -不可分辨性。然后,基于参与式工人的执行能力指标,筛选候选工人,并采用贪婪免疫克隆算法对工人的出行距离进行优化。最后,我们通过两个真实数据集的实验验证了该方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PPHMA: Privacy-Preserving Hybrid Multi-Task Allocation for Mobile Crowd Sensing
With the widespread adoption of mobile smart devices, mobile crowd sensing(MCS) has provided better services for people. To meet the growing sensing demands within a limited budget, platforms have integrated two modes—opportunistic sensing and participatory sensing—to utilize their complementary strengths. However, location privacy issues may reduce workers' willingness to participate, thereby affecting task completion rates. Although existing methods have addressed privacy protection in a single sensing mode, there remains little focus on location privacy in hybrid sensing modes. There are two main limitations in privacy issues related to task allocation: (i) how to effectively preserve workers' location privacy in hybrid sensing modes, and (ii) the usual reliance on trusted third-party institution. To address these issues, we propose a privacy-preserving hybrid multi-task allocation for MCS (PPHMA). This approach preserves workers' location privacy without relying on a fully trusted third-party institution, while maximizing the number of tasks completed. Specifically, for opportunistic task allocation, we employ zero-knowledge range proofs to protect workers' location, thereby avoiding location privacy leaks. Subsequently, based on the performance capability indicator of opportunistic workers, we select appropriate workers for task allocation. For participatory task allocation, we employ a worker location obfuscation generation algorithm to locally generate and upload obfuscated locations, ensuring that both the worker's real and obfuscated locations satisfy $\varepsilon$-Geo-Indistinguishability within the protected range. Then, based on the execution capability indicator of the participatory workers, we screen for candidate workers and use a greedy immune clone algorithm to optimize the workers' travel distances. Finally, we verify the effectiveness of the scheme through experiments using two real-world datasets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.
×
引用
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学术官方微信