Optimal Task Partition with Delay Requirement in Mobile Crowdsourcing

Algorithm 1

Optimal task partition for task i.

	Input:
	Total mobile workers’ arrival rate
	Delay requirement Di
	Task load Tai
	Monetary reward Ri to a worker
	Mobile workers’ computing capacity B
	Output:
	The optimal task partition and the maximal value
(1)	Based on equation (1), STai(N) ⟵ Each subtask load
(2)	Based on equation (3), Piw ⟵ The probability that worker accepts the subtask of task i
(3)	With Piw, transition probability matrix is obtained based on Equation (8)
(4)	Based on equation (5), SDi ⟵ Duration for each worker to complete a subtask
(5)	Based on equation (7), m ⟵ The number of slots within
(6)	Within m slots, Pi(N) is obtained based on equation (9)
(7)	Using equation (10), N′ ⟵ the optimal task partition in theory
(8)	Using equation (11),  ⟵ the practical optimal task partition
(9)	Based on equation (9) and ,  ⟵ the maximal value of successful assignment probability
	Return and