arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.14116cs.LGcs.DCcs.NIeess.SP
收藏

天地一体化网络中的分层学习与计算

Hierarchical Learning and Computing over Space-Ground Integrated Networks

School of Information Science and Technology, ShanghaiTech University(信息科学与技术学院,上海科技大学);Beijing National Research Center for Information Science and Technology, Tsinghua University(信息科学与技术国家研究中心,清华大学)

Jingyang Zhu, Yuanming Shi, Yong Zhou, Chunxiao Jiang, Linling Kuang

AI总结:

针对天地一体化物联网中集中式AI训练的高通信开销与隐私问题,提出结合LEO/GEO卫星的分层学习计算框架,并用TAEER算法求解模型聚合的DST能量最小化问题。

摘要:

天地一体化网络在提供全球连接方面具有巨大前景,尤其是在偏远地区:这些地区的物联网(IoT)设备会产生大量有价值的数据,却缺乏地面通信基础设施。传统上,海量数据会被传输到云服务器,用于集中式人工智能(AI)模型训练,这会带来巨大的通信开销和隐私担忧。为解决该问题,我们提出一种分层学习与计算框架,利用低地球轨道(LEO)卫星的低时延特性以及地球静止轨道(GEO)卫星的全球覆盖能力,为地面 IoT 设备上本地训练的模型提供全球聚合服务。由于卫星网络拓扑具有时变特性,且 LEO 卫星存在能量约束,在 LEO 卫星上高效聚合从地面设备接收的本地模型极具挑战性。我们利用星间连接的可预测性,将空间网络建模为有向图,并将模型聚合的网络能量最小化问题形式化;该问题最终表现为一个 Directed Steiner Tree(DST,有向 Steiner 树)问题。我们提出 topology-aware energy-efficient routing(TAEER,拓扑感知节能路由)算法,通过在替代有向图上寻找最小生成树形图来求解该 DST 问题。在真实天地一体化网络设置下进行的大量仿真表明,所提出的 TAEER 算法显著降低了能耗,并且优于各基准方法。

英文摘要:

Space-ground integrated networks hold great promise for providing global connectivity, particularly in remote areas where large amounts of valuable data are generated by Internet of Things (IoT) devices, but lacking terrestrial communication infrastructure. The massive data is conventionally transferred to the cloud server for centralized artificial intelligence (AI) models training, raising huge communication overhead and privacy concerns. To address this, we propose a hierarchical learning and computing framework, which leverages the lowlatency characteristic of low-earth-orbit (LEO) satellites and the global coverage of geostationary-earth-orbit (GEO) satellites, to provide global aggregation services for locally trained models on ground IoT devices. Due to the time-varying nature of satellite network topology and the energy constraints of LEO satellites, efficiently aggregating the received local models from ground devices on LEO satellites is highly challenging. By leveraging the predictability of inter-satellite connectivity, modeling the space network as a directed graph, we formulate a network energy minimization problem for model aggregation, which turns out to be a Directed Steiner Tree (DST) problem. We propose a topologyaware energy-efficient routing (TAEER) algorithm to solve the DST problem by finding a minimum spanning arborescence on a substitute directed graph. Extensive simulations under realworld space-ground integrated network settings demonstrate that the proposed TAEER algorithm significantly reduces energy consumption and outperforms benchmarks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑