mlsanityData to 14 Oct 2026

CARGO: Carbon-Aware Gossip Orchestration in Smart Shipping

arXiv 2603.27857 ↗First posted 29 Mar 2026cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Smart shipping operations increasingly depend on collaborative AI, yet the underlying data are generated across vessels with uneven connectivity, limited backhaul, and clear commercial sensitivity. In such settings, server-coordinated FL remains a weak systems assumption, depending on a reachable aggregation point and repeated wide-area synchronization, both of which are difficult to guarantee in maritime networks. A serverless gossip approach therefore represents a more natural approach, but existing methods still treat communication mainly as an optimization bottleneck, rather than as a resource that must be managed jointly with carbon cost, reliability, and long-term participation balance. In this context, this paper presents CARGO, a carbon-aware gossip orchestration framework for smart-shipping. CARGO separates learning into a control and a data plane. The data plane performs local optimization with compressed gossip exchange, while the control plane decides, at each round, which vessels should participate, which communication edges should be activated, how aggressively updates should be compressed, and when recovery actions should be triggered. We evaluate CARGO under a predictive-maintenance scenario using operational bulk-carrier engine data and a trace-driven maritime communication protocol that captures client dropout, partial participation, packet loss, and multiple connectivity regimes, derived from mobility-aware vessel interactions. Across the tested stress settings, CARGO consistently remains in the high-accuracy regime while reducing carbon footprint and communication overheads, compared to accuracy-competitive decentralized baselines. Overall, the conducted performance evaluation demonstrates that CARGO is a feasible and practical solution for reliable and resource-conscious maritime AI deployment.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 47 references that are in the map. First posted on arXiv 29 Mar 2026.

Builds on

15 of 47 references.

References · 15

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2019Green AIcited by 627
  3. 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 502
  4. 2019Fair Resource Allocation in Federated Learningcited by 394
  5. 2018Sparsified SGD with Memorycited by 376
  6. 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 310
  7. 2020Towards the Systematic Reporting of the Energy and Carbon Footprints of Machine Learningcited by 249
  8. 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 221
  9. 2018Stochastic Gradient Push for Distributed Deep Learningcited by 152
  10. 2022The Cost of Training Machine Learning Models over Distributed Data Sourcescited by 18
  11. 2022An Energy and Carbon Footprint Analysis of Distributed and Federated Learningcited by 16
  12. 2023Green Federated Learningcited by 8
3 more
  1. 2019Hybrid Satellite-Terrestrial Communication Networks for the Maritime Internet of Things: Key Technologies, Opportunities, and Challengescited by 3
  2. 2022FedComm: Understanding Communication Protocols for Edge-based Federated Learningcited by 2
  3. 2024Context-Aware Orchestration of Energy-Efficient Gossip Learning Schemescited by 1

Built on by

Not cited yet.