iCrowd: near-optimal task allocation for Piggyback Crowdsensing

Abstract : This paper first defines a novel spatial-temporal coverage metric, k-depth coverage, for mobile crowdsensing (MCS) problems. This metric considers both the fraction of subareas covered by sensor readings and the number of sensor readings collected in each covered subarea. Then iCrowd, a generic MCS task allocation framework operating with the energy-efficient Piggyback Crowdsensing task model, is proposed to optimize the MCS task allocation with different incentives and k-depth coverage objectives/constraints. iCrowd first predicts the call and mobility of mobile users based on their historical records, then it selects a set of users in each sensing cycle for sensing task participation, so that the resulting solution achieves two dual optimal MCS data collection goals - i.e., Goal. 1 nearmaximal k-depth coverage without exceeding a given incentive budget or Goal. 2 near-minimal incentive payment while meeting a predefined k-depth coverage goal. We evaluated iCrowd extensively using a large-scale real-world dataset for these two data collection goals. The results show that: for Goal.1, iCrowd significantly outperformed three baseline approaches by achieving 3% - 60% higher k-depth coverage; for Goal.2, iCrowd required 10.0% - 73.5% less incentives compared to three baselines under the same k-depth coverage constraint
Document type :
Journal articles
Complete list of metadatas

Contributor : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Submitted on : Friday, July 22, 2016 - 10:49:40 AM
Last modification on : Thursday, November 28, 2019 - 3:41:49 PM



Haoyi Xiong, Daqing Zhang, Guanling Chen, Leye Wang, Vincent Gauthier, et al.. iCrowd: near-optimal task allocation for Piggyback Crowdsensing. IEEE Transactions on Mobile Computing, Institute of Electrical and Electronics Engineers, 2016, 15 (8), pp.2010 - 2022. ⟨10.1109/TMC.2015.2483505⟩. ⟨hal-01347999⟩



Record views