The rise of the Internet of Things (IoT) has generated significant interest by enabling connectivity across various objects, ranging from the smallest devices to large-scale systems. Despite its benefits, IoT poses considerable security challenges due to the many interconnected devices that collect and transmit sensitive data across networks. Therefore, ensuring robust data protection and preventing unauthorized access or misuse are essential concerns. To address this issue, strategically placing security services within IoT networks is vital for safeguarding both devices and data. One promising strategy for optimizing this placement is the use of the dominating set concept derived from graph theory, which helps in the efficient allocation of security resources. This study presents an IoT network as a simple weighted graph, considering device capabilities while focusing on adopting the dominating set concept to enhance the placement of security services in IoT networks. To achieve this, an enhanced greedy heuristic is proposed for efficiently generating the dominating set. The effectiveness and performance of the proposed approach are evaluated through a comparative analysis combined with existing methods in the recent literature.
Read full abstract