Application of entropy of centrality measures to routing in tactical wireless networks

Various Centrality measures such as Degree, Closeness, and Betweenness were introduced in order to analyze networks and understand both the global dynamics of the networks and the roles played by individual nodes. It will be worthwhile to rank the centrality measures of each node and an index of the distribution of centrality measures in the entire network. In this paper, we define the notion of entropy of centrality measures, which extends the concept of centrality to the whole network. We show that this measure has wide range of applications, in network design, from designing maximally efficient networks to identifying dominance of one node or link in the context of entire network. In particular, we present an application to tactical wireless networks.