Smart City Gnosys
Smart city article details
| Title | Employing Topology Modification Strategies In Scale-Free Iot Networks For Robustness Optimization |
|---|---|
| ID_Doc | 22890 |
| Authors | Khan Z.A.; Awais M.; Alghamdi T.A.; Javaid N. |
| Year | 2024 |
| Published | Computing, 106, 6 |
| DOI | http://dx.doi.org/10.1007/s00607-024-01273-2 |
| 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. © The Author(s), under exclusive licence to Springer-Verlag GmbH Austria, part of Springer Nature 2024. |
| Author Keywords | Assortativity; Entropy; Hill climbing algorithm; Random and malicious attacks; Robustness; Scale-free IoT networks; Simulated annealing algorithm |
Similar Articles
| Id | Similarity | Authors | Title | Published |
|---|---|---|---|---|
3294  | 0.913 | Khan M.A.; Javaid N.; Javaid S.; Khalid A.; Nasser N.; Imran M. | A Novel Cooperative Link Selection Mechanism For Enhancing The Robustness In Scale-Free Iot Networks | 2020 International Wireless Communications and Mobile Computing, IWCMC 2020 (2020) |
| 45493 | 0.9 | Chen N.; Qiu T.; Guo D.-K.; Xu T.-Y. | Research On Lightweight Topology Optimization Strategy Of Internet Of Things Based On Network Motif; [基于网络模体的轻量级物联网拓扑优化策略研究] | Jisuanji Xuebao/Chinese Journal of Computers, 46, 6 (2023) |
| 40645 | 0.9 | Changazi S.A.; Bakhshi A.D.; Yousaf M.; Mohsin S.M.; Akber S.M.A.; Abazeed M.; Ali M. | Optimization Of Network Topology Robustness In Iots: A Systematic Review | Computer Networks, 250 (2024) |
| 46961 | 0.899 | Qiu T.; Chen N.; Zhang S. | Robustness Optimization For Iot Topology | Robustness Optimization for IoT Topology (2022) |
| 22649 | 0.883 | Qureshi T.N.; Khan Z.A.; Javaid N.; Aldegheishem A.; Rasheed M.B.; Alrajeh N. | Elephant Herding Robustness Evolution Algorithm With Multi-Clan Co-Evolution Against Cyber Attacks For Scale-Free Internet Of Things In Smart Cities | IEEE Access, 11 (2023) |
| 39012 | 0.87 | Dhuli S.; Kouachi S.; Chhabra A.; Singh Y.N. | Network Robustness Analysis For Iot Networks Using Regular Graphs | IEEE Internet of Things Journal, 9, 11 (2022) |