跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+352新增论文
+272其中 AI 相关
+39已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 04:58 · 全站最近入库:2026-11-17 04:58各信源进度 →

统计口径与数据新鲜度

统计 2026-11-16 11:55 — 2026-11-17 11:55(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-17 04:58最近发现新增版本:2026-11-17 04:58库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

24,106 已收录论文20,158 AI 相关7,049 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
版本更新 · v2arXiv:2605.02413

Spatial-Temporal Learning-Based Distributed Routing for Dynamic LEO Satellite Networks

Po-Heng Chou, Chiapin Wang, Shou-Yu Chen, Hsiang-Ming Wang, Kuan-Fu Chen

原文摘要

This paper proposes a spatial-temporal learning-based routing framework for dynamic low Earth orbit (LEO) satellite networks. The routing problem is formulated as a partially observable Markov decision process (POMDP), where each satellite independently selects its next hop using network-state observations and destination information. A graph attention network (GAT) extracts spatial features from the dynamic satellite topology and queue states, while a long short-term memory (LSTM) network captures their temporal evolution. The resulting representation is integrated into a deep Q-network (DQN) for destination-aware next-hop selection without a separate traffic-prediction stage. Simulations in a 45-satellite LEO constellation under normal and bursty traffic demonstrate packet delivery performance comparable to a graph neural network (GNN)-enhanced routing baseline, although the proposed method incurs higher delay and queue occupancy. Ablation studies further demonstrate the complementary benefits of spatial and temporal learning.

cs.NI · cs.LG