2016
DOI: 10.1109/tnet.2015.2418191
|View full text |Cite
|
Sign up to set email alerts
|

Taming the Uncertainty: Budget Limited Robust Crowdsensing Through Online Learning

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 device… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 66 publications
(22 citation statements)
references
References 30 publications
0
22
0
Order By: Relevance
“…They firstly investigate the off-line allocation model and propose an efficient polynomial-time approximation algorithm with a factor of 2 − 1/m, where m is the number of mobile devices joining the system. Then, focusing on the on-line allocation model, they design a greedy algorithm that achieves a ratio of at most m. Han et al [23] propose an on-line learning algorithm, where a central authority assigns tasks aiming at rewarding participants with a limited amount of budget. It supposes a fixed minimum number of users who actively join the sensing process, while the quality of collected data may vary.…”
Section: Background and Motivationmentioning
confidence: 99%
See 1 more Smart Citation
“…They firstly investigate the off-line allocation model and propose an efficient polynomial-time approximation algorithm with a factor of 2 − 1/m, where m is the number of mobile devices joining the system. Then, focusing on the on-line allocation model, they design a greedy algorithm that achieves a ratio of at most m. Han et al [23] propose an on-line learning algorithm, where a central authority assigns tasks aiming at rewarding participants with a limited amount of budget. It supposes a fixed minimum number of users who actively join the sensing process, while the quality of collected data may vary.…”
Section: Background and Motivationmentioning
confidence: 99%
“…MCS follows a Sensing as a Service (S 2 aaS) business model, which makes data collected from sensors available to cloud users [12]. Consequently, companies and organizations have no longer the need to acquire an infrastructure to perform a sensing campaign, but they can exploit existing ones recruiting and compensating users for their involvement [13]. The users sustain costs while contributing data too.…”
Section: Introductionmentioning
confidence: 99%
“…While [17] allows to flexibly adjust the shared generalized context and makes TRs based on offline statistics and generalized worker context, our approach keeps worker context locally and learns each worker's individual statistics online. In [18], an online learning algorithm for mobile crowdsensing is presented to maximize the revenue of a budget-constrained task owner by learning the sensing values of workers with known prices. While [18] considers a total budget and each crowdsensing task requires a minimum number of workers, we consider a separate budget per task, which translates to a maximum number of required workers, and we additionally take task and worker context into account.…”
Section: Related Workmentioning
confidence: 99%
“…In [9], the authors incorporated the consideration of data quality into the mechanism, and rewarded the participant depending on the quality of its collected data. The authors in [10], [13] also considered the data quality and studied the tradoff between the recruiting cost and sensing robustness. The comprehensive survey can be found in [12].…”
Section: Introductionmentioning
confidence: 99%