Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Taming the uncertainty: budget limited robust crowdsensing through online learning

Published: 01 June 2016 Publication History

Abstract

Mobile crowdsensing has been intensively explored recently due to its flexible and pervasive sensing ability. Although many crowdsensing platforms have been built for various applications, the general issue of how to manage such systems intelligently remains largely open. While recent investigations mostly focus on incentivizing crowdsensing, the robustness of crowdsensing toward uncontrollable sensing quality, another important issue, has been widely neglected. Due to the non-professional personnel and devices, the quality of crowdsensing data cannot be fully guaranteed, hence the revenue gained from mobile crowdsensing is generally uncertain. Moreover, the need for compensating the sensing costs under a limited budget has exacerbated the situation: one does not enjoy an infinite horizon to learn the sensing ability of the crowd and hence to make decisions based on sufficient statistics. In this paper, we present a novel framework, Budget LImited robuSt crowdSensing (BLISS), to handle this problem through an online learning approach. Our approach aims to minimize the difference on average sense (a.k.a. regret) between the achieved total sensing revenue and the (unknown) optimal one, and we show that our BLISS sensing policies achieve logarithmic regret bounds and Hannan-consistency. Finally, we use extensive simulations to demonstrate the effectiveness of BLISS.

References

[1]
R. K. Ganti, F. Ye, and H. Lei, "Mobile crowdsensing: Current state and future challenges," IEEE Commun. Mag., vol. 6, no. 11, pp. 32--39, 2011.
[2]
W. Khan, Y. Xiang, M. Aalsalem, and Q. Arshad, "Mobile phone sensing systems: A survey," IEEE Commun. Surveys & Tutorials, vol. 15, no. 1, pp. 402--427, 2013.
[3]
L. Duan, T. Kubo, K. Sugiyama, J. Huang, T. Hasegawa, and J. Walrand, "Incentive mechanisms for smartphone collaboration in data acquisition and distributed computing," in Proc. IEEE INFOCOM, 2012, pp. 1701--1709.
[4]
D. Yang, G. Xue, X. Fang, and J. Tang, "Crowdsourcing to smartphones: Incentive mechanism design for mobile phone sensing," in Proc. ACM MobiCom, 2012, pp. 173--184.
[5]
I. Koutsopoulos, "Optimal incentive-driven design of participatory sensing systems," in Proc. IEEE INFOCOM, 2013.
[6]
Q. Li and G. Cao, "Providing privacy-aware incentives for mobile sensing," in Proc. IEEE PerCom, 2013, pp. 76--84.
[7]
K. Han, C. Zhang, and J. Luo, "Truthful scheduling mechanisms for powering mobile crowdsensing," IEEE Trans. Computers, vol. PP, Apr. 2015.
[8]
D. Wang, L. Kaplan, H. Le, and T. Abdelzaher, "On truth discovery in social sensing: A maximum likelihood estimation approach," in Proc. ACM/IEEE IPSN, 2012, pp. 233--244.
[9]
H. Min, P. Scheuermann, and J. Heo, "A hybrid approach for improving the data quality of mobile phone sensing," Int. J. Distributed Sensor Networks, 2013.
[10]
S. He, D. Shin, J. Zhang, and J. Chen, "Toward optimal allocation of location dependent tasks in crowdsensing," in Proc. IEEE INFOCOM, 2014, pp. 745--753.
[11]
S. Reddy, J. Burke, D. Estrin, M. Hansen, and M. Srivastava, "A framework for data quality and feedback in participatory sensing," in Proc. ACM SenSys, 2007, pp. 417--418.
[12]
Y. Chon, N. D. Lane, F. Li, H. Cha, and F. Zhao, "Automatically characterizing places with opportunistic crowdsensing using smartphones," in Proc. ACM UbiComp, 2012, pp. 481--490.
[13]
C.-K. Tham and T. Luo, "Quality of contributed service and market equilibrium for participatory sensing," in Proc. IEEE DCOSS, 2013.
[14]
S. Bubeck and N. Cesa-Bianchi, "Regret analysis of stochastic and non-stochastic multi-armed bandit problems," Foundations and Trends in Machine Learning, vol. 5, no. 1, pp. 1--122, 2012.
[15]
R. K. Ganti, N. Pham, H. Ahmadi, S. Nangia, and T. F. Abdelzaher, "GreenGPS: A participatory sensing fuel-efficient maps application," in Proc. ACM MobiSys, 2010, pp. 151--164.
[16]
S. Mathur, T. Jin, N. Kasturirangan, J. Chandrashekharan, W. Xue, M. Gruteser, and W. Trappe, "ParkNet: Drive-by sensing of road-side parking statistics," in Proc. ACM MobiSys, 2010, pp. 123--136.
[17]
Y. Lee, Y. Ju, C. Min, S. Kang, I. Hwang, and J. Song, "CoMon: Co-operative ambience monitoring platform with continuity and benefit awareness," in Proc. ACM MobiSys, 2012, pp. 43--56.
[18]
J. R. Kwapisz, G. M. Weiss, and S. A. Moore, "Activity recognition using cell phone accelerometers," ACM SIGKDD Explorations Newsletter, vol. 12, no. 2, pp. 74--82, 2011.
[19]
S. Reddy, D. Estrin, and M. Srivastava, "Recruitment framework for participatory sensing data collections," in Proc. Pervasive'10, 2010, pp. 138--155.
[20]
N. Cesa-Bianchi and G. Lugosi, Prediction, Learning, and Games. Cambridge, U.K.: Cambridge Univ. Press, 2006.
[21]
P. Auer, N. Cesa-Bianchi, and P. Fischer, "Finite-time analysis of the multiarmed bandit problem," Machine Learning, vol. 47, no. 2--3, pp. 235--256, 2002.
[22]
C. A. Floudas and P. M. Pardalos, Encyclopedia of Optimization. Berlin, Germany: Springer Verlag, 2009.
[23]
W. Hoeffding, "Probability inequalities for sums of bounded random variables," J. Am. Statist. Assoc., vol. 58, no. 301, pp. 13--30, 1963.
[24]
Y. Gai, B. Krishnamachari, and R. Jain, "Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations," IEEE/ACM Trans. Netw., vol. 20, no. 5, pp. 1466--1478, Oct. 2012.
[25]
IBM ILOG CPLEX Optimizer. {Online}. Available: http://www.ibm.com/software/integration/optimization/cplex-optimizer/
[26]
P. Doukhan, Mixing: Properties and Examples. Berlin, Germany: Springer Verlag, 1994.
[27]
M. Mohri and A. Rostamizadeh, "Stability bounds for stationary ϕ-mixing and β-mixing processes," J. Machine Learning Research, vol. 11, pp. 789--814, 2010.
[28]
T. L. Lai and H. Robbins, "Asymptotically efficient adaptive allocation rules," Adv. Appl. Math., vol. 6, no. 1, pp. 4--22, 1985.
[29]
P. Mansourifard, T. Javidi, and B. Krishnamachari, "Optimality of myopic policy for a class of monotone affine restless multi-armed bandits," in Proc. IEEE CDC, 2012, pp. 877--882.
[30]
L. Tran-Thanh, A. C. Chapman, A. Rogers, and N. R. Jennings, "Knap-sack based optimal policies for budget-limited multi-armed bandits," in Proc. AAAI, 2012, pp. 1134--1140.
[31]
C. Jiang and R. Srikant, "Bandits with budgets," in Proc. IEEE CDC, 2013, pp. 5345--5350.
[32]
C. Tekin and M. Liu, "Online learning of rested and restless bandits," IEEE Trans. Inf. Theory, vol. 58, no. 8, pp. 5588--5611, 2012.
[33]
L. A. Kontorovich and K. Ramanan, "Concentration inequalities for dependent random variables via the martingale method," Annals Probabil., vol. 36, no. 6, pp. 2126--2158, 2008.
[34]
P. M. Samson, "Concentration of measure inequalities for markov chains and &phis;-mixing processes," Annals Probabil., vol. 28, no. 1, pp. 416--461, 2000.
[35]
M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. New York, NY, USA: W. H. Freeman & Co., 1990.
[36]
F. W. Olver, D. W. Lozier, R. F. Boisvert, and C. W. Clark, NIST Handbook of Mathematical Functions. Cambridge, USA: Cambridge Univ. Press, 2010.

Cited By

View all
  • (2024)Bi-Objective Incentive Mechanism for Mobile Crowdsensing With Budget/Cost ConstraintIEEE Transactions on Mobile Computing10.1109/TMC.2022.322947023:1(223-237)Online publication date: 1-Jan-2024
  • (2024)B2-Bandit: Budgeted Pricing With Blocking Constraints for Metaverse Crowdsensing Under UncertaintyIEEE Journal on Selected Areas in Communications10.1109/JSAC.2023.334539642:3(724-736)Online publication date: 1-Mar-2024
  • (2024)Task allocation for unmanned aerial vehicles in mobile crowdsensingWireless Networks10.1007/s11276-021-02638-730:5(3707-3719)Online publication date: 1-Jul-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking  Volume 24, Issue 3
June 2016
638 pages
ISSN:1063-6692
  • Editor:
  • R. Srikant
Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 June 2016
Published in TON Volume 24, Issue 3

Author Tags

  1. crowdsourcing
  2. machine learning algorithms

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 09 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Bi-Objective Incentive Mechanism for Mobile Crowdsensing With Budget/Cost ConstraintIEEE Transactions on Mobile Computing10.1109/TMC.2022.322947023:1(223-237)Online publication date: 1-Jan-2024
  • (2024)B2-Bandit: Budgeted Pricing With Blocking Constraints for Metaverse Crowdsensing Under UncertaintyIEEE Journal on Selected Areas in Communications10.1109/JSAC.2023.334539642:3(724-736)Online publication date: 1-Mar-2024
  • (2024)Task allocation for unmanned aerial vehicles in mobile crowdsensingWireless Networks10.1007/s11276-021-02638-730:5(3707-3719)Online publication date: 1-Jul-2024
  • (2023)Learning With Guarantee Via Constrained Multi-Armed Bandit: Theory and Network ApplicationsIEEE Transactions on Mobile Computing10.1109/TMC.2022.317379222:9(5346-5358)Online publication date: 1-Sep-2023
  • (2023)Towards Robust Task Assignment in Mobile Crowdsensing SystemsIEEE Transactions on Mobile Computing10.1109/TMC.2022.315119022:7(4297-4313)Online publication date: 1-Jul-2023
  • (2022)Streaming Algorithms for Constrained Submodular MaximizationProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35706156:3(1-32)Online publication date: 8-Dec-2022
  • (2020)Hunting multiple bumps in graphsProceedings of the VLDB Endowment10.14778/3377369.337737513:5(656-669)Online publication date: 1-Jan-2020
  • (2020)bioMCSProceedings of the 21st International Conference on Distributed Computing and Networking10.1145/3369740.3369788(1-10)Online publication date: 4-Jan-2020
  • (2020)Combinatorial Multi-Armed Bandit Based Unknown Worker Recruitment in Heterogeneous CrowdsensingIEEE INFOCOM 2020 - IEEE Conference on Computer Communications10.1109/INFOCOM41043.2020.9155518(179-188)Online publication date: 6-Jul-2020
  • (2020)Designing Energy Efficient Strategies Using Markov Decision Process for Crowd-Sensing ApplicationsMobile Networks and Applications10.1007/s11036-020-01522-625:3(932-942)Online publication date: 1-Jun-2020
  • Show More Cited By

View Options

Get Access

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media