CoChat

Latency Optimization for Blockchain-Empowered Federated Learning in Multi-Server Edge Computing

Open access
Nguyen, Dinh C., Hosseinalipour, Seyyedali, Love, David J., Pathirana, Pubudu N., Brinton, Christopher G. · 2022 · IEEE Journal on Selected Areas in Communications
Cited by 83

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

Abstract

In this paper, we study a new latency optimization problem for blockchain-based federated learning (BFL) in multi-server edge computing. In this system model, distributed mobile devices (MDs) communicate with a set of edge servers (ESs) to handle both machine learning (ML) model training and block mining simultaneously. To assist the ML model training for resource-constrained MDs, we develop an offloading strategy that enables MDs to transmit their data to one of the associated ESs. We then propose a new decentralized ML model aggregation solution at the edge layer based on a consensus mechanism to build a global ML model via peer-to-peer (P2P)-based blockchain communications. Blockchain builds trust among MDs and ESs to facilitate reliable ML model sharing and cooperative consensus formation, and enables rapid elimination of manipulated models caused by poisoning attacks. We formulate latency-aware BFL as an optimization aiming to minimize the system latency via joint consideration of the data offloading decisions, MDs’ transmit power, channel bandwidth allocation for MDs’ data offloading, MDs’ computational allocation, and hash power allocation. Given the mixed action space of discrete offloading and continuous allocation variables, we propose a novel deep reinforcement learning scheme with a parameterized advantage actor critic algorithm. We theoretically characterize the convergence properties of BFL in terms of the aggregation delay, mini-batch size, and number of P2P communication rounds. Our numerical evaluation demonstrates the superiority of our proposed scheme over baselines in terms of model training efficiency, convergence rate, system latency, and robustness against model poisoning attacks.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/jsac.2022.3213344

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 13 references

Cited by

See all 83

Metadata

Authors
Nguyen, D. C., Hosseinalipour, S., Love, D. J., Pathirana, P. N., & Brinton, C. G.
Venue
IEEE Journal on Selected Areas in Communications
Published
2022-12
Volume
40
Issue
12
Pages
3373-3390
ISSN
  • 0733-8716 (ISSN-L)
  • 1558-0008
OpenAlex
W4226091865
Cited by
83
References
13
FWCI
7.65
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Latency Optimization for Blockchain-Empowered Federated Learning in Multi-Server Edge Computing. https://app.cochat.ai/papers/10.1109/jsac.2022.3213344
The paper
Nguyen, D. C., Hosseinalipour, S., Love, D. J., Pathirana, P. N., & Brinton, C. G. (2022). Latency Optimization for Blockchain-Empowered Federated Learning in Multi-Server Edge Computing. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2022.3213344

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.