Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2506.09703

Help | Advanced Search

Computer Science > Networking and Internet Architecture

arXiv:2506.09703 (cs)
[Submitted on 11 Jun 2025 (v1) , last revised 13 Jun 2025 (this version, v2)]

Title: Multi-Level Damage-Aware Graph Learning for Resilient UAV Swarm Networks

Title: 多级损伤感知图学习用于弹性无人机群网络

Authors:Huan Lin, Chenguang Zhu, Lianghui Ding, Feng Yang
Abstract: Unmanned aerial vehicle (UAV) swarm networks leverage resilient algorithms to address communication network split issues and restore connectivity. However, existing graph learning-based resilient algorithms face over-aggregation and non-convergence problems caused by uneven and sparse topology under massive damage scenarios. To alleviate these problems, we propose a novel Multi-Level Damage-Aware Graph Learning (ML-DAGL) algorithm, which generates recovery trajectories by mining information from destroyed UAVs. We first introduce a Multi-Branch Damage Attention (MBDA) module, which forms a sequence of multi-hop Damage Attentive Graphs (mDAG) with different ranges of receptive fields. Each mDAG links only remaining and damaged nodes to ensure a more even degree distribution for mitigating over-aggregation, and utilizes multi-hop dilation to establish more links for sparse topology enhancement. To resort to the mDAG, we propose a Dilated Graph Convolution Network (DGCN), which generates the optimal recovery trajectories with theoretically proven convergence under massive damage cases. Simulation results show that the proposed algorithm can guarantee the connectivity restoration under large swarm and damage scales, while significantly expediting the recovery time by 75.94% and improving the topology uniformity after recovery.
Abstract: 无人机(UAV)集群网络利用鲁棒性算法解决通信网络分裂问题并恢复连接。然而,现有的基于图学习的鲁棒性算法在面对大规模损伤情况下因拓扑分布不均和稀疏导致过聚合和非收敛问题。为缓解这些问题,我们提出了一种新颖的多级损伤感知图学习(ML-DAGL)算法,该算法通过挖掘受损无人机的信息生成恢复轨迹。我们首先引入一个多分支损伤注意力(MBDA)模块,形成一系列具有不同感受野范围的多跳损伤注意图(mDAG)。每个mDAG仅连接剩余节点和受损节点以确保更均匀的度分布来减轻过聚合,并利用多跳扩张建立更多链接以增强稀疏拓扑。为了使用mDAG,我们提出了一个扩张图卷积网络(DGCN),在大规模损伤情况下理论上证明了其收敛性并生成最优恢复轨迹。仿真结果显示,所提出的算法能够在大规模集群和损伤规模下保证连接恢复,同时显著加速恢复时间达75.94%,并在恢复后提高拓扑均匀性。
Comments: 15 pages. arXiv admin note: text overlap with arXiv:2411.11342
Subjects: Networking and Internet Architecture (cs.NI)
MSC classes: 68M18
ACM classes: C.2.1
Cite as: arXiv:2506.09703 [cs.NI]
  (or arXiv:2506.09703v2 [cs.NI] for this version)
  https://doi.org/10.48550/arXiv.2506.09703
arXiv-issued DOI via DataCite

Submission history

From: Huan Lin [view email]
[v1] Wed, 11 Jun 2025 13:15:36 UTC (7,691 KB)
[v2] Fri, 13 Jun 2025 13:57:04 UTC (7,688 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.NI
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号