Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2509.12814

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2509.12814 (cs)
[Submitted on 16 Sep 2025 ]

Title: Energy-Efficient Quantized Federated Learning for Resource-constrained IoT devices

Title: 面向资源受限物联网设备的节能量化联邦学习

Authors:Wilfrid Sougrinoma Compaoré, Yaya Etiabi, El Mehdi Amhoud, Mohamad Assaad
Abstract: Federated Learning (FL) has emerged as a promising paradigm for enabling collaborative machine learning while preserving data privacy, making it particularly suitable for Internet of Things (IoT) environments. However, resource-constrained IoT devices face significant challenges due to limited energy,unreliable communication channels, and the impracticality of assuming infinite blocklength transmission. This paper proposes a federated learning framework for IoT networks that integrates finite blocklength transmission, model quantization, and an error-aware aggregation mechanism to enhance energy efficiency and communication reliability. The framework also optimizes uplink transmission power to balance energy savings and model performance. Simulation results demonstrate that the proposed approach significantly reduces energy consumption by up to 75\% compared to a standard FL model, while maintaining robust model accuracy, making it a viable solution for FL in real-world IoT scenarios with constrained resources. This work paves the way for efficient and reliable FL implementations in practical IoT deployments. Index Terms: Federated learning, IoT, finite blocklength, quantization, energy efficiency.
Abstract: 联邦学习(FL)已成为一种有前景的范式,可以在保护数据隐私的同时实现协作机器学习,使其特别适用于物联网(IoT)环境。 然而,资源受限的物联网设备由于能量有限、通信信道不可靠以及假设无限块长度传输不切实际,面临重大挑战。 本文提出了一种用于物联网网络的联邦学习框架,该框架结合了有限块长度传输、模型量化和误差感知聚合机制,以提高能效和通信可靠性。 该框架还优化了上行链路传输功率,以平衡节能和模型性能。 仿真结果表明,与标准FL模型相比,所提出的方法可将能耗降低多达75%,同时保持强大的模型准确性,使其成为在资源受限的实际物联网场景中进行FL的可行解决方案。 这项工作为在实际物联网部署中实现高效可靠的FL铺平了道路。 索引术语: 联邦学习,物联网,有限块长度,量化,能效。
Comments: 6 pages, accepted at IEEE PIMRC 2025
Subjects: Machine Learning (cs.LG) ; Distributed, Parallel, and Cluster Computing (cs.DC)
Cite as: arXiv:2509.12814 [cs.LG]
  (or arXiv:2509.12814v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2509.12814
arXiv-issued DOI via DataCite

Submission history

From: Wilfrid Sougrinoma Compaoré [view email]
[v1] Tue, 16 Sep 2025 08:31:46 UTC (340 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs
cs.DC

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号