期刊文献+

一种评价通信网节点重要性的新方法——节点孤立法 被引量:8

A new method for finding the most vital node in communication networks——node-isolation
在线阅读 下载PDF
导出
摘要 提出了一种评价通信网节点重要性的新方法——节点孤立法,并提出了节点核度积的概念,认为通信网中最重要的节点是孤立后所对应的节点核度积最大的节点。该方法考虑了网络的连接状况,并且动态地考虑了网络中所有节点相互通信的最短路径总长度的增加值。该方法是基于全网性能对节点重要性进行评价,通过比较节点的核度积,判断通信网中任意两个节点的相对重要性,而且使用了一种模2的矩阵运算方法,可以快速得到节点通信的最短路径。理论分析和仿真实验结果表明,该方法的计算复杂度和对节点重要性评价的准确性优于其它算法。 In the paper, a node-isolation method for finding the most vital node in communication networks is proposed and the product of core and degree is defined. It considers the most vital node is the ,one whose isolation results in the largest product of core and degree. The method considers the conjunction cond/tions of networks and the increase of the total length of the shortest peer-to-peer communication path. The node-isolation method evaluates the node importance based on the performance of the whole network. The relative importance of two nodes in the network is compared in terms of the product of core and degree. The theoretical analyses and experimental results show that the computation complexity and the evaluation veracity of the proposed method outperform the conventional algorithms owing to its fast calculation property of the shortest peer-to-peer path.
出处 《高技术通讯》 CAS CSCD 北大核心 2008年第7期673-678,共6页 Chinese High Technology Letters
基金 863计划(2006AA01Z268)资助项目
关键词 通信网 节点重要性 节点孤立 核度积 communication networks, node importance, node-isolation, product of core and degree
作者简介 男,1981年生,博士生;研究方向:通信网可靠性;联系人,E-mail:jybio@126.com
  • 相关文献

参考文献14

  • 1Ball M O, Golden B L, Vohra R V. Finding the most vital arcs in a network. Operations Research Letters, 1989,8(2): 73-76
  • 2Lin K C, Chem M S. The fuzzy shortest path problem and its most vital arcs. Fuzzy Sets and Systems, 1993,58(3) : 343-353.
  • 3Lin K C, Chem M S. The single most vital arc in the most economical path problem A parametric analysis. Computers & Operations Research, 1994,21(3): 353-358
  • 4Nardelli E, Proietti G, Widmayer P. A faster computation of the most vital edge of a shortest path. Information Processing Letters, 2001,79(2): 81-85
  • 5Mahk K, Mittal A K, Gupta S K. The k most vital arcs in the shortest path problem. Operations Research Letters, 1990, 9 (4) : 283
  • 6Corley H W, Sha D Y. Most vital links and nodes in weighted networks. Operations Research Letters, 1982,1(4): 157-160
  • 7Nardelli E, Proietti G, Widmayer P. Finding the most vital node of a shortest path. Theoretical Computer Science, 2003, 296(1) : 167-177
  • 8Yan H H. The most vital node of the shortest path under uncertainty. In: 2006 International Conference on Computational Intelligence and Security, Guangzhou, 2006. 912-915
  • 9Wu J, Tan Y J. Finding the most vital node by node contraction in communication networks. In: 2005 IEEE International Conference on Communications, Circuits and Systems Proceeding, Changsha, 2005. 1283-1286
  • 10陈勇,胡爱群,胡骏,陈立全.通信网中最重要节点的确定方法[J].高技术通讯,2004,14(1):21-24. 被引量:48

二级参考文献3

共引文献47

同被引文献89

引证文献8

二级引证文献30

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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