Efficient Space-Ground Federated Learning Based on Compressed Sensing

Satellite communication (SatCom) networks based on low Earth orbit (LEO) satellites play an important role in the sixth-generation mobile communication network (6G) and Terrestrial-Aerial-Space network. However, traditional SatCom faces the following challenges: 1) The lack of computing power of satellite nodes. 2) Limitations of communication bandwidth. 3) The risk of node data being leaked. To tackle the challenges, in this paper, we propose an efficient space-ground federated learning (FL) algorithm based on compressed sensing (CS). The proposed framework improves upon the existing frameworks by allowing terminal nodes to send quantized data to the central server after compression with a random measurement matrix. Based on that, the central server updates the global model parameters utilizing the result of sparse reconstruction obtain by Bilinear Adaptive Generalized Vector Approximate Message Passing (BAd-GVAMP). Experiments on both independent and identically distributed (IID) datasets and non-IID datasets show that the proposed framework is able to reach high training accuracy while achieving substantial compression of model parameters and communication delay. The proposed framework enables high-efficiency and high-precision space-ground FL by fully utilizing the computing power of terminal nodes, tackling the communication bottleneck problem of SatCom, and protecting node data from leakage.

Authors

Institutions

Publication Details

Published
2024-10-25
DOI
https://doi.org/10.1109/sat-net62854.2024.00017
Primary Topic
Indoor and Outdoor Localization Technologies
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Efficient Space-Ground Federated Learning Based on Compressed Sensing

Zhiyong Luo, Qiyan Fang
Indoor and Outdoor Localization Technologies
article

Efficient Space-Ground Federated Learning Based on Compressed Sensing

Zhiyong Luo, Qiyan Fang
article en

Abstract

Satellite communication (SatCom) networks based on low Earth orbit (LEO) satellites play an important role in the sixth-generation mobile communication network (6G) and Terrestrial-Aerial-Space network. However, traditional SatCom faces the following challenges: 1) The lack of computing power of satellite nodes. 2) Limitations of communication bandwidth. 3) The risk of node data being leaked. To tackle the challenges, in this paper, we propose an efficient space-ground federated learning (FL) algorithm based on compressed sensing (CS). The proposed framework improves upon the existing frameworks by allowing terminal nodes to send quantized data to the central server after compression with a random measurement matrix. Based on that, the central server updates the global model parameters utilizing the result of sparse reconstruction obtain by Bilinear Adaptive Generalized Vector Approximate Message Passing (BAd-GVAMP). Experiments on both independent and identically distributed (IID) datasets and non-IID datasets show that the proposed framework is able to reach high training accuracy while achieving substantial compression of model parameters and communication delay. The proposed framework enables high-efficiency and high-precision space-ground FL by fully utilizing the computing power of terminal nodes, tackling the communication bottleneck problem of SatCom, and protecting node data from leakage.

Sun Yat-sen University (CN)
Research and Development
Affordable and clean energy
Openalex Percentile: Top 76%
Indoor and Outdoor Localization Technologies
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.