Task allocation based on time optimization in Mobile crowd sensing

In this paper, we consider the time optimization problem of MCS (mobile crowd sensing). We consider the influence of various factors on time from two aspects of system task scheduling and task allocation. In task scheduling, we use queuing theory and data calculation to describe the optimal situation. In task allocation, we consider the reliability of tasks and the mobility of participants, Finally, the SA(simulated annealing) algorithm is compared with the greedy algorithm to prove the superiority of the algorithm.