[an error occurred while processing this directive]
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2009, Vol. 35 Issue (9) :1076-1079    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
�����, ������, ֣ ��, ����*
�������պ����ѧ ������Ϣ����ѧԺ, ���� 100191
Finding most vital node by node importance contribution matrix in communication netwoks
Zhao Yihuan, Wang Zulin, Zheng Jing, Guo Xujing*
School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100191, China

Download: PDF (333KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ ������еĽڵ���Ҫ�����۷���,���ڽڵ���Ƴ����ܵ����������˽ṹ�仯�IJ���,�����һ�����ýڵ��������Ե�ͨ������ڵ���Ҫ�����۷���.�÷�������Ľڵ���Ҫ�Թ��׾���(NICM,Node Importance Contribution Matrix)�����������в�ͬ�ڵ������ӹ�ϵ�Խڵ���Ҫ�Ե�Ӱ��,ÿ���ڵ�������ڽڵ���Ҫ�̶ȵĹ�����ýڵ�Ķ��й�,�ڵ�ij�ʼ��Ҫ����Ϊ�ýڵ�Ľ���.���ø��㷨�Ե�������Ľڵ���Ҫ�Խ����˷���,�������Ƴ��ڵ�ķ��������˶Ա�.ʵ��������,��������㷨���뿼���������˽ṹ�ı仯,�����ȷ������ȷ���۽ڵ��������Դ�Ŀ�������.
Email Alert
�ؼ����� ͨ������   ����Ҫ�ڵ�   ��   ����   ����     
Abstract�� Node importance evaluation based on removal of nodes and their incident links may change the topology of the network, even splits the network into several disconnected parts.The neighbor nodes- node importance contribution matrix (NICM) was defined and an improved node importance evaluation method was proposed. A node-s importance value was initialized as its betweenness. Different node contributed importance value dissimilarly to a certain node, according to its degree and their position relationship. The algorithm was compared with the node-removal based method in the analysis of advanced research project agency(ARPA) net topology. The results show that this algorithm accurately represents the node importance, with less calculation workload and no change of the net topology. Nodes- ability to control the network recourse is also involved in this method.
Keywords�� communication network   most vital node   degree   betweenness   topology     
Received 2008-07-14;


About author: �����(1982-),��,����������,��ʿ��,zhaoyihuan@gmail.com.
�����, ������, ֣ ��, ����.������Ҫ�Թ��׾���ȷ��ͨ����������Ҫ�ڵ�[J]  �������պ����ѧѧ��, 2009,V35(9): 1076-1079
Zhao Yihuan, Wang Zulin, Zheng Jing, Guo Xujing.Finding most vital node by node importance contribution matrix in communication netwoks[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2009,V35(9): 1076-1079
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2009/V35/I9/1076
Copyright 2010 by �������պ����ѧѧ��