A differentially private task planning framework for spatial crowdsourcing
Spatial crowdsourcing has stimulated various new applications such as taxi calling and food delivery. A key enabler for these spatial crowdsourcing based applications is to plan routes for crowd workers to execute tasks given diverse requirements of workers and the spatial crowdsourcing platform. De...
Saved in:
Main Authors: | , , , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/6709 https://ink.library.smu.edu.sg/context/sis_research/article/7712/viewcontent/mdm21_tao.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-7712 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-77122022-01-27T11:17:06Z A differentially private task planning framework for spatial crowdsourcing TAO, Qian TONG, Yongxin LI, Shuyuan ZENG, Yuxiang ZHOU, Zimu XU, Ke Spatial crowdsourcing has stimulated various new applications such as taxi calling and food delivery. A key enabler for these spatial crowdsourcing based applications is to plan routes for crowd workers to execute tasks given diverse requirements of workers and the spatial crowdsourcing platform. Despite extensive studies on task planning in spatial crowdsourcing, few have accounted for the location privacy of tasks, which may be misused by an untrustworthy platform. In this paper, we explore efficient task planning for workers while protecting the locations of tasks. Specifically, we define the Privacy-Preserving Task Planning (PPTP) problem, which aims at both total revenue maximization of the platform and differential privacy of task locations. We first apply the Laplacian mechanism to protect location privacy, and analyze its impact on the total revenue. Then we propose an effective and efficient task planning algorithm for the PPTP problem. Extensive experiments on both synthetic and real datasets validate the advantages of our algorithm in terms of total revenue and time cost. 2021-07-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/6709 info:doi/10.1109/MDM52706.2021.00015 https://ink.library.smu.edu.sg/context/sis_research/article/7712/viewcontent/mdm21_tao.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Spatial Crowdsourcing Privacy Preserving Task Planning Databases and Information Systems Software Engineering |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Spatial Crowdsourcing Privacy Preserving Task Planning Databases and Information Systems Software Engineering |
spellingShingle |
Spatial Crowdsourcing Privacy Preserving Task Planning Databases and Information Systems Software Engineering TAO, Qian TONG, Yongxin LI, Shuyuan ZENG, Yuxiang ZHOU, Zimu XU, Ke A differentially private task planning framework for spatial crowdsourcing |
description |
Spatial crowdsourcing has stimulated various new applications such as taxi calling and food delivery. A key enabler for these spatial crowdsourcing based applications is to plan routes for crowd workers to execute tasks given diverse requirements of workers and the spatial crowdsourcing platform. Despite extensive studies on task planning in spatial crowdsourcing, few have accounted for the location privacy of tasks, which may be misused by an untrustworthy platform. In this paper, we explore efficient task planning for workers while protecting the locations of tasks. Specifically, we define the Privacy-Preserving Task Planning (PPTP) problem, which aims at both total revenue maximization of the platform and differential privacy of task locations. We first apply the Laplacian mechanism to protect location privacy, and analyze its impact on the total revenue. Then we propose an effective and efficient task planning algorithm for the PPTP problem. Extensive experiments on both synthetic and real datasets validate the advantages of our algorithm in terms of total revenue and time cost. |
format |
text |
author |
TAO, Qian TONG, Yongxin LI, Shuyuan ZENG, Yuxiang ZHOU, Zimu XU, Ke |
author_facet |
TAO, Qian TONG, Yongxin LI, Shuyuan ZENG, Yuxiang ZHOU, Zimu XU, Ke |
author_sort |
TAO, Qian |
title |
A differentially private task planning framework for spatial crowdsourcing |
title_short |
A differentially private task planning framework for spatial crowdsourcing |
title_full |
A differentially private task planning framework for spatial crowdsourcing |
title_fullStr |
A differentially private task planning framework for spatial crowdsourcing |
title_full_unstemmed |
A differentially private task planning framework for spatial crowdsourcing |
title_sort |
differentially private task planning framework for spatial crowdsourcing |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2021 |
url |
https://ink.library.smu.edu.sg/sis_research/6709 https://ink.library.smu.edu.sg/context/sis_research/article/7712/viewcontent/mdm21_tao.pdf |
_version_ |
1770576051632603136 |