Energy Optimization for NOMA assisted Federated Learning with Secrecy Provisioning

Tianshun Wang, Xumin Huang, Yuxiao Song, Yuan Wu, L. Qian, Bin Lin
{"title":"Energy Optimization for NOMA assisted Federated Learning with Secrecy Provisioning","authors":"Tianshun Wang, Xumin Huang, Yuxiao Song, Yuan Wu, L. Qian, Bin Lin","doi":"10.1109/iccc52777.2021.9580235","DOIUrl":null,"url":null,"abstract":"Federated learning (FL) has been considered as an efficient yet privacy-preserving approach for enabling the distributed learning. There have been many studies investigating the applications of FL in different scenarios, e.g., Internet of Things, Internet of Vehicles, and UAV systems. However, due to delivering the trained model via wireless links, FL may suffer from a potential issue, i.e., some malicious users may intentionally overhear the trained model delivered through the wireless links. In this paper, we investigate the energy optimization for nonorthogonal multiple access (NOMA) assisted with secrecy provisioning. Specifically, we consider that the wireless devices (WDs) adopt NOMA to deliver their respectively trained local models to a base station (BS) which serves a parameter-server, and there exists a malicious node that overhears the parameter-server when delivering the aggregated global model to all WDs. We adopt the physical layer security to quantify the secrecy throughput under the eavesdropping attack and formulate an optimization problem to minimize the overall energy consumption of all the WDs in FL, by jointly optimizing the uplink time, the downlink time, the local model accuracy, and the uplink decoding order of NOMA. In spite of the non-convexity of this joint optimization problem, we propose an efficient algorithm, which is based on the theory of monotonic optimization, for finding the solution. Numerical results show that our proposed algorithm can achieve the almost same solutions as the LINGO's global-solver while reducing more than 90% computation-time than LINGO. Moreover, the results also show that our proposed NOMA decoding scheme can outperform some heuristic decoding schemes.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccc52777.2021.9580235","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Federated learning (FL) has been considered as an efficient yet privacy-preserving approach for enabling the distributed learning. There have been many studies investigating the applications of FL in different scenarios, e.g., Internet of Things, Internet of Vehicles, and UAV systems. However, due to delivering the trained model via wireless links, FL may suffer from a potential issue, i.e., some malicious users may intentionally overhear the trained model delivered through the wireless links. In this paper, we investigate the energy optimization for nonorthogonal multiple access (NOMA) assisted with secrecy provisioning. Specifically, we consider that the wireless devices (WDs) adopt NOMA to deliver their respectively trained local models to a base station (BS) which serves a parameter-server, and there exists a malicious node that overhears the parameter-server when delivering the aggregated global model to all WDs. We adopt the physical layer security to quantify the secrecy throughput under the eavesdropping attack and formulate an optimization problem to minimize the overall energy consumption of all the WDs in FL, by jointly optimizing the uplink time, the downlink time, the local model accuracy, and the uplink decoding order of NOMA. In spite of the non-convexity of this joint optimization problem, we propose an efficient algorithm, which is based on the theory of monotonic optimization, for finding the solution. Numerical results show that our proposed algorithm can achieve the almost same solutions as the LINGO's global-solver while reducing more than 90% computation-time than LINGO. Moreover, the results also show that our proposed NOMA decoding scheme can outperform some heuristic decoding schemes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
NOMA的能量优化辅助联邦学习与保密配置
联邦学习(FL)被认为是实现分布式学习的一种高效且保护隐私的方法。目前已有很多研究探讨了FL在不同场景下的应用,如物联网、车联网、无人机系统等。然而,由于通过无线链路传递训练好的模型,FL可能会遇到一个潜在的问题,即一些恶意用户可能会故意偷听通过无线链路传递的训练好的模型。本文研究了带保密配置的非正交多址(NOMA)的能量优化问题。具体来说,我们认为无线设备(WDs)采用NOMA将各自训练好的局部模型传递给服务于参数服务器的基站(BS),并且在向所有无线设备(WDs)传递聚合全局模型时存在侦听参数服务器的恶意节点。我们通过对NOMA的上行时间、下行时间、局部模型精度和上行解码顺序进行联合优化,采用物理层安全来量化窃听攻击下的保密吞吐量,并制定优化问题以最小化FL中所有WDs的总体能耗。尽管该联合优化问题具有非凸性,但我们提出了一种基于单调优化理论的求解算法。数值结果表明,该算法可以获得与LINGO全局求解器几乎相同的解,而计算时间比LINGO减少90%以上。此外,研究结果还表明,我们提出的NOMA解码方案优于一些启发式解码方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Group-oriented Handover Authentication Scheme in MEC-Enabled 5G Networks Joint Task Secure Offloading and Resource Allocation for Multi-MEC Server to Improve User QoE Dueling-DDQN Based Virtual Machine Placement Algorithm for Cloud Computing Systems Predictive Beam Tracking with Cooperative Sensing for Vehicle-to-Infrastructure Communications Age-aware Communication Strategy in Federated Learning with Energy Harvesting Devices
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1