Identification of Critical Nodes in Ad Hoc Network Based on the Analysis of Network Partition

Abstract

Identifying critical nodes from the point of view that destructiveness equals to criticality, the traditional identification methods usually consider the degree of damage but does not analyze the type of damage. The critical nodes identified have a certain universality, but the pertinence is not strong. In this paper, a critical node identification method based on the analysis of network partition for Ad Hoc network is proposed. Firstly, the Kernighan-Lin algorithm is applied to group the nodes in the network, and then the boundary nodes between different groups are selected from the grouping results. Finally, the boundary nodes are re-screened by combining the node’s degree value to select the nodes that can lead to the partition of the network. The experimental results show that the failure of identified critical nodes can directly lead to network partitioned into multiple subnets, destroy the connectivity of the network seriously.