AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (6 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Diversity-Based Recruitment in Crowdsensing by Combinatorial Multi-Armed Bandits

Center for Networked Computing, Temple University, Philadelphia, PA 19122, USA
Show Author Information

Abstract

Mobile Crowdsensing (MCS) represents a transformative approach to collecting data from the environment as it utilizes the ubiquity and sensory capabilities of mobile devices with human participants. This paradigm enables scales of data collection critical for applications ranging from environmental monitoring to urban planning. However, the effective harnessing of this distributed data collection capability faces significant challenges. One of the most significant challenges is the variability in the sensing qualities of the participating devices while they are initially unknown and must be learned over time to optimize task assignments. This paper tackles the dual challenges of managing task diversity to mitigate data redundancy and optimizing task assignment amidst the inherent variability of worker performance. We introduce a novel model that dynamically adjusts task weights based on assignment frequency to promote diversity and incorporates a flexible approach to account for the different qualities of task completion, especially in scenarios with overlapping task assignments. Our strategy aims to maximize the overall weighted quality of data collected within the constraints of a predefined budget. Our strategy leverages a combinatorial multi-armed bandit framework with an upper confidence bound approach to guide decision-making. We demonstrate the efficacy of our approach through a combination of regret analysis and simulations grounded in realistic scenarios.

References

[1]
Y. Wei, Y. Zhu, H. Zhu, Q. Zhang, and G. Xue, Truthful online double auctions for dynamic mobile crowdsourcing, in Proc. IEEE Conf. Computer Communications (INFOCOM), Hong Kong, China, 2015, pp. 2074–2082.
[2]

S. Peng, B. Zhang, Y. Yan, and C. Li, A multiplatform-cooperation-based task assignment mechanism for mobile crowdsensing, IEEE Internet Things J., vol. 10, no. 19, pp. 16881–16894, 2023.

[3]

V. S. Dasari, B. Kantarci, M. Pouryazdan, L. Foschini, and M. Girolami, Game theory in mobile CrowdSensing: A comprehensive survey, Sensors, vol. 20, no. 7, p. 2055, 2020.

[4]

J. Liu, H. Shen, H. S. Narman, W. Chung, and Z. Lin, A survey of mobile crowdsensing techniques: A critical component for the Internet of Things, ACM Trans. Cyber Phys. Syst., vol. 2, no. 3, p. 18, 2018.

[5]

H. Zhao, M. Xiao, J. Wu, Y. Xu, H. Huang, and S. Zhang, Differentially private unknown worker recruitment for mobile crowdsensing using multi-armed bandits, IEEE Trans. Mobile Comput., vol. 20, no. 9, pp. 2779–2794, 2021.

[6]
A. Sawwan and J. Wu, A new framework: Short-term and long-term returns in stochastic multi-armed bandit, in Proc. IEEE INFOCOM 2023 - IEEE Conf. Computer Communications, New York, NY, USA, 2023.
[7]

C. Wu, Y. Zhu, R. Zhang, Y. Chen, F. Wang, and S. Cui, FedAB: Truthful federated learning with auction-based combinatorial multi-armed bandit, IEEE Internet Things J., vol. 10, no. 17, pp. 15159–15170, 2023.

[8]
W. Jin, M. Xiao, M. Li, and L. Guo, If you do not care about it, sell it: Trading location privacy in mobile crowd sensing, in Proc. IEEE INFOCOM 2019 - IEEE Conf. Computer Communications, Paris, France, 2019, pp. 1045–1053.
[9]

H. Ma, D. Zhao, and P. Yuan, Opportunities in mobile crowd sensing, IEEE Commun. Mag., vol. 52, no. 8, pp. 29–35, 2014.

[10]
S. He, D. H. Shin, J. Zhang and J. Chen, Toward optimal allocation of location dependent tasks in crowdsensing, IEEE INFOCOM 2014 - IEEE Conf. on Computer Communications, Toronto, Canada, 2014, pp. 745–753.
[11]
L. Pu, X. Chen, J. Xu, and X. Fu, Crowdlet: Optimal worker recruitment for self-organized mobile crowdsourcing, in Proc. IEEE INFOCOM 2016 - The 35th Annual IEEE Int. Conf. Computer Communications, San Francisco, CA, USA, 2016, pp. 1–9.
[12]

Z. Song, C. H. Liu, J. Wu, J. Ma, and W. Wang, QoI-aware multitask-oriented dynamic participant selection with budget constraints, IEEE Trans. Veh. Technol., vol. 63, no. 9, pp. 4618–4632, 2014.

[13]
S. Yang, K. Han, Z. Zheng, S. Tang, and F. Wu, Towards personalized task matching in mobile crowdsensing via fine-grained user profiling, in Proc. IEEE INFOCOM 2018 - IEEE Conf. Computer Communications, Honolulu, HI, USA, 2018, pp. 2411–2419.
[14]

Y. Zhang, P. Li, T. Zhang, J. Liu, W. Huang, and L. Nie, Dynamic user recruitment in edge-aided mobile crowdsensing, IEEE Trans. Veh. Technol., vol. 72, no. 7, pp. 9351–9365, 2023.

[15]
M. Xiao, J. Wu, L. Huang, Y. Wang, and C. Liu, Multi-task assignment for crowdsensing in mobile social networks, in Proc. IEEE Conf. Computer Communications (INFOCOM), Hong Kong, China, 2015, pp. 2227–2235.
[16]
H. Jin, H. Guo, L. Su, K. Nahrstedt, and X. Wang, Dynamic task pricing in multi-requester mobile crowd sensing with Markov correlated equilibrium, in Proc. IEEE INFOCOM 2019 - IEEE Conf. Computer Communications, Paris, France, 2019, pp. 1063–1071.
[17]

U. ul Hassan and E. Curry, Efficient task assignment for spatial crowdsourcing: A combinatorial fractional optimization approach with semi-bandit learning, Expert Syst. Appl., vol. 58, pp. 36–56, 2016.

[18]

Y. Wu, F. Li, L. Ma, Y. Xie, T. Li, and Y. Wang, A context-aware multiarmed bandit incentive mechanism for mobile crowd sensing systems, IEEE Internet Things J., vol. 6, no. 5, pp. 7648–7658, 2019.

[19]

G. Gao, S. Huang, H. Huang, M. Xiao, J. Wu, Y. E. Sun, and S. Zhang, Combination of auction theory and multi-armed bandits: Model. algorithm, and application, IEEE Trans. Mob. Comput., vol. 22, no. 11, pp. 6343–6357, 2023.

[20]
G. Gao, J. Wu, M. Xiao, and G. Chen, Combinatorial multi-armed bandit based unknown worker recruitment in heterogeneous crowdsensing, in Proc. IEEE INFOCOM 2020 - IEEE Conf. Computer Communications, Toronto, Canada, 2020, pp. 179–188.
[21]

H. Wang, Y. Yang, E. Wang, W. Liu, Y. Xu, and J. Wu, Truthful user recruitment for cooperative crowdsensing task: A combinatorial multi-armed bandit approach, IEEE Trans. Mob. Comput., vol. 22, no. 7, pp. 4314–4331, 2023.

[22]

C. Zhang, M. Zhao, L. Zhu, T. Wu, and X. Liu, Enabling efficient and strong privacy-preserving truth discovery in mobile crowdsensing, IEEE Trans. Inf. Forensic Secur., vol. 17, pp. 3569–3581, 2022.

[23]

W. Chen, Y. Wang, & Y. Yuan, Combinatorial multi-armed bandit: General framework and applications, PMLR, vol. 28, no. 1, pp. 151–159, 2013.

[24]

Y. Gai, B. Krishnamachari, and R. Jain, Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations, IEEE/ACM Trans. Netw., vol. 20, no. 5, pp. 1466–1478, 2012.

[25]
E. L. Lawler, Fast approximation algorithms for knapsack problems, in Proc. 18th Annual Symp. on Foundations of Computer Science, Providence, RI, USA, 1977, pp. 206–213.
[26]
S. Yang, F. Wu, S. Tang, T. Luo, X. Gao, L. Kong, and G. Chen, Selecting most informative contributors with unknown costs for budgeted crowdsensing, in Proc. IEEE/ACM 24th Int. Symp. on Quality of Service (IWQoS), Beijing, China, 2016, pp. 1–6.
[27]
V. V. Vazirani, Approximation Algorithms (Vol. 1). Berlin, Germany: Springer, 2001.
[28]

P. Auer, N. Cesa-Bianchi, and P. Fischer, Finite-time analysis of the multiarmed bandit problem, Mach. Lang., vol. 47, nos. 2&3, pp. 235–256, 2002.

[29]

J. W. Kim, K. Edemacu, and B. Jang, Privacy-preserving mechanisms for location privacy in mobile crowdsensing: A survey, J. Netw. Comput. Appl., vol. 200, p. 103315, 2022.

[30]
M. Karaliopoulos, I. Koutsopoulos, and M. Titsias, First learn then earn: Optimizing mobile crowdsensing campaigns through data-driven user profiling, in Proc. 17th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing, Paderborn, Germany, 2016, pp. 271–280.
[31]

Y. Lin, Z. Cai, X. Wang, F. Hao, L. Wang, and A. M. V. V. Sai, Multi-round incentive mechanism for cold start-enabled mobile crowdsensing, IEEE Trans. Veh. Technol., vol. 70, no. 1, pp. 993–1007, 2021.

[32]

M. Xiao, B. An, J. Wang, G. Gao, S. Zhang, and J. Wu, CMAB-based reverse auction for unknown worker recruitment in mobile crowdsensing, IEEE Trans. Mobile Comput., vol. 21, no. 10, pp. 3502–3518, 2022.

[33]

S. Klos nee Muller, C. Tekin, M. van der Schaar, and A. Klein, Context-aware hierarchical online learning for performance maximization in mobile crowdsourcing, IEEE/ACM Trans. Netw., vol. 26, no. 3, pp. 1334–1347, 2018.

[34]

K. Han, C. Zhang, and J. Luo, Taming the uncertainty: Budget limited robust crowdsensing through online learning, IEEE/ACM Trans. Netw., vol. 24, no. 3, pp. 1462–1475, 2015.

[35]
G. Gao, J. Wu, Z. Yan, M. Xiao, and G. Chen, Unknown worker recruitment with budget and covering constraints for mobile crowdsensing, in Proc. IEEE 25th Int. Conf. Parallel and Distributed Systems (ICPADS), Tianjin, China, 2019, pp. 539–547.
[36]
Y. Song and H. Jin, Minimizing entropy for crowdsourcing with combinatorial multi-armed bandit, in Proc. IEEE INFOCOM 2021 - IEEE Conf. Computer Communications, Vancouver, Canada, 2021, pp. 1–10.
[37]

D. Zhou and C. Tomlin, Budget-constrained multi-armed bandits with multiple plays, Proc. AAAI Conf. Artif. Intell., vol. 32, no. 1, pp. 4572–4579, 2018.

[38]
L. Bracciale, M. Bonola, P. Loreti, G. Bianchi, R. Amici, A. Rabuffi, CRAWDAD dataset roma/taxi, https://crawdad.org/roma/taxi/20140717, 2014.
Tsinghua Science and Technology
Pages 732-747
Cite this article:
Sawwan A, Wu J. Diversity-Based Recruitment in Crowdsensing by Combinatorial Multi-Armed Bandits. Tsinghua Science and Technology, 2025, 30(2): 732-747. https://doi.org/10.26599/TST.2024.9010053

423

Views

122

Downloads

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Altmetrics

Received: 03 August 2023
Revised: 20 November 2023
Accepted: 06 March 2024
Published: 09 December 2024
© The Author(s) 2025.

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).

Return