Netinfo Security ›› 2024, Vol. 24 ›› Issue (3): 449-461.doi: 10.3969/j.issn.1671-1122.2024.03.010

Previous Articles     Next Articles

Dynamic Task Allocation for Crowd Sensing Based on Deep Reinforcement Learning and Privacy Protection

FU Yanming1,2,3, LU Shenglin1, CHEN Jiayuan1(), QIN Hua1   

  1. 1. School of Computer, Electronic and Information, Guangxi University, Nanning 530000, China
    2. Key Laboratory of Parallel, Distributed and Intelligent Computing(Guangxi), Nanning 530000, China
    3. Guangxi Intelligent Digital Services Research Center of Engineering Technology, Nanning 530000, China
  • Received:2024-01-29 Online:2024-03-10 Published:2024-04-03
  • Contact: CHEN Jiayuan E-mail:ycq_cjy@163.com

Abstract:

In mobile crowd sensing(MCS), the outcome of dynamic task allocation is crucial for enhancing system efficiency and ensuring data quality. Most existing studies simplify dynamic task allocation into a bipartite matching model, which fails to sufficiently consider the impact of task and worker attributes on the matching results and overlooked the protection of worker location privacy. To address these shortcomings, this paper presents a privacy-preserving dynamic task allocation strategy for MCS based on deep reinforcement learning and privacy protection. The strategy first employed differential privacy techniques to add noise to worker locations, protecting their privacy. It then adapted task batch assignments using deep reinforcement learning methods. Finally, it employed a greedy algorithm based on worker task capability thresholds to compute the maximal total utility of the platform under the optimal strategy. Experimental results on real-world datasets demonstrate that the strategy maintains superior performance under various parameter settings while effectively safeguarding worker location privacy.

Key words: crowd sensing, deep reinforcement learning, privacy protection, double deep Q-network, capacity threshold greedy algorithm

CLC Number: