Imperial College London


Faculty of EngineeringDepartment of Computing

Professor of Computer Systems



+44 (0)20 7594 8375j.mccann Website




258ACE ExtensionSouth Kensington Campus






BibTex format

author = {Shi, F and Qin, Z and Wu, D and McCann, J},
doi = {10.1016/j.pmcj.2018.09.007},
journal = {Pervasive and Mobile Computing},
pages = {88--103},
title = {Effective truth discovery and fair reward distribution for mobile crowdsensing},
url = {},
volume = {51},
year = {2018}

RIS format (EndNote, RefMan)

AB - By leveraging the sensing capabilities of consumer mobile devices, mobile crowdsensing (MCS) systems enable a number of new applications for Internet of Things (IoT), such as traffic management, environmental monitoring, and localisation. However, the sensing data collected from the crowd workers are of various qualities, making it difficult to discover the ground truth and maintain the fairness of incentivisation schemes. In this paper, we propose a truth discovery algorithm based on a two-stage Maximum Likelihood Estimator (MLE), which explicitly characterises the heterogeneous sensing capabilities of the crowd and is able to estimate ground truth accurately using only a small amount of data from IoT infrastructures. Moreover, based on the truth discovery algorithm, two reward distribution schemes, LRDS and MRDS, are proposed to ensure fairness of rewarding the crowd according to their effort levels. We evaluate the estimation accuracy of the truth discovery algorithm and the fairness of the reward distribution schemes using both simulations and real-world MCS campaigns. The evaluation results indicate that the proposed methods achieve superior performance compared with state-of-the-art methods in terms of estimation accuracy and fairness of reward distribution.
AU - Shi,F
AU - Qin,Z
AU - Wu,D
AU - McCann,J
DO - 10.1016/j.pmcj.2018.09.007
EP - 103
PY - 2018///
SN - 1574-1192
SP - 88
TI - Effective truth discovery and fair reward distribution for mobile crowdsensing
T2 - Pervasive and Mobile Computing
UR -
UR -
VL - 51
ER -