.png){kind=icon}
返回
Location-Aware Crowdsensing: Dynamic Task Assignment and Truth Inference
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2018.2878821.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Crowdsensing paradigm facilitates a wide range of data collection, where great efforts have been made to address its fundamental issues of matching workers to their assigned tasks and processing the collected data. In this paper, we reexamine these issues by considering the spatio-temporal worker mobility and task arrivals, which more fit the actual situation. Specifically, we study the location-aware and location diversity based dynamic crowdsensing system, where workers move over time and tasks arrive stochastically. We first exploit offline crowdsensing by proposing a combinatorial algorithm, for efficiently distributing tasks to workers. After that, we mainly study the online crowdsensing, and further consider an indispensable aspect of worker's fair allocation. Apart from the stochastic characteristics and discontinuous coverage, the non-linear expectation is incurred as a new challenge concerning fairness issue. Based on Lyapunov optimization with perturbation parameters, we propose online control policy to overcome those challenges. Hereby, we can maintain system stability and achieve a time average sensing utility arbitrarily close to the optimum. Finally, we propose an optimization framework to aggregate the sensing data which can estimate worker expertise and task truth simultaneously. Performance evaluations on real and synthetic data set validate the proposed algorithm, where 80 percent gain of fairness is achieved at the expense of 12 percent loss of sensing value on average.
Keyword:
Task analysis
Sensors
Optimization
Location awareness
Resource management
Mobile computing
Gallium nitride
Crowdsensing
dynamic task assignment
truth inference
Lyapunov optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.2
论文数:
5.8K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容