TY - JOUR
T1 - A location-constrained crowdsensing task allocation method for improving user satisfaction
AU - Chen, Huihui
AU - Guo, Bin
AU - Yu, Zhiwen
AU - Chen, Liming (Luke)
PY - 2019/10/21
Y1 - 2019/10/21
N2 - Mobile crowdsensing is a special data collection manner which collects data by smart phones taken by people every day. It is essential to pick suitable workers for different outdoor tasks. Constrained by participants’ locations and their daily travel rules, they are likely to accomplish light outdoor tasks by their way without extra detours. Previous researchers found that people prefer to accomplish a certain number of tasks at a time; thus, we focus on assigning light outdoor tasks to workers by considering two optimization objectives, including (1) maximizing the ratio of light tasks for different workers and (2) maximizing the worker’s satisfaction on assigned tasks. This task allocation problem is a non-deterministic polynomial-time-hard due to two reasons, that is, tasks and workers are many-to-many relationships and workers move from different places to different places. Considering both optimization objectives, we design the global-optimizing task allocation algorithm, which greedily selects the most appropriate participant until either no participant can be chosen or no tasks can be assigned. For the purpose of emulating real scenarios, different scales of maps, tasks, and workers are simulated to evaluate algorithms. Experimental results verify that the proposed global-optimizing method outperforms baselines on both maximization objectives.
AB - Mobile crowdsensing is a special data collection manner which collects data by smart phones taken by people every day. It is essential to pick suitable workers for different outdoor tasks. Constrained by participants’ locations and their daily travel rules, they are likely to accomplish light outdoor tasks by their way without extra detours. Previous researchers found that people prefer to accomplish a certain number of tasks at a time; thus, we focus on assigning light outdoor tasks to workers by considering two optimization objectives, including (1) maximizing the ratio of light tasks for different workers and (2) maximizing the worker’s satisfaction on assigned tasks. This task allocation problem is a non-deterministic polynomial-time-hard due to two reasons, that is, tasks and workers are many-to-many relationships and workers move from different places to different places. Considering both optimization objectives, we design the global-optimizing task allocation algorithm, which greedily selects the most appropriate participant until either no participant can be chosen or no tasks can be assigned. For the purpose of emulating real scenarios, different scales of maps, tasks, and workers are simulated to evaluate algorithms. Experimental results verify that the proposed global-optimizing method outperforms baselines on both maximization objectives.
U2 - 10.1177/1550147719883987
DO - 10.1177/1550147719883987
M3 - Article
SN - 1550-1477
VL - 15
JO - International Journal of Distributed Sensor Networks
JF - International Journal of Distributed Sensor Networks
IS - 10
ER -