TY - GEN
T1 - Selecting most informative contributors with unknown costs for budgeted crowdsensing
AU - Yang, Shuo
AU - Wu, Fan
AU - Tang, Shaojie
AU - Luo, Tie
AU - Gao, Xiaofeng
AU - Kong, Linghe
AU - Chen, Guihai
N1 - Publisher Copyright: © 2016 IEEE.
PY - 2016/10/13
Y1 - 2016/10/13
N2 - Mobile crowdsensing has become a novel and promising paradigm in collecting environmental data. A critical problem in improving the QoS of crowdsensing is to decide which users to select to perform sensing tasks, in order to obtain the most informative data, while maintaining the total sensing costs below a given budget. The key challenges lie in (i) finding an effective measure of the informativeness of users' data, (ii) learning users' sensing costs which are unknown a priori, and (iii) designing efficient user selection algorithms that achieve low-regret guarantees. In this paper, we build Gaussian Processes (GPs) to model spatial locations, and provide a mutual information-based criteria to characterize users' informativeness. To tackle the second and third challenges, we model the problem as a budgeted multi-armed bandit (MAB) problem based on stochastic assumptions, and propose an algorithm with theoretically proven low-regret guarantee. Our theoretical analysis and evaluation results both demonstrate that our algorithm can efficiently select most informative users under stringent constraints.
AB - Mobile crowdsensing has become a novel and promising paradigm in collecting environmental data. A critical problem in improving the QoS of crowdsensing is to decide which users to select to perform sensing tasks, in order to obtain the most informative data, while maintaining the total sensing costs below a given budget. The key challenges lie in (i) finding an effective measure of the informativeness of users' data, (ii) learning users' sensing costs which are unknown a priori, and (iii) designing efficient user selection algorithms that achieve low-regret guarantees. In this paper, we build Gaussian Processes (GPs) to model spatial locations, and provide a mutual information-based criteria to characterize users' informativeness. To tackle the second and third challenges, we model the problem as a budgeted multi-armed bandit (MAB) problem based on stochastic assumptions, and propose an algorithm with theoretically proven low-regret guarantee. Our theoretical analysis and evaluation results both demonstrate that our algorithm can efficiently select most informative users under stringent constraints.
UR - https://www.scopus.com/pages/publications/85009802446
U2 - 10.1109/IWQoS.2016.7590447
DO - 10.1109/IWQoS.2016.7590447
M3 - Conference contribution
T3 - 2016 IEEE/ACM 24th International Symposium on Quality of Service, IWQoS 2016
BT - 2016 IEEE/ACM 24th International Symposium on Quality of Service, IWQoS 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 24th IEEE/ACM International Symposium on Quality of Service, IWQoS 2016
Y2 - 20 June 2016 through 21 June 2016
ER -