A QoS-sensitive task assignment algorithm for mobile crowdsensing.

Recently, mobile crowdsensing has attracted many researchers’ attention due to the pervasiveness of smart phones. In this paper, we study the QoS-sensitive Task Assignment (QSTA) problem for mobile crowdsensing, which involves variable tasks and flexible rewards. Each user can conduct one or more tasks, and the number of tasks assigned to each user is flexible. The reward paid to the user is related to the assigned tasks. To ensure the sensing QoS of tasks, each task might be assigned to multiple users. We prove the QSTA problem to be NP-hard, and propose a greedy algorithm to solve this problem. Moreover, we also analyze the approximation ratio of the proposed algorithm. Additionally, we demonstrate the significant performance of the algorithm through simulations