4.7 Article

Blockchain Assisted Federated Learning Over Wireless Channels: Dynamic Resource Allocation and Client Scheduling

期刊

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
卷 22, 期 5, 页码 3537-3553

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2022.3219501

关键词

Computational modeling; Blockchains; Training; Wireless communication; Energy consumption; Resource management; Dynamic scheduling; Federated learning; blockchain; Lyapunov optimization; resource allocation; client scheduling

向作者/读者索取更多资源

This article proposes a novel BFL framework that integrates training and mining at the client side, aiming to optimize the learning performance and address the vulnerability of decentralized model aggregation in existing BFL frameworks.
Blockchain technology has been extensively studied to enable distributed and tamper-proof data processing in federated learning (FL). Most existing blockchain assisted FL (BFL) frameworks have employed a third-party blockchain network to decentralize the model aggregation process. However, decentralized model aggregation is vulnerable to pooling and collusion attacks from the third-party blockchain network. Driven by this issue, we propose a novel BFL framework that features the integration of training and mining at the client side. To optimize the learning performance of FL, we propose to maximize the long-term time average (LTA) training data size under a constraint of LTA energy consumption. To this end, we formulate a joint optimization problem of training client selection and resource allocation (i.e., the transmit power and computation frequency at the client side), and solve the long-term mixed integer non-linear program based on a Lyapunov technique. In particular, the proposed dynamic resource allocation and client scheduling (DRACS) algorithm can achieve a trade-off of [ $\mathcal {O}(1/V)$ , $\mathcal {O}(\sqrt {V})$ ] to balance the maximization of the LTA training data size and the minimization of the LTA energy consumption with a control parameter $V$ . Our experimental results show that the proposed DRACS algorithm achieves better learning accuracy than benchmark client scheduling strategies with limited time or energy consumption.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据