Reputation-Based Fair Power Allocation to Plug-in Electric Vehicles in the Smart Grid

Abdullah Al Zishan, Moosa Moghimi Haji, Omid Ardakanian
{"title":"Reputation-Based Fair Power Allocation to Plug-in Electric Vehicles in the Smart Grid","authors":"Abdullah Al Zishan, Moosa Moghimi Haji, Omid Ardakanian","doi":"10.1109/ICCPS48487.2020.00014","DOIUrl":null,"url":null,"abstract":"We present a reputation-based framework for allocating power to plug-in electric vehicles (EVs) in the smart grid. In this framework, the available capacity of the distribution network measured by distribution-level phasor measurement units is divided in a proportionally fair manner among connected EVs, considering their demands and self-declared deadlines. To encourage users to estimate their deadlines more precisely and conservatively, a weight is assigned to a each deadline based on the user’s reputation, which comprises two kinds of evidence: deadlines declared before and after the actual departure times in the recent past. Assuming reliable communication between sensors installed in the network and charging stations, we design a decentralized algorithm which allows the users to independently compute their fair share based on signals received from upstream sensors without sharing their private information, e.g., their deadline, with a central scheduler. We prove that this algorithm achieves quadratic convergence under specific conditions and evaluate it empirically on a test distribution network by comparing it with a centralized algorithm which solves the same optimization problem, a decentralized gradient-projection algorithm with linear convergence, and earliest-deadline-first and least-laxity-first scheduling policies. Our results corroborate that the proposed algorithm can track the available capacity of the network despite changes in the demands of homes and other inelastic loads, improves a fairness metric, and increases the overall allocation to users who have a better reputation.","PeriodicalId":158690,"journal":{"name":"2020 ACM/IEEE 11th International Conference on Cyber-Physical Systems (ICCPS)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 ACM/IEEE 11th International Conference on Cyber-Physical Systems (ICCPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCPS48487.2020.00014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

We present a reputation-based framework for allocating power to plug-in electric vehicles (EVs) in the smart grid. In this framework, the available capacity of the distribution network measured by distribution-level phasor measurement units is divided in a proportionally fair manner among connected EVs, considering their demands and self-declared deadlines. To encourage users to estimate their deadlines more precisely and conservatively, a weight is assigned to a each deadline based on the user’s reputation, which comprises two kinds of evidence: deadlines declared before and after the actual departure times in the recent past. Assuming reliable communication between sensors installed in the network and charging stations, we design a decentralized algorithm which allows the users to independently compute their fair share based on signals received from upstream sensors without sharing their private information, e.g., their deadline, with a central scheduler. We prove that this algorithm achieves quadratic convergence under specific conditions and evaluate it empirically on a test distribution network by comparing it with a centralized algorithm which solves the same optimization problem, a decentralized gradient-projection algorithm with linear convergence, and earliest-deadline-first and least-laxity-first scheduling policies. Our results corroborate that the proposed algorithm can track the available capacity of the network despite changes in the demands of homes and other inelastic loads, improves a fairness metric, and increases the overall allocation to users who have a better reputation.
智能电网中基于声誉的插电式电动汽车电力公平分配
我们提出了一个基于声誉的框架,用于在智能电网中为插电式电动汽车(ev)分配电力。在该框架中,考虑到并网电动汽车的需求和自行宣布的截止日期,由配电级相量测量单元测量的配电网可用容量以比例公平的方式分配给并网电动汽车。为了鼓励用户更精确和保守地估计他们的截止日期,根据用户的声誉为每个截止日期分配一个权重,其中包括两种证据:在最近的实际出发时间之前和之后宣布的截止日期。假设安装在网络中的传感器与充电站之间的通信可靠,我们设计了一个分散的算法,允许用户根据从上游传感器接收的信号独立计算他们的公平份额,而不与中央调度程序共享他们的私有信息,例如他们的截止日期。通过与解决相同优化问题的集中式算法、线性收敛的分散式梯度投影算法以及最早截止日期优先和最不松弛优先调度策略的比较,证明了该算法在特定条件下实现了二次收敛,并在测试配电网上进行了经验评价。我们的研究结果证实,所提出的算法可以在家庭需求和其他非弹性负载变化的情况下跟踪网络的可用容量,提高公平性指标,并增加对声誉较好的用户的总体分配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信