Near-Optimal Incentive Allocation for Piggyback Crowdsensing

Piggyback crowdsensing (PCS) is a novel energy- efficient mobile crowdsensing paradigm that reduces the energy consumption of crowdsensing tasks by leveraging smartphone app opportunities (SAOs). This article, based on several fundamental assumptions of incentive payment for PCS task participation and spatial-temporal coverage assessment for collected sensor data, first proposes two alternating data collection goals. Goal 1 is maximizing overall spatial-temporal coverage under a predefined incentive budget constraint; goal 2 is minimizing total incentive payment while ensuring predefined spatial-temporal coverage for collected sensor data, all on top of the PCS task model. With all of the above assumptions, settings, and models, we introduce CrowdMind -- a generic incentive allocation framework for the two optimal data collection goals, on top of the PCS model. We evaluated CrowdMind extensively using a large-scale real-world SAO dataset for the two incentive allocation problems. The results demonstrate that compared to baseline algorithms, CrowdMind achieves better spatial-temporal coverage under the same incentive budget constraint, while costing less in total incentive payments and ensuring the same spatial-temporal coverage, under various coverage/incentive settings. Further, a short theoretical analysis is presented to analyze the performance of Crowd- Mind in terms of the optimization with total incentive cost and overall spatial-temporal coverage objectives/constraints.

[1]  Daqing Zhang,et al.  iCrowd: Near-Optimal Task Allocation for Piggyback Crowdsensing , 2016, IEEE Transactions on Mobile Computing.

[2]  Yu Zheng,et al.  U-Air: when urban air quality inference meets big data , 2013, KDD.

[3]  Valérie Issarny,et al.  Probabilistic registration for large-scale mobile participatory sensing , 2013, 2013 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[4]  Rishabh K. Iyer,et al.  Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints , 2013, NIPS.

[5]  Andreas S. Schulz,et al.  Revisiting the Greedy Approach to Submodular Set Function Maximization , 2007 .

[6]  Hojung Cha,et al.  Piggyback CrowdSensing (PCS): energy efficient crowdsourcing of mobile sensor data by exploiting smartphone app opportunities , 2013, SenSys '13.

[7]  Fan Ye,et al.  Mobile crowdsensing: current state and future challenges , 2011, IEEE Communications Magazine.

[8]  Antonio Corradi,et al.  Supporting Energy-Efficient Uploading Strategies for Continuous Sensing Applications on Mobile Phones , 2010, Pervasive.

[9]  Deborah Estrin,et al.  Recruitment Framework for Participatory Sensing Data Collections , 2010, Pervasive.

[10]  Daqing Zhang,et al.  CrowdRecruiter: selecting participants for piggyback crowdsensing under probabilistic coverage constraint , 2014, UbiComp.

[11]  Daqing Zhang,et al.  4W1H in mobile crowd sensing , 2014, IEEE Communications Magazine.

[12]  Jian Tang,et al.  Energy-efficient collaborative sensing with mobile phones , 2012, 2012 Proceedings IEEE INFOCOM.

[13]  Maxim Sviridenko,et al.  A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..