2017
DOI: 10.1109/tmc.2016.2616473
|View full text |Cite
|
Sign up to set email alerts
|

Online Task Assignment for Crowdsensing in Predictable Mobile Social Networks

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
2020
2020

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 148 publications
(22 citation statements)
references
References 28 publications
0
22
0
Order By: Relevance
“…The algorithm selects the participants who can achieve the maximum data quality in each round of the selection process until the data quality obtained by the selected participants exceeds the set value. Xiao et al [28] takes the completion time of tasks as the quality requirements in social networks, and proposes AOTA and LOTA algorithms to assign tasks to users minimizing task completion time. Xiong et al [29] proposes two optimization objectives considering the coverage requirements and incentive budget.…”
Section: Related Workmentioning
confidence: 99%
“…The algorithm selects the participants who can achieve the maximum data quality in each round of the selection process until the data quality obtained by the selected participants exceeds the set value. Xiao et al [28] takes the completion time of tasks as the quality requirements in social networks, and proposes AOTA and LOTA algorithms to assign tasks to users minimizing task completion time. Xiong et al [29] proposes two optimization objectives considering the coverage requirements and incentive budget.…”
Section: Related Workmentioning
confidence: 99%
“…For single-objective task assignment: Xiao et al [ 6 ] considered the independent perceptual task scheme to minimize the task average completion time as the optimization goal, proposed the AOTA algorithm (average time-sensitive online task assignment algorithm); and considered the cooperative perception. In the task assignment scheme, the LOTA algorithm (the maximum completion time sensitive online task assignment algorithm) is proposed to minimize the maximum completion time of the task, and the important performance of the two algorithms is proved by simulation experiments.…”
Section: Related Workmentioning
confidence: 99%
“…It can ensure the completion rate of tasks while reducing the total cost to the minimum. Xiao et al [28] introduced an average time‐sensitive online task assignment (AOTA) algorithm and a maximum time‐sensitive online task assignment (LOTA) algorithm. In addition, the greedy small‐task‐first‐assignment strategy and the earliest‐idle‐user‐receive‐task use each round of virtual AOTA offline task assignment, while the greedy large‐task‐first‐assignment strategy and the earliest‐idle‐user ‐receive‐task uses virtual LOTA offline task assignment.…”
Section: Related Workmentioning
confidence: 99%