Name
Abstract | ||
|---|---|---|
Mobile CrowdSensing (MCS), through which a requester can coordinate a crowd of workers to accomplish some data collection tasks, has been recognized as a promising paradigm for large-scale data acquisition in recent years. Many researches focus on the worker recruitment problem in MCS, but most of them either have the assumption that workers’ qualities are known ahead of time or cannot ensure that workers report costs honestly. In this paper, we propose an incentive mechanism based on Combinatorial Multi-Armed Bandit and reverse Auction, called CMABA, to solve the multiple unknown workers recruitment problem in MCS. Our objective is to determine a recruiting strategy to maximize the total sensing quality under a limited budget, while ensuring truthfulness and individual rationality of sensing workers. We theoretically prove that our CMABA mechanism achieves truthfulness and individual rationality, and then analyze the regret of the mechanism. Based on CMABA, we ulteriorly propose an adaptive incentive mechanism, called ACMABA, to recruit workers via the alternative worker recruitment and quality update, which can achieve a higher total sensing quality and lower regret. Additionally, we also demonstrate significant performances of the CMABA and ACMABA mechanisms through extensive simulations on real-world data traces. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TMC.2021.3059346 | IEEE Transactions on Mobile Computing |
Keywords | DocType | Volume |
Mobile crowdsensing,multi-armed bandit,reverse auction,worker recruitment | Journal | 21 |
Issue | ISSN | Citations |
10 | 1536-1233 | 1 |
PageRank | References | Authors |
0.35 | 26 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mingjun Xiao | 1 | 520 | 41.54 |
| Baoyi An | 2 | 4 | 1.76 |
| Jing Wang | 3 | 28 | 23.94 |
| Guoju Gao | 4 | 2 | 2.73 |
| Sheng Zhang | 5 | 113 | 10.66 |
| Jie Wu | 6 | 8307 | 592.07 |