Communication-Efficient Wireless Traffic Prediction with Federated Learning

Wireless traffic prediction is essential to developing intelligent communication networks that facilitate efficient resource allocation. Along this line, decentralized wireless traffic prediction under the paradigm of federated learning is becoming increasingly significant. Compared to traditional c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematics (Basel) 2024-08, Vol.12 (16), p.2539
Hauptverfasser: Gao, Fuwei, Zhang, Chuanting, Qiao, Jingping, Li, Kaiqiang, Cao, Yi
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Wireless traffic prediction is essential to developing intelligent communication networks that facilitate efficient resource allocation. Along this line, decentralized wireless traffic prediction under the paradigm of federated learning is becoming increasingly significant. Compared to traditional centralized learning, federated learning satisfies network operators’ requirements for sensitive data protection and reduces the consumption of network resources. In this paper, we propose a novel communication-efficient federated learning framework, named FedCE, by developing a gradient compression scheme and an adaptive aggregation strategy for wireless traffic prediction. FedCE achieves gradient compression through top-K sparsification and can largely relieve the communication burdens between local clients and the central server, making it communication-efficient. An adaptive aggregation strategy is designed by quantifying the different contributions of local models to the global model, making FedCE aware of spatial dependencies among various local clients. We validate the effectiveness of FedCE on two real-world datasets. The results demonstrate that FedCE can improve prediction accuracy by approximately 27% with only 20% of communications in the baseline method.
ISSN:2227-7390
2227-7390
DOI:10.3390/math12162539