Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAsynchrony-Resilient and Privacy-Preserving Charging Protocol for Plug-in Electric Vehicles
147
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The proliferation of plug-in electric vehicles (PEVs) advocates a distributed paradigm for the coordination of PEV charging. Distinct from existing primal-dual decomposition or consensus methods, this paper proposes a cutting-plane based distributed algorithm, which enables an asynchronous coordination while well preserving individuals private information. To this end, an equivalent surrogate model is first constructed by exploiting the duality of the original optimization problem, which masks the private information of individual users by a transformation. Then, a cutting-plane based algorithm is derived to solve the surrogate problem in a distributed manner with intrinsic superiority to cope with various asynchrony. Critical implementation issues, such as the distributed initialization, cutting-plane generation and localized stopping criteria, are discussed in detail. Numerical tests on IEEE 37- and 123-node feeders with real data show that the proposed method is resilient to a variety of asynchrony and admits the plug-and-play operation mode. It is expected the proposed methodology provides an alternative path toward a more practical protocol for PEV charging.
rate research
Read More
With the advances in the Internet of Things technology, electric vehicles (EVs) have become easier to schedule in daily life, which is reshaping the electric load curve. It is important to design efficient charging algorithms to mitigate the negative impact of EV charging on the power grid. This paper investigates an EV charging scheduling problem to reduce the charging cost while shaving the peak charging load, under unknown future information about EVs, such as arrival time, departure time, and charging demand. First, we formulate an EV charging problem to minimize the electricity bill of the EV fleet and study the EV charging problem in an online setting without knowing future information. We develop an actor-critic learning-based smart charging algorithm (SCA) to schedule the EV charging against the uncertainties in EV charging behaviors. The SCA learns an optimal EV charging strategy with continuous charging actions instead of discrete approximation of charging. We further develop a more computationally efficient customized actor-critic learning charging algorithm (CALC) by reducing the state dimension and thus improving the computational efficiency. Finally, simulation results show that our proposed SCA can reduce EVs expected cost by 24.03%, 21.49%, 13.80%, compared with the Eagerly Charging Algorithm, Online Charging Algorithm, RL-based Adaptive Energy Management Algorithm, respectively. CALC is more computationally efficient, and its performance is close to that of SCA with only a gap of 5.56% in the cost.
Electric vehicles (EVs) are an eco-friendly alternative to vehicles with internal combustion engines. Despite their environmental benefits, the massive electricity demand imposed by the anticipated proliferation of EVs could jeopardize the secure and economic operation of the power grid. Hence, proper strategies for charging coordination will be indispensable to the future power grid. Coordinated EV charging schemes can be implemented as centralized, decentralized, and hierarchical systems, with the last two, referred to as distributed charging control systems. This paper reviews the recent literature of distributed charging control schemes, where the computations are distributed across multiple EVs and/or aggregators. First, we categorize optimization problems for EV charging in terms of operational aspects and cost aspects. Then under each category, we provide a comprehensive discussion on algorithms for distributed EV charge scheduling, considering the perspectives of the grid operator, the aggregator, and the EV user. We also discuss how certain algorithms proposed in the literature cope with various uncertainties inherent to distributed EV charging control problems. Finally, we outline several research directions that require further attention.
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-time 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.
In modern networks, the use of drones as mobile base stations (MBSs) has been discussed for coverage flexibility. However, the realization of drone-based networks raises several issues. One of the critical issues is drones are extremely power-hungry. To overcome this, we need to characterize a new type of drones, so-called charging drones, which can deliver energy to MBS drones. Motivated by the fact that the charging drones also need to be charged, we deploy ground-mounted charging towers for delivering energy to the charging drones. We introduce a new energy-efficiency maximization problem, which is partitioned into two independently separable tasks. More specifically, as our first optimization task, two-stage charging matching is proposed due to the inherent nature of our network model, where the first matching aims to schedule between charging towers and charging drones while the second matching solves the scheduling between charging drones and MBS drones. We analyze how to convert the formulation containing non-convex terms to another one only with convex terms. As our second optimization task, each MBS drone conducts energy-aware time-average transmit power allocation minimization subject to stability via Lyapunov optimization. Our solutions enable the MBS drones to extend their lifetimes; in turn, network coverage-time can be extended.
Resource Public Key Infrastructure (RPKI) is vital to the security of inter-domain routing. However, RPKI enables Regional Internet Registries (RIRs) to unilaterally takedown IP prefixes - indeed, such attacks have been launched by nation-state adversaries. The threat of IP prefix takedowns is one of the factors hindering RPKI adoption. In this work, we propose the first distributed RPKI system, based on threshold signatures, that requires the coordination of a number of RIRs to make changes to RPKI objects; hence, preventing unilateral prefix takedown. We perform extensive evaluations using our implementation demonstrating the practicality of our solution. Furthermore, we show that our system is scalable and remains efficient even when RPKI is widely deployed.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
