具有数据时效性的覆盖感知众测任务分配算法

Chenxi Pan, Shuyu Li
{"title":"具有数据时效性的覆盖感知众测任务分配算法","authors":"Chenxi Pan, Shuyu Li","doi":"10.1145/3569966.3570083","DOIUrl":null,"url":null,"abstract":"In the task allocation of mobile crowdsensing (MCS), importance is often attached to the quality of sensing data while the data timeliness is often neglected, which may lead to the slow response of the MCS platform for urgent tasks (such as fire, geological disasters, etc.), thus missing the golden response time. Based on the definition of worker data timeliness and area coverage, a coverage-aware task allocation algorithm (CATA) is proposed in the paper. The CATA algorithm adopts fog nodes as the intermediate layer between MCS platform and participants and tries to both maximize the data timeliness and minimizing the incentive cost. For tasks with given location and crowdsensing range, workers with higher data timeliness and lower bidding are selected from participants according to their data timeliness and virtual credit. In addition, the location privacy of participants is protected by geo-indistinguishability. Results of simulation experiment validate the effectiveness of the proposed algorithm.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A task allocation algorithm for Coverage-Aware Crowdsensing with Data timeliness\",\"authors\":\"Chenxi Pan, Shuyu Li\",\"doi\":\"10.1145/3569966.3570083\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the task allocation of mobile crowdsensing (MCS), importance is often attached to the quality of sensing data while the data timeliness is often neglected, which may lead to the slow response of the MCS platform for urgent tasks (such as fire, geological disasters, etc.), thus missing the golden response time. Based on the definition of worker data timeliness and area coverage, a coverage-aware task allocation algorithm (CATA) is proposed in the paper. The CATA algorithm adopts fog nodes as the intermediate layer between MCS platform and participants and tries to both maximize the data timeliness and minimizing the incentive cost. For tasks with given location and crowdsensing range, workers with higher data timeliness and lower bidding are selected from participants according to their data timeliness and virtual credit. In addition, the location privacy of participants is protected by geo-indistinguishability. Results of simulation experiment validate the effectiveness of the proposed algorithm.\",\"PeriodicalId\":145580,\"journal\":{\"name\":\"Proceedings of the 5th International Conference on Computer Science and Software Engineering\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 5th International Conference on Computer Science and Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3569966.3570083\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3569966.3570083","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在移动众传感(MCS)的任务分配中,往往重视感知数据的质量,而忽视数据的时效性,这可能导致MCS平台对紧急任务(如火灾、地质灾害等)的响应速度较慢,从而错过黄金响应时间。基于工人数据时效性和区域覆盖的定义,提出了一种覆盖感知任务分配算法(CATA)。CATA算法采用雾节点作为MCS平台与参与者之间的中间层,力求数据及时性最大化和激励成本最小化。对于给定地点和众测范围的任务,根据参与者的数据时效性和虚拟信用,从参与者中选择数据时效性较高、出价较低的员工。此外,参与者的位置隐私受到地理不可区分性的保护。仿真实验结果验证了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A task allocation algorithm for Coverage-Aware Crowdsensing with Data timeliness
In the task allocation of mobile crowdsensing (MCS), importance is often attached to the quality of sensing data while the data timeliness is often neglected, which may lead to the slow response of the MCS platform for urgent tasks (such as fire, geological disasters, etc.), thus missing the golden response time. Based on the definition of worker data timeliness and area coverage, a coverage-aware task allocation algorithm (CATA) is proposed in the paper. The CATA algorithm adopts fog nodes as the intermediate layer between MCS platform and participants and tries to both maximize the data timeliness and minimizing the incentive cost. For tasks with given location and crowdsensing range, workers with higher data timeliness and lower bidding are selected from participants according to their data timeliness and virtual credit. In addition, the location privacy of participants is protected by geo-indistinguishability. Results of simulation experiment validate the effectiveness of the proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Accurate and Time-saving Deepfake Detection in Multi-face Scenarios Using Combined Features The Exponential Dynamic Analysis of Network Attention Based on Big Data Research on Data Governance and Data Migration based on Oracle Database Appliance in campus Research on Conformance Engineering process of Airborne Software quality Assurance in Civil Aviation Extending Take-Grant Model for More Flexible Privilege Propagation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1