A Task Assignment Method Based on User-Union Clustering and Individual Preferences in Mobile Crowdsensing

被引:4
作者
Shao, Zihao [1 ]
Wang, Huiqiang [1 ]
Zou, Yifan [1 ]
Gao, Zihan [1 ]
Lv, Hongwu [1 ]
机构
[1] Harbin Engn Univ, Coll Comp Sci & Technol, Harbin 150001, Peoples R China
关键词
INCENTIVE MECHANISM; ALLOCATION; RECRUITMENT; NETWORKS;
D O I
10.1155/2022/2595143
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile crowdsensing (MCS) offers a novel paradigm for large-scale sensing with the proliferation of smartphones. Task assignment is a critical problem in mobile crowdsensing (MCS), where service providers attempt to recruit a group of brilliant users to complete the sensing task at a limited cost. However, selecting an appropriate set of users with high quality and low cost is challenging. Existing works of task assignment ignore the data redundancy of large-scale users and the individual preference of service providers, resulting in a significant workload on the sensing platform and inaccurate assignment results. To tackle this issue, we propose a task assignment method based on user-union clustering and individual preferences, which considers the influence of clustering data quality and preference-based sensing cost. Firstly, we design a user-union clustering algorithm (UCA) by defining user similarity and setting user scale, which aims to balance user distribution, reduce data redundancy, and improve the accuracy of high-quality user aggregation. Then, we consider individual preferences of service providers and construct a preference-based task assignment algorithm (PTA) to achieve the diversified sensing cost control needs. To evaluate the performance of the proposed solutions, extensive simulations are conducted. The results demonstrate that our proposed solutions outperform the baseline algorithm, which realizes the individual preference-based task assignment under the premise of ensuring high-quality data.
引用
收藏
页数:15
相关论文
共 33 条
[1]   SDRS: A stable data-based recruitment system in IoT crowdsensing for localization tasks [J].
Alagha, Ahmed ;
Mizouni, Rabeb ;
Singh, Shakti ;
Otrok, Hadi ;
Ouali, Anis .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2021, 177
[2]   Improved Recruitment Algorithms for Vehicular Crowdsensing Networks [J].
Campioni, Fabio ;
Choudhury, Salimur ;
Salomaa, Kai ;
Akl, Selim G. .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2019, 68 (02) :1198-1207
[3]   DENOMINATOR VECTORS AND COMPATIBILITY DEGREES IN CLUSTER ALGEBRAS OF FINITE TYPE [J].
Ceballos, Cesar ;
Pilaud, Vincent .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2015, 367 (02) :1421-1439
[4]   Bayesian Co-Clustering Truth Discovery for Mobile Crowd Sensing Systems [J].
Du, Yang ;
Sun, Yu-E ;
Huang, He ;
Huang, Liusheng ;
Xu, Hongli ;
Bao, Yu ;
Guo, Hansong .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2020, 16 (02) :1045-1057
[5]  
Firdose S., CRAWDAD DATASET COPE
[6]   Mobile Crowdsensing: Current State and Future Challenges [J].
Ganti, Raghu K. ;
Ye, Fan ;
Lei, Hui .
IEEE COMMUNICATIONS MAGAZINE, 2011, 49 (11) :32-39
[7]  
Gong W, 2017, P IEEE GLOBECOM, P1
[8]   Task Allocation in Semi-Opportunistic Mobile Crowdsensing: Paradigm and Algorithms [J].
Gong, Wei ;
Zhang, Baoxian ;
Li, Cheng ;
Yao, Zheng .
MOBILE NETWORKS & APPLICATIONS, 2020, 25 (02) :772-782
[9]   Task Assignment in Mobile Crowdsensing: Present and Future Directions [J].
Gong, Wei ;
Zhang, Baoxian ;
Li, Cheng .
IEEE NETWORK, 2018, 32 (04) :100-107
[10]   A Survey of Task Allocation: Contrastive Perspectives From Wireless Sensor Networks and Mobile Crowdsensing [J].
Guo, Wenzhong ;
Zhu, Weiping ;
Yu, Zhiyong ;
Wang, Jiangtao ;
Guo, Bin .
IEEE ACCESS, 2019, 7 :78406-78420