Abstract

A subset S of vertices of a graph G is a dominating set if every vertex outside S is adjacent to some vertex in S. A dominating set S is an outer-independent dominating set if there is no edge within the verti-ces of G-S. A method for deploying security services within an IoT network according to devices capabilities is given by Godquin et al. in [Journal of Information Security and Applications 55 (2020) 102640] in which an IoT network is modeled as a graph using device capabilities. They proposed a formula for the protection according to the vertex placement on dominating sets by computing the percentage of vertex pairs from the graph that have at least one shortest secured path. In this short paper, we propose a new formula for the protec-tion and prove that all graphs reach the protection of 100% provided that the secure nodes form an outer-independent dominating set.