健壮通信网络的不受攻击性

Wen Changjun, Zhang Xiaomeng
{"title":"健壮通信网络的不受攻击性","authors":"Wen Changjun, Zhang Xiaomeng","doi":"10.1109/ICCSN.2016.7586675","DOIUrl":null,"url":null,"abstract":"Due to the fully connected network with the best invulnerability, and the shortest path number between a node for network invulnerability is important. Based on the fully connected network, the shortest path number for evaluation index, the robust communication network invulnerability of the model is established. A new method of calculation of the shortest path is put forward by using MATLAB in this paper. Calculating the examples, the network of the invulnerability can be concluded. The more symmetrical the robust communication network topology is, the higher the invulnerability is.","PeriodicalId":158877,"journal":{"name":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The invulnerability of robust communication network\",\"authors\":\"Wen Changjun, Zhang Xiaomeng\",\"doi\":\"10.1109/ICCSN.2016.7586675\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the fully connected network with the best invulnerability, and the shortest path number between a node for network invulnerability is important. Based on the fully connected network, the shortest path number for evaluation index, the robust communication network invulnerability of the model is established. A new method of calculation of the shortest path is put forward by using MATLAB in this paper. Calculating the examples, the network of the invulnerability can be concluded. The more symmetrical the robust communication network topology is, the higher the invulnerability is.\",\"PeriodicalId\":158877,\"journal\":{\"name\":\"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSN.2016.7586675\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th IEEE International Conference on Communication Software and Networks (ICCSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSN.2016.7586675","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

由于完全连接的网络具有最佳的不受攻击性,而节点之间的最短路径数对于网络的不受攻击性很重要。以全连通网络为评价指标,以最短路径数为评价指标,建立了鲁棒通信网络抗毁性模型。本文利用MATLAB提出了一种新的最短路径计算方法。通过算例的计算,可以得出不受伤害的网络。鲁棒性通信网络拓扑结构越对称,其抗毁性越高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The invulnerability of robust communication network
Due to the fully connected network with the best invulnerability, and the shortest path number between a node for network invulnerability is important. Based on the fully connected network, the shortest path number for evaluation index, the robust communication network invulnerability of the model is established. A new method of calculation of the shortest path is put forward by using MATLAB in this paper. Calculating the examples, the network of the invulnerability can be concluded. The more symmetrical the robust communication network topology is, the higher the invulnerability is.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信