اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCyber Insurance Against Cyberattacks on Electric Vehicle Charging Stations
94
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Even with state-of-the-art defense mechanisms, cyberattacks in the electric power distribution sector are commonplace. Particularly alarming are load-altering (demand-side) cyberattacks launched through high-wattage assets, which are not continuously monitored by electric power utilities. Electric Vehicle Charging Stations (EVCSs) are among such high-wattage assets and, therefore, cyber insurance can be an effective mechanism to protect EVCSs from economic losses caused by cyberattacks. This paper presents a data-driven cyber insurance design model for public EVCSs. Under some mildly restrictive assumptions, we derive an optimal cyber insurance premium. Then, we robustify this optimal premium against uncertainty in data and investigate the risk of insuring the EVCSs using Conditional Value-at-Risk. A case study with data from EVCSs in Manhattan, New York illustrates our results.
قيم البحث
اقرأ أيضاً
Cooperative Adaptive Cruise Control (CACC) is a vehicular technology that allows groups of vehicles on the highway to form in closely-coupled automated platoons to increase highway capacity and safety, and decrease fuel consumption and CO2 emissions.
The underlying mechanism behind CACC is the use of Vehicle-to-Vehicle (V2V) wireless communication networks to transmit acceleration commands to adjacent vehicles in the platoon. However, the use of V2V networks leads to increased vulnerabilities against faults and cyberattacks at the communication channels. Communication networks serve as new access points for malicious agents trying to deteriorate the platooning performance or even cause crashes. Here, we address the problem of increasing robustness of CACC schemes against cyberattacks by the use of multiple V2V networks and a data fusion algorithm. The idea is to transmit acceleration commands multiple times through different communication networks (channels) to create redundancy at the receiver side. We exploit this redundancy to obtain attack-free estimates of acceleration commands. To accomplish this, we propose a data-fusion algorithm that takes data from all channels, returns an estimate of the true acceleration command, and isolates compromised channels. Note, however, that using estimated data for control introduces uncertainty into the loop and thus decreases performance. To minimize performance degradation, we propose a robust $H_{infty}$ controller that reduces the joint effect of estimation errors and sensor/channel noise in the platooning performance (tracking performance and string stability). We present simulation results to illustrate the performance of our approach.
We describe the architecture and algorithms of the Adaptive Charging Network (ACN), which was first deployed on the Caltech campus in early 2016 and is currently operating at over 100 other sites in the United States. The architecture enables real-ti
me monitoring and control and supports electric vehicle (EV) charging at scale. The ACN adopts a flexible Adaptive Scheduling Algorithm based on convex optimization and model predictive control and allows for significant over-subscription of electrical infrastructure. We describe some of the practical challenges in real-world charging systems, including unbalanced three-phase infrastructure, non-ideal battery charging behavior, and quantized control signals. We demonstrate how the Adaptive Scheduling Algorithm handles these challenges, and compare its performance against baseline algorithms from the deadline scheduling literature using real workloads recorded from the Caltech ACN and accurate system models. We find that in these realistic settings, our scheduling algorithm can improve operator profit by 3.4 times over uncontrolled charging and consistently outperforms baseline algorithms when delivering energy in highly congested systems.
The increased uptake of electric vehicles (EVs) leads to increased demand for electricity, and sometime pressure to power grids. Uncoordinated charging of EVs may result in putting pressure on distribution networks, and often some form of optimisatio
n is required in the charging process. Optimal coordinated charging is a multi-objective optimisation problem in nature, with objective functions such as minimum price charging and minimum disruptions to the grid. In this manuscript, we propose a general multi-objective EV charging/discharging schedule (MOEVCS) framework, where the time of use (TOU) tariff is designed according to the load request at each time stamp. To obtain the optimal scheduling scheme and balance the competing benefits from different stakeholders, such as EV owners, EV charging stations (EVCS), and the grid operator, we design three conflicting objective functions including EV owner cost, EVCS profit, and the network impact. Moreover, we create four application scenarios with different charging request distributions over the investigated periods. We use a constraint multi-objective evolutionary algorithm (MOEA) to solve the problem. Our results demonstrate the effectiveness of MOEVCS in making a balance between three conflicting objectives.
Effective placement of charging stations plays a key role in Electric Vehicle (EV) adoption. In the placement problem, given a set of candidate sites, an optimal subset needs to be selected with respect to the concerns of both (a) the charging statio
n service provider, such as the demand at the candidate sites and the budget for deployment, and (b) the EV user, such as charging station reachability and short waiting times at the station. This work addresses these concerns, making the following three novel contributions: (i) a supervised multi-view learning framework using Canonical Correlation Analysis (CCA) for demand prediction at candidate sites, using multiple datasets such as points of interest information, traffic density, and the historical usage at existing charging stations; (ii) a mixed-packing-and- covering optimization framework that models competing concerns of the service provider and EV users; (iii) an iterative heuristic to solve these problems by alternately invoking knapsack and set cover algorithms. The performance of the demand prediction model and the placement optimization heuristic are evaluated using real world data.
The number of electric vehicles (EVs) is expected to increase. As a consequence, more EVs will need charging, potentially causing not only congestion at charging stations, but also in the distribution grid. Our goal is to illustrate how this gives ri
se to resource allocation and performance problems that are of interest to the Sigmetrics community.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
