Engineering Papers⌕ Search

Engineering topics

Frincu, Marc

Publications and source records attributed to Frincu, Marc.

Prediction Models for Dynamic Demand Response

As Smart Grids move closer to dynamic curtailment programs, Demand Response (DR) events will become necessary not only on fixed time intervals and weekdays predetermined by static policies, but also during changing decision periods and weekends to react to real-time demand signals. Unique challenges arise in this context vis-a-vis demand prediction and curtailment estimation and the transformation of such tasks into an automated, efficient dynamic demand response (D 2 R) process. While existing work has concentrated on increasing the accuracy of prediction models for DR, there is a lack of studies for prediction models for D 2 R, which we address in this paper. Our first contribution is the formal definition of D 2 R, and the description of its challenges and requirements. Our second contribution is a feasibility analysis of very-short-term prediction of electricity consumption for D 2 R over a diverse, large-scale dataset that includes both small residential customers and large buildings. Our third, and major contribution is a set of insights into the predictability of electricity consumption in the context of D 2 R. Specifically, we focus on prediction models that can operate at a very small data granularity (here 15-min intervals), for both weekdays and weekends - all conditions that characterize scenarios for D 2 R. We find that short-term time series and simple averaging models used by Independent Service Operators and utilities achieve superior prediction accuracy. We also observe that workdays are more predictable than weekends and holiday. Also, smaller customers have large variation in consumption and are less predictable than larger buildings. Key implications of our findings are that better models are required for small customers and for non-workdays, both of which are critical for D 2 R. Also, prediction models require just few days’ worth of data indicating that small amounts of historical training data can be used to make reliable predictions, simplifying the complexity of big data challenge associated with D 2 R.

Aman, Saima↗

Challenge Online Time Series Clustering For Demand Response A Theory to Break the ‘Curse of Dimensionality'

The advent of smart meters and advanced communication infrastructures catalyzes numerous smart grid applications such as dynamic demand response, and paves the way to solve challenging research problems in sustainable energy consumption. The space of solution possibilities are restricted primarily by the huge amount of generated data requiring considerable computational resources and efficient algorithms. To overcome this Big Data challenge, data clustering techniques have been proposed. Current approaches however do not scale in the face of the “increasing dimensionality” problem where a cluster point is represented by the entire customer consumption time series. To overcome this aspect we first rethink the way cluster points are created and designed, and then design an efficient online clustering technique for demand response (DR) in order to analyze high volume, high dimensional energy consumption time series data at scale, and on the fly. Our online algorithm is randomized in nature, and provides optimal performance guarantees in a computationally efficient manner. Unlike prior work we (i) study the consumption properties of the whole population simultaneously rather than developing individual models for each customer separately, claiming it to be a ‘killer’ approach that breaks the “curse of dimensionality” in online time series clustering, and (ii) provide tight performance guarantees in theory to validate our approach. Our insights are driven by the field of sociology, where collective behavior often emerges as the result of individual patterns and lifestyles.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Enabling Automated Dynamic Demand Response: From Theory to Practice

Demand response (DR) is a technique used in smart grids to shape customer load during peak hours. Automated DR offers utilities a fine grained control and a high degree of confidence in the outcome. However the impact on the customer's comfort means this technique is more suited for industrial and commercial settings than for residential homes. In this paper we propose a system for achieving automated controlled DR in a heterogeneous environment. We present some of the main issues arising in building such a system, including privacy, customer satisfiability, reliability, and fast decision turnaround, with emphasis on the solutions we proposed. Based on the lessons we learned from empirical results we describe an integrated automated system for controlled DR on the USC microgrid. Results show that while on a per building per event basis the accuracy of our prediction and customer selection techniques varies, it performs well on average when considering several events and buildings.

Frincu, Marc↗

Fault-Tolerant and Elastic Streaming MapReduce with Decentralized Coordination

The MapReduce programming model, due to its simplicity and scalability, has become an essential tool for processing large data volumes in distributed environments. Recent Stream Processing Systems (SPS) extend this model to provide low-latency analysis of high-velocity continuous data streams. However, integrating MapReduce with streaming poses challenges: first, the runtime variations in data characteristics such as data-rates and key-distribution cause resource overload, that inturn leads to fluctuations in the Quality of the Service (QoS); and second, the stateful reducers, whose state depends on the complete tuple history, necessitates efficient fault-recovery mechanisms to maintain the desired QoS in the presence of resource failures. We propose an integrated streaming MapReduce architecture leveraging the concept of consistent hashing to support runtime elasticity along with locality-aware data and state replication to provide efficient load-balancing with low-overhead fault-tolerance and parallel fault-recovery from multiple simultaneous failures. Our evaluation on a private cloud shows up to 2:8 improvement in peak throughput compared to Apache Storm SPS, and a low recovery latency of 700 -1500 ms from multiple failures.

97 MATHEMATICS AND COMPUTING↗

Model-based Assessment for Balancing Privacy Requirements and Operational Capabilities

The smart grid changes the way energy is produced and distributed. In addition both, energy and information is exchanged bidirectionally among participating parties. Therefore heterogeneous systems have to cooperate effectively in order to achieve a common high-level use case, such as smart metering for billing or demand response for load curtailment. Furthermore, a substantial amount of personal data is often needed for achieving that goal. Capturing and processing personal data in the smart grid increases customer concerns about privacy and in addition, certain statutory and operational requirements regarding privacy aware data processing and storage have to be met. An increase of privacy constraints, however, often limits the operational capabilities of the system. In this paper, we present an approach that automates the process of finding an optimal balance between privacy requirements and operational requirements in a smart grid use case and application scenario. This is achieved by formally describing use cases in an abstract model and by finding an algorithm that determines the optimum balance by forward mapping privacy and operational impacts. For this optimal balancing algorithm both, a numeric approximation and – if feasible – an analytic assessment are presented and investigated. The system is evaluated by applying the tool to a real-world use case from the University of Southern California (USC) microgrid.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Model-driven Privacy Assessment in the Smart Grid

In a smart grid, data and information are transported, transmitted, stored, and processed with various stakeholders having to cooperate effectively. Furthermore, personal data is the key to many smart grid applications and therefore privacy impacts have to be taken into account. For an effective smart grid, well integrated solutions are crucial and for achieving a high degree of customer acceptance, privacy should already be considered at design time of the system. To assist system engineers in early design phase, frameworks for the automated privacy evaluation of use cases are important. For evaluation, use cases for services and software architectures need to be formally captured in a standardized and commonly understood manner. In order to ensure this common understanding for all kinds of stakeholders, reference models have recently been developed. In this paper we present a model-driven approach for the automated assessment of such services and software architectures in the smart grid that builds on the standardized reference models. The focus of qualitative and quantitative evaluation is on privacy. For evaluation, the framework draws on use cases from the University of Southern California microgrid.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Estimating Reduced Consumption for Dynamic Demand Response

Growing demand is straining our existing electricity generation facilities and requires active participation of the utility and the consumers to achieve energy sustainability. One of the most effective and widely used ways to achieve this goal in the smart grid is demand response (DR), whereby consumers reduce their electricity consumption in response to a request sent from the utility whenever it anticipates a peak in demand. To successfully plan and implement demand response, the utility requires reliable estimate of reduced consumption during DR. This also helps in optimal selection of consumers and curtailment strategies during DR. While much work has been done on predicting normal consumption, reduced consumption prediction is an open problem that is under-studied. In this paper, we introduce and formalize the problem of reduced consumption prediction, and discuss the challenges associated with it. We also describe computational methods that use historical DR data as well as pre-DR conditions to make such predictions. Our experiments are conducted in the real-world setting of a university campus microgrid, and our preliminary results set the foundation for more detailed modeling.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Efficient Customer Selection for Sustainable Demand Response in Smart Grids

Regulating the power consumption to avoid peaks in demand is a common practice. Demand Response(DR) is being used by utility providers to minimize costs or ensure system reliability. Although it has been used extensively there is a shortage of solutions dealing with dynamic DR. Past attempts focus on minimizing the load demand without considering the sustainability of the reduced energy. In this paper an efficient algorithm is presented which solves the problem of dynamic DR scheduling. Data from the USC campus micro grid were used to evaluate the efficiency as well as the robustness of the proposed solution. The targeted energy reduction is achieved with a maximum average approximation error of ≈ 0.7%. Sustainability of the reduced energy is achieved with respect to the optimal available solution providing a maximum average error less than 0.6%. It is also shown that a solution is provided with a low computational cost fulfilling the requirements of dynamic DR.

change making↗

Integrated Platform for Automated Sustainable Demand Response in Smart Grids

Demand Response(DR) is a common practice used by utility providers to regulate energy demand. It is used at periods of high demand to minimize the peak to average consumption ratio. Several methods have been Demand Response(DR) is a common praon using information about the baseline consumption and the consumption during DR. Our goal is to provide a sustainable reduction to ensure the elimination of peaks in demand. The proposed system includes an adaptation mechanism for when the provided solution does not meet the DR requirements. We conducted a series of experiments using consumption data from a real life micro grid to evaluate the efficiency as well as the robustness of our solution.

automated demand response↗

Efficient Extraction of High Centrality Vertices in Distributed Graphs

Betweenness centrality (BC) is an important measure for identifying high value or critical vertices in graphs, in variety of domains such as communication networks, road networks, and social graphs. However, calculating betweenness values is prohibitively expensive and, more often, domain experts are interested only in the vertices with the highest centrality values. In this paper, we first propose a partition-centric algorithm (MS-BC) to calculate BC for a large distributed graph that optimizes resource utilization and improves overall performance. Further, we extend the notion of approximate BC by pruning the graph and removing a subset of edges and vertices that contribute the least to the betweenness values of other vertices (MSL-BC), which further improves the runtime performance. We evaluate the proposed algorithms using a mix of real-world and synthetic graphs on an HPC cluster and analyze its strengths and weaknesses. The experimental results show an improvement in performance of upto 12x for large sparse graphs as compared to the state-of-the-art, and at the same time highlights the need for better partitioning methods to enable a balanced workload across partitions for unbalanced graphs such as small-world or power-law graphs.

97 MATHEMATICS AND COMPUTING↗

Hatrick: A System for Real-time Threat Detection in Cyber Physical Systems

Complexity of cyber attacks has grown rapidly over the last few decades. Novel advance techniques are needed in order to counter these attacks. Detecting some of these complex cyber attacks can be reduced to detecting patterns and dynamics in computer network traffic. These patterns can be molded as directed graphs based on their propagation through the cyber physical systems. This work in progress report presents an implemented system, Hatrick, which enable scalable, low latency dynamic graph analytics on clouds and commodity clusters. Hatrick will enable continuous monitoring of cyber physical systems to detect attack patterns in real-time.

97 MATHEMATICS AND COMPUTING↗