通信学报2026，Vol.47Issue(5)：56-68,13.DOI:10.11959/j.issn.1000-436x.TXXB250689
基于时变图的大规模自组织网络确定性路由方法
Deterministic routing method for large-scale Ad Hoc networks based on time-varying graphs
摘要
Abstract
To address interference,routing failure,and low resource utilization in large-scale UAV Ad Hoc networks,a deterministic routing method based on time-varying graphs was proposed.The network was compressed into a sparse clustered graph through topology and resource aggregation,thereby reducing routing complexity.A clustered time-slot graph model was then constructed to characterize time-varying topology and link states,transforming the joint routing and scheduling problem into a graph search problem.Based on this model,a Dijkstra-based joint routing and scheduling algorithm was designed under half-duplex and temporal resource constraints to obtain inter-cluster transmission routes.Simulation results show that the proposed algorithm reduces runtime by approximately 93％compared with the ILP solver while achieving comparable end-to-end delay and service success rate.The proposed method significantly im-proves QoS guarantee capability and resource utilization in UAV Ad Hoc networks.关键词
自组织网络/时变图/确定性路由/服务质量保障Key words
Ad Hoc network/time-varying graph/deterministic routing/QoS guarantee分类
信息技术与安全科学引用本文复制引用
麻涵,张修社,王鹏,陈妍,李红艳..基于时变图的大规模自组织网络确定性路由方法[J].通信学报,2026,47(5):56-68,13.基金项目
国家自然科学基金资助项目(No.62371374) The National Natural Science Foundation of China(No.62371374) （No.62371374）
