Modified graph-based algorithm to analyze security threats in IoT

被引:0
|
作者
Arat, Ferhat [1 ]
Akleylek, Sedat [2 ,3 ,4 ]
机构
[1] Samsun Univ, Dept Software Engn, Samsun, Turkiye
[2] Ondokuz Mayis Univ Samsun, Dept Comp Engn, Samsun, Turkiye
[3] Univ Tartu, Tartu, Estonia
[4] Ondokuz Mayis Univ Samsun, Cyber Secur & Informat Technol Res & Dev Ctr, Samsun, Turkiye
关键词
Industrial IoT; Security; Risk assessment; Threat graph; Graph theory; Threats; INDUSTRIAL INTERNET; MANAGEMENT;
D O I
10.7717/peerj-cs.1743
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In recent years, the growing and widespread usage of Internet of Things (IoT) systems has led to the emergence of customized structures dependent on these systems. Industrial IoT (IIoT) is a subset of IoT in terms of applications and usage areas. IIoT presents many participants in various domains, such as healthcare, transportation, agriculture, and manufacturing. Besides the daily life benefits, IIoT technology provides major contributions via the Industrial Control System (ICS) and intelligent systems. The convergence of IoT and IIoT systems brings some integration and interoperability problems. In IIoT systems, devices interact with each other using information technologies (IT) and network space. However, these common usages and interoperability led to some security risks. To avoid security risks and vulnerabilities, different systems and protocols have been designed and published. Various public databases and programs identify and provide some of the security threats to make it easier for system administrators' missions. However, effective and long-term security detection mechanisms are needed. In the literature, there are numerous approaches to detecting security threats in IoT-based systems. This article presents two major contributions: First, a graph-based threat detection approach for IoT-based network systems is proposed. Threat path detection is one of the most critical steps in the security of IoT-based systems. To represent vulnerabilities, a directed acyclic graph (DAG) structure is constructed using threat weights. General threats are identified using Common Vulnerabilities and Exposures (CVE). The proposed threat pathfinding algorithm uses the depth first search (DFS) idea and discovers threat paths from the root to all leaf nodes. Therefore, all possible threat paths are detected in the threat graph. Second, threat path-reducing algorithms are proposed considering the total threat weight, hop length, and hot spot thresholds. In terms of available threat pathfinding and hot spot detecting procedures, the proposed reducing algorithms provide better running times. Therefore, all possible threat paths are founded and reduced by the constructed IoT-based DAG structure. Finally, simulation results are compared, and remarkable complexity performances are obtained.
引用
收藏
页数:28
相关论文
共 50 条
  • [31] A graph-based synthesis algorithm for AND/XOR networks
    Ye, YB
    Roy, K
    [J]. DESIGN AUTOMATION CONFERENCE - PROCEEDINGS 1997, 1997, : 107 - 112
  • [32] An improved Graph-based SNR Estimation Algorithm
    Yang, Li
    Wei, Haoyu
    Hu, Guobing
    Zhu, Wenqing
    [J]. KSII Transactions on Internet and Information Systems, 2024, 18 (10): : 3084 - 3108
  • [33] Abstraction Methods for Solving Graph-Based Security Games
    Basak, Anjon
    Fang, Fei
    Thanh Hong Nguyen
    Kiekintveld, Christopher
    [J]. AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2016, 10003 : 13 - 33
  • [34] Graph-based Event Classification in Grid Security Gateways
    Obert, James
    Chavez, Adrian
    [J]. 2019 SECOND INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE FOR INDUSTRIES (AI4I 2019), 2019, : 63 - 66
  • [35] Graph-based technique for survivability assessment and optimization of IoT applications
    Shakhov, Vladimir
    Koo, Insoo
    [J]. INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2021, 23 (01) : 105 - 114
  • [36] Graph-based technique for survivability assessment and optimization of IoT applications
    Vladimir Shakhov
    Insoo Koo
    [J]. International Journal on Software Tools for Technology Transfer, 2021, 23 : 105 - 114
  • [37] Assessing the performance of a graph-based clustering algorithm
    Foggia, P.
    Percannella, G.
    Sansone, C.
    Vento, M.
    [J]. GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS, 2007, 4538 : 215 - +
  • [38] A parsing graph-based algorithm for ontology mapping
    Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200030, China
    [J]. J. Donghua Univ, 2009, 3 (323-328):
  • [39] WMR - A graph-based algorithm for friend recommendation
    Lo, Shuchuan
    Lin, Chingching
    [J]. 2006 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE, (WI 2006 MAIN CONFERENCE PROCEEDINGS), 2006, : 121 - +
  • [40] INOD: A Graph-Based Outlier Detection Algorithm
    Yang, Lihua
    Li, Guilin
    Zhou, Shaobin
    Liao, Minghong
    [J]. SENSORS, MEASUREMENT AND INTELLIGENT MATERIALS II, PTS 1 AND 2, 2014, 475-476 : 1008 - 1012