Multi-Task Allocation Under Time Constraints in Mobile Crowdsensing

摘要

Mobile crowdsensing (MCS) is a popular paradigm to collect sensed data for numerous sensing applications. With the increment of tasks and workers in MCS, it has become indispensable to design efficient task allocation schemes to achieve high performance for MCS applications. Many existing works on task allocation focus on single-task allocation, which is inefficient in many MCS scenarios where workers are able to undertake multiple tasks. On the other hand, many tasks are time-limited, while the available time of workers is also limited. Therefore, time validity is essential for both tasks and workers. To accommodate these challenges, this paper proposes a multi-task allocation problem with time constraints, which investigates the impact of time constraints to multi-task allocation and aims to maximize the utility of the MCS platform. We first prove that this problem is NP-complete. Then two evolutionary algorithms are designed to solve this problem. Finally, we conduct the experiments based on synthetic and real-world datasets under different experiment settings. The results verify that the proposed algorithms achieve more competitive and stable performance compared with baseline algorithms.