Study on cluster-based dynamic routing algorithm in Power Line Communication network

Chenchen Huang, Yonghai Ning
{"title":"Study on cluster-based dynamic routing algorithm in Power Line Communication network","authors":"Chenchen Huang, Yonghai Ning","doi":"10.1109/ICAL.2012.6308250","DOIUrl":null,"url":null,"abstract":"Power Line Communication (PLC) networks have some characters, such as unpredictable physical topology and time-varying channel. In order to enhance the reliability of PLC networks, cluster-based dynamic routing algorithm is proposed and thoroughly discussed in this paper. This algorithm uses the ideology of minimum identification (ID) clustering algorithm to establish routing and maintain effective routing on-demand. It can reduce the routing overhead to ensure the reliability and stability of the communication routing, and thus enhance the overall performance and efficiency of power line communication network. Simulation result shows that the algorithm has certain validity.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Automation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAL.2012.6308250","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Power Line Communication (PLC) networks have some characters, such as unpredictable physical topology and time-varying channel. In order to enhance the reliability of PLC networks, cluster-based dynamic routing algorithm is proposed and thoroughly discussed in this paper. This algorithm uses the ideology of minimum identification (ID) clustering algorithm to establish routing and maintain effective routing on-demand. It can reduce the routing overhead to ensure the reliability and stability of the communication routing, and thus enhance the overall performance and efficiency of power line communication network. Simulation result shows that the algorithm has certain validity.
电力线通信网络中基于集群的动态路由算法研究
电力线通信(PLC)网络具有物理拓扑不可预测、信道时变等特点。为了提高PLC网络的可靠性,本文提出了一种基于集群的动态路由算法,并对其进行了深入的讨论。该算法采用最小识别(ID)聚类算法的思想,按需建立路由并保持有效的路由。它可以减少路由开销,保证通信路由的可靠性和稳定性,从而提高电力线通信网络的整体性能和效率。仿真结果表明,该算法具有一定的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信