Cited by 506Privacy-Preserving Technologies in DataIoT and Edge/Fog ComputingInternet of Things and AI

Federated Learning for Edge Networks: Resource Optimization and Incentive Mechanism

Open access
Khan, Latif U., Pandey, Shashi Raj, Tran, Nguyen H., Saad, Walid, Han, Zhu, Nguyen, Minh N. H., Hong, Choong Seon·2020·IEEE Communications Magazine

Abstract

Recent years have witnessed a rapid proliferation of smart Internet of Things (IoT) devices. IoT devices with intelligence require the use of effective machine learning paradigms. Federated learning can be a promising solution for enabling IoT-based smart applications. In this article, we present the primary design aspects for enabling federated learning at the network edge. We model the incentive- based interaction between a global server and participating devices for federated learning via a Stackelberg game to motivate the participation of the devices in the federated learning process. We present several open research challenges with their possible solutions. Finally, we provide an outlook on future research.

AI snapshot

Written from the paper’s full text.

TL;DR

This article presents design aspects for federated learning at the network edge and models the interaction between a base station and participating devices as a Stackelberg game to incentivize participation. It evaluates an incentive-based FL model using MNIST distributed across five UEs and outlines open challenges in resource optimization, context awareness, and mobility.

Key findings

  • The paper proposes a Stackelberg game with one leader (the BS) and multiple followers (UEs), where UEs strategically choose local iteration/CPU-frequency strategies and the BS adjusts reward rates to maximize FL performance.
  • It identifies four key design aspects for edge FL: resource optimization, incentive mechanism design, learning algorithm design, and hardware-software co-design.
  • In the performance evaluation, the offered reward rate motivates UEs to perform more local iterations within one global iteration, improving relative accuracy; heterogeneous UE responses arise from individual computational limitations, local data size, and communication channel conditions.
  • The evaluation uses a classification task with multinomial logistic regression, distributes the MNIST dataset among five participating UEs with equal local data size, and uses the modified CoCoA framework for federated optimization.

Methods

  • Design: conceptual/overview article with a Stackelberg game-based incentive mechanism for FL over edge networks.
  • Data/sample: simulation-style evaluation with five participating UEs having different channel conditions and equal local data size; MNIST dataset distributed among UEs; classification via multinomial logistic regression; modified CoCoA for federated optimization.
  • Analysis: best-response algorithm to reach Stackelberg equilibrium; first-order condition to find a unique Nash equilibrium among UEs at the lower level, then backward induction to solve the upper-level BS problem; performance shown through figures on reward rate, relative accuracy, communication time, and normalized BS utility.

Limitations

  • The paper does not state a dedicated limitations section.
  • Evident from the text: the performance evaluation is small-scale, using only five UEs with equal local data size on MNIST, so the system model’s heterogeneous data sizes are not tested in the reported evaluation.
  • Evident from the text: no numerical performance values are reported in the text; results are described qualitatively through figure axes and trends.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1109/mcom.001.1900649

Cites

16 of 16 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

0 of 17 cited sources checked · 0 supported · 0 flagged

  • Findingnone given

    The offered reward rate reveals the optimal response of the UEs that maximizes their own utilities for given channel conditions.

    “The offered reward rate reveals the optimal response of the UEs that maximizes their own utilities for given channel conditions.”
    Quote in the paperSubstantial claim
  • Findingnone given

    There is consistency in the normalized BS utility function for various response behaviors of the UEs to the offered reward rate.

    “Here, we have consistency in the normalized BS utility function for various response behaviors of the UEs to the offered reward rate.”
    Quote in the paperNot a substantial claim
  • Findingreasoning

    In Fig. 3a, the accuracy improves when the relative accuracy value (x-axis) is smaller.

    “The accuracy improves when the relative accuracy value (x-axis) is smaller.”
    Quote in the paperNot a substantial claim
  • Findingreasoning

    As the communication time increases, the UEs perform more local iterations to avoid expensive communication costs.

    “As the communication time increases, the UEs perform more local iterations to avoid expensive communication costs.”
    Quote in the paperSubstantial claim
  • Interpretationnone given

    The heterogeneous UE responses is the result of individual computational limitations, local data size, and communication channel conditions.

    “The heterogeneous UE responses is the result of individual computational limitations, local data size, and communication channel conditions.”
    Quote in the paperSubstantial claim
  • Classified as probably not a substantial claim. 9
  • May combine two claims. 6
  • Classified as probably not a substantial claim.

    Findingnone given

    An increase in the offered reward rate will motivate UEs to iterate more within one global iteration, resulting in a better accuracy.

    “Intuitively, an increase in the offered reward rate will motivate UEs to iterate more within one global iteration, resulting in a better accuracy.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Premisenone given

    Works [2] and [3] rely on centralized learning solutions that have limited scalability and privacy-preservation.

    “Works in [2] and [3] rely on centralized learning solutions that have limited scalability and privacy-preservation.”
    Quote in the paperSubstantial claim0 of 2 sources checked
    • cites [2]

      Not checked in the free run.

    • cites [3] source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S4 (based).

    Premisenone given

    Works [5] and [6] do not discuss the important challenges pertaining to incentive design and network optimization under edge-based FL.

    “However, the works in [5] and [6] do not discuss the important challenges pertaining to incentive design and network optimization under edge-based FL.”
    Quote in the paperNot a substantial claim0 of 2 sources checked
    • cites [5] source

      Not checked in the free run.

    • cites [6]

      Not checked in the free run.

  • May combine two claims.

    Premisecitation

    FedAvg does not guarantee theoretical convergence, while FedProx shows theoretical convergence.

    “FedAvg does not guarantee theoretical convergence, while FedProx shows theoretical convergence.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [7] source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S2 (checkable), S3 (load-bearing), S4 (based).

    Interpretationreasoning

    This work can potentially make FL amenable for implementation in diverse 5G-enabled smart IoT applications such as intelligent transportation systems, industry 4.0, and digital health care.

    “This work can potentially make FL amenable for implementation in diverse 5G-enabled smart IoT applications such as intelligent transportation systems, industry 4.0, and digital health care.”
    Quote in the paperNot a substantial claim
    • Rests on an assumption: Federated learning can be a promising solution for enabling IoT-based smart applications.
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisecitation

    The problem studied in [15] captures two tradeoffs: (a) UE energy consumption and FL time via variations in device CPU-cycles/sec and (b) computational and communication latencies for FL accuracy.

    “The problem studied in [15] captures two tradeoffs: (a) UE energy consumption and FL time via variations in device CPU-cycles/sec and (b) computational and communication latencies for FL accuracy.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [15] source

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning

    An increase in the number of local iterations minimizes the local learning model error and thus, few global FL rounds are required to reach a certain global FL model accuracy.

    “An increase in the number of local iterations minimizes the local learning model error and thus, few global FL rounds are required to reach a certain global FL model accuracy.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    In our previous work [15], we jointly optimized the computing time and energy consumption of FL over wireless networks.

    “In our previous work [15], we jointly optimized the computing time and energy consumption of FL over wireless networks.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [15] source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    A federated multitask learning scheme was proposed in [10] by modifying the CoCoA framework.

    “A federated multitask learning scheme was proposed in [10] by modifying the so-called communication-efficient distributed dual coordinate ascent (CoCoA) framework.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [10]

      Not checked in the free run.

  • May combine two claims.

    Premisecitation

    The UEs will respond to the BS-offered reward and choose their local iteration strategy to maximize their own benefits.

    “Correspondingly, the UEs will respond to the BS-offered reward and choose their local iteration strategy (i.e., select a CPU-frequency cycle for local computation) to maximize their own benefits [14].”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [14]

      Not checked in the free run.

    • Rests on an assumption: Heterogeneous UEs have different computational and communication costs for training and, thus, they expect different rewards.
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    To enable a wide variety of machine learning models, CoCoA supports objectives for linear regularized loss minimization.

    “To enable a wide variety of machine learning models, CoCoA supports objectives for linear reguarlized loss minimization [11].”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [11]

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    This adaptive control scheme offers a desirable tradeoff between global model aggregation and local model update to minimize the loss function with resource budget constraint.

    “This adaptive control scheme offers a desirable tradeoff between global model aggregation and local model update to minimize the loss function with resource budget constraint.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [9] source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    In [9] an adaptive control scheme was proposed to adapt the global FL aggregation frequency.

    “In [9] an adaptive control scheme was proposed to adapt the global FL aggregation frequency.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [9] source

      Not checked in the free run.

  • May combine two claims.

    Interpretationreasoning

    For a fixed global FL model accuracy, an increase in computational cost reduces communication cost and vice versa.

    “Therefore, for a fixed global FL model accuracy, an increase in computational cost reduces communication cost and vice versa.”
    Quote in the paperSubstantial claim
14 of 14
  • The paper relies on this without support.

    Federated learning can be a promising solution for enabling IoT-based smart applications.

    “Federated learning can be a promising solution for enabling IoTbased smart applications.”
  • The paper relies on this without support.

    UEs are generally reluctant to participate in FL due to limited computing and communication resources.

    “However, UEs are generally reluctant to participate in FL due to limited computing and communication resources.”
  • The authors state this as an assumption.

    The utility of the BS is modeled as a strictly concave function of key FL performance metrics such as the number of global iterations required to reach global accuracy for a given local relative accuracy.

    “The utility of the BS is modeled as strictly concave function of key FL performance metrics such as the number of global iterations required to reach global accuracy for a given local relative accuracy.”
  • The authors state this as an assumption.

    For the UEs utility, we choose a concave function of the local relative accuracy and the BS-offered reward.

    “For the UEs utility, we choose a concave function of the local relative accuracy and the BS-offered reward.”
  • The paper relies on this without support.

    The allocation of local device computational resources strongly depends on device energy consumption, local learning time, and local learning accuracy.

    “The allocation of local device computational resources strongly depends on the device energy consumption, local learning time, and local learning accuracy.”
  • The paper relies on this without support.

    Heterogeneous UEs have different computational and communication costs for training and, thus, they expect different rewards.

    “However, heterogeneous UEs have different computational and communication costs for training and, thus, they expect different rewards.”
6 of 6

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • FL can assist to mitigate communication expenses, such as data lag and power transmission, associated with transfer of raw data by avoiding the offloading of large data volumes to the server.

    “Health Data Training at a Low Cost: FL can assist to mitigate communication expenses, such as data lag and power transmission, associated with transfer of raw data by avoiding the offloading of large data volumes to the server [97].”
  • FL-AI may assist decrease communication costs, like latency and transmit power, associated with raw data transfer by evading the dumping of large data to the central network because model gradients are often considerably less in size than their real datasets.

    “FL-AI may assist decrease communication costs, like latency and transmit power, associated with raw data transfer by evading the dumping of large data to the central network because model gradients are often considerably less in size than their real datasets [97].”
  • By avoiding offloading huge data volumes to the server, FL reduces communication costs, such as latency and transmit power, consumed by raw data transmission, as model gradients generally have much smaller sizes compared to their actual datasets.

    “By avoiding the offloading of huge data volumes to the server, FL can help reduce significantly communication costs, e.g., latency and transmit power, consumed by raw data transmission, as the model gradients generally have much smaller sizes compared to their actual datasets [32].”

    From Federated learning for smart healthcare: A survey (2023) · cites this paper as [32]

  • Game theory and blockchain are two important tools for designing incentive mechanisms for federated learning.

    “Game theory and blockchain are two important tools for designing incentive mechanisms”

    From Federated learning for smart healthcare: A survey (2023) · cites this paper as [32]

Self-check

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

Each contradiction between two passages listed here was confirmed by an independent check.

  • Figure 3a identifies the wrong x-axis

    Minor

    The text calls relative accuracy the x-axis variable in Fig. 3a, but the figure labels the x-axis "Reward rate" and relative accuracy on the other axis.

1 of 1

Cites

Flagged first, then by citations

Research works printed but not linked: 3

  1. smith, 2017, Federated Multi-Task Learning, Proc Adv Neural Info Process Syst, 4424
  2. han, 2012, Game Theory in Wireless and Communication Networks Theory Models and Applications
  3. dinh, 2019, Federated learning over wireless networks Convergence analysis and resource allocation

Cited by

Sorted by citations

Authors
Khan, L. U., Pandey, S. R., Tran, N. H., Saad, W., Han, Z., Nguyen, M. N. H., & Hong, C. S.
Affiliations
  • Kyung Hee University (KR)
  • The University of Sydney (AU)
  • Virginia Tech (US)
  • University of Houston (US)
Venue
IEEE Communications Magazine
Published
2020-10
Volume
58
Issue
10
Pages
88-93
ISSN
  • 0163-6804 (ISSN-L)
  • 1558-1896
OpenAlex
W2985145906
Cited by
506
References
16
Citations by year
2026: 37 · 2025: 57 · 2024: 87 · 2023: 106 · 2022: 102 · 2021: 92 · 2020: 25
FWCI
31.94
Type
journal article
Language
en
Open access
Locations
  • IEEE Communications Magazine (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • VBN Forskningsportal (Aalborg Universitet) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
  • Physical Sciences › Computer Science › Information Systems › Internet of Things and AI
Keywords
federated learning, edge computing, Internet of Things, resource optimization, incentive mechanisms, Stackelberg game, resource allocation

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.

Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-09.

Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-09.

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