Multitask Allocation to Heterogeneous Participants in Mobile Crowd Sensing

Algorithm 1

Greedy strategy algorithm.

Input: Task set , User set , the number of users that each task required

Output: The <task, users> tuple

For each task in

Find the users with the required sensor and maximum workload > 0, denotes as

Sort the according to the moving time, maximum workload and number of sensors

Greedily select users from whose moving time is shortest

If moving time is equal, select non-competitive users firstly

If all users are competitive users, select users whose devices with fewer sensors

Delete task if there are users to complete it

End for

Output the <task, users> tuple