User Recruitment Algorithm for Maximizing Quality under Limited Budget in Mobile Crowdsensing

Table 2

Experimental setting of Algorithm 2.

Happening	Budget (B)	Number of recruits per round (Y)	Amount of users (A)	Number of tasks (P)
1	5000	20–80	150	800
2	5000	50	50–200	800
3	5000	50	150	200–1200
4	10000	20–80	150	800
5	10000	50	50–200	800
6	10000	50	150	200–1200
7	15000	20–80	150	800
8	15000	50	50–200	800
9	15000	50	150	200–1200