4.7 Article

Computationally efficient topology optimization of scale-free IoT networks

期刊

COMPUTER COMMUNICATIONS
卷 185, 期 -, 页码 1-12

出版社

ELSEVIER
DOI: 10.1016/j.comcom.2021.12.013

关键词

Betweenness centrality; Closeness centrality; Heat map centrality; Malicious attacks; Scale-free IoT networks

向作者/读者索取更多资源

This paper focuses on malicious attacks in scale-free Internet of Things (IoT) networks and aims to construct a robust network topology to support node functionality while reducing computational cost. Four solutions are presented, including a Smart Edge Swap Mechanism (SESM) to overcome excessive randomness, a threshold-based node removal method to reduce edge swap operation, correlation analysis of network measures, and the utilization of Heat Map Centrality (HMC) to find important nodes. Simulation results show the effectiveness of the proposed SESM mechanism, with better network robustness and reduced computational cost.
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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据