任务牵引的无人机辅助路由和信道规划方法  

Task-Oriented UAV-Assisted Routing and Channel Allocation Approach

作　　者：孙伟皓 王海 秦蓁 秦子超 SUN Weihao;WANG Hai;QIN Zhen;QIN Zichao(College of Communications Engineering,Army Engineering University of PLA,Nanjing 210007,China;Noncommissioned Officer School of PAP,Hangzhou 310000,China)

机构地区：[1]陆军工程大学通信工程学院,江苏南京210007 [2]武警士官学校,浙江杭州310000

出　　处：《陆军工程大学学报》2023年第6期17-24,共8页Journal of Army Engineering University of PLA

基　　金：国家自然科学基金(62171465)。

摘　　要：无人机可搭建空域骨干网络提供中继转发服务。在资源受限的战场通信网络,执行不同任务的用户遂行不同的通信业务,具有不同的传输需求和重要性。如何有效规划路由和信道分配策略,最大化网络的总效益是值得研究的问题。为了求解该问题,将链路信道分配子问题建模为拥塞博弈,提出了基于并行最优响应的算法。基于所提的信道分配策略,将路由规划子问题建模为匹配博弈,提出了基于多对一匹配和最大容量路径的算法。利用势能博弈理论,分析了算法的收敛性。通过仿真实验验证了所提算法的有效性和可扩展性,能够有效提升任务的总效益。UAVs can be used to construct aerial backbone networks to provide multi-hop routing services.In resource-constrained battlefield communication networks,users performing different tasks carry out different communication services and have different transmission requirements.It is worthwhile to effectively plan routing and channel allocation strategies to maximize the network-wide task utility.To address this problem,firstly,the link channel allocation subproblem is modelled as a congestion game and a parallel best response-based link channel allocation algorithm is proposed.Secondly,based on the proposed link channel allocation algorithm,the routing planning subproblem is modelled as a matching game and a many-to-one matching and maximal path capacity-based algorithm is proposed.Finally,the convergence of the proposed algorithm is analyzed using potential game theory.The simulation results demonstrate the effectiveness and scalability of the proposed algorithm,which can effectively improve the overall task utility.

关 键 词：无人机辅助通信 博弈论 路由规划 信道分配 

分 类 号：V279[航空宇航科学与技术—飞行器设计] TN929.5[电子电信—通信与信息系统]