A Distributed Incentive Mechanism to Balance Demand and Communication Overhead for Multiple Federated Learning Tasks in IoV

Federated learning (FL), as a typical distributed machine learning framework, has been effectively applied to traffic flow optimization, driving behavior analysis, and other areas. However, the stability and efficiency of FL systems heavily rely on the quality and cooperation of participants. If participants find no profit in the FL process, they may reduce their willingness to participate due to energy consumption and limited resources. To bridge these gaps, this article proposes a demand-balanced incentive mechanism for multiple FL tasks. First, considering the time-varying channel characteristics in the Internet of Vehicles (IoV) scenario, two optimization problems are constructed: 1) maximizing task-matching satisfaction and 2) minimizing communication energy consumption. Second, these problems are transformed into a distributed incentive mechanism based on a multileader-multifollower (MLMF) Stackelberg game, and a bi-level alternating direction method of multipliers (ADMM) algorithm is proposed to solve for the optimal resource allocation and reward schemes that balance the demands of all parties. Furthermore, this article designs a multiagent deep reinforcement learning-based method to solve the incentive problem, thereby avoiding the impact of information asymmetry. Simulation results verify that the proposed scheme not only balances the demands of all parties but also enhances user participation without being affected by the number of participants, making it suitable for IoV environments.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2024-12-03
DOI
https://doi.org/10.1109/jiot.2024.3510561
Citations
47
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
16.33

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Distributed Incentive Mechanism to Balance Demand and Communication Overhead for Multiple Federated Learning Tasks in IoV

Changle Li, Yuchuan Fu, Nan Cheng, Mengyuan Dong et al.
47 citations
IEEE Internet of Things Journal
Privacy-Preserving Technologies in Data
16.33
article

A Distributed Incentive Mechanism to Balance Demand and Communication Overhead for Multiple Federated Learning Tasks in IoV

Changle Li, Yuchuan Fu, Nan Cheng, Mengyuan Dong, F. Richard Yu, Lingling Zhou
article en
47 citations

Abstract

Federated learning (FL), as a typical distributed machine learning framework, has been effectively applied to traffic flow optimization, driving behavior analysis, and other areas. However, the stability and efficiency of FL systems heavily rely on the quality and cooperation of participants. If participants find no profit in the FL process, they may reduce their willingness to participate due to energy consumption and limited resources. To bridge these gaps, this article proposes a demand-balanced incentive mechanism for multiple FL tasks. First, considering the time-varying channel characteristics in the Internet of Vehicles (IoV) scenario, two optimization problems are constructed: 1) maximizing task-matching satisfaction and 2) minimizing communication energy consumption. Second, these problems are transformed into a distributed incentive mechanism based on a multileader-multifollower (MLMF) Stackelberg game, and a bi-level alternating direction method of multipliers (ADMM) algorithm is proposed to solve for the optimal resource allocation and reward schemes that balance the demands of all parties. Furthermore, this article designs a multiagent deep reinforcement learning-based method to solve the incentive problem, thereby avoiding the impact of information asymmetry. Simulation results verify that the proposed scheme not only balances the demands of all parties but also enhances user participation without being affected by the number of participants, making it suitable for IoV environments.

IEEE Internet of Things JournalVol. 12(8)
Xidian University (CN), Carleton University (CA)
Major Research Plan
Openalex Percentile: Top 1%
Privacy-Preserving Technologies in Data
16.33
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.