Residential Collegefalse
Status已發表Published
Energy Optimization for NOMA Assisted Federated Learning with Secrecy Provisioning
Wang Tianshun1; Huang Xumin1,3; Song Yuxiao1; Wu Yuan1,2; Qian Liping4; Lin Bin5
2021-07
Conference Name2021 IEEE/CIC International Conference on Communications
Source Publication2021 IEEE/CIC International Conference on Communications in China (ICCC)
Pages1189-1194
Conference Date28-30 July 2021
Conference PlaceXiamen
CountryChina
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.

DOI10.1109/ICCC52777.2021.9580235
URLView the original
Language英語English
Scopus ID2-s2.0-85119382128
Fulltext Access
Citation statistics
Document TypeConference paper
CollectionTHE STATE KEY LABORATORY OF INTERNET OF THINGS FOR SMART CITY (UNIVERSITY OF MACAU)
Corresponding AuthorWu Yuan
Affiliation1.University of Macau, State Key Laboratory of Internet of Things for Smart City, Macao
2.Zhuhai UM Science, Technology Research Institute, Zhuhai, China
3.School of Automation, Guangdong University of Technology, Guangzhou, 510006, China
4.College of Information Engineering, Zhejiang University of Technology, Hangzhou, China
5.Department of Communication Engineering, Dalian Maritime University, Dalian, China
First Author AffilicationUniversity of Macau
Corresponding Author AffilicationUniversity of Macau
Recommended Citation
GB/T 7714
Wang Tianshun,Huang Xumin,Song Yuxiao,et al. Energy Optimization for NOMA Assisted Federated Learning with Secrecy Provisioning[C], 2021, 1189-1194.
APA Wang Tianshun., Huang Xumin., Song Yuxiao., Wu Yuan., Qian Liping., & Lin Bin (2021). Energy Optimization for NOMA Assisted Federated Learning with Secrecy Provisioning. 2021 IEEE/CIC International Conference on Communications in China (ICCC), 1189-1194.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Wang Tianshun]'s Articles
[Huang Xumin]'s Articles
[Song Yuxiao]'s Articles
Baidu academic
Similar articles in Baidu academic
[Wang Tianshun]'s Articles
[Huang Xumin]'s Articles
[Song Yuxiao]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Wang Tianshun]'s Articles
[Huang Xumin]'s Articles
[Song Yuxiao]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.