The rank difference of node centrality between global and local graphs

スポンサーリンク

概要

• 論文の詳細を見る

• This paper considers the difference of node centrality measures between global graph and local graphs. The next hop selection in distance vector-based routing motivates the paper. For each node, a subgraph termed a local k-hop graph, is composed of nodes and links obtained from neighboring information of other nodes within k-1 hops from that node. This paper deals with three well-known centrality measures such as degree, closeness and betweenness. For each centrality measure, a rank difference of nodes is defined and compared through simulation experiments. As a result, betweenness centrality measure turns out to provide less rank difference between global graph and local graphs.

• 一般社団法人電子情報通信学会の論文
• 2013-07-04

著者

• Kaneko Yoshihiro

  Faculty Of Engineering Gifu University

• Ishii Yuhei

  Faculty of Engineering, Gifu University

関連論文

• An Optimal File Transfer on a Path Network with 2-level Arc Cost and Positive Demands
• A Synthesis of a Forest-Type Optimal File Transfer on a File Transmission Net with Source Vertices
• On an Optimal File Transfer on an Arborescence-Net with Constraints on Copying Numbers
• An Optimal File Transfer on Networks with Plural Original Files(Regular Sction)
• The Complexity of an Optimal File Transfer Problem
• On a Problem of Designing a 2-Switch Node Network
• B-20-9 The utilization of betwenness for DSDV
• The rank difference of node centrality between global and local graphs
• The rank difference of node centrality between global and local graphs
• The rank difference of node centrality between global and local graphs
• The rank difference of node centrality between global and local graphs

もっと見る 閉じる

スポンサーリンク