Cited by 19Privacy-Preserving Technologies in DataIoT and Edge/Fog ComputingDistributed Sensor Networks and Detection Algorithms

Optimal Adaptive Power Control for Over-The-Air Federated Edge Learning Under Fading Channels

Yu, Xichen, Xiao, Bingnan, Ni, Wei, Wang, Xin·2023·IEEE Transactions on Communications

Abstract

Channel fading can have a strong impact on the convergence of over-the-air federated edge learning (OTA-FEEL). This paper develops a new and optimal power control policy to minimize the optimality gap of OTA-FEEL under any independently and identically distributed fading. Specifically, we reveal that the optimal power control policy takes a structure where the variance of the effective channel from a device to the server should be minimized when its mean is given. Following this structure, a novel nested optimization algorithm is developed to iteratively minimize the variance using the Lagrange-dual method and then optimize the mean of the effective channel using one-dimensional search. A quasi-closed-form expression of the optimal power control policy is derived. It is shown that the optimal adaptive power control for OTA-FEEL performs an integration of the “channel inverting” strategy and the opposite “channel-proportional” strategy to balance the mean and variance of the effective channel. We also generalize the new policy when the channel statistics are unknown a-priori, and show that the optimal policy can be asymptotically approached over time. Simulations confirm the superiority of the policy to its existing alternatives in the convergence speed and learning accuracy of OTA-FEEL.

Integrity signals

Registry

Crossref · 10.1109/tcomm.2023.3283790

Cites

33 of 33 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • The emerging OTA-WFL may pose new challenges to existing aggregation-phase defenses because the FL server only accesses the aggregated global model, obscuring local models and allowing backdoor attacks to take place unnoticed.

    “the emerging OTA-WFL may pose new challenges to the existing defense mechanisms designed for the aggregation phase due to the fact that the FL server would only access the aggregated global model under OTA-WFL [14], [101]. The local models of individual clients are obscured. While this helps improve the privacy of the individuals' local models to a great extent, it allows backdoor attacks to take”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Yu, X., Xiao, B., Ni, W., & Wang, X.
Affiliations
  • Fudan University (CN)
  • Commonwealth Scientific and Industrial Research Organisation (AU)
Venue
IEEE Transactions on Communications
Published
2023-09
Volume
71
Issue
9
Pages
5199-5213
ISSN
  • 0090-6778 (ISSN-L)
  • 1558-0857
OpenAlex
W4379622636
Cited by
19
References
33
Citations by year
2026: 6 · 2025: 9 · 2024: 4
FWCI
1.79
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Communications (publishedVersion)
Funders
  • Innovation Program of Shanghai Municipal Science and Technology Commission (20JC1416400, 21XD1400300)
  • National Natural Science Foundation of China (62231010, 62071126)
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 › Computer Networks and Communications › Distributed Sensor Networks and Detection Algorithms
Keywords
adaptive power control, fading channels, optimality gap, nested optimization, Lagrange dual method, unknown channel statistics, convergence rate

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