基于时变图的大规模自组织网络确定性路由方法OA
Deterministic routing method for large-scale Ad Hoc networks based on time-varying graphs
针对大规模无人机自组织网络无线传输易干扰、路由易失效和资源利用率低等问题,提出了一种基于时变图的大规模自组织网络确定性路由方法.首先,提出了大规模网络拓扑与资源压缩表征方法,该方法按簇表征网络拓扑,将大规模网络压缩为簇规模的分簇网络稀疏图,显著降低了求解路由问题时的网络规模;在此基础上,构建了分簇网络时隙图模型,时隙化表征网络拓扑与链路状态的时变特征,将路由与时隙联合规划问题转换为图中的路由搜索问题;最后设计了基于迪杰斯特拉(Dijkstra)的路由与时隙联合规划算法,在半双工传输和簇间资源分配的时序约束等约束条件下,获得跨簇传输路由.仿真结果表明,所提算法的运行时间相比整数线性规划(ILP)的求解时间降低约93％,且在业务端到端时延和业务编排成功率上表现出与整数线性规划相同的性能水平.所提方法可以显著提升无人机自组织网络的服务质量(QoS)保障能力和资源利用率.
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.
麻涵;张修社;王鹏;陈妍;李红艳
西安电子科技大学空天地一体化综合业务网全国重点实验室,陕西 西安 710071西安导航技术研究所,陕西 西安 710068新加坡科技设计大学,新加坡 487372西安电子科技大学空天地一体化综合业务网全国重点实验室,陕西 西安 710071||西安导航技术研究所,陕西 西安 710068西安电子科技大学空天地一体化综合业务网全国重点实验室,陕西 西安 710071
信息技术与安全科学
自组织网络时变图确定性路由服务质量保障
Ad Hoc networktime-varying graphdeterministic routingQoS guarantee
《通信学报》 2026 (5)
56-68,13
国家自然科学基金资助项目(No.62371374) The National Natural Science Foundation of China(No.62371374)
评论