Journal of Computations & Modelling

Significance of Eigenvector Centrality for Routing in a Delay Tolerant Network

• [ Download ]
• Times downloaded: 11131

• Abstract

  Centrality measure is an important concept in networks. It indicates the relative importance of nodes in a network. Various centrality measures have been proposed in the literature, such as degree centrality, closeness centrality etc. Practically all these measures are some values based on the properties of the node concerned. Eigenvector centrality takes into account the centrality value of the neighbours of a node to assign a centrality value to it. In this paper, we show how this value can be utilized to select relay nodes in a delay tolerant network and improve the delivery delay.