ArticleSensors (Basel, Switzerland)2026
Adaptive Compressed Sensing Differential Privacy Federated Learning Based on Orbital Spatiotemporal Characteristics in Space-Air-Ground Networks.
Article in Sensors (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed.
- Research on Covert Communication in Satellite-Ground-Integrated Sensor Networks Based on FH-DL-MPWFRFT.Sensors (Basel, Switzerland) · 2026Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
Abstract
With the development of 6G communication technology, Space-Air-Ground Integrated Networks (SAGINs) have become critical infrastructure for global intelligent collaborative computing. However, federated learning deployment in SAGINs faces three severe challenges: the high dynamics of satellite orbital motion, node resource heterogeneity, and privacy vulnerabilities in data transmission. This paper proposes an adaptive compressed sensing differential privacy federated learning framework based on orbital spatiotemporal characteristics. First, we design orbital periodicity-driven time-varying sparse sensing matrices that dynamically adjust compression strategies according to satellite orbital positions, achieving intelligent communication efficiency optimization. Second, we propose an orbital predictability-based privacy budget temporal allocation mechanism and perform differential privacy noise injection in the compressed domain, establishing a compression-privacy joint optimization algorithm. Furthermore, we construct an energy-communication-privacy ternary collaborative mechanism that achieves multi-objective dynamic balance through model predictive control. Finally, we design reinforcement learning-based dynamic routing scheduling and hierarchical aggregation strategies to effectively handle the time-varying characteristics of network topology. Simulation experiments demonstrate that compared to existing methods, the proposed approach achieves 3-12% improvement in model accuracy and 30-50% enhancement in communication efficiency while maintaining differential privacy protection with dynamic privacy budget ε∈[0.1,10.0] and compression ratio ρ∈[0.2,0.8]. Unlike static compressed sensing approaches that ignore orbital periodicity, the proposed orbital-driven time-varying sensing matrices reduce reconstruction error by up to 19.4% compared to fixed-matrix baselines, validating the synergistic effectiveness of integrating orbital spatiotemporal characteristics with federated learning in 6G SAGIN deployments. The framework assumes reliable orbital propagation via SGP4/SDP4 models and does not account for Doppler frequency shifts or inter-satellite link handover delays; future extensions include scalability to mega-constellations and integration of quantum-resistant privacy mechanisms.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.