匹配(统计)
计算机科学
任务(项目管理)
选择(遗传算法)
方案(数学)
利用
分布式计算
机器学习
人工智能
工程类
数学
计算机安全
统计
数学分析
系统工程
作者
Yilong Hui,Gaosheng Zhao,Changle Li,Nan Cheng,Zhisheng Yin,Tom H. Luan,Xiao Xiao
出处
期刊:IEEE Transactions on Vehicular Technology
[Institute of Electrical and Electronics Engineers]
日期:2023-02-01
卷期号:72 (2): 2352-2364
被引量:2
标识
DOI:10.1109/tvt.2022.3211005
摘要
In the heterogeneous vehicular networks (HetVNets), the roadside units (RUs) can exploit the massive amounts of valuable data collected by vehicles to complete federated learning tasks. However, most of the existing studies consider the scenario of one task requester (TR) and ignore the fact that multiple TRs may concurrently request their model training tasks in the HetVNets. In this paper, we consider the scenario of multi-TR and multi-RU and propose a digital twins (DT) enabled on-demand matching scheme for multi-task federated learning to address the two-way selection problem between TRs and RUs. Specifically, by jointly considering the diversified requirements of the TRs and the differentiated training capabilities of the RUs, we first design a DT enabled on-demand matching architecture to facilitate the multi-task federated learning in the HetVNets. Then, based on the personalized requirement of the DT of each TR (DT-TR), a marginal utility based vehicle selection mechanism is proposed to enable the DT of each RU (DT-RU) to determine the customized model training strategy. With the determined strategies, the two-way selection problem between the DT-TRs and the DT-RUs is formulated as an on-demand matching game in DT networks, where a matching algorithm is designed to obtain their optimal strategies. Simulation results demonstrate that the proposed scheme outperforms the conventional schemes in terms of training accuracy, performance-cost ratio (PCR), and task completion rate (TCR).
科研通智能强力驱动
Strongly Powered by AbleSci AI