{"title":"参与式移动众测的时变稳定任务分配","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":"{\"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}","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}
Time-dependent Stable Task Assignment in Participatory Mobile Crowdsensing
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.