Green Offloading and Model Size Adaptation for Federated Learning in IoT and Next-Generation Networks

Federated learning (FL) trains models across geographically dispersed clients whose electricity carries very different carbon intensities. We present FedGreenCS, a carbon-aware approach to FL for IoT and next-generation networks. Clients are first grouped by data distribution similarity, using pairwise cosine similarity of model weights after a single local epoch. In each subsequent round, a sampled client whose carbon intensity exceeds a fixed tolerance offloads its training to the lowest-carbon available peer in its similarity cluster, while clients within the tolerance participate unchanged. Ordered dropout gives clients with a higher carbon intensity a narrower model. We derive a carbon cost model that separates computation and communication for each client and round, isolates the cost of the mandatory first-round broadcast, and states the design over the scaling rates and the tolerance. On a non-IID EMNIST partition with real regional carbon intensities, FedGreenCS with three carbon clusters reaches 70% test accuracy at 3.15 to 3.36 g CO2 of client-side carbon cost over three seeds, against 3.58 g for FedGreen and 15.12 g for FedAvg. With one model width for all clients, the offloading cuts this cost by 23% to 58%, but it raises the cost with two carbon clusters and always needs more rounds.

Authors

Institutions

Publication Details

Journal
Future Internet
Published
2026-10-14
DOI
https://doi.org/10.3390/fi18100553
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Green Offloading and Model Size Adaptation for Federated Learning in IoT and Next-Generation Networks

Xin Wang, Khoa Nguyen, Ali Abbasi, Yunkai Bao et al.
Future Internet
Privacy-Preserving Technologies in Data
article

Green Offloading and Model Size Adaptation for Federated Learning in IoT and Next-Generation Networks

Xin Wang, Khoa Nguyen, Ali Abbasi, Yunkai Bao, Steve Drew
article en

Abstract

Federated learning (FL) trains models across geographically dispersed clients whose electricity carries very different carbon intensities. We present FedGreenCS, a carbon-aware approach to FL for IoT and next-generation networks. Clients are first grouped by data distribution similarity, using pairwise cosine similarity of model weights after a single local epoch. In each subsequent round, a sampled client whose carbon intensity exceeds a fixed tolerance offloads its training to the lowest-carbon available peer in its similarity cluster, while clients within the tolerance participate unchanged. Ordered dropout gives clients with a higher carbon intensity a narrower model. We derive a carbon cost model that separates computation and communication for each client and round, isolates the cost of the mandatory first-round broadcast, and states the design over the scaling rates and the tolerance. On a non-IID EMNIST partition with real regional carbon intensities, FedGreenCS with three carbon clusters reaches 70% test accuracy at 3.15 to 3.36 g CO2 of client-side carbon cost over three seeds, against 3.58 g for FedGreen and 15.12 g for FedAvg. With one model width for all clients, the offloading cuts this cost by 23% to 58%, but it raises the cost with two carbon clusters and always needs more rounds.

Future InternetVol. 18(10)
University of Calgary (CA), Carleton University (CA)
Alberta Innovates, Natural Sciences and Engineering Research Council of Canada
Climate action, Industry, innovation and infrastructure
Openalex Percentile: Top 13%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.