期刊文献+

基于“保障重心”的作战网络拓扑重构方法

Operational Network Topology Reconfiguration Based on Focus of Support
原文传递
导出
摘要 针对精确作战的网络组织需求,提出了一种基于"保障重心"概念模型的作战网络拓扑重构方法:从指挥视角出发,以指挥流程为主线,围绕任务紧要性特点组织作战网络的拓扑重构。对"保障重心"概念模型进行了规范化描述,剖析了"保障重心"与作战网络拓扑重构的关联性。围绕"保障重心"的数据信息流特征及通联需求,构建了以提升网络通信能力和抗毁能力为目标的作战网络拓扑重构模型。最后,通过应用实例进行了验证,结果表明:该方法可显著提升重构网络的传输能力,为开展精确作战、指挥和保障研究提供了方法支撑。 Oriented to the requirement of network organization in precise operations,a combat network topology reconfiguration method based on the conceptual model of 'focus of support'is proposed: from the command perspective,with the command process as the main line,the network topology reconfiguration is organized around the characteristics of mission criticality. The conceptual model of 'focus of support'is described in a standardized way,the correlation between ' focus of support' and the reconfiguration of operational network topology is analyzed. Focusing on the data and information flow characteristics and communication needs,a combat network topology reconstruction model is built aiming at improving network communication capability and survivability. Finally,it is verified by an application example. The results show that this method can significantly improve the transmission capability of the reconfigurable network,and provide methodological support for the research of precise operation,command and support.
作者 侯剑锋 贺晔 王会涛 HOU Jian-feng;HE Ye;WANG Hui-tao(Information and Communications College,National University of Defense Technology of PLA,Wuhan 430014,China)
出处 《装甲兵工程学院学报》 2018年第6期80-85,共6页 Journal of Academy of Armored Force Engineering
基金 国家社会科学基金资助项目(14GJ003-027)
关键词 保障重心 拓扑重构 目标函数 关联性 focus of support topology reconfiguration objective function correlation
  • 相关文献

参考文献3

二级参考文献30

  • 1马骏,唐方成,郭菊娥,席酉民.复杂网络理论在组织网络研究中的应用[J].科学学研究,2005,23(2):173-178. 被引量:58
  • 2周涛,傅忠谦,牛永伟,王达,曾燕,汪秉宏,周佩玲.复杂网络上传播动力学研究综述[J].自然科学进展,2005,15(5):513-518. 被引量:72
  • 3李德毅,王新政,胡钢锋.网络化战争与复杂网络[J].中国军事科学,2006,19(3):111-119. 被引量:58
  • 4Albert R, Barabdsi A L. Statistical mechanics of complexnetworks[J ]. Review of Modem Physics, 2002, 74 ( 1 ) : 47-97.
  • 5Erd6s P, R6nyi A. On the evolution of random graphs[Jl. Publication of Mathematical Institute of Hungarian Academy of Science, 1960, 5: 17-60.
  • 6Barabdsi A L, Albert R. Emergence of scaling in random networks[J]. Science, 1999,286(5439): 509-512.
  • 7Duch J, Arenas A. Effect of random failures on traffic in complex networks[C]//Proceedings-SPIE the International Society for Optical Engineering, 2007,6601 : 66010.
  • 8He Shan, Li Sheng, Ma Hongru. Effect of edge removal on topological and functional robustness of complex networks[J ]. Physica A, 2009,388( 11 ) : 2243 - 2253.
  • 9Cormen T H, Leiserson C E, Rivest R L, et at. Introduction to Algorithms[ M]. 2nd ed. The MIT Prexs, 2001: 386 - 388.
  • 10(3ohen R, Havlin S. Scale-free networks are uhrasmall[J ]. Physical Review Letters, 2003, 90(5):058701.

共引文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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