Determining Task Assignments for Candidate Workers Based on Trajectory Prediction

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yahong Li;Yingjie Wang;Gang Li;Xiangrong Tong;Zhipeng Cai
{"title":"Determining Task Assignments for Candidate Workers Based on Trajectory Prediction","authors":"Yahong Li;Yingjie Wang;Gang Li;Xiangrong Tong;Zhipeng Cai","doi":"10.1109/TMC.2024.3518534","DOIUrl":null,"url":null,"abstract":"With the rise of sensor-equipped mobile devices, Mobile Crowd Sensing (MCS) has emerged as an efficient method for information gathering. In smart city environmental sensing, workers can acquire data by merely being within the sensing area. Currently, most studies select opportunistic workers based on the workers’ prior preferences and ignore the effect of movement trajectories on potential opportunistic workers. This may result in the selected opportunistic workers being less-than-ideal, or even ignoring the failure of some tasks to be accomplished, thus resulting in a waste of resources. Therefore, this paper proposes a Recruitment Framework for judging Opportunistic Workers based on Movement Trajectories (RFOW-MT), a two-phase framework for worker recruitment. In the offline phase, combining the neural network model Long Short-Term Memory (LSTM) and Geohash algorithm, an algorithm to detect the set of candidate opportunistic workers is proposed, solving the problems of location privacy and search efficiency. In the online phase, in order to maximize the task spatial coverage under the task budget constraint, a task allocation algorithm based on geographic location packed grouping is proposed. Finally, RFOW-MT outperforms other methods in terms of task spatial coverage and runtime as verified by experiments on real datasets.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 5","pages":"3890-3902"},"PeriodicalIF":7.7000,"publicationDate":"2024-12-16","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/10804096/","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

With the rise of sensor-equipped mobile devices, Mobile Crowd Sensing (MCS) has emerged as an efficient method for information gathering. In smart city environmental sensing, workers can acquire data by merely being within the sensing area. Currently, most studies select opportunistic workers based on the workers’ prior preferences and ignore the effect of movement trajectories on potential opportunistic workers. This may result in the selected opportunistic workers being less-than-ideal, or even ignoring the failure of some tasks to be accomplished, thus resulting in a waste of resources. Therefore, this paper proposes a Recruitment Framework for judging Opportunistic Workers based on Movement Trajectories (RFOW-MT), a two-phase framework for worker recruitment. In the offline phase, combining the neural network model Long Short-Term Memory (LSTM) and Geohash algorithm, an algorithm to detect the set of candidate opportunistic workers is proposed, solving the problems of location privacy and search efficiency. In the online phase, in order to maximize the task spatial coverage under the task budget constraint, a task allocation algorithm based on geographic location packed grouping is proposed. Finally, RFOW-MT outperforms other methods in terms of task spatial coverage and runtime as verified by experiments on real datasets.
基于轨迹预测的候选工人任务分配确定
随着配备传感器的移动设备的兴起,移动人群传感(MCS)已经成为一种有效的信息收集方法。在智慧城市环境感知中,工作人员只需在感知区域内即可获取数据。目前,大多数研究都是根据工人的先验偏好来选择机会主义工人,而忽略了运动轨迹对潜在机会主义工人的影响。这可能会导致被选择的机会主义工作者不够理想,甚至忽略一些任务无法完成,从而造成资源的浪费。因此,本文提出了一种基于运动轨迹判断机会主义工人的招聘框架(rwow - mt),这是一种两阶段的工人招聘框架。在离线阶段,结合长短期记忆(LSTM)神经网络模型和Geohash算法,提出了一种检测候选机会工作者集合的算法,解决了位置隐私和搜索效率问题。在在线阶段,为了在任务预算约束下使任务空间覆盖率最大化,提出了一种基于地理位置分组的任务分配算法。最后,在真实数据集上的实验验证了rfowm - mt在任务空间覆盖和运行时间方面优于其他方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信