Incentive Mechanisms for Discretized Mobile Crowdsensings

被引:17
作者
Ji, Shiyu [1 ]
Chen, Tingting [2 ]
机构
[1] Oklahoma State Univ, Stillwater, OK 74078 USA
[2] Calif State Polytech Univ Pomona, Pomona, CA 91768 USA
关键词
Crowdsensing; discretization; incentive mechanisms; SETI-AT-HOME; SYSTEMS;
D O I
10.1109/TWC.2015.2468724
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In crowdsensing to mobile phones, each user needs incentives to participate. Mobile devices with sensing capabilities have enabled a new paradigm of mobile crowdsensing with a broad range of applications. A major challenge in achieving stable crowdsensing on a large scale is the incentive issue. Proper incentive mechanisms are necessary to keep the crowdsensing working. However, most existing incentive mechanisms for crowdsensing assume the system admit continuous strategies like sensing time in opposite of the fact that many digital devices and crowdsensing models only admit discretized strategies. In this paper, we show that discretization, like rounding method, can make the existing crowdsensing incentive mechanisms invalid. To address this problem, we design the incentive mechanism for discrete crowdsensing in which each user has a uniform sensing subtask length. We rigorously show that our mechanism can achieve perfect Bayesian equilibrium (PBE) and maximize the platform utility. Our algorithm is efficient since its complexity is linear to the number of users. We also consider the cases in which the users have diverse subtask lengths, and propose another two incentive mechanisms to achieve PBEs and maximize platform utility. Extensive simulations verify our mechanisms are efficient, individual-rational, and system-optimal.
引用
收藏
页码:146 / 161
页数:16
相关论文
共 43 条
  • [1] BOINC: A system for public-resource computing and storage
    Anderson, DP
    [J]. FIFTH IEEE/ACM INTERNATIONAL WORKSHOP ON GRID COMPUTING, PROCEEDINGS, 2004, : 4 - 10
  • [2] SETI@home - An experiment in public-resource computing
    Anderson, DP
    Cobb, J
    Korpela, E
    Lebofsky, M
    Werthimer, D
    [J]. COMMUNICATIONS OF THE ACM, 2002, 45 (11) : 56 - 61
  • [3] [Anonymous], 2013, Proceedings of the 22nd WWW
  • [4] [Anonymous], 2013, P 19 ANN INT C MOB C, DOI [DOI 10.1145/2500423.2500438, 10.1145/2500423.2500438]
  • [5] Bell D. E., 1976, ADA023588 DTIC
  • [6] Chawla Shuchi., 2012, SODA, P856
  • [7] Chen Tingting., 2010, INFOCOM, 2010 Proceedings IEEE, P1
  • [8] Chon Y, 2012, UBICOMP'12: PROCEEDINGS OF THE 2012 ACM INTERNATIONAL CONFERENCE ON UBIQUITOUS COMPUTING, P481
  • [9] Sensors and Crowdsourcing for Environmental Awareness and Emergency Planning
    Chun, Soon Ae
    Artigas, Francisco
    [J]. INTERNATIONAL JOURNAL OF E-PLANNING RESEARCH, 2012, 1 (01) : 56 - 74
  • [10] THE COMPLEXITY OF COMPUTING A NASH EQUILIBRIUM
    Daskalakis, Constantinos
    Goldberg, Paul W.
    Papadimitriou, Christos H.
    [J]. SIAM JOURNAL ON COMPUTING, 2009, 39 (01) : 195 - 259