TY - JOUR
T1 - Identifying the Most Valuable Workers in Fog-Assisted Spatial Crowdsourcing
AU - Yang, Peng
AU - Zhang, Ning
AU - Zhang, Shan
AU - Yang, Kan
AU - Yu, Li
AU - Shen, Xuemin
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2017/10
Y1 - 2017/10
N2 - In this paper, we study worker selection in spatial crowdsourcing, which is the recruitment of human workers in a specific location to collect geographical data. To achieve better performance, spatial crowdsourcing task relies on both worker's effort and skill. Therefore, to maximize the long-term platform utility, we exploit fog platform as a service to identify valuable workers through learning their performance information. Worker's historical performance data are recorded at local fog server, based on which valuable workers are identified and selected to perform the tasks. During worker selection, we aim at balancing the exploration and exploitation, and propose an online algorithm that promotes workers who are not fully explored. With budget constraint, the proposed algorithm is able to maximize the long-term platform utility. Theoretical analysis indicates that the proposed learning algorithm achieves asymptotically diminishing regret. Finally, extensive simulations on real-world dataset are conducted, which demonstrate the advantage of our algorithm over other methods.
AB - In this paper, we study worker selection in spatial crowdsourcing, which is the recruitment of human workers in a specific location to collect geographical data. To achieve better performance, spatial crowdsourcing task relies on both worker's effort and skill. Therefore, to maximize the long-term platform utility, we exploit fog platform as a service to identify valuable workers through learning their performance information. Worker's historical performance data are recorded at local fog server, based on which valuable workers are identified and selected to perform the tasks. During worker selection, we aim at balancing the exploration and exploitation, and propose an online algorithm that promotes workers who are not fully explored. With budget constraint, the proposed algorithm is able to maximize the long-term platform utility. Theoretical analysis indicates that the proposed learning algorithm achieves asymptotically diminishing regret. Finally, extensive simulations on real-world dataset are conducted, which demonstrate the advantage of our algorithm over other methods.
KW - Budget constraint
KW - fog computing
KW - online learning
KW - spatial crowdsourcing
KW - worker selection
UR - https://www.scopus.com/pages/publications/85028918707
U2 - 10.1109/JIOT.2017.2726820
DO - 10.1109/JIOT.2017.2726820
M3 - 文章
AN - SCOPUS:85028918707
SN - 2327-4662
VL - 4
SP - 1193
EP - 1203
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
IS - 5
M1 - 7979501
ER -