Towards Profit Optimization During Online Participant Selection in Compressive Mobile Crowdsensing

Author:

Chen Yueyue1ORCID,Guo Deke2,Bhuiyan MD Zakirul Alam3,Xu Ming1,Wang Guojun4,Lv Pin5

Affiliation:

1. National University of Defense Technology, Changsha, China

2. National University of Defense Technology, China and Tianjin University, Tianjin, China

3. Fordham University, NewYork, USA

4. Guangzhou University, Guangzhou, China

5. Guangxi University, Nanning, China

Abstract

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.

Funder

Tianjin Science and Technology Foundation

National Program for Support of Top-Notch Young Professionals of National Program for Special Support of Eminent Professionals

National Natural Science Foundation of China

Guangdong Provincial Natural Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications

Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Complementary Coarse-to-Fine Matching for Video Object Segmentation;ACM Transactions on Multimedia Computing, Communications, and Applications;2023-07-12

2. Robust and Efficient Memory Network for Video Object Segmentation;2023 IEEE International Conference on Multimedia and Expo (ICME);2023-07

3. Boosting Video Object Segmentation via Robust and Efficient Memory Network;IEEE Transactions on Circuits and Systems for Video Technology;2023

4. “Follower of the Reference Point”: Platform Utility-Oriented Incentive Mechanism in Crowdsensing;Electronics;2022-08-20

5. Fast target-aware learning for few-shot video object segmentation;Science China Information Sciences;2022-07-27

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3