检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙方楠 SUN Fangnan(Huaibei Power Supply Company of State Grid Anhui Electric Power Co.,Ltd.,Huaibei 235000,China)
机构地区:[1]国网安徽省电力有限公司淮北供电公司,安徽淮北235000
出 处:《电子设计工程》2025年第1期171-175,共5页Electronic Design Engineering
基 金:安徽省自然科学基金能源互联网联合基金重点项目(2008085UD04)。
摘 要:由于电力通信网链路数量庞大、状态变化频繁且故障类型多样化,易导致业务中断,影响电力通信网络运行的可靠性,为此,提出一种大规模电力通信网链路故障保护算法。采集电力通信网每一段链路的流量数据,利用K-Means算法批量聚类,检测并排除链路故障。引入人工蜂群算法,利用无故障链路重新组建最优通信保护路径,实现大规模电力通信网链路故障保护。测试结果表明,所提方法求出的链路保护方案的路径总长度更短,节点跳数仅为5跳,业务传递耗费总时间更短,由此说明所研究算法的性能更好。Due to the large number of power communication network links,frequent status changes,and diversified fault types,services are easily interrupted and the reliability of the power communication network is affected.Therefore,a link fault protection algorithm for large⁃scale power communication network is proposed.The traffic data of each link in electric power communication network is collected,and the K⁃Means algorithm is used to batch cluster to detect and eliminate link faults.The artificial colony algorithm is introduced to reconstruct the optimal communication protection path using the fault⁃free link to realize the link fault protection of large⁃scale power communication network.The test results show that the total path length of the proposed link protection scheme is shorter,the number of node hops is only 5 hops,and the total service transmission time is shorter,which indicates that the performance of the proposed algorithm is better.
关 键 词:电力通信网 链路故障 K-MEANS算法 人工蜂群算法 通信保护
分 类 号:TN214.98[电子电信—物理电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200