Channel-aware optimal placement algorithm for data concentrator unit in smart grid systems

C. Pirak, Tanayoot Sangsuwan, Songserm Tanakornpintong, R. Mathar
{"title":"Channel-aware optimal placement algorithm for data concentrator unit in smart grid systems","authors":"C. Pirak, Tanayoot Sangsuwan, Songserm Tanakornpintong, R. Mathar","doi":"10.1109/ECTICON.2017.8096270","DOIUrl":null,"url":null,"abstract":"In this paper, the channel-aware optimal location algorithm for the data concentrator unit placement in smart grid systems is proposed. The M/M/1/K queuing model is adopted for analyzing the averaged throughput and delay. The optimization algorithm based on a minimum hop count approach with the acceptable averaged throughput and delay constraints, and the optimal DCU localization methodology are proposed. Specifically, the optimal location algorithm will determine the optimal location for DCU by using the principle of minimum hop count first. If there are multiple locations achieving the minimum hop count and constraints, the averaged received signal strength for the 1st-hop tier will be used as the additional performance metric to select the ultimately optimal location, in which the optimal location achieving the maximum averaged received signal strength will be selected. Hence, the system reliability and performance will be maximized. From the simulation results, it is obvious that the proposed methodology is significantly effective, in which the optimal location for DCU yielding the acceptable averaged throughput and delay with the maximum received signal strength is achieved.","PeriodicalId":273911,"journal":{"name":"2017 14th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 14th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECTICON.2017.8096270","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this paper, the channel-aware optimal location algorithm for the data concentrator unit placement in smart grid systems is proposed. The M/M/1/K queuing model is adopted for analyzing the averaged throughput and delay. The optimization algorithm based on a minimum hop count approach with the acceptable averaged throughput and delay constraints, and the optimal DCU localization methodology are proposed. Specifically, the optimal location algorithm will determine the optimal location for DCU by using the principle of minimum hop count first. If there are multiple locations achieving the minimum hop count and constraints, the averaged received signal strength for the 1st-hop tier will be used as the additional performance metric to select the ultimately optimal location, in which the optimal location achieving the maximum averaged received signal strength will be selected. Hence, the system reliability and performance will be maximized. From the simulation results, it is obvious that the proposed methodology is significantly effective, in which the optimal location for DCU yielding the acceptable averaged throughput and delay with the maximum received signal strength is achieved.
智能电网系统中数据集中器单元的信道感知优化布局算法
本文提出了智能电网系统中数据集中器单元配置的信道感知最优定位算法。采用M/M/1/K排队模型分析平均吞吐量和延迟。提出了基于可接受平均吞吐量和时延约束的最小跳数优化算法和最优DCU定位方法。其中,最优定位算法采用最小跳数优先原则确定DCU的最优位置。如果有多个位置达到最小跳数和约束,则将第一跳层的平均接收信号强度用作选择最终最优位置的附加性能指标,其中将选择实现最大平均接收信号强度的最优位置。因此,系统的可靠性和性能将得到最大化。从仿真结果可以明显看出,所提出的方法是非常有效的,其中DCU的最佳位置产生可接受的平均吞吐量和延迟与最大接收信号强度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信