The next hop selection of distance vector by local centrality measure

In network system, the selection of neighboring nodes is fundamental in distance vector-based routing, which we call the next hop selection of neighboring nodes. This paper proposes to apply centrality measure obtained locally for such selection. Suppose that each node can obtain the neighboring information of its neighboring nodes, which forms a subgraph termed a local 2-hop graph. This paper compares three well-known centrality measures such as degree, betweenness and subgraph. Then we select the next hop that provides least centrality measurement. For each route, a relay number of a node is defined. Simulation experiments show that betweenness centrality minimizes the maximum of relay numbers for all node-pair routes.