A distributed algorithm for secure dominating set problem in IoT networks

In this paper, we introduce a heuristic-based distributed approach to address the Secure Dominating Set Problem (SDSP) in Internet of Things (IoT) networks. The SDSP is a critical variant of the Dominating Set Problem (DSP), incorporating security and resilience constraints. It involves identifying the minimal subset of nodes that not only forms a dominating set but also ensures that any potential swap within the set preserves its dominating properties. The proposed approach operates in two phases. Phase I involves a spanning tree construction algorithm based on the flooding protocol. In Phase II, we propose a new distributed algorithm called SDSTree, which identifies secure dominating nodes from the spanning tree. We provide a detailed description of the proposed algorithm and analyze its convergence complexity. The performance of the proposed algorithm is rigorously evaluated through simulations using the CupCarbon tool, which is widely recognized for modeling and simulating IoT networks. Compared to an existing method for the DSP in IoT networks, the SDSTree algorithm demonstrates superior performance, achieving faster execution times and requiring fewer message exchanges across various network sizes.