Identification of Critical Nodes in Ad-hoc Network Based on Topology Optimization

Abstract

Critical nodes have global significance for the network, the existing methods on the identification of critical nodes in Ad-hoc network usually based on the premise of topology is known, considering that there exists a link if the two nodes are in the other’s communication range, so the topology we get at last is relatively complex, but there are many links that aren’t exist in real which leading the identification of critical nodes with deviation. For this problem, in the paper we used Delaunay triangulation to optimize the network topology, based on identifying virtual backbone nodes by the unified connected dominating set, we measured the importance of the nodes by the average betweenness centrality. Experimental results show that the method proposed can identify the critical nodes in Ad-hoc networks effectively.