Distributed detection of critical nodes in wireless sensor networks using connected dominating set

Abstract

A critical node (cut vertex) in a wireless sensor network (WSN) is a node which its failure divides the network to disconnected parts. Identification of such nodes is the first step in countering against the threats on WSN reliability. In this paper, we propose the Connected Dominating Set based CUT vertex detection (CDSCUT) approach. We define 5 new rules for deciding about the statuses of nodes. The proposed algorithm has O(Δ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) local computation complexity and O(log <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> n) bit complexity per node where n is the node count and Δ is the maximum node degree. The simulation results show that our proposed approach achieves up to 30% improvement in percentage of status detection compared to the previous CDS based approach while consuming similar time and energy.