A Truthful Auction Mechanism for Mobile Crowd Sensing With Budget Constraint

被引:13
作者
Liu, Yuanni [1 ]
Xu, Xiaodan [1 ]
Pan, Jianli [2 ]
Zhang, Jianhui [3 ]
Zhao, Guofeng [1 ]
机构
[1] Chongqing Univ Posts & Telecommun, Sch Commun & Informat Engn, Chongqing 400065, Peoples R China
[2] Univ Missouri, Dept Math & Comp Sci, St Louis, MO 63121 USA
[3] Digital Switching Syst Engn & Technol R&D Ctr, Zhengzhou 450002, Henan, Peoples R China
关键词
Mobile crowd sensing; incentive mechanism; task coverage; double auction; INCENTIVE MECHANISM;
D O I
10.1109/ACCESS.2019.2902882
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The selfishness and randomness of users in the mobile crowd sensing network could cause them unwilling to participate in sensing activities and lead to lower completion rates of sensing tasks. In order to deal with these problems, this paper proposes a novel incentive mechanism based on a new auction model for mobile crowd sensing, which consists of two consecutive stages. In the first stage, a novel Incentive Method based on Reverse Auction for Location-aware sensing (IMRAL) is proposed to maximize user utility. By introducing a task-centric method to determine the winning bids, it can provide higher user utility and higher task coverage ratio. To ensure the truthfulness of IMRAL, we design a unique payment determination algorithm based on critical payment for the incentive platform. In the second stage, we propose a user-interaction incentive model (UIBIM) to cover the situation that a user may drop out of the sensing activity. This new incentive model includes a dynamic double auction framework prompting users' interaction and a user matching algorithm based on a bipartite graph. The proposed new mechanism achieves the goal of improving task completion rates without increasing the cost of the incentive platform. The simulation results show that comparing with other solutions, such as a truthful auction for location-aware collaborative sensing in mobile crowdsourcing and incentive mechanism for crowdsourcing in the single-requester single-bid-model, IMRAL can achieve better performance in terms of average user utility and tasks coverage ratio, and the UIBIM can significantly improve task completion rates.
引用
收藏
页码:43933 / 43947
页数:15
相关论文
共 30 条
[1]  
[Anonymous], P IEEE C COMP COMM I
[2]  
[Anonymous], 2013, ACM
[3]  
[Anonymous], 2010, PERVASIVE COMPUTING
[4]  
Barkhuus L, 2005, LECT NOTES COMPUT SC, V3660, P358
[5]  
Bigwood G., 2011, Proceedings of the 2011 IEEE Third International Conference on Privacy, Security, Risk and Trust and IEEE Third International Conference on Social Computing (PASSAT/SocialCom 2011), P65, DOI 10.1109/PASSAT/SocialCom.2011.60
[6]   Chain: A dynamic double auction framework for matching patient agents [J].
Bredin, Jonathan ;
Parkes, David C. ;
Duong, Quang .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2007, 30 :133-179
[7]   Decentralized Clustering by Finding Loose and Distributed Density Cores [J].
Chen, Yewang ;
Tang, Shengyu ;
Zhou, Lida ;
Wang, Cheng ;
Du, Jixiang ;
Wang, Tian ;
Pei, Songwen .
INFORMATION SCIENCES, 2018, 433 :510-526
[8]  
Feng ZN, 2014, IEEE INFOCOM SER, P1231, DOI 10.1109/INFOCOM.2014.6848055
[9]  
Hu Y., 2016, PROC 35 ANN IEEE INT, P1
[10]   A Location-based Incentive Algorithm for Consecutive Crowd Sensing Tasks [J].
Jaimes, L. G. ;
Vergara, I. J. ;
Raij, A. .
IEEE LATIN AMERICA TRANSACTIONS, 2016, 14 (02) :811-817