Efficient time-delay attack detection based on node pruning and model fusion in IoT networks

被引:0
|
作者
Wenjie Zhao
Yu Wang
Wenbin Zhai
Liang Liu
Yulei Liu
机构
[1] Nanjing University of Aeronautics and Astronautics,College of Computer Science and Technology
[2] The Fifth Electronics Research Institute of the Ministry of Industry and Information Technology,undefined
关键词
IoT network; Malicious node detection; Time-delay attack; Model fusion;
D O I
暂无
中图分类号
学科分类号
摘要
IoT devices are vulnerable to various attacks because they are resource-limited. This paper introduces a novel type of attack called time-delay attack. The malicious nodes delay packet forwarding by extending the processing time of packets, thus affecting the performance and availability of the network. This attack is very stealthy and difficult to detect because it does not violate any communication protocol. To the best of our knowledge, how to detect the time-delay attack in IoT networks is still an open problem. We first propose a machine learning-based baseline algorithm to detect the time-delay attack. It models the system features of each node and the forwarding time of packets to detect whether a node is malicious or not. However, the baseline algorithm needs to detect all nodes in the network, which causes unnecessary resource consumption. Moreover, using a single model in the baseline algorithm does not have high robustness. To reduce the overhead and improve the detection performance, we design an efficient Detection algorithm based on Node pruning and Model fusion (DNM). DNM uses node pruning to filter out suspected nodes from all nodes. The suspected nodes are then detected according to a fusion model. We conduct experimental evaluations based on the Cooja network simulator. The experimental results show that baseline and DNM possess close to 90% accuracy, and DNM significantly outperforms other algorithms with an average F1-score of 0.85.
引用
收藏
页码:1286 / 1309
页数:23
相关论文
共 50 条
  • [31] Indirect information propagation model with time-delay effect on multiplex networks
    Zhang, Zehui
    Zhu, Kangci
    Wang, Fang
    CHAOS SOLITONS & FRACTALS, 2025, 192
  • [32] A novel botnet attack detection for IoT networks based on communication graphs
    Munoz, David Concejal
    Valiente, Antonio del-Corte
    CYBERSECURITY, 2023, 6 (01)
  • [33] Mathematical Model of Discrete Logic Bomb with Time-delay in the Computer Networks
    Ge, Shao-Ting
    Liu, Zhimin
    Mao, Aiying
    Kang, Lijuan
    He, Chunhua
    2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2015, : 705 - 710
  • [34] An Optimized Credit Distribution Model in Social Networks with Time-Delay Constraint
    Deng X.
    Cao D.
    Pan Y.
    Shen H.
    Chen Z.
    1600, Science Press (54): : 382 - 393
  • [35] A novel botnet attack detection for IoT networks based on communication graphs
    David Concejal Muñoz
    Antonio del-Corte Valiente
    Cybersecurity, 6
  • [36] Detection of Replica Node Attack Based on Exponential Moving Average Model in Wireless Sensor Networks
    S. Anitha
    P. Jayanthi
    R. Thangarajan
    Wireless Personal Communications, 2020, 115 : 1651 - 1666
  • [37] Detection of Replica Node Attack Based on Exponential Moving Average Model in Wireless Sensor Networks
    Anitha, S.
    Jayanthi, P.
    Thangarajan, R.
    WIRELESS PERSONAL COMMUNICATIONS, 2020, 115 (02) : 1651 - 1666
  • [38] Analysis of Time-Delay Epidemic Model in Rechargeable Wireless Sensor Networks
    Liu, Guiyun
    Li, Junqiang
    Liang, Zhongwei
    Peng, Zhimin
    MATHEMATICS, 2021, 9 (09)
  • [39] Hybrid Machine Learning Model for Efficient Botnet Attack Detection in IoT Environment
    Ali, Mudasir
    Shahroz, Mobeen
    Mushtaq, Muhammad Faheem
    Alfarhood, Sultan
    Safran, Mejdl
    Ashraf, Imran
    IEEE ACCESS, 2024, 12 : 40682 - 40699
  • [40] Optimized Ensemble Model with Genetic Algorithm for DDoS Attack Detection in IoT Networks
    Saiyed, Makhduma F.
    Al-Anbagi, Irfan
    2024 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS, ICC WORKSHOPS 2024, 2024, : 433 - 438