Tradeoff Between Capacity and Cost: Maximizing User Recruitment Through Collaboration in Mobile Crowdsensing

IF 4.5 2区 计算机科学 Q1 COMPUTER SCIENCE, CYBERNETICS
Dingwen Chi;Jun Tao;Haotian Wang;Yifan Xu
{"title":"Tradeoff Between Capacity and Cost: Maximizing User Recruitment Through Collaboration in Mobile Crowdsensing","authors":"Dingwen Chi;Jun Tao;Haotian Wang;Yifan Xu","doi":"10.1109/TCSS.2024.3473297","DOIUrl":null,"url":null,"abstract":"Utilizing mobile crowdsensing (MCS) for data collection and analysis has become a prominent paradigm in the Internet of Things (IoTs). However, the existing research predominantly focuses on platform-user interactions, often neglecting the potential for user collaboration, which is crucial for improving data quality and task efficiency. In practical applications, mobile users tend to cooperate with familiar individuals based on their preferences in sensing tasks. To tackle this issue, we introduce a novel MCS model that integrates user cooperation, significantly enhancing the system's overall effectiveness. Specifically, users’ capabilities and costs are synthesized and managed through a cooperation degree matrix. Additionally, cooperation is updated based on historical behaviors and user preferences. To incentivize user participation, currencies are employed for recruitment. Within this framework, we investigate the maximum collaborative user selection (MCUS) problem, which is dedicated to the problem of maximizing the amount of recruitment under user cooperation. The MCUS problem is proved to be an NP-hard problem and thus intractable. To address this, we propose the minimum weighted cost replacement (MWCR) algorithm. Experimental results demonstrate that the MWCR algorithm exhibits low complexity and high efficiency across various scales, making it an excellent solution for collaborative crowd recruitment.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":"12 1","pages":"295-305"},"PeriodicalIF":4.5000,"publicationDate":"2024-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10721235/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

Abstract

Utilizing mobile crowdsensing (MCS) for data collection and analysis has become a prominent paradigm in the Internet of Things (IoTs). However, the existing research predominantly focuses on platform-user interactions, often neglecting the potential for user collaboration, which is crucial for improving data quality and task efficiency. In practical applications, mobile users tend to cooperate with familiar individuals based on their preferences in sensing tasks. To tackle this issue, we introduce a novel MCS model that integrates user cooperation, significantly enhancing the system's overall effectiveness. Specifically, users’ capabilities and costs are synthesized and managed through a cooperation degree matrix. Additionally, cooperation is updated based on historical behaviors and user preferences. To incentivize user participation, currencies are employed for recruitment. Within this framework, we investigate the maximum collaborative user selection (MCUS) problem, which is dedicated to the problem of maximizing the amount of recruitment under user cooperation. The MCUS problem is proved to be an NP-hard problem and thus intractable. To address this, we propose the minimum weighted cost replacement (MWCR) algorithm. Experimental results demonstrate that the MWCR algorithm exhibits low complexity and high efficiency across various scales, making it an excellent solution for collaborative crowd recruitment.
容量和成本之间的权衡:通过移动众感合作最大化用户招募
利用移动群体感知(MCS)进行数据收集和分析已经成为物联网(iot)的一个突出范例。然而,现有的研究主要集中在平台-用户交互上,往往忽视了用户协作的潜力,而用户协作对于提高数据质量和任务效率至关重要。在实际应用中,移动用户在感知任务中倾向于根据自己的偏好与熟悉的个体进行合作。为了解决这个问题,我们引入了一种新的集成了用户合作的MCS模型,显著提高了系统的整体效率。具体而言,通过合作度矩阵对用户的能力和成本进行综合和管理。此外,合作将根据历史行为和用户偏好进行更新。为了激励用户参与,我们使用货币进行招募。在此框架下,我们研究了最大协同用户选择(MCUS)问题,该问题致力于解决用户合作下招聘数量最大化的问题。mcu问题被证明是np困难问题,因此难以处理。为了解决这个问题,我们提出了最小加权成本替换(MWCR)算法。实验结果表明,MWCR算法在各种尺度下具有低复杂度和高效率的特点,是一种很好的协同人群招募解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Computational Social Systems
IEEE Transactions on Computational Social Systems Social Sciences-Social Sciences (miscellaneous)
CiteScore
10.00
自引率
20.00%
发文量
316
期刊介绍: IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信