PMLSF: A Privacy-Preserving Machine Learning Service Framework for Efficient Task Allocation in Mobile Crowdsensing

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
IEEE Transactions on Services Computing Pub Date : 2026-09-01 Epub Date: 2026-04-16 DOI:10.1109/TSC.2026.3684881
Zeyuan Li;Xuechi Chen;Yuxin Liu;Neal N. Xiong;Houbing Herbert Song;Tian Wang
{"title":"PMLSF: A Privacy-Preserving Machine Learning Service Framework for Efficient Task Allocation in Mobile Crowdsensing","authors":"Zeyuan Li;Xuechi Chen;Yuxin Liu;Neal N. Xiong;Houbing Herbert Song;Tian Wang","doi":"10.1109/TSC.2026.3684881","DOIUrl":null,"url":null,"abstract":"The proliferation of machine learning services in mobile crowdsensing (MCS) brings both new opportunities and severe privacy challenges. Location leakage, identity linkage, and centralized trust bottlenecks remain critical risks, while conventional differential privacy (DP) techniques often degrade service responsiveness due to noise generation latency and increased training overhead. To address these issues, this paper proposes PMLSF, a Privacy-Preserving Machine Learning Service Framework that integrates differential privacy, deep reinforcement learning (DRL), and blockchain-based orchestration to enable secure, efficient, and scalable task allocation in MCS environments. Specifically, we design Optimized Geo-indistinguishability (OptGI), a lightweight DP mechanism that reduces noise generation latency while maintaining rigorous privacy guarantees. We further introduce TopK Double Deep Q-Network (TopK-DDQN), a task allocation service that prunes infeasible actions and supports latency-aware decision-making over privatized inputs. To eliminate single points of failure, PMLSF employs a permissioned blockchain orchestration layer, ensuring anonymity, accountability, and distributed trust without imposing prohibitive overhead. Extensive experiments demonstrate that PMLSF achieves low-latency privacy protection and significantly improves allocation utility and profit compared with state-of-the-art methods, positioning it as a scalable foundation for integrating DP methodologies into machine learning-driven MCS services.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"19 5","pages":"3226-3240"},"PeriodicalIF":6.2000,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11482771/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/4/16 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The proliferation of machine learning services in mobile crowdsensing (MCS) brings both new opportunities and severe privacy challenges. Location leakage, identity linkage, and centralized trust bottlenecks remain critical risks, while conventional differential privacy (DP) techniques often degrade service responsiveness due to noise generation latency and increased training overhead. To address these issues, this paper proposes PMLSF, a Privacy-Preserving Machine Learning Service Framework that integrates differential privacy, deep reinforcement learning (DRL), and blockchain-based orchestration to enable secure, efficient, and scalable task allocation in MCS environments. Specifically, we design Optimized Geo-indistinguishability (OptGI), a lightweight DP mechanism that reduces noise generation latency while maintaining rigorous privacy guarantees. We further introduce TopK Double Deep Q-Network (TopK-DDQN), a task allocation service that prunes infeasible actions and supports latency-aware decision-making over privatized inputs. To eliminate single points of failure, PMLSF employs a permissioned blockchain orchestration layer, ensuring anonymity, accountability, and distributed trust without imposing prohibitive overhead. Extensive experiments demonstrate that PMLSF achieves low-latency privacy protection and significantly improves allocation utility and profit compared with state-of-the-art methods, positioning it as a scalable foundation for integrating DP methodologies into machine learning-driven MCS services.
PMLSF:一种保护隐私的机器学习服务框架,用于移动众测中高效的任务分配
移动众测(MCS)中机器学习服务的激增既带来了新的机遇,也带来了严峻的隐私挑战。位置泄漏、身份链接和集中信任瓶颈仍然是关键风险,而传统的差分隐私(DP)技术通常会由于噪声产生延迟和增加的培训开销而降低服务响应性。为了解决这些问题,本文提出了PMLSF,这是一个保护隐私的机器学习服务框架,它集成了差分隐私、深度强化学习(DRL)和基于区块链的编排,以在MCS环境中实现安全、高效和可扩展的任务分配。具体来说,我们设计了优化的地理不可分辨性(OptGI),这是一种轻量级的DP机制,可以减少噪音产生的延迟,同时保持严格的隐私保证。我们进一步介绍了TopK Double Deep Q-Network (TopK- ddqn),这是一种任务分配服务,可以修剪不可行的动作,并支持对私有化输入的延迟感知决策。为了消除单点故障,PMLSF采用了经过许可的区块链编排层,确保匿名性、可问责性和分布式信任,而不会强加过高的开销。广泛的实验表明,与最先进的方法相比,PMLSF实现了低延迟的隐私保护,并显着提高了分配效用和利润,将其定位为将DP方法集成到机器学习驱动的MCS服务中的可扩展基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
×
引用
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学术官方微信
小红书