Computationally efficient topology optimization of scale-free IoT networks

被引:11
|
作者
Khan, Muhammad Awais [1 ]
Javaid, Nadeem [2 ,3 ]
机构
[1] COMSATS Univ Islamabad, Dept Elect & Comp Engn, Islamabad 44000, Pakistan
[2] COMSATS Univ Islamabad, Dept Comp Sci, Islamabad 44000, Pakistan
[3] Univ Technol Sydney, Sch Comp Sci, Ultimo, NSW 2007, Australia
关键词
Betweenness centrality; Closeness centrality; Heat map centrality; Malicious attacks; Scale-free IoT networks; COMPLEX NETWORKS; ROBUSTNESS; ALGORITHM; ATTACKS; MECHANISM; INTERNET; NODES;
D O I
10.1016/j.comcom.2021.12.013
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The malicious attacks in the scale-free Internet of Things (IoT) networks create a serious threat for the functionality of nodes. During the malicious attacks, the removal of high degree nodes greatly affects the connectivity of the remaining nodes in the networks. Therefore, ensuring the maximum connectivity among the nodes is an important part of the topology optimization. A good scale-free network has the ability to maintain the functionality of the nodes even if some of them are removed from the network. Thus, designing a robust network to support the nodes' functionality is the aim of topology optimization in the scale-free networks. Moreover, the computational complexity of an optimization process increases the cost of the network. Therefore, in this paper, the main objective is to reduce the computational cost of the network with the aim of constructing a robust network topology. Thus, four solutions are presented to reduce the computational cost of the network. First, a Smart Edge Swap Mechanism (SESM) is proposed to overcome the excessive randomness of the standard Random Edge Swap Mechanism (RESM). Second, a threshold based node removal method is introduced to reduce the operation of the edge swap mechanism when an objective function converges at a point. Third, multiple attacks are performed in the network to find the correlation between the measures, which are degree, betweenness and closeness centralities. Fourth, based on the third solution, a Heat Map Centrality (HMC) is used that finds the set of most important nodes from the network. The HMC damages the network by utilizing the information of two positively correlated measures. It helps to provide a good attack strategy for robust optimization. The simulation results demonstrate the efficacy of the proposed SESM mechanism. It outperforms the existing RESM mechanism by almost 4% better network robustness and 10% less number of swaps. Moreover, 64% removal of nodes helps to reduce the computational cost of the network.
引用
收藏
页码:1 / 12
页数:12
相关论文
共 50 条
  • [1] Employing topology modification strategies in scale-free IoT networks for robustness optimization
    Khan, Zahoor Ali
    Awais, Muhammad
    Alghamdi, Turki Ali
    Javaid, Nadeem
    COMPUTING, 2024, 106 (06) : 1845 - 1872
  • [2] Scale-free topology for pervasive networks
    Saffre, F
    Jovanovic, H
    Hoile, C
    Nicolas, S
    BT TECHNOLOGY JOURNAL, 2004, 22 (03) : 200 - 208
  • [3] Modeling of cyclic topology in scale-free networks
    Kim, Hyun-Joo
    Choi, Yeon-Mu
    MODERN PHYSICS LETTERS B, 2006, 20 (23): : 1489 - 1496
  • [4] Trading interactions for topology in scale-free networks
    Giuraniuc, CV
    Hatchett, JPL
    Indekeu, JO
    Leone, M
    Castillo, IP
    Van Schaeybroeck, B
    Vanderzande, C
    PHYSICAL REVIEW LETTERS, 2005, 95 (09)
  • [5] Boolean dynamics of networks with scale-free topology
    Aldana, M
    PHYSICA D-NONLINEAR PHENOMENA, 2003, 185 (01) : 45 - 66
  • [6] Efficient routing on scale-free networks
    Zhou, Tao
    INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2007, 21 (23-24): : 4071 - 4075
  • [7] DYNAMICS OF INTERCONNECTED BOOLEAN NETWORKS WITH SCALE-FREE TOPOLOGY
    Damiani, C.
    Villani, M.
    Darabos, Ch.
    Tomassini, M.
    ARTIFICIAL LIFE AND EVOLUTIONARY COMPUTATION, 2010, : 271 - +
  • [8] Scale-free topology evolution for wireless sensor networks
    Zheng, Gengzhong
    Liu, Qiumei
    COMPUTERS & ELECTRICAL ENGINEERING, 2013, 39 (06) : 1779 - 1788
  • [9] Search and topology aspects in transport on scale-free networks
    Tadic, B
    Thurner, S
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2005, 346 (1-2) : 183 - 190
  • [10] Is scale-free a realistic topology for evolving biochemical networks?
    Bersini, H
    Lenaerts, T
    Van den Broeck, W
    Science of Complex Networks: From Biology to the Internet and WWW, 2005, 776 : 227 - 251