Auction Meets Queuing: Information-Driven Data Purchasing in Stochastic Mobile Crowd Sensing

The pervasiveness of mobile phones and the increasing sensing capabilities of their built-in sensors have made mobile crowd sensing (MCS) a promising approach for large-scale event detection and collective knowledge formation. In a typical MCS system, the crowdsourcer purchases sensing data from some mobile phone users (i.e., contributors) and sells it to consumers for revenue. This kind of sensing data exchange has its unique challenges in practical MCS systems. On one hand, the crowdsourcer wants to maximize the information utility to get the most revenue under heterogeneous requests from the consumers while offering incentives to strategic contributors. On the other hand, the contributors need to make optimal real-time sensing and data selling decisions by considering their real-time sensing cost and quality of information, in order to maximize their own profit. In this paper, we propose a novel Information-driven Data Auction (IDA) scheme for data exchange in practical stochastic MCS systems, which offers optimal strategies for both the crowdsourcer and the contributors. By applying stochastic Lyapunov optimization and mechanism design theory, IDA is able to achieve a near-optimal time-averaged system-wide utility, while offering incentives to the contributors. Moreover, IDA achieves favourable economic properties including truthfulness, individual rationality, and budget balance. We demonstrate the efficacy of IDA through rigorous theoretical analysis and comprehensive simulations.

[1]  Baik Hoh,et al.  Sell your experiences: a market mechanism based incentive for participatory sensing , 2010, 2010 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[2]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[3]  Yang Han,et al.  Utility-maximizing data collection in crowd sensing: An optimal scheduling approach , 2015, 2015 12th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON).

[4]  Qinghua Li,et al.  Providing privacy-aware incentives for mobile sensing , 2013, 2013 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[5]  Chen-Khong Tham,et al.  Quality of Contributed Service and Market Equilibrium for Participatory Sensing , 2013, IEEE Transactions on Mobile Computing.

[6]  Iordanis Koutsopoulos,et al.  Optimal incentive-driven design of participatory sensing systems , 2013, 2013 Proceedings IEEE INFOCOM.

[7]  Jian Ma,et al.  QoI-aware energy-efficient participant selection , 2014, 2014 Eleventh Annual IEEE International Conference on Sensing, Communication, and Networking (SECON).

[8]  Kai Han,et al.  BLISS: Budget LImited robuSt crowdSensing through online learning , 2014, 2014 Eleventh Annual IEEE International Conference on Sensing, Communication, and Networking (SECON).

[9]  Athanasios V. Vasilakos,et al.  Stochastic Optimal Control for Participatory Sensing Systems with Heterogenous Requests , 2016, IEEE Transactions on Computers.

[10]  Shusen Yang,et al.  Backpressure meets taxes: Faithful data collection in stochastic mobile phone sensing systems , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[11]  Xiang-Yang Li,et al.  Budget-Feasible Online Incentive Mechanisms for Crowdsourcing Tasks Truthfully , 2016, IEEE/ACM Transactions on Networking.

[12]  Ning Chen,et al.  On the approximability of budget feasible mechanisms , 2010, SODA '11.

[13]  Hwee Pink Tan,et al.  Profit-maximizing incentive for participatory sensing , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[14]  Chi Zhang,et al.  Truthful Scheduling Mechanisms for Powering Mobile Crowdsensing , 2013, IEEE Transactions on Computers.

[15]  Lukas Biewald,et al.  Programmatic Gold: Targeted and Scalable Quality Assurance in Crowdsourcing , 2011, Human Computation.

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

[17]  Jiming Chen,et al.  Toward optimal allocation of location dependent tasks in crowdsensing , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[18]  Xiaoying Gan,et al.  Incentivize crowd labeling under budget constraint , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[19]  Yaron Singer,et al.  Budget Feasible Mechanisms , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[20]  Xi Fang,et al.  Crowdsourcing to smartphones: incentive mechanism design for mobile phone sensing , 2012, Mobicom '12.

[21]  Andreas Krause,et al.  Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..

[22]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..