DriveFL:密集车联网联合学习的动态声誉激励机制

IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xin Chang , Lixin Liu , Jingyu Wang , Jinling Yu , Xiaolin Zhang
{"title":"DriveFL:密集车联网联合学习的动态声誉激励机制","authors":"Xin Chang ,&nbsp;Lixin Liu ,&nbsp;Jingyu Wang ,&nbsp;Jinling Yu ,&nbsp;Xiaolin Zhang","doi":"10.1016/j.knosys.2025.114539","DOIUrl":null,"url":null,"abstract":"<div><div>Federated Learning (FL) enables devices to use data locally for model training and thus has received significant attention for protecting data privacy in the Internet of Vehicles (IoV). However, rational vehicles are reluctant to contribute their data to participate in training without compensation, necessitating the implementation of effective incentive algorithms to motivate vehicles to participate in training. Nevertheless, unlike incentives in other domains, the IoV has the following challenges for the design of incentive systems. First, the large number of vehicles in a dense IoT imposes a huge communication burden and pressure on computational efficiency. Second, road data used by vehicles for training may be affected by factors such as damaged sensors or harsh environments, resulting in changes in data quality. Third, intermittent participation issues are caused by the vehicle’s mobility. To address these issues, we propose DriveFL: A Dynamic Reputation Incentive Mechanism for Federated Learning in Dense Internet of Vehicles. Specifically, we employ gradient compression techniques to reduce communication costs. Subsequently, we design a similarity-based gradient compression quality assessment method capable of evaluating the quality of vehicle data in real time. Then, we develop a dynamic reputation incentive mechanism that quantifies quality assessment records and integrates reverse auction theory, which can attract vehicles with higher data quality from those that intermittently participate in training, thereby enhancing model training quality under constrained communication costs and budget limitations. Theoretical analysis demonstrates that our mechanism satisfies computational efficiency, individual rationality, budget feasibility, and truthfulness. Simulation experiments confirm the effectiveness of our approach.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"330 ","pages":"Article 114539"},"PeriodicalIF":7.6000,"publicationDate":"2025-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"DriveFL: A dynamic reputation incentive mechanism for federated learning in dense internet of vehicles\",\"authors\":\"Xin Chang ,&nbsp;Lixin Liu ,&nbsp;Jingyu Wang ,&nbsp;Jinling Yu ,&nbsp;Xiaolin Zhang\",\"doi\":\"10.1016/j.knosys.2025.114539\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Federated Learning (FL) enables devices to use data locally for model training and thus has received significant attention for protecting data privacy in the Internet of Vehicles (IoV). However, rational vehicles are reluctant to contribute their data to participate in training without compensation, necessitating the implementation of effective incentive algorithms to motivate vehicles to participate in training. Nevertheless, unlike incentives in other domains, the IoV has the following challenges for the design of incentive systems. First, the large number of vehicles in a dense IoT imposes a huge communication burden and pressure on computational efficiency. Second, road data used by vehicles for training may be affected by factors such as damaged sensors or harsh environments, resulting in changes in data quality. Third, intermittent participation issues are caused by the vehicle’s mobility. To address these issues, we propose DriveFL: A Dynamic Reputation Incentive Mechanism for Federated Learning in Dense Internet of Vehicles. Specifically, we employ gradient compression techniques to reduce communication costs. Subsequently, we design a similarity-based gradient compression quality assessment method capable of evaluating the quality of vehicle data in real time. Then, we develop a dynamic reputation incentive mechanism that quantifies quality assessment records and integrates reverse auction theory, which can attract vehicles with higher data quality from those that intermittently participate in training, thereby enhancing model training quality under constrained communication costs and budget limitations. Theoretical analysis demonstrates that our mechanism satisfies computational efficiency, individual rationality, budget feasibility, and truthfulness. Simulation experiments confirm the effectiveness of our approach.</div></div>\",\"PeriodicalId\":49939,\"journal\":{\"name\":\"Knowledge-Based Systems\",\"volume\":\"330 \",\"pages\":\"Article 114539\"},\"PeriodicalIF\":7.6000,\"publicationDate\":\"2025-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Knowledge-Based Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0950705125015783\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge-Based Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950705125015783","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

联邦学习(FL)使设备能够在本地使用数据进行模型训练,因此在保护车联网(IoV)中的数据隐私方面受到了极大的关注。但理性车辆不愿意无偿贡献数据参与训练,需要实施有效的激励算法来激励车辆参与训练。然而,与其他领域的激励机制不同,车联网在激励机制设计方面面临以下挑战。首先,密集物联网中的大量车辆给计算效率带来了巨大的通信负担和压力。其次,车辆用于训练的道路数据可能会受到传感器损坏或恶劣环境等因素的影响,导致数据质量发生变化。第三,间歇性参与问题是由车辆的移动性引起的。为了解决这些问题,我们提出了DriveFL:一种用于密集车辆互联网中联邦学习的动态声誉激励机制。具体来说,我们采用梯度压缩技术来降低通信成本。随后,我们设计了一种基于相似度的梯度压缩质量评估方法,能够实时评估车辆数据的质量。然后,我们建立了一种量化质量评估记录的动态声誉激励机制,并结合反向拍卖理论,从间歇性参与训练的车辆中吸引数据质量更高的车辆,从而在有限的沟通成本和预算限制下提高模型训练质量。理论分析表明,该机制满足计算效率、个体合理性、预算可行性和真实性。仿真实验验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
DriveFL: A dynamic reputation incentive mechanism for federated learning in dense internet of vehicles
Federated Learning (FL) enables devices to use data locally for model training and thus has received significant attention for protecting data privacy in the Internet of Vehicles (IoV). However, rational vehicles are reluctant to contribute their data to participate in training without compensation, necessitating the implementation of effective incentive algorithms to motivate vehicles to participate in training. Nevertheless, unlike incentives in other domains, the IoV has the following challenges for the design of incentive systems. First, the large number of vehicles in a dense IoT imposes a huge communication burden and pressure on computational efficiency. Second, road data used by vehicles for training may be affected by factors such as damaged sensors or harsh environments, resulting in changes in data quality. Third, intermittent participation issues are caused by the vehicle’s mobility. To address these issues, we propose DriveFL: A Dynamic Reputation Incentive Mechanism for Federated Learning in Dense Internet of Vehicles. Specifically, we employ gradient compression techniques to reduce communication costs. Subsequently, we design a similarity-based gradient compression quality assessment method capable of evaluating the quality of vehicle data in real time. Then, we develop a dynamic reputation incentive mechanism that quantifies quality assessment records and integrates reverse auction theory, which can attract vehicles with higher data quality from those that intermittently participate in training, thereby enhancing model training quality under constrained communication costs and budget limitations. Theoretical analysis demonstrates that our mechanism satisfies computational efficiency, individual rationality, budget feasibility, and truthfulness. Simulation experiments confirm the effectiveness of our approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Knowledge-Based Systems
Knowledge-Based Systems 工程技术-计算机:人工智能
CiteScore
14.80
自引率
12.50%
发文量
1245
审稿时长
7.8 months
期刊介绍: Knowledge-Based Systems, an international and interdisciplinary journal in artificial intelligence, publishes original, innovative, and creative research results in the field. It focuses on knowledge-based and other artificial intelligence techniques-based systems. The journal aims to support human prediction and decision-making through data science and computation techniques, provide a balanced coverage of theory and practical study, and encourage the development and implementation of knowledge-based intelligence models, methods, systems, and software tools. Applications in business, government, education, engineering, and healthcare are emphasized.
×
引用
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学术官方微信