有限块长度下的统计电网可观测性

Qiyan Zhan, Nan Liu, Zhiwen Pan, Hongjian Sun
{"title":"有限块长度下的统计电网可观测性","authors":"Qiyan Zhan, Nan Liu, Zhiwen Pan, Hongjian Sun","doi":"10.1109/cniot55862.2022.00026","DOIUrl":null,"url":null,"abstract":"We study the stochastic observability of the power grid system under communication constraints in the finite blocklength regime. Compared to the study under the assumption of infinite blocklength, we introduce two new elements: probability of decoding error and transmission delay. An optimization problem to maximize the observability of the smart grid over all possible bandwidth allocation is proposed, incorporating these two new elements. To solve the optimization problem, for a given bandwidth allocation, we first solve parallel subproblems, one for each synchronous phasor measurement unit (PMU), using alternating optimization, to find the optimal QoS exponent, transmission delay and probability of decoding error for each PMU. Then, simulated annealing method is used to find the optimal bandwidth allocation among PMUs. Numerical results verify that the assumption of infinite blocklength is indeed too optimistic and instead, finite blocklength should be studied. Large bandwidth saving gains of the proposed scheme are demonstrated compared to the equal bandwidth allocation scheme.","PeriodicalId":251734,"journal":{"name":"2022 3rd International Conference on Computing, Networks and Internet of Things (CNIOT)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Statistical Power Grid Observability under Finite Blocklength\",\"authors\":\"Qiyan Zhan, Nan Liu, Zhiwen Pan, Hongjian Sun\",\"doi\":\"10.1109/cniot55862.2022.00026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the stochastic observability of the power grid system under communication constraints in the finite blocklength regime. Compared to the study under the assumption of infinite blocklength, we introduce two new elements: probability of decoding error and transmission delay. An optimization problem to maximize the observability of the smart grid over all possible bandwidth allocation is proposed, incorporating these two new elements. To solve the optimization problem, for a given bandwidth allocation, we first solve parallel subproblems, one for each synchronous phasor measurement unit (PMU), using alternating optimization, to find the optimal QoS exponent, transmission delay and probability of decoding error for each PMU. Then, simulated annealing method is used to find the optimal bandwidth allocation among PMUs. Numerical results verify that the assumption of infinite blocklength is indeed too optimistic and instead, finite blocklength should be studied. Large bandwidth saving gains of the proposed scheme are demonstrated compared to the equal bandwidth allocation scheme.\",\"PeriodicalId\":251734,\"journal\":{\"name\":\"2022 3rd International Conference on Computing, Networks and Internet of Things (CNIOT)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 3rd International Conference on Computing, Networks and Internet of Things (CNIOT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/cniot55862.2022.00026\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 3rd International Conference on Computing, Networks and Internet of Things (CNIOT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/cniot55862.2022.00026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

研究了有限块长条件下通信约束下电网系统的随机可观测性问题。与无限块长假设下的研究相比,我们引入了两个新元素:译码错误概率和传输延迟。结合这两个新元素,提出了在所有可能的带宽分配情况下,使智能电网的可观测性最大化的优化问题。为了解决优化问题,对于给定的带宽分配,我们首先求解并行子问题,每个同步相量测量单元(PMU)一个,使用交替优化,找到每个PMU的最优QoS指数,传输延迟和译码错误概率。然后,采用模拟退火方法找到pmu之间的最优带宽分配。数值结果验证了无限块长度的假设确实过于乐观,相反,有限块长度应该进行研究。与等带宽分配方案相比,该方案节省了大量带宽。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Statistical Power Grid Observability under Finite Blocklength
We study the stochastic observability of the power grid system under communication constraints in the finite blocklength regime. Compared to the study under the assumption of infinite blocklength, we introduce two new elements: probability of decoding error and transmission delay. An optimization problem to maximize the observability of the smart grid over all possible bandwidth allocation is proposed, incorporating these two new elements. To solve the optimization problem, for a given bandwidth allocation, we first solve parallel subproblems, one for each synchronous phasor measurement unit (PMU), using alternating optimization, to find the optimal QoS exponent, transmission delay and probability of decoding error for each PMU. Then, simulated annealing method is used to find the optimal bandwidth allocation among PMUs. Numerical results verify that the assumption of infinite blocklength is indeed too optimistic and instead, finite blocklength should be studied. Large bandwidth saving gains of the proposed scheme are demonstrated compared to the equal bandwidth allocation scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信