Energy-Efficient Hierarchical Federated Anomaly Detection for the Internet of Underwater Things via Selective Cooperative Aggregation
Not on the map. Why?
Abstract (arXiv)
Anomaly detection is a core service in the Internet of Underwater Things, yet training accurate distributed models underwater is difficult because acoustic links are low-bandwidth, energy-intensive, and often unable to support direct sensor-to-surface communication. Standard flat federated learning therefore faces two coupled limitations in underwater deployments: expensive long-range transmissions and reduced participation when only a subset of sensors can reach the gateway. This paper proposes an energy-efficient hierarchical federated learning framework for underwater anomaly detection based on three components: feasibility-aware sensor-to-fog association, compressed model-update transmission, and selective cooperative aggregation among fog nodes. The proposed three-tier architecture localises most communication within short-range clusters while activating fog-to-fog exchange only when smaller clusters can benefit from nearby larger neighbours. A physics-grounded underwater acoustic model is used to evaluate detection quality, communication energy, and network participation jointly. In large synthetic deployments, only about 48% of sensors can directly reach the gateway in the 200-sensor case, whereas hierarchical learning preserves full participation through feasible fog paths. Selective cooperation matches the detection accuracy of always-on inter-fog exchange while reducing its energy by 31-33%, and compressed uploads reduce total energy by 71-95% in matched sensitivity tests. Experiments on three real benchmarks further show that low-overhead hierarchical methods remain competitive in detection quality, while flat federated learning defines the minimum-energy operating point. These results provide practical design guidance for underwater deployments operating under severe acoustic communication constraints.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 50 references that are in the map. First posted on arXiv 25 Mar 2026.
Builds on
20 of 50 references.
References · 20
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2018Federated Optimization in Heterogeneous Networkscited by 2,971
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,531
- 2020Adaptive Federated Optimizationcited by 1,036
- 2019Memorizing Normality to Detect Anomaly: Memory-augmented Deep Autoencoder for Unsupervised Anomaly Detectioncited by 560
- 2020An Efficient Framework for Clustered Federated Learningcited by 505
- 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 496
- 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
- 2020A Unifying Review of Deep and Shallow Anomaly Detectioncited by 423
- 2018Adaptive Federated Learning in Resource Constrained Edge Computing Systemscited by 408
- 2018Sparsified SGD with Memorycited by 373
- 2019A Joint Learning and Communications Framework for Federated Learning over Wireless Networkscited by 262
8 more
- 2021Federated Learning for Internet of Things: A Comprehensive Surveycited by 247
- 2018The Convergence of Sparsified Gradient Methodscited by 228
- 2019Client-Edge-Cloud Hierarchical Federated Learningcited by 202
- 2019Energy Efficient Federated Learning Over Wireless Communication Networkscited by 181
- 2020Federated Learning for Internet of Things: Recent Advances, Taxonomy, and Open Challengescited by 138
- 2020HFEL: Joint Edge Association and Resource Allocation for Cost-Efficient Hierarchical Federated Edge Learningcited by 74
- 20158-Bit Approximations for Parallelism in Deep Learningcited by 56
- 2024FedAA: A Reinforcement Learning Perspective on Adaptive Aggregation for Fair and Robust Federated Learningcited by 5
Built on by
Not cited yet.