Journal
IEEE ACCESS
Volume 8, Issue -, Pages 168854-168864Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2020.3023940
Keywords
Industries; Machine learning; Resource management; Optimization; Servers; Computational modeling; Internet of Things; Smart industry; cognitive Internet of Things; federated learning; convex optimization
Categories
Funding
- Institute of Information and Communications Technology Planning and Evaluation (IITP) Grant - Korean Government, Ministry of Science and ICT (MSIT), South Korea, Evolvable Deep Learning Model Generation Platform for Edge Computing [2019-0-01287]
- MSIT through the Grand Information Technology Research Center Support Program [IITP-2020-2015-0-00742]
Ask authors/readers for more resources
Leveraging the cognitive Internet of things (C-IoT), emerging computing technologies, and machine learning schemes for industries can assist in streamlining manufacturing processes, revolutionizing operational analytics, and maintaining factory efficiency. However, further adoption of centralized machine learning in industries seems to be restricted due to data privacy issues. Federated learning has the potential to bring about predictive features in industrial systems without leaking private information. However, its implementation involves key challenges including resource optimization, robustness, and security. In this article, we propose a novel dispersed federated learning (DFL) framework to provide resource optimization, whereby distributed fashion of learning offers robustness. We formulate an integer linear optimization problem to minimize the overall federated learning cost for the DFL framework. To solve the formulated problem, first, we decompose it into two sub-problems: association and resource allocation problem. Second, we relax the association and resource allocation sub-problems to make them convex optimization problems. Later, we use the rounding technique to obtain binary association and resource allocation variables. Our proposed algorithm works in an iterative manner by fixing one problem variable (for example, association) and compute the other (for example, resource allocation). The iterative algorithm continues until convergence of the formulated cost optimization problem. Furthermore, we compare the proposed DFL with two schemes; namely, random resource allocation and random association. Numerical results show the superiority of the proposed DFL scheme.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available