Zahoor Ali Khan, Muhammad Awais, Turki Ali Alghamdi, Nadeem Javaid
{"title":"Employing topology modification strategies in scale-free IoT networks for robustness optimization","authors":"Zahoor Ali Khan, Muhammad Awais, Turki Ali Alghamdi, Nadeem Javaid","doi":"10.1007/s00607-024-01273-2","DOIUrl":null,"url":null,"abstract":"<p>Nowadays, the Internet of Things (IoT) networks provide benefits to humans in numerous domains by empowering the projects of smart cities, healthcare, industrial enhancement and so forth. The IoT networks include nodes, which deliver the data to the destination. However, the network nodes’ connectivity is affected by the nodes’ removal caused due to the malicious attacks. The ideal plan is to construct a topology that maintains nodes’ connectivity after the attacks and subsequently increases the network robustness. Therefore, for constructing a robust scale-free network, two different mechanisms are adopted in this paper. First, a Multi-Population Genetic Algorithm (MPGA) is used to deal with premature convergence in GA. Then, an entropy based mechanism is used, which replaces the worst solution of high entropy population with the best solution of low entropy population to improve the network robustness. Second, two types of Edge Swap Mechanisms (ESMs) are proposed. The Efficiency based Edge Swap Mechanism (EESM) selects the pair of edges with high efficiency. While the second ESM named as EESM-Assortativity, transforms the network topology into an onion-like structure to achieve maximum connectivity between similar degree network nodes. Further, Hill Climbing (HC) and Simulated Annealing (SA) methods are used for optimizing the network robustness. The simulation results show that the proposed MPGA Entropy has 9% better network robustness as compared to MPGA. Moreover, both the proposed ESMs effectively increase the network robustness with an average of 15% better robustness as compared to HC and SA. Furthermore, they increase the graph density as well as network’s connectivity.</p>","PeriodicalId":10718,"journal":{"name":"Computing","volume":"15 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00607-024-01273-2","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Nowadays, the Internet of Things (IoT) networks provide benefits to humans in numerous domains by empowering the projects of smart cities, healthcare, industrial enhancement and so forth. The IoT networks include nodes, which deliver the data to the destination. However, the network nodes’ connectivity is affected by the nodes’ removal caused due to the malicious attacks. The ideal plan is to construct a topology that maintains nodes’ connectivity after the attacks and subsequently increases the network robustness. Therefore, for constructing a robust scale-free network, two different mechanisms are adopted in this paper. First, a Multi-Population Genetic Algorithm (MPGA) is used to deal with premature convergence in GA. Then, an entropy based mechanism is used, which replaces the worst solution of high entropy population with the best solution of low entropy population to improve the network robustness. Second, two types of Edge Swap Mechanisms (ESMs) are proposed. The Efficiency based Edge Swap Mechanism (EESM) selects the pair of edges with high efficiency. While the second ESM named as EESM-Assortativity, transforms the network topology into an onion-like structure to achieve maximum connectivity between similar degree network nodes. Further, Hill Climbing (HC) and Simulated Annealing (SA) methods are used for optimizing the network robustness. The simulation results show that the proposed MPGA Entropy has 9% better network robustness as compared to MPGA. Moreover, both the proposed ESMs effectively increase the network robustness with an average of 15% better robustness as compared to HC and SA. Furthermore, they increase the graph density as well as network’s connectivity.
期刊介绍:
Computing publishes original papers, short communications and surveys on all fields of computing. The contributions should be written in English and may be of theoretical or applied nature, the essential criteria are computational relevance and systematic foundation of results.