Near-Optimal Allocation Algorithms for Location-Dependent Tasks in Crowdsensing.

Crowdsensing offers an efficient way to meet the demand in large-scale sensing applications. In crowdsensing, optimal task allocation is challenging since sensing tasks with different requirements of quality of sensing are typically associated with specific locations, and mobile users have time constraints. We show that the allocation problem is NP-hard. We then focus on approximation algorithms and devise an efficient local-ratio-based algorithm (LRBA). Our analysis shows that the approximation ratio of the aggregate rewards obtained by optimal allocation to those by LRBA is 5. This reveals that LRBA is efficient, since a lower (but not tight) bound on the approximation ratio is 4. We extend the results to the general scenario where mobile users are heterogeneous. A distributed version of LRBA, namely DLRBA, is designed, which can be iteratively executed at each mobile user without the need for the platform to collect all the information of mobile users. We prove that both centralized and distributed versions can output the same solution. Extensive simulation results are provided to demonstrate the advantages of our proposed algorithms. [ABSTRACT FROM PUBLISHER]