Evaluation of the node importance in power grid communication network and analysis of node risk

Menghan Zhou, Lanlan Rui, Xue-song Qiu, Zhen Xia, Biyao Li
{"title":"Evaluation of the node importance in power grid communication network and analysis of node risk","authors":"Menghan Zhou, Lanlan Rui, Xue-song Qiu, Zhen Xia, Biyao Li","doi":"10.1109/NOMS.2018.8406214","DOIUrl":null,"url":null,"abstract":"To make an accurate evaluation of node importance in the power grid communication network, we propose an algorithm based on the communication topology layer and the power grid layer to evaluate the importance of the nodes. On the basis of the node contraction algorithm [7], the cut point is assigned a higher weight to reflect the difference between the key nodes and the non-key nodes. Simultaneously, combined with the characteristics of the power grid, the power factor, power service and node failure probability are added to evaluate node importance of power grid communication network objectively. Compared with the node contraction algorithm, the results show that the algorithm in this paper can better distinguish the importance of nodes, and has great reference value for the evaluation of node importance in the power grid communication network. Finally, the algorithm is applied to node risk analysis. By optimizing power service routing, average node risk of entire network can reduce significantly. Therefore, the reliability of network is improved.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"66 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOMS.2018.8406214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

To make an accurate evaluation of node importance in the power grid communication network, we propose an algorithm based on the communication topology layer and the power grid layer to evaluate the importance of the nodes. On the basis of the node contraction algorithm [7], the cut point is assigned a higher weight to reflect the difference between the key nodes and the non-key nodes. Simultaneously, combined with the characteristics of the power grid, the power factor, power service and node failure probability are added to evaluate node importance of power grid communication network objectively. Compared with the node contraction algorithm, the results show that the algorithm in this paper can better distinguish the importance of nodes, and has great reference value for the evaluation of node importance in the power grid communication network. Finally, the algorithm is applied to node risk analysis. By optimizing power service routing, average node risk of entire network can reduce significantly. Therefore, the reliability of network is improved.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
电网通信网络中节点重要性评价与节点风险分析
为了准确评估电网通信网络中节点的重要性,提出了一种基于通信拓扑层和电网层的节点重要性评估算法。在节点收缩算法[7]的基础上,截断点被赋予更高的权值,以反映关键节点与非关键节点之间的差异。同时,结合电网的特点,增加了功率因数、电力服务和节点故障概率,客观地评价了电网通信网节点的重要性。通过与节点收缩算法的比较,结果表明本文算法能够更好地区分节点的重要性,对电网通信网络中节点重要性的评估具有很大的参考价值。最后,将该算法应用于节点风险分析。通过优化供电服务路由,可以显著降低全网平均节点风险。从而提高了网络的可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
SSH Kernel: A Jupyter Extension Specifically for Remote Infrastructure Administration Visual emulation for Ethereum's virtual machine Analyzing throughput and stability in cellular networks Network events in a large commercial network: What can we learn? Economic incentives on DNSSEC deployment: Time to move from quantity to quality
×
引用
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