A framework for assessing robustness of water networks and computational evaluation of resilience.

Arid regions tend to take careful measures to ensure water supplies are secured to consumers, to help provide the basis for further development. Water distribution network is the most expensive part of the water supply infrastructure and it must maintain performance during unexpected incidents. Many aspects of performance have previously been discussed separately, including reliability, vulnerability, flexibility and resilience. This study aimed to develop a framework to bring together these aspects as found in the literature and industry practice, and bridge the gap between them. Semi-structured interviews with water industry experts were used to examine the presence and understanding of robustness factors. Thematic analysis was applied to investigate these and inform a conceptual framework including the component and topological levels. Robustness was described by incorporating network reliability and resiliency. The research focused on resiliency as a network-level concept derived from flexibility and vulnerability. To utilise this new framework, the study explored graph theory to formulate metrics for flexibility and vulnerability that combine network topology and hydraulics. The flexibility metric combines hydraulic edge betweenness centrality, representing hydraulic connectivity, and hydraulic edge load, measuring utilised capacity. Vulnerability captures the impact of failures on the ability of the network to supply consumers, and their sensitivity to disruptions, by utilising node characteristics, such as demand, population and alternative supplies. These measures together cover both edge (pipe) centric and node (demand) centric perspectives. The resiliency assessment was applied to several literature benchmark networks prior to using a real case network. The results show the benefits of combining hydraulics with topology in robustness analysis. The assessment helps to identify components or sections of importance for future expansion plans or maintenance purposes. The study provides a novel viewpoint overarching the gap between literature and practice, incorporating different critical factors for robust performance

A Majorization-Minimization Approach to Design of Power Transmission Networks

We propose an optimization approach to design cost-effective electrical power transmission networks. That is, we aim to select both the network structure and the line conductances (line sizes) so as to optimize the trade-off between network efficiency (low power dissipation within the transmission network) and the cost to build the network. We begin with a convex optimization method based on the paper ``Minimizing Effective Resistance of a Graph'' [Ghosh, Boyd \& Saberi]. We show that this (DC) resistive network method can be adapted to the context of AC power flow. However, that does not address the combinatorial aspect of selecting network structure. We approach this problem as selecting a subgraph within an over-complete network, posed as minimizing the (convex) network power dissipation plus a non-convex cost on line conductances that encourages sparse networks where many line conductances are set to zero. We develop a heuristic approach to solve this non-convex optimization problem using: (1) a continuation method to interpolate from the smooth, convex problem to the (non-smooth, non-convex) combinatorial problem, (2) the majorization-minimization algorithm to perform the necessary intermediate smooth but non-convex optimization steps. Ultimately, this involves solving a sequence of convex optimization problems in which we iteratively reweight a linear cost on line conductances to fit the actual non-convex cost. Several examples are presented which suggest that the overall method is a good heuristic for network design. We also consider how to obtain sparse networks that are still robust against failures of lines and/or generators.Comment: 8 pages, 3 figures. To appear in Proc. 49th IEEE Conference on Decision and Control (CDC '10

Enabling Disaster Resilient 4G Mobile Communication Networks

The 4G Long Term Evolution (LTE) is the cellular technology expected to outperform the previous generations and to some extent revolutionize the experience of the users by taking advantage of the most advanced radio access techniques (i.e. OFDMA, SC-FDMA, MIMO). However, the strong dependencies between user equipments (UEs), base stations (eNBs) and the Evolved Packet Core (EPC) limit the flexibility, manageability and resiliency in such networks. In case the communication links between UEs-eNB or eNB-EPC are disrupted, UEs are in fact unable to communicate. In this article, we reshape the 4G mobile network to move towards more virtual and distributed architectures for improving disaster resilience, drastically reducing the dependency between UEs, eNBs and EPC. The contribution of this work is twofold. We firstly present the Flexible Management Entity (FME), a distributed entity which leverages on virtualized EPC functionalities in 4G cellular systems. Second, we introduce a simple and novel device-todevice (D2D) communication scheme allowing the UEs in physical proximity to communicate directly without resorting to the coordination with an eNB.Comment: Submitted to IEEE Communications Magazin

Improving resiliency using graph based evolutionary algorithms

Resiliency is an important characteristic of any system. It signifies the ability of a system to survive and recover from unprecedented disruptions. Various characteristics exist that indicate the level of resiliency in a system. One of these attributes is the adaptability of the system. This adaptability can be enhanced by redundancy present within the system. In the context of system design, redundancy can be achieved by having a diverse set of good designs for that particular system. Evolutionary algorithms are widely used in creating designs for engineering systems, as they perform well on discontinuous and/or high dimensional problems. One method to control the diversity of solutions within an evolutionary algorithm is the use of combinatorial graphs, or graph based evolutionary algorithms. This diversity of solutions is key factor to enhance the redundancy of a system design. In this work, the way how graph based evolutionary algorithms generate diverse solutions is investigated by examining the influence of representation and mutation. This allows for greater understanding of the exploratory nature of each representation and how they can control the number of solution generated within a trial. The results of this research are then applied to the Travelling [sic] Salesman Problem, a known NP hard problem often used as a surrogate for logistic or network design problems. When the redundancy in system design is improved, adaptability can be achieved by placing an agent to initiate a transfer to other good solutions in the event of a disruption in network connectivity, making it possible to improve the resiliency of the system --Abstract, page iii

A Tabu-search-based Algorithm for Distribution Network Restoration to Improve Reliability and Resiliency

Fault restoration techniques have always been crucial for distribution system operators (DSOs). In the last decade, it started to gain more and more importance due to the introduction of output-based regulations where DSO performances are evaluated according to frequency and duration of energy supply interruptions. The paper presents a tabu-search-based algorithm able to assist distribution network operational engineers in identifying solutions to restore the energy supply after permanent faults. According to the network property, two objective functions are considered to optimize either reliability or resiliency. The mathematical formulation includes the traditional feeders, number of switching operation limit, and radiality constraints. Thanks to the DSO of Milan, Unareti, the proposed algorithm has been tested on a real distribution network to investigate its effectiveness

A Framework for Robust Assessment of Power Grid Stability and Resiliency

Security assessment of large-scale, strongly nonlinear power grids containing thousands to millions of interacting components is a computationally expensive task. Targeting at reducing the computational cost, this paper introduces a framework for constructing a robust assessment toolbox that can provide mathematically rigorous certificates for the grids' stability in the presence of variations in power injections, and for the grids' ability to withstand a bunch sources of faults. By this toolbox we can "off-line" screen a wide range of contingencies or power injection profiles, without reassessing the system stability on a regular basis. In particular, we formulate and solve two novel robust stability and resiliency assessment problems of power grids subject to the uncertainty in equilibrium points and uncertainty in fault-on dynamics. Furthermore, we bring in the quadratic Lyapunov functions approach to transient stability assessment, offering real-time construction of stability/resiliency certificates and real-time stability assessment. The effectiveness of the proposed techniques is numerically illustrated on a number of IEEE test cases