{"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}
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.