智能电网中的路由开销优化

Owais Khan, Kumaran Vijayasankar, Ramanuja Vedantham
{"title":"智能电网中的路由开销优化","authors":"Owais Khan, Kumaran Vijayasankar, Ramanuja Vedantham","doi":"10.1109/ISPLC.2015.7147595","DOIUrl":null,"url":null,"abstract":"This paper presents a routing overhead optimization algorithm called Staggered Link Quality algorithm to reduce routing overhead in large scale smart grid networks that use reactive routing protocols. A reduction in routing overhead will result in higher channel utilization and improved throughput. The proposed algorithm is evaluated over both power line and wireless network through experimental and simulation results. It is shown that the proposed algorithm not only reduces routing overhead but also reduces route discovery time and establishes near optimal paths. Reduction in routing overhead of up to 85% is observed under certain network conditions.","PeriodicalId":222123,"journal":{"name":"2015 IEEE International Symposium on Power Line Communications and Its Applications (ISPLC)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Routing overhead optimization in smart grid networks\",\"authors\":\"Owais Khan, Kumaran Vijayasankar, Ramanuja Vedantham\",\"doi\":\"10.1109/ISPLC.2015.7147595\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a routing overhead optimization algorithm called Staggered Link Quality algorithm to reduce routing overhead in large scale smart grid networks that use reactive routing protocols. A reduction in routing overhead will result in higher channel utilization and improved throughput. The proposed algorithm is evaluated over both power line and wireless network through experimental and simulation results. It is shown that the proposed algorithm not only reduces routing overhead but also reduces route discovery time and establishes near optimal paths. Reduction in routing overhead of up to 85% is observed under certain network conditions.\",\"PeriodicalId\":222123,\"journal\":{\"name\":\"2015 IEEE International Symposium on Power Line Communications and Its Applications (ISPLC)\",\"volume\":\"93 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Symposium on Power Line Communications and Its Applications (ISPLC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPLC.2015.7147595\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Symposium on Power Line Communications and Its Applications (ISPLC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPLC.2015.7147595","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种路由开销优化算法——交错链路质量算法,以减少大规模智能电网中使用被动路由协议的路由开销。路由开销的减少将导致更高的通道利用率和改进的吞吐量。通过实验和仿真结果对该算法在电力线和无线网络上进行了评估。结果表明,该算法不仅减少了路由开销,而且缩短了路由发现时间,建立了近最优路径。在某些网络条件下,可以观察到路由开销减少高达85%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Routing overhead optimization in smart grid networks
This paper presents a routing overhead optimization algorithm called Staggered Link Quality algorithm to reduce routing overhead in large scale smart grid networks that use reactive routing protocols. A reduction in routing overhead will result in higher channel utilization and improved throughput. The proposed algorithm is evaluated over both power line and wireless network through experimental and simulation results. It is shown that the proposed algorithm not only reduces routing overhead but also reduces route discovery time and establishes near optimal paths. Reduction in routing overhead of up to 85% is observed under certain network conditions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信