Mobile Crowdsourcing Task Allocation with Differential-and-Distortion Geo-Obfuscation

被引:38
|
作者
Wang, Leye [1 ,2 ]
Yang, Dingqi [4 ]
Han, Xiao [5 ]
Zhang, Daqing [1 ,2 ,3 ]
Ma, Xiaojuan [6 ]
机构
[1] Peking Univ, Minist Educ, Key Lab High Confidence Software Technol, Beijing 100871, Shi, Peoples R China
[2] Peking Univ, Software Inst, Beijing 100871, Shi, Peoples R China
[3] Telecom SudParis, Paris, France
[4] Univ Fribourg, eXascale Infolab, CH-1700 Fribourg, Switzerland
[5] Shanghai Univ Finance & Econ, Shanghai Shi 200433, Peoples R China
[6] Hong Kong Univ Sci & Technol, Hong Kong, Peoples R China
基金
欧洲研究理事会;
关键词
Task analysis; Privacy; Resource management; Distortion; Differential privacy; Crowdsourcing; Optimization; Mobile crowdsensing; differential location privacy; distortion location privacy; task allocation; travel distance; PRIVACY; WORKER;
D O I
10.1109/TDSC.2019.2912886
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In mobile crowdsourcing, organizers usually need participants' precise locations for optimal task allocation, e.g., minimizing selected workers' travel distance to task locations. However, the exposure of users' locations raises privacy concerns. In this paper, we propose a location privacy-preserving task allocation framework with geo-obfuscation to protect users' locations during task assignments. More specifically, we make participants obfuscate their reported locations under the guarantee of two rigorous privacy-preserving schemes, differential and distortion privacy, without the need to involve any third-party trusted entity. In order to achieve optimal task allocation with the differential-and-distortion geo-obfuscation, we formulate a mixed-integer non-linear programming problem to minimize the expected travel distance of the selected workers under the constraints of differential and distortion privacy. Moreover, a worker may be willing to accept multiple tasks, and a task organizer may be concerned with multiple utility objectives such as task acceptance ratio in addition to travel distance. Against this background, we also extend our solution to the multi-task allocation and multi-objective optimization cases. Evaluation results on both simulation and real-world user mobility traces verify the effectiveness of our framework. Particularly, our framework outperforms Laplace obfuscation, a state-of-the-art geo-obfuscation mechanism, by achieving up to 47 percent shorter average travel distance on real-world data under the same level of privacy protection.
引用
收藏
页码:967 / 981
页数:15
相关论文
共 27 条
  • [1] Location Privacy-Preserving Task Allocation for Mobile Crowdsensing with Differential Geo-Obfuscation
    Wang, Leye
    Yang, Dingqi
    Han, Xiao
    Wang, Tianben
    Zhang, Daqing
    Ma, Xiaojuan
    [J]. PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17), 2017, : 627 - 636
  • [2] A Geo-Obfuscation Approach to Protect Worker Location Privacy in Spatial Crowdsourcing Systems
    Pang, Ce
    Qiu, Chenxi
    Wang, Ning
    [J]. 2019 IEEE 16TH INTERNATIONAL CONFERENCE ON MOBILE AD HOC AND SENSOR SYSTEMS WORKSHOPS (MASSW 2019), 2019, : 166 - 167
  • [3] Time-Efficient Geo-Obfuscation to Protect Worker Location Privacy over Road Networks in Spatial Crowdsourcing
    Qiu, Chenxi
    Squicciarini, Anna
    Li, Zhouzhao
    Pang, Ce
    Yan, Li
    [J]. CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, : 1275 - 1284
  • [4] Task allocation based on profit maximization for mobile crowdsourcing
    Hou Yinglin
    Cheng Weiqing
    [J]. The Journal of China Universities of Posts and Telecommunications, 2020, 27 (01) : 26 - 37
  • [5] Task allocation based on profit maximization for mobile crowdsourcing
    Yinglin, Hou
    Weiqing, Cheng
    [J]. Journal of China Universities of Posts and Telecommunications, 2020, 27 (01): : 26 - 37
  • [6] Equilibrium is priceless: selfish task allocation for mobile crowdsourcing network
    Li, Qingyu
    Yang, Panlong
    Tang, Shaojie
    Zhang, Maotian
    Fan, Xiaochen
    [J]. EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2016,
  • [7] Dynamic Allocation for Complex Mobile Crowdsourcing Task with Internal Dependencies
    Yang, Congying
    Yu, Zhiwen
    Liu, Yimeng
    Wang, Liang
    Guo, Bin
    [J]. 2019 IEEE SMARTWORLD, UBIQUITOUS INTELLIGENCE & COMPUTING, ADVANCED & TRUSTED COMPUTING, SCALABLE COMPUTING & COMMUNICATIONS, CLOUD & BIG DATA COMPUTING, INTERNET OF PEOPLE AND SMART CITY INNOVATION (SMARTWORLD/SCALCOM/UIC/ATC/CBDCOM/IOP/SCI 2019), 2019, : 818 - 825
  • [8] Task Allocation Schemes for Crowdsourcing in Opportunistic Mobile Social Networks
    Chen, Xiao
    Deng, Bo
    [J]. 2018 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC), 2018, : 615 - 619
  • [9] Equilibrium is priceless: selfish task allocation for mobile crowdsourcing network
    Qingyu Li
    Panlong Yang
    Shaojie Tang
    Maotian Zhang
    Xiaochen Fan
    [J]. EURASIP Journal on Wireless Communications and Networking, 2016
  • [10] Online Mobile Micro-Task Allocation in Spatial Crowdsourcing
    Tong, Yongxin
    She, Jieying
    Ding, Bolin
    Wang, Libin
    Chen, Lei
    [J]. 2016 32ND IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2016, : 49 - 60