Long-Term or Temporary? Hybrid Worker Recruitment for Mobile Crowd Sensing and Computing
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910366250827776 |
|---|---|
| author | Liwang, Minghui Gao, Zhibin Hosseinalipour, Seyyedali Cheng, Zhipeng Wang, Xianbin Jiao, Zhenzhen |
| author_facet | Liwang, Minghui Gao, Zhibin Hosseinalipour, Seyyedali Cheng, Zhipeng Wang, Xianbin Jiao, Zhenzhen |
| contents | This paper investigates a novel hybrid worker recruitment problem where the mobile crowd sensing and computing (MCSC) platform employs workers to serve MCSC tasks with diverse quality requirements and budget constraints, under uncertainties in workers' participation and their local workloads.We propose a hybrid worker recruitment framework consisting of offline and online trading modes. The former enables the platform to overbook long-term workers (services) to cope with dynamic service supply via signing contracts in advance, which is formulated as 0-1 integer linear programming (ILP) with probabilistic constraints of service quality and budget.Besides, motivated by the existing uncertainties which may render long-term workers fail to meet the service quality requirement of each task, we augment our methodology with an online temporary worker recruitment scheme as a backup Plan B to support seamless service provisioning for MCSC tasks, which also represents a 0-1 ILP problem. To tackle these problems which are proved to be NP-hard, we develop three algorithms, namely, i) exhaustive searching, ii) unique index-based stochastic searching with risk-aware filter constraint, iii) geometric programming-based successive convex algorithm, which achieve the optimal or sub-optimal solutions. Experimental results demonstrate our effectiveness in terms of service quality, time efficiency, etc. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2206_04354 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Long-Term or Temporary? Hybrid Worker Recruitment for Mobile Crowd Sensing and Computing Liwang, Minghui Gao, Zhibin Hosseinalipour, Seyyedali Cheng, Zhipeng Wang, Xianbin Jiao, Zhenzhen Distributed, Parallel, and Cluster Computing Emerging Technologies This paper investigates a novel hybrid worker recruitment problem where the mobile crowd sensing and computing (MCSC) platform employs workers to serve MCSC tasks with diverse quality requirements and budget constraints, under uncertainties in workers' participation and their local workloads.We propose a hybrid worker recruitment framework consisting of offline and online trading modes. The former enables the platform to overbook long-term workers (services) to cope with dynamic service supply via signing contracts in advance, which is formulated as 0-1 integer linear programming (ILP) with probabilistic constraints of service quality and budget.Besides, motivated by the existing uncertainties which may render long-term workers fail to meet the service quality requirement of each task, we augment our methodology with an online temporary worker recruitment scheme as a backup Plan B to support seamless service provisioning for MCSC tasks, which also represents a 0-1 ILP problem. To tackle these problems which are proved to be NP-hard, we develop three algorithms, namely, i) exhaustive searching, ii) unique index-based stochastic searching with risk-aware filter constraint, iii) geometric programming-based successive convex algorithm, which achieve the optimal or sub-optimal solutions. Experimental results demonstrate our effectiveness in terms of service quality, time efficiency, etc. |
| title | Long-Term or Temporary? Hybrid Worker Recruitment for Mobile Crowd Sensing and Computing |
| topic | Distributed, Parallel, and Cluster Computing Emerging Technologies |
| url | https://arxiv.org/abs/2206.04354 |