期刊文献+

指挥信息系统网络节点重要度评估方法 被引量:17

A New Evaluation on Node Importance in Command Information System
原文传递
导出
摘要 针对传统节点重要度评估方法不能很好适用于指挥信息系统(CIS)的问题,提出了一种新的CIS节点重要度评估方法.综合考虑了作战任务需求和网络拓扑结构对节点重要度的影响,使用依赖度和影响度指标共同计算节点重要度.针对不同作战任务进行仿真实验,并研究了打击过程中节点重要度变化趋势.实验结果表明,该方法合理、有效. Evaluation of node importance in command information system (CIS) is of important effects on information warfare. A new evaluation method on node importance is presented, since the traditional evaluation methods could not be well used in CIS. Both mission requirement and network topology are taken into account, and node importance is calculated by indices of reliance and influence. An experiment is designed and conducted in two different missions. The change of node importance in the process of attack is also researched. Experiment shows the rationality and availability of this method.
出处 《北京邮电大学学报》 EI CAS CSCD 北大核心 2011年第4期38-42,共5页 Journal of Beijing University of Posts and Telecommunications
关键词 指挥信息系统 节点重要度 服务功能链 command information system node importance service functional chain
  • 相关文献

参考文献6

  • 1Guo TZ, RongLL, WangJW. A new measure of node importance in complex networks with tunable parameters [ C] //WiCOM '08. Piscataway, N J: Inst of Elee and Elec Eng Computer Society, 2008 : 1-4.
  • 2陈勇,胡爱群,胡啸.通信网中节点重要性的评价方法[J].通信学报,2004,25(8):129-134. 被引量:90
  • 3Wu J, Tan Y J. Finding the most vital node by node contraction in communication networks [ C ] //Proceedings of the 2005 International Conference on Communications, Circuits and Systems. Chengdu: UESTC Press, 2005: 1283-1286.
  • 4饶育萍,林竞羽,周东方.网络抗毁度和节点重要性评价方法[J].计算机工程,2009,35(6):14-16. 被引量:34
  • 5Xing W P, Ghorbani A. Weighted PageRank algorithm [ C]// Proceedings of the Second Annual Conference on Communication Networks and Services Research. Los Angeles, CA: 2004, 305-314.
  • 6Alberts D S, Garstka J J, Stein F P. Network centric warfare: developing and leveraging information superiority [ M ].nd Edition (Reviesd). Washington DC: CCRP Publication Series, 2002 : 115-122.

二级参考文献19

  • 1钟联炯,徐锋.通信网络拓扑抗毁性算法[J].火力与指挥控制,2003,28(z1):113-114. 被引量:9
  • 2陈勇,胡爱群,胡啸.通信网中节点重要性的评价方法[J].通信学报,2004,25(8):129-134. 被引量:90
  • 3吴俊,谭跃进.复杂网络抗毁性测度研究[J].系统工程学报,2005,20(2):128-131. 被引量:120
  • 4陈建国,张永静.通信网络拓扑抗毁性评估算法研究[J].无线电通信技术,2006,32(1):6-7. 被引量:34
  • 5PAGE L, PERRY J. Reliability polynomials and links importance in networks[J]. IEEE Transactions on Reliability, 1994,43(1):51-58.
  • 6TRALDI L. Commentary on: reliability polynomials and links importance in networks[J]. IEEE Transactions on Reliability, 2000,49(3):322.
  • 7RAO V. Most-vital edge of a graph with respect to spanning trees[J]. IEEE Transactions on Reliability, 1998, 47(1):6-7.
  • 8NARDELLI E, PROIETTI G. WIDMAYER P. A faster computation of the most vital edge of a shortest path[J]. Information Processing Letters, 2001, 79(2):81-85.
  • 9CORLEY H, SHAD. Most vital links and nodes in weighted networks[J]. Operations Research Letters, 1982, 1(4): 157-160.
  • 10NARDELLI E, PROIETTI G. WIDMAYER P. Finding the most vital node of a shortest path[A]. COCOON 2001, LNCS 2108[C].Springer-Verlag, 2001.278-287.

共引文献111

同被引文献158

引证文献17

二级引证文献54

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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