Journal
IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 18, Issue 1, Pages 84-97Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TMC.2018.2827375
Keywords
Crowdsourcing; mobile crowdsensing; spatiotemporal granularity; greedy-based search; task assignment
Funding
- National Basic Research Program of China [2015CB352400]
- National Natural Science Foundation of China [61402360, 61725205]
- Foundation of Shaanxi Educational Committee [16JK1509]
Ask authors/readers for more resources
Mobile crowdsensing (MCS) is a new paradigm to collect sensing data and infer useful knowledge over a vast area for numerous monitoring applications. In urban environments, as more and more applications need to utilize multi-source sensing information, it is almost indispensable to develop a generic mechanism supporting multiple concurrent MCS task assignment. However, most existing multi-task assignment methods focus on homogeneous tasks. Due to the diverse spatiotemporal task requirements and sensing contexts, MCS tasks often differ from each other in many aspects (e.g., spatial coverage, temporal interval). To this end, in the paper, we present and formalize an important Heterogeneous Multi-Task Assignment (HMTA) problem in mobile crowdsensing systems, and try to maximize data quality and minimize total incentive budget. By leveraging the implicit spatiotemporal correlations among heterogeneous tasks, we propose a two-stage HMTA problem-solving approach to effectively handle multiple concurrent tasks in a shared resource pool. Finally, in order to improve the assignment search efficiency, a decomposition-and-combination framework is devised to accommodate large-scale problem scenario. We evaluate our approach extensively using two large-scale real-world data sets. The experimental results validate the effectiveness and efficiency of our proposed approach.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available