.png){kind=icon}
返回
A QoS-sensitive task assignment algorithm for mobile crowdsensing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.pmcj.2017.01.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, mobile crowdsensing has attracted many researchers' attention due to the pervasiveness of smart phones. In this paper, we study the QoS-sensitive Task Assignment (QSTA) problem for mobile crowdsensing, which involves variable tasks and flexible rewards. Each user can conduct one or more tasks, and the number of tasks assigned to each user is flexible. The reward paid to the user is related to the assigned tasks. To ensure the sensing QoS of tasks, each task might be assigned to multiple users. We prove the QSTA problem to be NP-hard, and propose a greedy algorithm to solve this problem. Moreover, we also analyze the approximation ratio of the proposed algorithm. Additionally, we demonstrate the significant performance of the algorithm through simulations (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Mobile crowdsensing
QoS-sensitive
Task assignment
Variable tasks
Flexible rewards
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
1.5K
被引数:
2.2K
机构
引用论文
.png){kind=icon}
Incentive-Driven and Freshness-Aware Content Dissemination in Selfish Opportunistic Mobile Networks
OAAI
OAAI分享收藏 没有更多内容
没有更多内容