4.7 Article

Personalized Privacy-Preserving Task Allocation for Mobile Crowdsensing

期刊

IEEE TRANSACTIONS ON MOBILE COMPUTING
卷 18, 期 6, 页码 1330-1341

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TMC.2018.2861393

关键词

Mobile crowdsensing; task allocation; differential privacy; personalized privacy-preserving

资金

  1. National Natural Science of China [61502352, 61772551, U1636219, 61373167]
  2. National Basic Research Program of China [2014CB340600]
  3. National Science Foundation [1444059, 1717315]
  4. Shandong Provincial Key Program of Research and Development [2018GGX101035]
  5. Natural Science Foundation of Hubei Province [2017CFB503, 2017CFA007, 2017CFA047]
  6. Fundamental Research Funds for the Central Universities [2042018gf0043, 413000035, 18CX07003A]
  7. State Key Lab. for Novel Software Technology, Nanjing University [KFKT2018B09]
  8. Division Of Computer and Network Systems
  9. Direct For Computer & Info Scie & Enginr [1717315, 1444059] Funding Source: National Science Foundation

向作者/读者索取更多资源

Location information of workers are usually required for optimal task allocation in mobile crowdsensing, which however raises severe concerns of location privacy leakage. Although many approaches have been proposed to protect the locations of users, the location protection for task allocation in mobile crowdsensing has not been well explored. In addition, to the best of our knowledge, none of existing privacy-preserving task allocation mechanisms can provide personalized location protection considering different protection demands of workers. In this paper, we propose a personalized privacy-preserving task allocation framework for mobile crowdsensing that can allocate tasks effectively while providing personalized location privacy protection. The basic idea is that each worker uploads the obfuscated distances and personal privacy level to the server instead of its true locations or distances to tasks. In particular, we propose a Probabilistic Winner Selection Mechanism (PWSM) to minimize the total travel distance with the obfuscated information from workers, by allocating each task to the worker who has the largest probability of being closest to it. Moreover, we propose a Vickrey Payment Determination Mechanism (VPDM) to determine the appropriate payment to each winner by considering its movement cost and privacy level, which satisfies the truthfulness, profitability, and probabilistic individual rationality. Extensive experiments on the real-world datasets demonstrate the effectiveness of the proposed mechanisms.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据