基于位置的移动传感任务分配研究

Xiulan Wang, Shiyan Wang
{"title":"基于位置的移动传感任务分配研究","authors":"Xiulan Wang, Shiyan Wang","doi":"10.1109/ICCKE.2016.7802114","DOIUrl":null,"url":null,"abstract":"in recent years, mobile phone sensing applications has been regarded as new paradigm to obtain ubiquitous environment data. Research on motivating smart phone users to participate in mobile sensing contributing their resources and maximizing the profit of platform is in full swing. Unfortunately, the location-based optimal task assignment problem in mobile sensing is an NP-hard problem. We transform the problem to the maximum weight independent set problem (MWIS) and proposed a polynomial-time approximation scheme (PTAS) to approximate this problem in the intersection graph models. We conducted the simulation experiment and it turns out that the practical performance of the proposed near optimal task assignment algorithm corroborates the theoretical analysis.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on a location-based task assignment for mobile sensing\",\"authors\":\"Xiulan Wang, Shiyan Wang\",\"doi\":\"10.1109/ICCKE.2016.7802114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"in recent years, mobile phone sensing applications has been regarded as new paradigm to obtain ubiquitous environment data. Research on motivating smart phone users to participate in mobile sensing contributing their resources and maximizing the profit of platform is in full swing. Unfortunately, the location-based optimal task assignment problem in mobile sensing is an NP-hard problem. We transform the problem to the maximum weight independent set problem (MWIS) and proposed a polynomial-time approximation scheme (PTAS) to approximate this problem in the intersection graph models. We conducted the simulation experiment and it turns out that the practical performance of the proposed near optimal task assignment algorithm corroborates the theoretical analysis.\",\"PeriodicalId\":205768,\"journal\":{\"name\":\"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCKE.2016.7802114\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE.2016.7802114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,手机传感应用已被视为获取无处不在的环境数据的新范式。如何激励智能手机用户参与移动传感,贡献自身资源,实现平台利润最大化的研究正在如火如荼地进行。不幸的是,移动传感中基于位置的最优任务分配问题是一个np困难问题。我们将该问题转化为最大权无关集问题(MWIS),并提出了一种多项式时间逼近方案(PTAS)来逼近该问题。我们进行了仿真实验,结果表明所提出的近最优任务分配算法的实际性能与理论分析相吻合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on a location-based task assignment for mobile sensing
in recent years, mobile phone sensing applications has been regarded as new paradigm to obtain ubiquitous environment data. Research on motivating smart phone users to participate in mobile sensing contributing their resources and maximizing the profit of platform is in full swing. Unfortunately, the location-based optimal task assignment problem in mobile sensing is an NP-hard problem. We transform the problem to the maximum weight independent set problem (MWIS) and proposed a polynomial-time approximation scheme (PTAS) to approximate this problem in the intersection graph models. We conducted the simulation experiment and it turns out that the practical performance of the proposed near optimal task assignment algorithm corroborates the theoretical analysis.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信