Home // ACHI 2015, The Eighth International Conference on Advances in Computer-Human Interactions // View article

Modified Betweenness to Analyze Relay Nodes to Identify Relay Nodes in Data Networks

Authors:
Masaaki Miyashita
Norihiko Shinomiya

Keywords: Betweenness centrality, Graph theory, Data networks

Abstract:
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 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.

Pages: 55 to 56

Copyright: Copyright (c) IARIA, 2015

Publication date: February 22, 2015

Published in: conference

ISSN: 2308-4138

ISBN: 978-1-61208-382-7

Location: Lisbon, Portugal

Dates: from February 22, 2015 to February 27, 2015