期刊文献+

地域通信网节点重要性评价方法 被引量:1

Evaluation Method for Nodes Importance of Field Communication Network
在线阅读 下载PDF
导出
摘要 为了更全面、更客观地评价地域通信网节点的重要性,提出了综合考虑节点边权值和节点地位双重因素的评价方法,该方法既刻画了节点间的作用细节,又反映出节点在网络中的位置和节点间连接紧密程度,克服了以往无权网络中评价节点重要性存在的不足。最后,通过实例验证了该方法的有效性和全面性。 In order to evaluate the importance of nodes in regional communication network more comprehensively and more objectively,an evaluation method which synthetically considers the edge weight and the position of node is proposed,the method not only depicts the details of roles between the nodes,but also reflects the location of node in the network and the tightness of connectivity between the nodes,and overcomes the shortages of the past on evaluating the importance of nodes in the unweight network. Finally, the effectiveness and comprehensiveness of this method has been verified by examples.
出处 《火力与指挥控制》 CSCD 北大核心 2014年第11期47-50,54,共5页 Fire Control & Command Control
基金 军队预研基金资助项目(51333030103)
关键词 节点重要性 可靠度 时延 节点边权值 节点地位 node importance reliability latency edge weight of node position of node
  • 相关文献

参考文献6

二级参考文献28

  • 1陈勇,胡爱群,胡啸.通信网中节点重要性的评价方法[J].通信学报,2004,25(8):129-134. 被引量:92
  • 2陈建国,张永静.通信网络拓扑抗毁性评估算法研究[J].无线电通信技术,2006,32(1):6-7. 被引量:34
  • 3谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,26(11):79-83. 被引量:265
  • 4PAGE L, PERRY J. Reliability polynomials and links importance in networks[J]. IEEE Transactions on Reliability, 1994,43(1):51-58.
  • 5TRALDI L. Commentary on: reliability polynomials and links importance in networks[J]. IEEE Transactions on Reliability, 2000,49(3):322.
  • 6RAO V. Most-vital edge of a graph with respect to spanning trees[J]. IEEE Transactions on Reliability, 1998, 47(1):6-7.
  • 7NARDELLI 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.
  • 8CORLEY H, SHAD. Most vital links and nodes in weighted networks[J]. Operations Research Letters, 1982, 1(4): 157-160.
  • 9NARDELLI 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.
  • 10SWAMY M, THULASIRAMAN K. Graphs, Networks, and Algorithms[M]. New York: John Wiley & Sons Inc,1981.

共引文献135

同被引文献7

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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