基于图着色的大规模无人机群三维网络资源分配算法  

A Three-dimension Resources Allocation Algorithm for Large-scale UAV Network Based on Graph Coloring

作　　者：龚广伟 谢添 赵海涛[1] 魏急波[1] GONG Guangwei;XIE Tian;ZHAO Haitao;WEI Jibo(College of Electronic Science and Technology,National University of Defense Technology,Changsha,Hunan 410000,China)

机构地区：[1]国防科技大学电子科学学院,湖南长沙410000

出　　处：《信号处理》2022年第8期1693-1702,共10页Journal of Signal Processing

基　　金：国家自然科学基金资助项目:大规模无人机群智能组网理论与技术(61931020)。

摘　　要：为了解决大规模无人机集群组网中的网络资源有限、有效分配网络资源难度大的问题,本文针对任意对无人机收发节点构成的通信网络,联合考虑时域、频域、空域,提出了一种基于图着色的三维网络资源分配算法。具体的,本文利用方向回溯阵列天线在传统时频二维网络资源划分的基础上开辟空间维度,得到三维网络资源划分问题。为了解决该三维资源分配问题,本文首先将其建模为图着色问题,然后提出了启发式和贪婪式两种复杂度不同、适应场景也不同的图着色算法,并进一步设计了由着色结果到网络资源分配方案的映射算法。仿真结果验证了所提方法的有效性,相较于传统时分多址接入和时频二维资源分配而言,大大提高了吞吐量和传包成功率。In order to solve the problem of limited network resources and the difficulty of effective resources allocation in large-scale unmanned aerial vehicle(UAV)network,a three-dimensional(time domain,frequency domain,and spatial domain)network resource allocation algorithm based on graph coloring was proposed,which can cope with arbitrary number of UAV transceiver pairs.Specifically,the retro-directive array antenna was adopted to utilize the spatial dimension resource on the basis of the traditional time-frequency network resource partition,which leaded to a three-dimensional network resource partition problem.The problem was then modeled to a graph coloring problem.Heuristic graph coloring algorithm,greedy graph coloring algorithm,and the corresponding mapping algorithm from coloring results to network resource allocation were proposed.Simulation results show that the proposed algorithm greatly improves the throughput and packet success rate compared with the traditional time-division multiple access(TDMA)and time-frequency resource allocation.

关 键 词：无人机网络 网络资源分配 图着色问题 

分 类 号：TN92[电子电信—通信与信息系统]