Yahong Li;Yingjie Wang;Gang Li;Xiangrong Tong;Zhipeng Cai
{"title":"基于轨迹预测的候选工人任务分配确定","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":"{\"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}","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}
Determining Task Assignments for Candidate Workers Based on Trajectory Prediction
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.
期刊介绍:
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.