论文标题

长期还是临时?移动人群感测和计算的混合工人招聘

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

论文摘要

本文调查了一个新型的混合工人招聘问题,其中移动人群传感和计算平台(MCSC)平台雇用工人在工人的参与及其本地工作量的不确定性的情况下服务于具有多种质量要求和预算限制的MCSC任务。 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计划B支持MCSC任务的无缝服务提供,这也代表了0-1 ILP问题。为了解决这些事实证明是NP-硬化的问题,我们开发了三种算法,即,i)详尽的搜索,ii)具有风险感知过滤器约束的唯一基于索引的随机搜索,iii)基于几何编程的连续凸连续孔算法,以实现最佳或亚近距离解决方案。实验结果证明了我们在服务质量,时间效率等方面的有效性。

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.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源