Time-dependent Stable Task Assignment in Participatory Mobile Crowdsensing

F. Yucel, E. Bulut
{"title":"Time-dependent Stable Task Assignment in Participatory Mobile Crowdsensing","authors":"F. Yucel, E. Bulut","doi":"10.1109/LCN48667.2020.9314829","DOIUrl":null,"url":null,"abstract":"Finding efficient task assignments is key to the success of mobile crowdsensing campaigns. Many studies in the literature focus on this problem and propose solutions that optimize the goals of mobile crowdsensing platform, but disregard user preferences. On the other hand, in a few recent studies that consider user preferences, workers are assigned a single task at a time, and the effect of these assignments to their prospective utilities is ignored. In this paper, we address these issues and study the task assignment problem considering both the user preferences and impact of each task assignment on the long-term utility of workers given the spatio-temporal characteristics of tasks. We propose a dynamic programming based task assignment algorithm that guarantees the satisfaction of users with their assignments. Through simulations, we compare it with a state-of-the-art algorithm and show the superiority of our algorithm in various aspects.","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN48667.2020.9314829","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Finding efficient task assignments is key to the success of mobile crowdsensing campaigns. Many studies in the literature focus on this problem and propose solutions that optimize the goals of mobile crowdsensing platform, but disregard user preferences. On the other hand, in a few recent studies that consider user preferences, workers are assigned a single task at a time, and the effect of these assignments to their prospective utilities is ignored. In this paper, we address these issues and study the task assignment problem considering both the user preferences and impact of each task assignment on the long-term utility of workers given the spatio-temporal characteristics of tasks. We propose a dynamic programming based task assignment algorithm that guarantees the satisfaction of users with their assignments. Through simulations, we compare it with a state-of-the-art algorithm and show the superiority of our algorithm in various aspects.
参与式移动众测的时变稳定任务分配
找到有效的任务分配是移动众筹活动成功的关键。文献中许多研究都关注这一问题,提出了优化移动众筹平台目标的解决方案,但忽略了用户偏好。另一方面,在最近一些考虑用户偏好的研究中,工人一次只被分配一项任务,而这些任务对他们预期效用的影响被忽略了。在本文中,我们解决了这些问题,并研究了任务分配问题,考虑了用户偏好和每个任务分配对工人长期效用的影响,给定任务的时空特征。提出了一种基于动态规划的任务分配算法,保证了用户对任务分配的满意度。通过仿真,我们将其与一种最先进的算法进行了比较,显示了我们的算法在各个方面的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信