2018 IEEE Global Communications Conference (GLOBECOM) 2018
DOI: 10.1109/glocom.2018.8647534
|View full text |Cite
|
Sign up to set email alerts
|

Min-Max Planning of Time-Sensitive and Heterogeneous Tasks in Mobile Crowd Sensing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…They proposed an online method with caching mechanism for task whose sensing time is earlier than arrival time. [20] first define Min-Max Task (MMT) planning problem in MCS systems, considering time-sensitive and heterogeneity of sensing tasks. To address MMT problem, they propose a Memetic based Bidirectional General Variable Neighborhood algorithm.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…They proposed an online method with caching mechanism for task whose sensing time is earlier than arrival time. [20] first define Min-Max Task (MMT) planning problem in MCS systems, considering time-sensitive and heterogeneity of sensing tasks. To address MMT problem, they propose a Memetic based Bidirectional General Variable Neighborhood algorithm.…”
Section: Related Workmentioning
confidence: 99%
“…MCS platform needs to recruit nearby workers who are willing to move quickly for the task, this cause a higher incentive cost while ensuring tasks can be timely executed. Summarize studies above, we can find that existing studies [18] [19] [20] focus on either delay-tolerant or time-sensitive task allocation follows several same phases, including task detection, task publishing, receiving and execution, as shown in Fig. 1.…”
Section: Introductionmentioning
confidence: 99%
“…Considering the total time consumption for multiple tasks depends on the time consumption of the last completed task. The authors in the study [25] considered the time-sensitive tasks and proposed a cooperation scheme to minimize the maximum completion time of tasks. Ni et al [26] investigated the dependency-aware task allocation problem with the consideration of skills, moving distances, and deadlines.…”
Section: Related Workmentioning
confidence: 99%