The Identification of Critical Nodes in Ad Hoc Network Based on Node Degree and Clustering Coefficient

Although the nodes in the wireless ad hoc network are designed to have similar function and equal status, there still exist some critical nodes that may cause the partition of network topology due to the mobility of nodes and the harsh environment. In this paper, we propose that such critical nodes can be detected by neighbor degree and loop degree. Using this method, the critical nodes can be identified quickly from paths without multihop paths by clustering coefficient. Finally, this paper uses weighted coupling method of node degree and clustering coefficient to analyze the importance of critical nodes, which is helpful to sort and protect the critical nodes.