面向杀伤网构建的多无人节点边缘服务覆盖方法  

Multiple Unmanned Nodes Edge Service Coverage Method for Constructing Kill Web

作　　者：赵锦明 吴冠霖 曹江 王双双 杨华 ZHAO Jinming;WU Guanlin;CAO Jiang;WANG Shuangshuang;YANG Hua(Institute of War Studies,Academy of Military Science,Beijing 100091,China;School of Graduate,Academy of Military Science,Beijing 100091,China)

机构地区：[1]军事科学院战争研究院,北京100091 [2]军事科学院研究生院,北京100091

出　　处：《信息工程大学学报》2025年第2期148-153,共6页Journal of Information Engineering University

基　　金：国家自然科学基金(62222121,62341110)。

摘　　要：为应对未来战场无预设战场通信设施条件下为杀伤网构建提供数据采集、通信中继等服务覆盖的问题,基于战场资源分布情况,研究了一种多无人节点边缘服务覆盖方法。首先对通过无人节点为战场资源提供服务覆盖问题进行分析,建立相应的模型;其次对不同资源分布情况下所需无人节点的情况进行分析,设计了一种考虑资源分布情况的近似覆盖算法,重点对算法中孤立点判断、最大团查找、无人节点部署位置确定等问题进行分析;最后通过测试案例对该方法进行测试和验证。结果表明,在资源分布十分分散情况,该方法能够达到最优结果;在资源密集程度较大时,与区域覆盖的结果相当;相较于对比算法,同等情况下该方法所需无人节点数量平均减少了14%到39%,证明该方法可行、有效。To provide data collection and communication relay services for the construction of kill webs in future battlefields without preset communication facilities,a multi-unmanned-nodes edge service coverage method based on resource distribution is studied.Firstly,the problem of providing service coverage for resources via unmanned nodes is analyzed,and a corresponding model is established.Secondly,the situation of unmanned nodes required under different resource distributions is analyzed,and an approximate coverage algorithm considering resource distribution is designed,with foa on isolated points identification maximum,clique searching,unmanned nodes deployment location determination,and soon.Finally,the algorithm is tested and validated by asing test cases.The results obtained indicate that,in cases of highly dispersed resource distribution,the optimal results can be achieved by asing this proposed method.When resource intensity is high,the results are comparable to those of regional coverage.In comparison,the average number of unmanned nodes required in the same situations reduce by 14% to 39%,proving the feasibility and effectiveness of the method.

关 键 词：杀伤网 多无人节点 服务覆盖 最大团 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]