TY - GEN
T1 - An Evolutionary Algorithm for Collaborative Mobile Crowdsourcing Recruitment in Socially Connected IoT Systems
AU - Hamrouni, Aymen
AU - Ghazzai, Hakim
AU - Alelyani, Turki
AU - Massoud, Yehia
N1 - Generated from Scopus record by KAUST IRTS on 2022-09-13
PY - 2020/12/12
Y1 - 2020/12/12
N2 - Mobile crowd sourcing (MCS) enables a distributed problem-solving model in which a crowd of smart devices' users is engaged in the task of solving a data sensing problem through an open call. With the increasing complexity of tasks that are crowdsourced and the need of collaboration among workers, collaborative MCS (CMCS) has emerged to enable requesters to form teams of skilled IoT workers and promote their ability to cooperate together. To efficiently execute such tasks, optimizing the team recruitment process must be conducted. In this paper, we design a low complexity CMCS team recruitment approach that forms and hires a group of socially connected workers having sufficient skills to accomplish a CMCS task. Inspired from swam intelligence, the proposed recruitment approach enables project matching and virtual team formation according to four different fuzzy-logic-based criteria: level of expertise, social relationship strength, recruitment cost, and platform's confidence level. Applied to a real-world data set, experimental results illustrate the performances of the proposed genetic algorithm for CMCS recruitment and show that our approach outperforms the metaheuristic particle swarm optimization algorithm. Moreover, it is shown that the proposed approach achieves close performance to those of the baseline optimal integer linear program with significant computational saving.
AB - Mobile crowd sourcing (MCS) enables a distributed problem-solving model in which a crowd of smart devices' users is engaged in the task of solving a data sensing problem through an open call. With the increasing complexity of tasks that are crowdsourced and the need of collaboration among workers, collaborative MCS (CMCS) has emerged to enable requesters to form teams of skilled IoT workers and promote their ability to cooperate together. To efficiently execute such tasks, optimizing the team recruitment process must be conducted. In this paper, we design a low complexity CMCS team recruitment approach that forms and hires a group of socially connected workers having sufficient skills to accomplish a CMCS task. Inspired from swam intelligence, the proposed recruitment approach enables project matching and virtual team formation according to four different fuzzy-logic-based criteria: level of expertise, social relationship strength, recruitment cost, and platform's confidence level. Applied to a real-world data set, experimental results illustrate the performances of the proposed genetic algorithm for CMCS recruitment and show that our approach outperforms the metaheuristic particle swarm optimization algorithm. Moreover, it is shown that the proposed approach achieves close performance to those of the baseline optimal integer linear program with significant computational saving.
UR - https://ieeexplore.ieee.org/document/9345852/
UR - http://www.scopus.com/inward/record.url?scp=85101368639&partnerID=8YFLogxK
U2 - 10.1109/GCAIoT51063.2020.9345852
DO - 10.1109/GCAIoT51063.2020.9345852
M3 - Conference contribution
SN - 9781728184203
BT - 2020 IEEE Global Conference on Artificial Intelligence and Internet of Things, GCAIoT 2020
PB - Institute of Electrical and Electronics Engineers Inc.
ER -