Modified Betweenness Centrality to Identify Relay Nodes in Data Networks

Masaaki Miyashita, Norihiko Shinomiya
Several types of data networks require relay nodes to transmit data because the nodes would impact on services with the networks. Betweenness centrality is one of the measures that reveal important nodes for a network topology. However, the measure does not specialized in relay nodes of survivable networks. This paper proposes a evaluation method to designate the relay nodes in the network modifying betweenness centrality for relay nodes and survivability. In our simulation, we used two routing
more » ... we used two routing algorithms for the survivability of the network and compared the modified measure applying each algorithm with original betweenness centrality. The simulation results show that our approach estimates features different from the original does. The different implies that our method is effective to identify relay nodes.