4.7 Article

Incentive Mechanisms for Time Window Dependent Tasks in Mobile Crowdsensing

期刊

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
卷 14, 期 11, 页码 6353-6364

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2015.2452923

关键词

Mobile crowdsensing; incentive mechanism; auction; strategic behavior; optimal algorithm; approximation ratio

资金

  1. NSF [1444059, 1420881]
  2. NSFC [61472193, 61472192, 61373139]
  3. Natural Science Foundation of Jiangsu Province [BK20141429]
  4. Scientific and Technological Support Project (Society) of Jiangsu Province [BE2013666]
  5. China Postdoctoral Science Foundation [2014M562662, 2013T60553]
  6. Jiangsu Postdoctoral Science Foundation [1402223C]
  7. Direct For Computer & Info Scie & Enginr
  8. Division Of Computer and Network Systems [1444059] Funding Source: National Science Foundation
  9. Direct For Computer & Info Scie & Enginr
  10. Division Of Computer and Network Systems [1420881] Funding Source: National Science Foundation

向作者/读者索取更多资源

Mobile crowdsensing can enable numerous attractive novel sensing applications due to the prominent advantages such as wide spatiotemporal coverage, low cost, good scalability, pervasive application scenarios, etc. In mobile crowdsensing applications, incentive mechanisms are necessary to stimulate more potential smartphone users and to achieve good service quality. In this paper, we focus on exploring truthful incentive mechanisms for a novel and practical scenario where the tasks are time window dependent, and the platform has strong requirement of data integrity. We present a universal system model for this scenario based on reverse auction framework and formulate the problem as the Social Optimization User Selection (SOUS) problem. We design two incentive mechanisms, MST and MMT. In single time window case, we design an optimal algorithm based on dynamic programming to select users. Then we determine the payment for each user by VCG auction; while in multiple time window case, we show the general SOUS problem is NP-hard, and we design MMT based on greedy approach, which approximates the optimal solution within a factor of In broken vertical bar W broken vertical bar + 1, where broken vertical bar W broken vertical bar is the length of sensing time window defined by the platform. Through both rigorous theoretical analysis and extensive simulations, we demonstrate that the proposed mechanisms achieve high computation efficiency, individual rationality and truthfulness.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据