RECrowd: a reliable participant selection framework with truthful willingness in mobile crowdsensing
by Xiaohui Wei; Yao Tang; Xingwang Wang; Yuanyuan Liu; Bingyi Sun
International Journal of Sensor Networks (IJSNET), Vol. 28, No. 2, 2018

Abstract: In crowdsensing systems, participant selection as one of main problems attracts a lot of attention. Most studies focus on how to select reliable participants for task allocation to assure task quality and minimise incentive cost. Conventional methods are mainly based on historical reputation, which is from the statistical result of participant behaviours during a past period. However, these methods could cause unreliable assignment that reduces the task quality, since historical reputation cannot exactly reflect the current state of participants. In this paper, we advocate RECrowd, a reliable participant selection framework that considers both historical records and current truthful willingness. In RECrowd, we formulate an optimisation problem with the objective of minimising incentive cost while ensuring task quality, and design a two-stage online greedy algorithm with the pre-assignment step. During the participant selection, we also consider participants' position privacy. Experiment results with real datasets demonstrate our algorithm outperforms other methods.

Online publication date: Sat, 15-Sep-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email