.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Mobile crowdsensing
QoS-sensitive
Task assignment
Variable tasks
Flexible rewards
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
1.5K
Citations:
2.2K
Organization
Cited Papers
.png){kind=icon}
ShareSaveIncentive-Driven and Freshness-Aware Content Dissemination in Selfish Opportunistic Mobile Networks
OAAI
OAAIShareSave no more
no more