Long-Term or Temporary? Hybrid Worker Recruitment for Mobile Crowd Sensing and Computing

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Minghui Liwang;Zhibin Gao;Seyyedali Hosseinalipour;Zhipeng Cheng;Xianbin Wang;Zhenzhen Jiao
{"title":"Long-Term or Temporary? Hybrid Worker Recruitment for Mobile Crowd Sensing and Computing","authors":"Minghui Liwang;Zhibin Gao;Seyyedali Hosseinalipour;Zhipeng Cheng;Xianbin Wang;Zhenzhen Jiao","doi":"10.1109/TMC.2024.3470993","DOIUrl":null,"url":null,"abstract":"This paper explores an interesting worker recruitment challenge where the mobile crowd sensing and computing (MCSC) platform hires workers to complete tasks with varying quality requirements and budget limitations, amidst uncertainties in worker participation and local workloads. We propose an innovative hybrid worker recruitment framework that combines offline and online trading modes. The offline mode enables the platform to overbook long-term workers by pre-signing contracts, thereby managing dynamic service supply. This is modeled as a 0-1 integer linear programming (ILP) problem with probabilistic constraints on service quality and budget. To address the uncertainties that may prevent long-term workers from consistently meeting service quality standards, we also introduce an online temporary worker recruitment scheme as a contingency plan. This scheme ensures seamless service provisioning and is likewise formulated as a 0-1 ILP problem. To tackle these problems with NP-hardness, we develop three algorithms, namely, \n<italic>i)</i>\n exhaustive searching, \n<italic>ii)</i>\n unique index-based stochastic searching with risk-aware filter constraint, \n<italic>iii)</i>\n geometric programming-based successive convex algorithm. These algorithms are implemented in a stagewise manner to achieve optimal or near-optimal solutions. Extensive experiments demonstrate our effectiveness in terms of service quality, time efficiency, etc.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 2","pages":"1055-1072"},"PeriodicalIF":7.7000,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10700689/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper explores an interesting worker recruitment challenge where the mobile crowd sensing and computing (MCSC) platform hires workers to complete tasks with varying quality requirements and budget limitations, amidst uncertainties in worker participation and local workloads. We propose an innovative hybrid worker recruitment framework that combines offline and online trading modes. The offline mode enables the platform to overbook long-term workers by pre-signing contracts, thereby managing dynamic service supply. This is modeled as a 0-1 integer linear programming (ILP) problem with probabilistic constraints on service quality and budget. To address the uncertainties that may prevent long-term workers from consistently meeting service quality standards, we also introduce an online temporary worker recruitment scheme as a contingency plan. This scheme ensures seamless service provisioning and is likewise formulated as a 0-1 ILP problem. To tackle these problems with NP-hardness, 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. These algorithms are implemented in a stagewise manner to achieve optimal or near-optimal solutions. Extensive experiments demonstrate our effectiveness in terms of service quality, time efficiency, etc.
长期的还是暂时的?面向移动人群传感与计算的混合工人招聘
本文探讨了一个有趣的工人招聘挑战,其中移动人群传感和计算(MCSC)平台雇用工人完成具有不同质量要求和预算限制的任务,在工人参与和本地工作量的不确定性中。我们提出了一种结合线下和线上交易模式的创新型混合型员工招聘框架。线下模式下,平台通过预签合同的方式超额预定长期员工,从而管理动态服务供给。这是一个0-1整数线性规划(ILP)问题,在服务质量和预算上有概率约束。为了解决可能阻碍长期工人持续达到服务质量标准的不确定性,我们还引入了在线临时工招聘计划作为应急计划。该方案确保了无缝的业务提供,同样也被表述为0-1 ILP问题。为了解决这些np -硬度问题,我们开发了三种算法,即i)穷举搜索,ii)基于风险感知滤波器约束的基于唯一索引的随机搜索,iii)基于几何规划的连续凸算法。这些算法以分阶段的方式实现,以获得最优或接近最优的解决方案。大量的实验证明了我们在服务质量、时间效率等方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信