Maximizing Acceptance in Rejection-Aware Spatial Crowdsourcing

With the rapid development of mobile networks and the widespread usage of mobile devices, spatial crowdsourcing, which refers to assigning location-based tasks to moving workers, has drawn increasing attention. One of the important issues in spatial crowdsourcing is task assignment, which allocates...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on knowledge and data engineering Vol. 29; no. 9; pp. 1943 - 1956
Main Authors Zheng, Libin, Chen, Lei
Format Journal Article
LanguageEnglish
Published New York IEEE 01.09.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
acceptance maximization
Approximation
Crowdsourcing
Dynamic programming
Electronic devices
Exact solutions
greedy algorithm
Greedy algorithms
Heuristic algorithms
local search
Mathematical analysis
Maximization
Mobile communication
Mobile computing
Optimization
Pruning
Rejection
Rejection-aware spatial crowdsourcing
Servers
Throughput
Wireless networks
Online AccessGet full text

Cover

More Information
Summary:With the rapid development of mobile networks and the widespread usage of mobile devices, spatial crowdsourcing, which refers to assigning location-based tasks to moving workers, has drawn increasing attention. One of the important issues in spatial crowdsourcing is task assignment, which allocates tasks to appropriate workers. However, existing works generally assume that no rejection would happen after the task assignment is completed by the server. Ignorance of such an operation can lead to low system throughput. Thus, in this paper, we take workers' rejection into consideration and try to maximize workers' acceptance in order to improve the system throughput. Specifically, we first formally define the problem of maximizing workers' acceptance in rejection-aware spatial crowdsourcing. Unfortunately, the problem is NP-hard. We propose two exact solutions to obtain the optimal assignment, but they are not efficient enough and not scalable for large inputs. Then, we present four approximation approaches for improving the efficiency. Finally, we show the effectiveness of the proposed pruning strategy for the exact solutions and the superiority of the proposed Greedy algorithm over other approximation methods through extensive experiments.
ISSN:1041-4347
1558-2191
DOI:10.1109/TKDE.2017.2676771