Next Article in Journal
Acceleration of the Measurement Time of Thermopiles Using Sigma-Delta Control
Next Article in Special Issue
On-Device Deep Learning Inference for Efficient Activity Data Collection
Previous Article in Journal
Precision and Limits of Detection for Selected Commercially Available, Low-Cost Carbon Dioxide and Methane Gas Sensors
Previous Article in Special Issue
Hyperspectral Imaging in Environmental Monitoring: A Review of Recent Developments and Technological Advances in Compact Field Deployable Systems
Article Menu
Issue 14 (July-2) cover image

Export Article

Open AccessArticle

Using Greedy Random Adaptive Procedure to Solve the User Selection Problem in Mobile Crowdsourcing

1
School of Computer and Communication Engineering, Beijing Key Laboratory of Knowledge Engineering for Materials Science, University of Science and Technology Beijing, Beijing 100083, China
2
Research Institute of Information, Beijing National Research Center for Information Science and Technology, Department of Computer Science and Technology, Institute of Internet Industry, Tsinghua University, Beijing 100084, China
*
Author to whom correspondence should be addressed.
Sensors 2019, 19(14), 3158; https://doi.org/10.3390/s19143158
Received: 24 June 2019 / Revised: 13 July 2019 / Accepted: 16 July 2019 / Published: 18 July 2019
(This article belongs to the Special Issue Mobile Sensing: Platforms, Technologies and Challenges)
  |  
PDF [3610 KB, uploaded 18 July 2019]
  |  

Abstract

With the rapid development of mobile networks and smart terminals, mobile crowdsourcing has aroused the interest of relevant scholars and industries. In this paper, we propose a new solution to the problem of user selection in mobile crowdsourcing system. The existing user selection schemes mainly include: (1) find a subset of users to maximize crowdsourcing quality under a given budget constraint; (2) find a subset of users to minimize cost while meeting minimum crowdsourcing quality requirement. However, these solutions have deficiencies in selecting users to maximize the quality of service of the task and minimize costs. Inspired by the marginalism principle in economics, we wish to select a new user only when the marginal gain of the newly joined user is higher than the cost of payment and the marginal cost associated with integration. We modeled the scheme as a marginalism problem of mobile crowdsourcing user selection (MCUS-marginalism). We rigorously prove the MCUS-marginalism problem to be NP-hard, and propose a greedy random adaptive procedure with annealing randomness (GRASP-AR) to achieve maximize the gain and minimize the cost of the task. The effectiveness and efficiency of our proposed approaches are clearly verified by a large scale of experimental evaluations on both real-world and synthetic data sets. View Full-Text
Keywords: mobile crowdsourcing; user selection; marginalism principle; GRASP-AR mobile crowdsourcing; user selection; marginalism principle; GRASP-AR
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Yang, J.; Ban, X.; Xing, C. Using Greedy Random Adaptive Procedure to Solve the User Selection Problem in Mobile Crowdsourcing. Sensors 2019, 19, 3158.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top