Towards Profit Optimization During Online Participant Selection in Compressive Mobile Crowdsensing

被引:10
|
作者
Chen, Yueyue [1 ]
Guo, Deke [2 ,3 ]
Bhuiyan, Md Zakirul Alam [4 ]
Xu, Ming [1 ]
Wang, Guojun [5 ]
Lv, Pin [6 ]
机构
[1] Natl Univ Def Technol, Coll Comp, Changsha, Hunan, Peoples R China
[2] Natl Univ Def Technol, Sci & Technol Informat Syst Engn Lab, Changsha, Hunan, Peoples R China
[3] Tianjin Univ, Coll Intelligence & Comp, Tianjin, Peoples R China
[4] Fordham Univ, Dept Comp & Informat Sci, Bronx, NY 10458 USA
[5] Guangzhou Univ, Sch Comp Sci & Cyber Engn, Guangzhou, Guangdong, Peoples R China
[6] Guangxi Univ, Sch Comp Elect & Informat, Nanning, Peoples R China
基金
中国国家自然科学基金;
关键词
Compressive mobile crowdsensing; online participant selection; data reconstruction;
D O I
10.1145/3342515
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A mobile crowdsensing (MCS) platform motivates employing participants from the crowd to complete sensing tasks. A crucial problem is to maximize the profit of the platform, i.e., the charge of a sensing task minus the payments to participants that execute the task. In this article, we improve the profit via the data reconstruction method, which brings new challenges, because it is hard to predict the reconstruction quality due to the dynamic features and mobility of participants. In particular, two Profit-driven Online Participant Selection (POPS) problems under different situations are studied in our work: (1) for S-POPS, the sensing cost of the different parts within the target area is the Same. Two mechanisms are designed to tackle this problem, including the ProSC and ProSC+. An exponential-based quality estimation method and a repetitive cross-validation algorithm are combined in the former mechanism, and the spatial distribution of selected participants are further discussed in the latter mechanism; (2) for V-POPS, the sensing cost of different parts within the target area is Various, which makes it the NP-hard problem. A heuristic mechanism called ProSCx is proposed to solve this problem, where the searching space is narrowed and both the participant quantity and distribution are optimized in each slot. Finally, we conduct comprehensive evaluations based on the real-world datasets. The experimental results demonstrate that our proposed mechanisms are more effective and efficient than baselines, selecting the participants with a larger profit for the platform.
引用
收藏
页数:29
相关论文
共 29 条
  • [1] ProSC plus : Profit-driven Online Participant Selection in Compressive Mobile Crowdsensing
    Chen, Yueyue
    Guo, Deke
    Xu, Ming
    [J]. 2018 IEEE/ACM 26TH INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE (IWQOS), 2018,
  • [2] Participant selection optimization model for mobile groups in crowdsensing
    Jiang, Wei-Jin
    Lü, Si-Jian
    Chen, Xiao-Hong
    [J]. Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2022, 39 (02): : 343 - 351
  • [3] User Characteristic Aware Participant Selection for Mobile Crowdsensing
    Wu, Dapeng
    Li, Haopeng
    Wang, Ruyan
    [J]. SENSORS, 2018, 18 (11)
  • [4] Participant-Quantity-Aware Online Task Allocation in Mobile Crowdsensing
    Yang, Guisong
    Guo, Dongsheng
    Wang, Buye
    He, Xingyu
    Wang, Jiangtao
    Wang, Gang
    [J]. IEEE INTERNET OF THINGS JOURNAL, 2023, 10 (24) : 22650 - 22663
  • [5] A Lightweight Privacy-Preserving Participant Selection Scheme for Mobile Crowdsensing
    Cheng, Yudan
    Ma, Jianfeng
    Liu, Zhiquan
    [J]. 2022 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2022, : 1509 - 1514
  • [6] Sensing-gain constrained participant selection mechanism for mobile crowdsensing
    Dan Tao
    Ruipeng Gao
    Hongbin Sun
    [J]. Personal and Ubiquitous Computing, 2023, 27 : 631 - 645
  • [7] RECrowd: a reliable participant selection framework with truthful willingness in mobile crowdsensing
    Wei, Xiaohui
    Tang, Yao
    Wang, Xingwang
    Liu, Yuanyuan
    Sun, Bingyi
    [J]. INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2018, 28 (02) : 89 - 102
  • [8] Sensing-gain constrained participant selection mechanism for mobile crowdsensing
    Tao, Dan
    Gao, Ruipeng
    Sun, Hongbin
    [J]. PERSONAL AND UBIQUITOUS COMPUTING, 2020, 27 (3) : 631 - 645
  • [9] PSARE: A RL-Based Online Participant Selection Scheme Incorporating Area Coverage Ratio and Degree in Mobile Crowdsensing
    Xu, Ying
    Wang, Yufeng
    Ma, Jianhua
    Jin, Qun
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2022, 71 (10) : 10923 - 10933
  • [10] Worker Selection Towards Data Completion for Online Sparse Crowdsensing
    Liu, Wenbin
    Wang, En
    Yang, Yongjian
    Wu, Jie
    [J]. IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022), 2022, : 1509 - 1518