We compute an optimal day-ahead dispatch plan for distribution networks with stochastic resources and batteries, while accounting for grid and battery losses. We formulate and solve a scenario-based AC Optimal Power Flow (OPF), which is by construction non-convex. We explain why the existing relaxation methods do not apply and we propose a novel iterative scheme, corrected DistFlow (CoDistFlow), to solve the scenario-based AC OPF problem in radial networks. It uses a modified branch flow model for radial networks with angle relaxation that accounts for line shunt capacitances. At each step, it solves a convex problem based on a modified DistFlow OPF with correction terms for line losses and node voltages. Then, it updates the correction terms using the results of a full load flow. We prove that under a mild condition, a fixed point of CoDistFlow provides an exact solution to the full AC power flow equations. We propose treating battery losses similarly to grid losses by using a single-port electrical equivalent instead of battery efficiencies. We evaluate the performance of the proposed scheme in a simple and real electrical networks. We conclude that grid and battery losses affect the feasibility of the day-ahead dispatch plan and show how CoDistFlow can handle them correctly.
17 January 2018 in IEEE Transactions on Computational Social Systems
Twitter constitutes an accessible platform for studying and experimenting with the dynamics of information dissemination. By exploiting this and using real data, in this paper, we study the temporal dynamics of topic-specific information spread in Twitter, where we assume that each topic corresponds to a hashtag. We develop an epidemic model for information spread in Twitter and we validate it using real data for several hashtags chosen so as to cover a variety of characteristics. Contrary to the existing works in literature, which define the informed Twitter users as those who have produced/reproduced tweets with a specific hashtag, our model considers as informed a superset of Twitter users who have seen/produced/reproduced tweets with a specific hashtag. Thus, it does not underestimate the extent of information propagation in the network. The evaluation results indicate a satisfactory performance of the proposed epidemic model for all hashtag types examined; while more importantly, they allow studying the impact of several factors, such as the need of time-varying infection rates depending on the hashtag type.
13 October 2021 in IEEE Transactions on Smart Grid
Smart meters (SMs) measure and transmit fine-grained electricity consumption data to the data center at a certain high frequency (such as every 15 minutes). A data aggregation point (DAP) is a relay device between a cluster of SMs and data centers. The placement of DAPs significantly impacts the cost-effectiveness and quality of service (QoS) of the communication system. Nowadays, many newly installed SMs not only can send data to the DAPs but also receive/send data from/to other SMs. This paper proposes a novel approach for the optimal DAP placement in a multi-hop routing scenario, where SMs can serve as small relay devices so that communications among SMs can be leveraged to reduce the overall communication cost. To do so, we formulate a mixed-integer optimization problem that minimizes three types of cost: installation, transmission, and delay cost. Since the optimization problem involves too many binary variables to be efficiently solved to optimality, a heuristic approach is developed to obtain a desirable solution with a low computational burden. The heuristic iteratively implements clustering approximation, pole assignment, and optimal routing until convergence of the total cost value. Both an illustrative example and case studies verify the effectiveness of the proposed method.
12 March 2020 in IEEE Transactions on Control Systems Technology
We consider low run-time complexity power management in distribution grids with renewable energy sources (RESs) and batteries, where forecasts are unavailable. We propose iterative Lyapunov Real-time Control (iLypRC), a fast online algorithm, which does not need forecasts, for the real-time battery control. iLypRC is designed via Lyapunov optimization and applies either to follow a previously computed dispatch plan or to optimize the monetary cost, while it satisfies look-ahead state-of-energy constraints. iLypRC requires only bounds on the uncertain quantities for each real-time interval. iLypRC efficiently accounts for grid losses, battery efficiency, and grid constraints via iterative linearizations of the power flow equations. We compute a theoretical upper bound on the difference between the cost of iLypRC and the cost of an oracle. Finally, numerical evaluations (using real data) on a 4-bus distribution grid and a 34-bus real Swiss grid show that iLypRC achieves a cost very close to that of a model predictive control (MPC) with a good forecast, but iLypRC needs no forecast and has much lower run-time complexity. Also, when the MPC forecast is inaccurate, iLypRC outperforms MPC.
In Time-Sensitive Networking (TSN), it is important to formally prove per-flow latency and backlog bounds. To this end, recent works have applied network calculus and obtained latency bounds from service curves. The latency component of such service curves is directly derived from upper bounds on the values of the credit counters used by the Credit-Based Shaper (CBS), an essential building-block of TSN. In this paper, we derive and formally prove credit upper bounds for the CBS, which improve on existing bounds.