共 48 条
Joint Scheduling and Resource Allocation for Efficiency-Oriented Distributed Learning Over Vehicle Platooning Networks
被引:18
作者:
Ma, Xiaoting
[1
,2
]
Zhao, Junhui
[1
,3
]
Gong, Yi
[2
,4
]
机构:
[1] Beijing Jiaotong Univ, Sch Elect & Informat Engn, Beijing 100044, Peoples R China
[2] Peng Cheng Lab, Shenzhen 518055, Peoples R China
[3] East China Jiaotong Univ, Sch Informat Engn, Nanchang 330013, Jiangxi, Peoples R China
[4] Southern Univ Sci & Technol, Univ Key Lab Adv Wireless Commun Guangdong Prov, Shenzhen 518055, Peoples R China
基金:
北京市自然科学基金;
中国国家自然科学基金;
关键词:
Artificial intelligence;
Scheduling;
Processor scheduling;
Distance learning;
Computer aided instruction;
Distributed databases;
Computational modeling;
vehicle platooning networks;
distributed learning;
scheduling;
resource allocation;
Markovian stochastic process;
AUTONOMOUS VEHICLES;
EDGE INTELLIGENCE;
COMMUNICATION;
MANAGEMENT;
INFERENCE;
INTERNET;
DESIGN;
D O I:
10.1109/TVT.2021.3107465
中图分类号:
TM [电工技术];
TN [电子技术、通信技术];
学科分类号:
0808 ;
0809 ;
摘要:
The limited communication and computing resources, as well as the rising concerns about the privacy protection, bring significant challenges to the massive data training and analysis in vehicular networks. To address these challenges, in this paper a platoon-based distributed learning framework design for data learning is carried out, where the vacant computation resources of vehicle platooning networks are leveraged. In the proposed framework, a 2-phase Markovian stochastic process is utilized to depict the learning service heterogeneity for each participating vehicle. Meanwhile, we propose a joint scheduling and resource allocation scheme for efficiency-oriented distributed learning to maximize the learning accuracy subject to a given learning time constraint. The optimization problem is solved as follows. First, given the scheduled vehicles, the communication resource allocation is modeled as a minimum-maximum problem to minimize the learning delay of each learning round. Subsequently, an efficiency-oriented unbiased global aggregation policy is proposed to explore the convergence difference between partial scheduling and total scheduling. Considering the learning convergence and remaining time, an on-demand scheduling scheme is introduced to determine the number of scheduled vehicles. Finally, combining the learning efficiency of each vehicle with the scheduled number of vehicles, the scheduled vehicle set is selected. Simulations results show that the proposed scheduling policy can schedule the number of participating vehicles on demand based on the trade-off between learning performance and learning latency.
引用
收藏
页码:10894 / 10908
页数:15
相关论文