The avoidance from central node of selected routes by centrality measure
Yoshihiro Kaneko · ITC-CSCC :International Technical Conference on Circuits Systems, Computers and Communications · 2015
An ad-hoc network requires no fixed infrastructure, which is composed of terminals that communicate with each other as well as transmit data like a router. For load balancing, we have proposed to apply node centrality measure, to one of the most popular routing protocol DSDV. Our proposal idea is to avoid nodes located in the central area as far as possible. We have tested its validity on network simulator ns-3. However, its effectiveness seems yet limited at present. Thus, in order to develop our proposal, we observe properties of obtained routes. This paper discusses the relation between relay nodes on those routes and central node in viewpoint of avoidance. First we locate central nodes by three node centrality measures such as closeness, degree and betweenness. We deal with sixty network models with link density 5 to 10%. As a result, we show that betweenness centrality measure always provides single central node. Next we examine how far those obtained routes pass from central node. Finally, of the three measures, we show that closeness centrality-aware routing provides routes whose relay nodes are the most distant on average from central node.