计算机科学
任务(项目管理)
粒子群优化
资源配置
收入
分布式计算
方案(数学)
服务(商务)
最优化问题
钥匙(锁)
运筹学
计算机网络
机器学习
工程类
计算机安全
算法
会计
数学分析
经济
业务
经济
系统工程
数学
作者
Yanming Fu,Xiao Liu,Weigeng Han,Shenglin Lu,Jiayuan Chen,Tianbing Tang
出处
期刊:Electronics
[Multidisciplinary Digital Publishing Institute]
日期:2023-08-15
卷期号:12 (16): 3454-3454
被引量:2
标识
DOI:10.3390/electronics12163454
摘要
With the rapid development of sensor technology and mobile services, the service model of mobile crowd sensing (MCS) has emerged. In this model, user groups perceive data through carried mobile terminal devices, thereby completing large-scale and distributed tasks. Task allocation is an important link in MCS, but the interests of task publishers, users, and platforms often conflict. Therefore, to improve the performance of MCS task allocation, this study proposes a repeated overlapping coalition formation game MCS task allocation scheme based on multiple-objective particle swarm optimization (ROCG-MOPSO). The overlapping coalition formation (OCF) game model is used to describe the resource allocation relationship between users and tasks, and design two game strategies, allowing users to form overlapping coalitions for different sensing tasks. Multi-objective optimization, on the other hand, is a strategy that considers multiple interests simultaneously in optimization problems. Therefore, we use the multi-objective particle swarm optimization algorithm to adjust the parameters of the OCF to better balance the interests of task publishers, users, and platforms and thus obtain a more optimal task allocation scheme. To verify the effectiveness of ROCG-MOPSO, we conduct experiments on a dataset and compare the results with the schemes in the related literature. The experimental results show that our ROCG-MOPSO performs superiorly on key performance indicators such as average user revenue, platform revenue, task completion rate, and user average surplus resources.
科研通智能强力驱动
Strongly Powered by AbleSci AI