Employing topology modification strategies in scale-free IoT networks for robustness optimization

IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, THEORY & METHODS Computing Pub Date : 2024-03-12 DOI:10.1007/s00607-024-01273-2
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.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在无标度物联网网络中采用拓扑修改策略优化鲁棒性
如今,物联网(IoT)网络通过支持智能城市、医疗保健、工业提升等项目,在众多领域为人类造福。物联网网络包括将数据传送到目的地的节点。然而,恶意攻击导致的节点移除会影响网络节点的连接性。理想的方案是构建一种拓扑结构,在受到攻击后保持节点的连通性,从而提高网络的鲁棒性。因此,为了构建鲁棒的无标度网络,本文采用了两种不同的机制。首先,采用多群体遗传算法(MPGA)来处理 GA 过早收敛的问题。然后,采用基于熵的机制,用低熵种群的最优解替换高熵种群的最差解,以提高网络的鲁棒性。其次,提出了两种边缘交换机制(ESM)。基于效率的边缘交换机制(ESM)选择效率高的边缘对。第二种机制被称为 EESM-排列组合机制,它将网络拓扑结构转化为洋葱状结构,以实现相似度网络节点之间的最大连通性。此外,还采用了爬山法(HC)和模拟退火法(SA)来优化网络的鲁棒性。仿真结果表明,与 MPGA 相比,拟议的 MPGA Entropy 的网络鲁棒性提高了 9%。此外,与 HC 和 SA 相比,提出的两种 ESM 都能有效提高网络鲁棒性,平均提高 15%。此外,它们还提高了图密度和网络的连通性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computing
Computing 工程技术-计算机:理论方法
CiteScore
8.20
自引率
2.70%
发文量
107
审稿时长
3 months
期刊介绍: 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.
期刊最新文献
Mapping and just-in-time traffic congestion mitigation for emergency vehicles in smart cities Fog intelligence for energy efficient management in smart street lamps Contextual authentication of users and devices using machine learning Multi-objective service composition optimization problem in IoT for agriculture 4.0 Robust evaluation of GPU compute instances for HPC and AI in the cloud: a TOPSIS approach with sensitivity, bootstrapping, and non-parametric analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1