A truthful incentive mechanism for mobile crowd sensing with location-Sensitive weighted tasks

被引:13
|
作者
Cai, Hui [1 ]
Zhu, Yanmin [1 ]
Feng, Zhenni [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai, Peoples R China
基金
中国国家自然科学基金;
关键词
Mobile crowd sensing; Location-sensitive; Incentive mechanism; Truthfulness; Auction; PRIVACY; ALGORITHMS; EFFICIENT; STATE;
D O I
10.1016/j.comnet.2017.12.012
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile crowd sensing has emerged as an appealing paradigm to provide sensing data for its efficient economy. A large number of incentive mechanisms has been proposed for stimulating smartphone users to participate in mobile crowd sensing applications. Different from existing work, in addition to sensing tasks with diverse weights, we uniquely take into consideration the crucial dimension of location information when performing sensing tasks allocation. However, the location-sensitive weighted tasks are more vulnerable to the real life where each sensing task has the evident distinction. Meanwhile, the location sensitiveness leads to the increase of theoretical and computational complexity. In this paper, we investigate a truthful incentive mechanism which consists of two main components, winning bids determination algorithm and critical payment scheme. Since optimally determining the winning bids is NP hard, a near-optimal algorithm with polynomial-time computation complexity is proposed, which further approximates the optimal solution within a factor of 1 + In(n), where n is the maximum number of sensing tasks that a smartphone can accommodate. To guarantee the truthfulness, a critical payment scheme is proposed to induce smartphones to disclose their real costs. Through both rigid theoretical analysis and extensive simulations, we demonstrate that the proposed mechanism achieves truthfulness, individual rationality and high computation efficiency. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 14
页数:14
相关论文
共 50 条
  • [1] A Truthful Online Mechanism for Location-Aware Tasks in Mobile Crowd Sensing
    Zhou, Ruiting
    Li, Zongpeng
    Wu, Chuan
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2018, 17 (08) : 1737 - 1749
  • [2] A Truthful Incentive Mechanism for Online Recruitment in Mobile Crowd Sensing System
    Chen, Xiao
    Liu, Min
    Zhou, Yaqin
    Li, Zhongcheng
    Chen, Shuang
    He, Xiangnan
    SENSORS, 2017, 17 (01)
  • [3] Truthful incentive mechanisms for mobile crowd sensing with dynamic smartphones
    Cai, Hui
    Zhu, Yanmin
    Feng, Zhenni
    Zhu, Hongzi
    Yu, Jiadi
    Cao, Jian
    COMPUTER NETWORKS, 2018, 141 : 1 - 16
  • [4] Staged Incentive Mechanism for Mobile Crowd Sensing
    Zhong, Shan
    Tao, Dan
    Luo, Hong
    Obaidat, Mohammad S.
    Wu, Tin Yu
    2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2018,
  • [5] Reverse Auction Based Incentive Mechanism for Location-Aware Sensing in Mobile Crowd Sensing
    Liu, Yuanni
    Li, Huicong
    Zhao, Guofeng
    Duan, Jie
    2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2018,
  • [6] The Truthful Evolution and Incentive for Large-Scale Mobile Crowd Sensing Networks
    Wang, Yingjie
    Li, Yingshu
    Chi, Zhongyang
    Tong, Xiangrong
    IEEE ACCESS, 2018, 6 : 51187 - 51199
  • [7] A Truthful Auction Mechanism for Mobile Crowd Sensing With Budget Constraint
    Liu, Yuanni
    Xu, Xiaodan
    Pan, Jianli
    Zhang, Jianhui
    Zhao, Guofeng
    IEEE ACCESS, 2019, 7 : 43933 - 43947
  • [8] TRIM: A Truthful Incentive Mechanism for Dynamic and Heterogeneous Tasks in Mobile Crowdsensing
    Fan, Yue
    Sun, Hailong
    Liu, Xudong
    MOBICOM '15: PROCEEDINGS OF THE 21ST ANNUAL INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING, 2015, : 272 - 274
  • [9] Staged Incentive and Punishment Mechanism for Mobile Crowd Sensing
    Tao, Dan
    Zhong, Shan
    Luo, Hong
    SENSORS, 2018, 18 (07)
  • [10] Incentive Mechanism with Task Bundling for Mobile Crowd Sensing
    Zhang, Yifan
    Zhang, Xinglin
    ACM TRANSACTIONS ON SENSOR NETWORKS, 2023, 19 (03)