• Corpus ID: 231940932

Harnessing Context for Budget-Limited Crowdsensing with Massive Uncertain Workers

@article{Li2021HarnessingCF,
  title={Harnessing Context for Budget-Limited Crowdsensing with Massive Uncertain Workers},
  author={Feng Li and Jichao Zhao and Dongxiao Yu and Xiuzhen Cheng and Weifeng Lv},
  journal={ArXiv},
  year={2021},
  volume={abs/2107.01385}
}
Crowdsensing is an emerging paradigm of ubiquitous sensing, through which a crowd of workers are recruited to perform sensing tasks collaboratively. Although it has stimulated many applications, an open fundamental problem is how to select among a massive number of workers to perform a given sensing task under a limited budget. Nevertheless, due to the proliferation of smart devices equipped with various sensors, it is very different to profile the workers in terms of sensing ability. Although… 

Figures from this paper

References

SHOWING 1-10 OF 28 REFERENCES
Unknown Worker Recruitment with Budget and Covering Constraints for Mobile Crowdsensing
TLDR
This paper models the problem of recruiting unknown workers under the budget and covering constraints so that the total expected achieved qualities can be maximized and proposes a recruitment algorithm with a performance guarantee.
Taming the Uncertainty: Budget Limited Robust Crowdsensing Through Online Learning
TLDR
A novel framework, Budget LImited robuSt crowdSensing (BLISS), is presented, to handle the problem of robustness of crowdsensing toward uncontrollable sensing quality through an online learning approach and achieves logarithmic regret bounds and Hannan-consistency.
Combinatorial Multi-Armed Bandit Based Unknown Worker Recruitment in Heterogeneous Crowdsensing
TLDR
This paper focuses on the unknown worker recruitment problem in mobile crowdsensing, where workers’ sensing qualities are unknown a priori, and proposes an extended UCB based worker recruitment algorithm.
Multi-Armed Bandit Algorithms for Crowdsourcing Systems with Online Estimation of Workers' Ability
TLDR
This work develops a notion of Limited-information Crowdsourcing Systems (LCS), where the task master can assign the work based on some knowledge of the workers' ability acquired over time, and uses the simplified bounded KUBE (B-KUBE) algorithm as a solution.
Context-Aware Hierarchical Online Learning for Performance Maximization in Mobile Crowdsourcing
TLDR
A context-aware hierarchical online learning algorithm addressing the problem of performance maximization in MCS is proposed and it is proved that the algorithm converges to the optimal task assignment strategy.
A Survey on Mobile Crowdsensing Systems: Challenges, Solutions, and Opportunities
TLDR
A survey on existing works in the MCS domain is presented and a detailed taxonomy is proposed to shed light on the current landscape and classify applications, methodologies, and architectures to outline potential future research directions and synergies with other research areas.
Crowdlet: Optimal worker recruitment for self-organized mobile crowdsourcing
TLDR
This paper presents a comprehensive system model of Crowdlet, a novel self-organized mobile crowdsourcing paradigm, in which a mobile task requester can proactively exploit a massive crowd of encountered mobile workers at real-time for quick and high-quality results.
Dynamic Participant Recruitment of Mobile Crowd Sensing for Heterogeneous Sensing Tasks
  • Hanshang Li, Ting Li, Yu Wang
  • Computer Science
    2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems
  • 2015
TLDR
This paper considers such a dynamic participant recruitment problem with heterogeneous sensing tasks which aims to minimize the sensing cost while maintaining certain level of probabilistic coverage and proposes both offline and online algorithms to solve the challenging problem.
A Prediction-Based User Selection Framework for Heterogeneous Mobile CrowdSensing
TLDR
A point of interest (PoI) based mobility prediction model is presented to obtain the probabilities that tasks would be completed by users and a greedy offline algorithm to select a set of users under a participant number constraint is proposed.
...
1
2
3
...