{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T19:25:15Z","timestamp":1772652315730,"version":"3.50.1"},"reference-count":23,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,6,14]],"date-time":"2018-06-14T00:00:00Z","timestamp":1528934400000},"content-version":"vor","delay-in-days":164,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1705262"],"award-info":[{"award-number":["U1705262"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672159"],"award-info":[{"award-number":["61672159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772136"],"award-info":[{"award-number":["61772136"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Task allocation is a key problem in Mobile Crowd Sensing (MCS). Prior works have mainly assumed that participants can complete tasks once they arrive at the location of tasks. However, this assumption may lead to poor reliability in sensing data because the heterogeneity among participants is disregarded. In this study, we investigate a multitask allocation problem that considers the heterogeneity of participants (i.e., different participants carry various devices and accomplish different tasks). A greedy discrete particle swarm optimization with genetic algorithm operation is proposed in this study to address the abovementioned problem. This study is aimed at maximizing the number of completed tasks while satisfying certain constraints. Simulations over a real\u2010life mobile dataset verify that the proposed algorithm outperforms baseline methods under different settings.<\/jats:p>","DOI":"10.1155\/2018\/7218061","type":"journal-article","created":{"date-parts":[[2018,6,14]],"date-time":"2018-06-14T23:34:13Z","timestamp":1529019253000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Multitask Allocation to Heterogeneous Participants in Mobile Crowd Sensing"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0311-5394","authenticated-orcid":false,"given":"Weiping","family":"Zhu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6586-4588","authenticated-orcid":false,"given":"Wenzhong","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Zhiyong","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Haoyi","family":"Xiong","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2018,6,14]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"crossref","unstructured":"ThiagarajanA. BiagioniJ. GerlichT. andErikssonJ. Cooperative transit tracking using smart-phones Proceedings of the 8th ACM International Conference on Embedded Networked Sensor Systems SenSys 2010 November 2010 85\u201398 https:\/\/doi.org\/10.1145\/1869983.1869993 2-s2.0-78650869210.","DOI":"10.1145\/1869983.1869993"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11917-0_8"},{"key":"e_1_2_10_3_2","doi-asserted-by":"crossref","unstructured":"ZhengY. LiuF. andHsiehH.-P. U-air: when urban air quality inference meets big data Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u203213) August 2013 Chicago Ill USA 1436\u20131444 https:\/\/doi.org\/10.1145\/2487575.2488188.","DOI":"10.1145\/2487575.2488188"},{"key":"e_1_2_10_4_2","doi-asserted-by":"crossref","unstructured":"DemirbasM. BayirM. A. AkcoraC. G. YilmazY. S. andFerhatosmanogluH. Crowd-sourced sensing and collaboration using twitter Proceedings of the 2010 IEEE International Symposium on \"A World of Wireless Mobile and Multimedia Networks\" WoWMoM 2010 June 2010 can 2-s2.0-77955864472 https:\/\/doi.org\/10.1109\/WOWMOM.2010.5534910.","DOI":"10.1109\/WOWMOM.2010.5534910"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2386343"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12654-3_9"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01721-6_4"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2483505"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2490679"},{"key":"e_1_2_10_10_2","doi-asserted-by":"crossref","unstructured":"KaraliopoulosM. TelelisO. andKoutsopoulosI. User recruitment for mobile crowdsensing over opportunistic networks Proceedings of the 34th IEEE Annual Conference on Computer Communications and Networks IEEE INFOCOM 2015 May 2015 2254\u20132262 https:\/\/doi.org\/10.1109\/INFOCOM.2015.7218612 2-s2.0-84954200420.","DOI":"10.1109\/INFOCOM.2015.7218612"},{"key":"e_1_2_10_11_2","doi-asserted-by":"crossref","unstructured":"ZhangD. XiongH. WangL. andChenG. CrowdRecruiter: selecting participants for piggyback crowdsensing under probabilistic coverage constraint Proceedings of the ACM International Joint Conference on Pervasive and Ubiquitous Computing (UbiComp \u203214) 2014 703\u2013714 https:\/\/doi.org\/10.1145\/2632048.2632059.","DOI":"10.1145\/2632048.2632059"},{"key":"e_1_2_10_12_2","doi-asserted-by":"crossref","unstructured":"WangL. ZhangD. PathakA. ChenC. XiongH. YangD. andWangY. CCS-TA: quality-guaranteed online task allocation in compressive crowdsensing Proceedings of the ACM International Joint Conference on Pervasive and Ubiquitous Computing (UbiComp \u203215) September 2015 Osaka Japan ACM 683\u2013694 https:\/\/doi.org\/10.1145\/2750858.2807513.","DOI":"10.1145\/2750858.2807513"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-017-0481-x"},{"key":"e_1_2_10_14_2","doi-asserted-by":"crossref","unstructured":"LiH. LiT. andWangY. Dynamic participant recruitment of mobile crowd sensing for heterogeneous sensing tasks Proceedings of the 12th IEEE International Conference on Mobile Ad Hoc and Sensor Systems MASS 2015 October 2015 Dallas TX USA 136\u2013144 https:\/\/doi.org\/10.1109\/MASS.2015.46 2-s2.0-84964692972.","DOI":"10.1109\/MASS.2015.46"},{"key":"e_1_2_10_15_2","doi-asserted-by":"crossref","unstructured":"LiuY. GuoB. WangY. WuW. YuZ. andZhangD. TaskMe: Multi-task allocation in Mobile Crowd Sensing Proceedings of the 2016 ACM International Joint Conference on Pervasive and Ubiquitous Computing UbiComp 2016 September 2016 deu 403\u2013414 2-s2.0-84991448030 https:\/\/doi.org\/10.1145\/2971648.2971709.","DOI":"10.1145\/2971648.2971709"},{"key":"e_1_2_10_16_2","doi-asserted-by":"crossref","unstructured":"WangJ. T. WangY. S. ZhangD. Q. WangF. HeY. D. andMaL. T. PSAllocator: multi-task allocation for participatory sensing with sensing capability constraints Proceedings of the International Conference on Computer-Supported Cooperative Work and Social Computing (CSCW) 2015 1139\u20131151.","DOI":"10.1145\/2998181.2998193"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2014.2317701"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/THMS.2016.2599489"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2016.2592541"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2018.2791432"},{"key":"e_1_2_10_21_2","doi-asserted-by":"crossref","unstructured":"ChangD.-J. DesokyA. H. OuyangM. andRouchkaE. C. Compute pairwise Manhattan distance and Pearson correlation coefficient of data points with GPU Proceedings of the 10th ACIS Conference on Software Engineering Artificial Intelligence Networking and Parallel\/Distributed Computing SNPD 2009 In conjunction with IWEA 2009 and WEACR 2009 May 2009 Daegu South Korea 501\u2013506 https:\/\/doi.org\/10.1109\/SNPD.2009.34 2-s2.0-71249093935.","DOI":"10.1109\/SNPD.2009.34"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.3390\/s140916972"},{"key":"e_1_2_10_23_2","unstructured":"BlondelV. D. EschM. ChanC. ClerotF. DevilleP. HuensE. MorlotF. SmoredaZ. andZiemlickiC. Data for Development: the D4D Challenge on Mobile Phone Data 2012 https:\/\/arxiv.org\/abs\/1210.0137."}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/7218061.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/7218061.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/7218061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:01:30Z","timestamp":1751688090000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/7218061"}},"subtitle":[],"editor":[{"given":"Huaqun","family":"Wang","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/7218061"],"URL":"https:\/\/doi.org\/10.1155\/2018\/7218061","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"value":"1530-8669","type":"print"},{"value":"1530-8677","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2018-03-10","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-05-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-06-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"7218061"}}