一种可扩展的能源互联网方法,用于具有连通性和偏好约束的hop监管点对点电力交易

IF 4.8 2区 工程技术 Q2 ENERGY & FUELS
Neethu Maya , Bala Kameshwar Poolla , Seshadhri Srinivasan , Alessandra Parisio , Narasimman Sundararajan , Suresh Sundaram
{"title":"一种可扩展的能源互联网方法,用于具有连通性和偏好约束的hop监管点对点电力交易","authors":"Neethu Maya ,&nbsp;Bala Kameshwar Poolla ,&nbsp;Seshadhri Srinivasan ,&nbsp;Alessandra Parisio ,&nbsp;Narasimman Sundararajan ,&nbsp;Suresh Sundaram","doi":"10.1016/j.segan.2025.101668","DOIUrl":null,"url":null,"abstract":"<div><div>Incentives to maximize Peer-to-Peer (P2P) power trading and the establishment of consumer-friendly distributed power markets are essential contributions to the decarbonization of the power sector. This paper presents a Connectivity and Preference Constrained Hop-Regulated Approach for Peer-to-Peer Trading (CPHPT) in sparsely connected communities with reduced infrastructure requirements. The CPHPT approach leverages graph theory to optimize P2P subscriber matching by regulating the maximum hops between the nodes in each routed path of P2P exchange. Simulations using real-world datasets in a 10-home community demonstrate that the CPHPT increases community participation by 29.49%, with P2P power exchanges comparable to full connectivity at reduced infrastructure requirements. When scaled to a 100-home community, the CPHPT approach achieves a marginal performance difference of 2.71% compared to full connectivity while lowering the connectivity infrastructure by 93.4%. The CPHPT approach has a mean runtime of 8.9 s for a 3-h window with 30-min intervals in a 100-home community, indicating its scalability and feasibility for real-time implementation.</div></div>","PeriodicalId":56142,"journal":{"name":"Sustainable Energy Grids & Networks","volume":"42 ","pages":"Article 101668"},"PeriodicalIF":4.8000,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A scalable energy internet approach for hop regulated peer-to-peer power trading with connectivity and preference constraints\",\"authors\":\"Neethu Maya ,&nbsp;Bala Kameshwar Poolla ,&nbsp;Seshadhri Srinivasan ,&nbsp;Alessandra Parisio ,&nbsp;Narasimman Sundararajan ,&nbsp;Suresh Sundaram\",\"doi\":\"10.1016/j.segan.2025.101668\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Incentives to maximize Peer-to-Peer (P2P) power trading and the establishment of consumer-friendly distributed power markets are essential contributions to the decarbonization of the power sector. This paper presents a Connectivity and Preference Constrained Hop-Regulated Approach for Peer-to-Peer Trading (CPHPT) in sparsely connected communities with reduced infrastructure requirements. The CPHPT approach leverages graph theory to optimize P2P subscriber matching by regulating the maximum hops between the nodes in each routed path of P2P exchange. Simulations using real-world datasets in a 10-home community demonstrate that the CPHPT increases community participation by 29.49%, with P2P power exchanges comparable to full connectivity at reduced infrastructure requirements. When scaled to a 100-home community, the CPHPT approach achieves a marginal performance difference of 2.71% compared to full connectivity while lowering the connectivity infrastructure by 93.4%. The CPHPT approach has a mean runtime of 8.9 s for a 3-h window with 30-min intervals in a 100-home community, indicating its scalability and feasibility for real-time implementation.</div></div>\",\"PeriodicalId\":56142,\"journal\":{\"name\":\"Sustainable Energy Grids & Networks\",\"volume\":\"42 \",\"pages\":\"Article 101668\"},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2025-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sustainable Energy Grids & Networks\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2352467725000505\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENERGY & FUELS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sustainable Energy Grids & Networks","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2352467725000505","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENERGY & FUELS","Score":null,"Total":0}
引用次数: 0

摘要

激励最大限度地实现点对点(P2P)电力交易和建立对消费者友好的分布式电力市场是对电力部门脱碳的重要贡献。本文提出了一种基于连通性和偏好约束的点对点交易(CPHPT)方法,该方法适用于基础设施要求较低的稀疏连接社区。CPHPT方法利用图论,通过调节P2P交换路由路径中节点间的最大跳数来优化P2P用户匹配。在一个10户社区中使用真实数据集进行的模拟表明,CPHPT将社区参与度提高了29.49%,在降低基础设施要求的情况下,P2P电力交换与完全连接相当。当扩展到100户社区时,与完全连接相比,CPHPT方法实现了2.71%的边际性能差异,同时将连接基础设施降低了93.4%。在100个家庭的社区中,CPHPT方法在一个3小时的窗口中以30分钟的间隔平均运行时间为8.9秒,表明其可扩展性和实时实现的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A scalable energy internet approach for hop regulated peer-to-peer power trading with connectivity and preference constraints
Incentives to maximize Peer-to-Peer (P2P) power trading and the establishment of consumer-friendly distributed power markets are essential contributions to the decarbonization of the power sector. This paper presents a Connectivity and Preference Constrained Hop-Regulated Approach for Peer-to-Peer Trading (CPHPT) in sparsely connected communities with reduced infrastructure requirements. The CPHPT approach leverages graph theory to optimize P2P subscriber matching by regulating the maximum hops between the nodes in each routed path of P2P exchange. Simulations using real-world datasets in a 10-home community demonstrate that the CPHPT increases community participation by 29.49%, with P2P power exchanges comparable to full connectivity at reduced infrastructure requirements. When scaled to a 100-home community, the CPHPT approach achieves a marginal performance difference of 2.71% compared to full connectivity while lowering the connectivity infrastructure by 93.4%. The CPHPT approach has a mean runtime of 8.9 s for a 3-h window with 30-min intervals in a 100-home community, indicating its scalability and feasibility for real-time implementation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Sustainable Energy Grids & Networks
Sustainable Energy Grids & Networks Energy-Energy Engineering and Power Technology
CiteScore
7.90
自引率
13.00%
发文量
206
审稿时长
49 days
期刊介绍: Sustainable Energy, Grids and Networks (SEGAN)is an international peer-reviewed publication for theoretical and applied research dealing with energy, information grids and power networks, including smart grids from super to micro grid scales. SEGAN welcomes papers describing fundamental advances in mathematical, statistical or computational methods with application to power and energy systems, as well as papers on applications, computation and modeling in the areas of electrical and energy systems with coupled information and communication technologies.
×
引用
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学术官方微信