A Context-Aware Multiarmed Bandit Incentive Mechanism for Mobile Crowd Sensing Systems

被引:45
|
作者
Wu, Yue [1 ]
Li, Fan [1 ]
Ma, Liran [2 ]
Xie, Yadong [1 ]
Li, Ting [3 ]
Wang, Yu [3 ]
机构
[1] Beijing Inst Technol, Sch Comp Sci, Beijing Engn Res Ctr High Volume Language Informa, Beijing 100081, Peoples R China
[2] Texas Christian Univ, Dept Comp Sci, Ft Worth, TX 76129 USA
[3] Univ N Carolina, Dept Comp Sci, Charlotte, NC 28223 USA
基金
北京市自然科学基金; 美国国家科学基金会;
关键词
Mobile crowd sensing (MCS); multiarmed bandit (MAB); participant selection; LOCATION-PRIVACY; ALLOCATION;
D O I
10.1109/JIOT.2019.2903197
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Smart city is a key component in Internet of Things, so it has attracted much attention. The emergence of mobile crowd sensing (MCS) systems enables many smart city applications. In an MCS system, sensing tasks are allocated to a number of mobile users. As a result, the sensing related context of each mobile user plays a significant role on service quality. However, some important sensing context is ignored in the literature. This motivates us to propose a context-aware multiarmed bandit (C-MAB) incentive mechanism to facilitate quality-based worker selection in an MCS system. We evaluate a worker's service quality by its context (i.e., extrinsic ability and intrinsic ability) and cost. Based on our proposed C-MAB incentive mechanism and quality evaluation design, we develop a modified Thompson sampling worker selection (MTS-WS) algorithm to select workers in a reinforcement learning manner. MTS-WS is able to choose effective workers because it can maintain accurate worker quality information by updating evaluation parameters according to the status of task accomplishment. We theoretically prove that our C-MAB incentive mechanism is selection efficient, computationally efficient, individually rational, and truthful. Finally, we evaluate our MTS-WS algorithm on simulated and real-world datasets in comparison with some other classic algorithms. Our evaluation results demonstrate that MTS-WS achieves the highest cumulative utility of the requester and social welfare.
引用
收藏
页码:7648 / 7658
页数:11
相关论文
共 50 条
  • [41] Price Learning-based Incentive Mechanism for Mobile Crowd Sensing
    Zhang, Yifan
    Zhang, Xinglin
    [J]. ACM TRANSACTIONS ON SENSOR NETWORKS, 2021, 17 (02)
  • [42] A Truthful Incentive Mechanism for Online Recruitment in Mobile Crowd Sensing System
    Chen, Xiao
    Liu, Min
    Zhou, Yaqin
    Li, Zhongcheng
    Chen, Shuang
    He, Xiangnan
    [J]. SENSORS, 2017, 17 (01)
  • [43] Incentive mechanism based on auction model for mobile crowd sensing network
    Liu Y.
    Li Y.
    Li H.
    Li W.
    Zhang J.
    Zhao G.
    [J]. Tongxin Xuebao/Journal on Communications, 2019, 40 (07): : 208 - 224
  • [44] UMIM: Utility-Maximization Incentive Mechanism for Mobile Crowd Sensing
    Yao, Xin-Wei
    Yang, Xiao-Tian
    Li, Qiang
    Qi, Chu-Feng
    Kong, Xiang-Jie
    Li, Xiang-Yang
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2024, 23 (05) : 6334 - 6346
  • [45] Research on Incentive Mechanism with Privacy-Preserving in Mobile Crowd Sensing
    Liang Y.
    An J.
    Hu X.-Z.
    Yang Q.
    Si H.-F.
    [J]. An, Jian (anjian@mail.xjtu.edu.cn), 1600, Science Press (43): : 2414 - 2431
  • [47] Context-Aware recommender systems in mobile application domains
    Wörndl, Wolfgang
    Bader, Roland
    Schlichter, Johann
    [J]. i-com, 2011, 10 (01) : 26 - 33
  • [48] Towards a framework for context-aware mobile information systems
    Aarab, Zineb
    Saidi, Rajaa
    Rahmani, Moulay Driss
    [J]. 10TH INTERNATIONAL CONFERENCE ON SIGNAL-IMAGE TECHNOLOGY AND INTERNET-BASED SYSTEMS SITIS 2014, 2014, : 694 - 701
  • [49] Redundancy-Aware and Budget-Feasible Incentive Mechanism in Crowd Sensing
    Li, Juan
    Zhu, Yanmin
    Yu, Jiadi
    [J]. COMPUTER JOURNAL, 2020, 63 (01): : 66 - 79
  • [50] Special Issue on Context-aware Mobile Recommender Systems
    Colombo-Mendoza, Luis Omar
    Valencia-Garcia, Rafael
    Alor-Hernandez, Giner
    Bellavista, Paolo
    [J]. PERVASIVE AND MOBILE COMPUTING, 2017, 38 : 444 - 445