Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/29160
Title: | Device Scheduling for Secure Aggregation in Wireless Federated Learning |
Authors: | Yan, N Wang, K Zhi, K Pan, C Chai, KK Poor, HV |
Keywords: | federated learning (FL);device scheduling;branch-and-bound (BnB);integer nonlinear fractional programming |
Issue Date: | 27-May-2024 |
Publisher: | Institute of Electrical and Electronics Engineers (IEEE) |
Citation: | Yan, N. et al. (2024) 'Device Scheduling for Secure Aggregation in Wireless Federated Learning', IEEE Internet of Things Journal, 11 (17), pp. 28851 - 28862. doi: 10.1109/jiot.2024.3405855. |
Abstract: | Federated learning (FL) has been widely investigated in academic and industrial fields to resolve the issue of data isolation in the distributed Internet of Things (IoT) while maintaining privacy. However, challenges persist in ensuring adequate privacy and security during the aggregation process. In this paper, we investigate device scheduling strategies that ensure the security and privacy of wireless FL. Specifically, we measure the privacy leakage of user data using differential privacy (DP) and assess the security level of the system through mean square error security (MSE-security). We commence by deriving analytical results that reveal the impact of device scheduling on privacy and security protection, as well as on the learning process. Drawing from these analytical findings, we propose three scheduling policies that can achieve secure aggregation of wireless FL under different cases of channel noise. In particular, we formulate an integer nonlinear fractional programming problem to improve the learning perfor- mance while guaranteeing privacy and security of wireless FL. We provide an insightful solution in the closed form to the optimization problem when the model has a high dimension. For the general case, we propose a secure and private aggregation (SPA) algorithm based on the branch-and- bound (BnB) method, which can obtain the optimal solution with low complexity. The effectiveness of the proposed schemes for device selection is validated through simulations. |
URI: | https://bura.brunel.ac.uk/handle/2438/29160 |
DOI: | https://doi.org/10.1109/jiot.2024.3405855 |
Other Identifiers: | ORCiD: Na Yan https://orcid.org/0000-0003-1388-8566 ORCiD: Kezhi Wang https://orcid.org/0000-0001-8602-0800 ORCiD: Kangda Zhi https://orcid.org/0000-0002-1677-847X ORCiD: Cunhua Pan https://orcid.org/0000-0001-5286-7958 ORCiD: H. Vincent Poor https://orcid.org/0000-0002-2062-131X |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | Copyright © 2024 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional | 1.62 MB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.