期刊文献+

无人机蜂群网络非合作博弈的功率控制 被引量:2

Non-cooperative Game Power Control in Swarm UAV Networks
下载PDF
导出
摘要 无人机蜂群网络是一种由大量节点组成的分层、多簇结构的无线通信网络。重点研究了多信道条件下功率优化控制问题及措施,提出了一种基于非合作博弈的分布式功率控制方法。该博弈问题的价格因子设计考虑了网络节点重要度因子的影响,每个节点根据连接关系评估得到全网节点的重要度因子。给出了分布式价格功率控制算法。对所提出的算法进行典型场景下的仿真分析,结果表明该算法能够快速收敛,保证簇首、核心节点等高重要度节点的干扰容限,提高网络的可靠性,达到系统总体效用最优。 The network of swarm unmanned aircraft vehicles(UAVs) is a layered multi-cluster structure network composed of a large number of nodes.This paper focuses on the power optimization control under multichannel scenario and proposes a distributed power control method based on non-cooperative game with controlling pricing affected by importance factor of nodes.Each node evaluates the importance factors of the whole network nodes according to the information of connectivity.The power control algorithm of distributed price is given.The simulation analysis of the proposed algorithm in typical scenes shows that the algorithm can quickly converge,guarantee the interference tolerance of nodes more important such as cluster head and core nodes,improve the reliability of the network,and achieve the optimal overall utility of the system.
作者 卿利 QING Li(Southwest China Institute of Electronic Technology,Chengdu 610036,China)
出处 《电讯技术》 北大核心 2019年第7期786-791,共6页 Telecommunication Engineering
关键词 无人机蜂群 功率控制 非合作博弈 重要度 swarm unmanned aircraft vehicle power control non-cooperative game importance factor
  • 相关文献

参考文献1

二级参考文献15

  • 1谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,26(11):79-83. 被引量:257
  • 2吴俊,谭跃进,邓宏钟,迟妍.考虑级联失效的复杂负载网络节点重要度评估[J].小型微型计算机系统,2007,28(4):627-630. 被引量:41
  • 3Watts D J, Strogatz S H. Collective Dynamics of "Small-world" Networks[J]. Nature, 1998, 393(6684): 440-442.
  • 4Barabasi A L, Albert R. Emergence of Scaling in Random Networks[J]. Science, 1999, 286(5439): 509-512.
  • 5Freeman L C. A Set of Measures of Centrality Based upon Betweenness[J]. Sociometry, 1977, 40(1): 35-41.
  • 6Wasserman S, Faust K. Social Network Analysis: Methods and Applications[M]. Cambridge, UK: Cambridge University Press, 1994.
  • 7Corley H W, Sha D Y. Most Vital Links and Nodes in Weighted Networks[J]. Operations Research Letters, 1982, 1(4): 157-160.
  • 8Nardelli E, Proietti G, Widmayer E Finding the Most Vital Node of a Shortest Path[J]. Theoretical Computer Science, 2003, 296(1): 167-177.
  • 9Latora V, Marchiori M. A Measure of Centrality Based on Network Efficiency[J]. New Journalof Physics, 2007, 9(6): 1-11.
  • 10Callaway D S, Newman M E J, Strogatez S H, et al. Network Robustness and Fragility: Percolation on Random Graphs[J]. Phys. Rev. Lett., 2000, 85(25): 5468-5471.

共引文献11

同被引文献11

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部