Optimal Selection of Crowdsourcing Workers Balancing Their Utilities and Platform Profit

被引:40
作者
Sarker, Sujan [1 ]
Razzaque, Md. Abdur [1 ]
Hassan, Mohammad Mehedi [2 ]
Almogren, Ahmad [2 ]
Fortino, Giancarlo [3 ]
Zhou, Mengchu [4 ,5 ]
机构
[1] Univ Dhaka, Dept Comp Sci & Engn, Dhaka 1000, Bangladesh
[2] King Saud Univ, Coll Comp & Informat Sci, Chair Pervas & Mobile Comp, Riyadh 11543, Saudi Arabia
[3] Univ Calabria, Dept Informat Modeling Elect & Syst, I-87036 Arcavacata Di Rende, Italy
[4] Macau Univ Sci & Technol, Inst Syst Engn, Macau 999078, Peoples R China
[5] New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07102 USA
关键词
Crowdsourcing; platform profit; reputation; sensing quality; utility; MOBILE; AUCTION; MODEL; TIME;
D O I
10.1109/JIOT.2019.2921234
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In a mobile crowdsourcing system (MCS), a platform outsources sensing tasks to numerous mobile worker devices. The collected data are analyzed and the processed information is shared among many other interested users. The platform pays the workers for the sensing data and earns money from the users receiving processed information services. Distributing the sensing workloads among the potential workers so as to maintain the required data quality and to make a reasonable amount of profit is a challenging problem for such a platform. In this paper, we develop a workload allocation policy that makes a reasonable tradeoff between worker utilities and platform profit. It quantifies the utility (i.e., the quality of sensed data) of a worker as a function of worker mobility, current location, and past sensing records. The workload allocation problem is formulated as a multiobjective nonlinear programming (MONLP) problem which aims to make the desired tradeoff between worker utilities and platform profit. The allocation problem is shown to be NP-hard and thus we develop two greedy algorithms with relaxed constraints to achieve polynomial time solutions. Performance of the proposed workload allocation policy is evaluated in a distributed computation environment using MATLAB. The results show its effectiveness compared to state-of-the-art methods in terms of platform profit, quality of sensing data, and request service satisfaction.
引用
收藏
页码:8602 / 8614
页数:13
相关论文
共 41 条
[1]   A Crowdsourcing Assignment Model Based on Mobile Crowd Sensing in the Internet of Things [J].
An, Jian ;
Gui, Xiaolin ;
Wang, Zhehao ;
Yang, Jianwei ;
He, Xin .
IEEE INTERNET OF THINGS JOURNAL, 2015, 2 (05) :358-369
[2]  
[Anonymous], 2010, v7.10.0 (R2010a)
[3]  
[Anonymous], 1990, COMPUT INTRACTABILIT
[4]  
Bettstetter C., 2001, P ACM INT WORKSH MOD, P19
[5]   Crowdsourcing with Smartphones [J].
Chatzimilioudis, Georgios ;
Konstantinidis, Andreas ;
Laoudias, Christos ;
Zeinalipour-Yazti, Demetrios .
IEEE INTERNET COMPUTING, 2012, 16 (05) :36-44
[6]  
Chen JL, 2011, HPDC 11: PROCEEDINGS OF THE 20TH INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE DISTRIBUTED COMPUTING, P229
[7]   A truthful double auction for two-sided heterogeneous mobile crowdsensing markets [J].
Chen, Shuang ;
Liu, Min ;
Chen, Xiao .
COMPUTER COMMUNICATIONS, 2016, 81 :31-42
[8]   Truthful Incentive Mechanisms for Social Cost Minimization in Mobile Crowdsourcing Systems [J].
Duan, Zhuojun ;
Yan, Mingyuan ;
Cai, Zhipeng ;
Wang, Xiaoming ;
Han, Meng ;
Li, Yingshu .
SENSORS, 2016, 16 (04)
[9]   A Mobility-Aware Optimal Resource Allocation Architecture for Big Data Task Execution on Mobile Cloud in Smart Cities [J].
Enayet, Asma ;
Razzaque, Md. Abdur ;
Hassan, Mohammad Mehedi ;
Alamri, Atif ;
Fortino, Giancarlo .
IEEE COMMUNICATIONS MAGAZINE, 2018, 56 (02) :110-117
[10]  
Feng ZN, 2014, IEEE INFOCOM SER, P1231, DOI 10.1109/INFOCOM.2014.6848055